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/seq-mthreaded/pals_STARTPALS_Triplicated.1.ufo.UNBOUNDED.pals.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-f4eb214f-m [2019-10-13 23:22:39,476 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-10-13 23:22:39,479 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-10-13 23:22:39,491 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-10-13 23:22:39,492 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-10-13 23:22:39,493 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-10-13 23:22:39,494 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-10-13 23:22:39,496 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-10-13 23:22:39,498 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-10-13 23:22:39,499 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-10-13 23:22:39,500 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-10-13 23:22:39,501 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-10-13 23:22:39,502 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-10-13 23:22:39,503 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-10-13 23:22:39,504 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-10-13 23:22:39,505 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-10-13 23:22:39,506 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-10-13 23:22:39,507 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-10-13 23:22:39,508 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-10-13 23:22:39,510 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-10-13 23:22:39,512 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-10-13 23:22:39,513 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-10-13 23:22:39,514 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-10-13 23:22:39,515 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-10-13 23:22:39,517 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-10-13 23:22:39,518 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-10-13 23:22:39,518 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-10-13 23:22:39,519 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-10-13 23:22:39,519 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-10-13 23:22:39,520 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-10-13 23:22:39,520 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-10-13 23:22:39,521 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-10-13 23:22:39,522 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-10-13 23:22:39,523 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-10-13 23:22:39,524 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-10-13 23:22:39,524 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-10-13 23:22:39,525 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-10-13 23:22:39,527 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-10-13 23:22:39,527 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-10-13 23:22:39,528 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-10-13 23:22:39,529 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-10-13 23:22:39,532 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 23:22:39,555 INFO L113 SettingsManager]: Loading preferences was successful [2019-10-13 23:22:39,555 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-10-13 23:22:39,557 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-10-13 23:22:39,558 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-10-13 23:22:39,558 INFO L138 SettingsManager]: * Use SBE=true [2019-10-13 23:22:39,558 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-10-13 23:22:39,558 INFO L138 SettingsManager]: * sizeof long=4 [2019-10-13 23:22:39,558 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-10-13 23:22:39,559 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-10-13 23:22:39,559 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-10-13 23:22:39,560 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-10-13 23:22:39,560 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-10-13 23:22:39,560 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-10-13 23:22:39,561 INFO L138 SettingsManager]: * sizeof long double=12 [2019-10-13 23:22:39,561 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-10-13 23:22:39,561 INFO L138 SettingsManager]: * Use constant arrays=true [2019-10-13 23:22:39,561 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-10-13 23:22:39,562 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-10-13 23:22:39,562 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-10-13 23:22:39,562 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-10-13 23:22:39,563 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-10-13 23:22:39,563 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-13 23:22:39,563 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-10-13 23:22:39,563 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-10-13 23:22:39,564 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-10-13 23:22:39,564 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-10-13 23:22:39,564 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-10-13 23:22:39,564 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-10-13 23:22:39,564 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 23:22:39,875 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-10-13 23:22:39,888 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-10-13 23:22:39,893 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-10-13 23:22:39,894 INFO L271 PluginConnector]: Initializing CDTParser... [2019-10-13 23:22:39,895 INFO L275 PluginConnector]: CDTParser initialized [2019-10-13 23:22:39,895 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/seq-mthreaded/pals_STARTPALS_Triplicated.1.ufo.UNBOUNDED.pals.c [2019-10-13 23:22:39,962 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c80e46bf5/e502efbdc44e49fabd9f184320754cc9/FLAGdf3565592 [2019-10-13 23:22:40,517 INFO L306 CDTParser]: Found 1 translation units. [2019-10-13 23:22:40,518 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/seq-mthreaded/pals_STARTPALS_Triplicated.1.ufo.UNBOUNDED.pals.c [2019-10-13 23:22:40,529 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c80e46bf5/e502efbdc44e49fabd9f184320754cc9/FLAGdf3565592 [2019-10-13 23:22:40,794 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c80e46bf5/e502efbdc44e49fabd9f184320754cc9 [2019-10-13 23:22:40,806 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-10-13 23:22:40,807 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-10-13 23:22:40,811 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-10-13 23:22:40,812 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-10-13 23:22:40,816 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-10-13 23:22:40,817 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 11:22:40" (1/1) ... [2019-10-13 23:22:40,821 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@9061149 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 11:22:40, skipping insertion in model container [2019-10-13 23:22:40,821 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 11:22:40" (1/1) ... [2019-10-13 23:22:40,831 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-10-13 23:22:40,895 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-10-13 23:22:41,306 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-13 23:22:41,317 INFO L188 MainTranslator]: Completed pre-run [2019-10-13 23:22:41,395 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-13 23:22:41,420 INFO L192 MainTranslator]: Completed translation [2019-10-13 23:22:41,420 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 11:22:41 WrapperNode [2019-10-13 23:22:41,421 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-10-13 23:22:41,422 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-10-13 23:22:41,423 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-10-13 23:22:41,423 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-10-13 23:22:41,435 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 11:22:41" (1/1) ... [2019-10-13 23:22:41,435 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 11:22:41" (1/1) ... [2019-10-13 23:22:41,447 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 11:22:41" (1/1) ... [2019-10-13 23:22:41,448 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 11:22:41" (1/1) ... [2019-10-13 23:22:41,465 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 11:22:41" (1/1) ... [2019-10-13 23:22:41,478 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 11:22:41" (1/1) ... [2019-10-13 23:22:41,482 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 11:22:41" (1/1) ... [2019-10-13 23:22:41,488 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-10-13 23:22:41,489 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-10-13 23:22:41,489 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-10-13 23:22:41,489 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-10-13 23:22:41,490 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 11:22:41" (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 23:22:41,544 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-10-13 23:22:41,544 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-10-13 23:22:41,544 INFO L138 BoogieDeclarations]: Found implementation of procedure add_history_type [2019-10-13 23:22:41,544 INFO L138 BoogieDeclarations]: Found implementation of procedure read_history_int8 [2019-10-13 23:22:41,544 INFO L138 BoogieDeclarations]: Found implementation of procedure read_history_bool [2019-10-13 23:22:41,545 INFO L138 BoogieDeclarations]: Found implementation of procedure write_history_int8 [2019-10-13 23:22:41,545 INFO L138 BoogieDeclarations]: Found implementation of procedure write_history_bool [2019-10-13 23:22:41,545 INFO L138 BoogieDeclarations]: Found implementation of procedure init [2019-10-13 23:22:41,545 INFO L138 BoogieDeclarations]: Found implementation of procedure check [2019-10-13 23:22:41,545 INFO L138 BoogieDeclarations]: Found implementation of procedure gate1_each_pals_period [2019-10-13 23:22:41,545 INFO L138 BoogieDeclarations]: Found implementation of procedure gate2_each_pals_period [2019-10-13 23:22:41,546 INFO L138 BoogieDeclarations]: Found implementation of procedure gate3_each_pals_period [2019-10-13 23:22:41,546 INFO L138 BoogieDeclarations]: Found implementation of procedure voter [2019-10-13 23:22:41,546 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-10-13 23:22:41,546 INFO L138 BoogieDeclarations]: Found implementation of procedure assert [2019-10-13 23:22:41,546 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-10-13 23:22:41,547 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_char [2019-10-13 23:22:41,547 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_bool [2019-10-13 23:22:41,547 INFO L130 BoogieDeclarations]: Found specification of procedure read [2019-10-13 23:22:41,547 INFO L130 BoogieDeclarations]: Found specification of procedure write [2019-10-13 23:22:41,547 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assume [2019-10-13 23:22:41,547 INFO L130 BoogieDeclarations]: Found specification of procedure assert [2019-10-13 23:22:41,548 INFO L130 BoogieDeclarations]: Found specification of procedure read_history_bool [2019-10-13 23:22:41,548 INFO L130 BoogieDeclarations]: Found specification of procedure read_history_int8 [2019-10-13 23:22:41,548 INFO L130 BoogieDeclarations]: Found specification of procedure add_history_type [2019-10-13 23:22:41,548 INFO L130 BoogieDeclarations]: Found specification of procedure write_history_int8 [2019-10-13 23:22:41,548 INFO L130 BoogieDeclarations]: Found specification of procedure write_history_bool [2019-10-13 23:22:41,548 INFO L130 BoogieDeclarations]: Found specification of procedure init [2019-10-13 23:22:41,549 INFO L130 BoogieDeclarations]: Found specification of procedure check [2019-10-13 23:22:41,549 INFO L130 BoogieDeclarations]: Found specification of procedure gate1_each_pals_period [2019-10-13 23:22:41,549 INFO L130 BoogieDeclarations]: Found specification of procedure gate2_each_pals_period [2019-10-13 23:22:41,549 INFO L130 BoogieDeclarations]: Found specification of procedure gate3_each_pals_period [2019-10-13 23:22:41,549 INFO L130 BoogieDeclarations]: Found specification of procedure voter [2019-10-13 23:22:41,549 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-10-13 23:22:41,549 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-10-13 23:22:41,550 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-10-13 23:22:42,858 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-10-13 23:22:42,860 INFO L284 CfgBuilder]: Removed 2 assume(true) statements. [2019-10-13 23:22:42,862 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 11:22:42 BoogieIcfgContainer [2019-10-13 23:22:42,862 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-10-13 23:22:42,864 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-10-13 23:22:42,864 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-10-13 23:22:42,868 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-10-13 23:22:42,868 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.10 11:22:40" (1/3) ... [2019-10-13 23:22:42,869 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@388c484f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 11:22:42, skipping insertion in model container [2019-10-13 23:22:42,869 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 11:22:41" (2/3) ... [2019-10-13 23:22:42,870 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@388c484f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 11:22:42, skipping insertion in model container [2019-10-13 23:22:42,870 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 11:22:42" (3/3) ... [2019-10-13 23:22:42,872 INFO L109 eAbstractionObserver]: Analyzing ICFG pals_STARTPALS_Triplicated.1.ufo.UNBOUNDED.pals.c [2019-10-13 23:22:42,884 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-10-13 23:22:42,895 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-10-13 23:22:42,910 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-10-13 23:22:42,960 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-10-13 23:22:42,960 INFO L374 AbstractCegarLoop]: Hoare is true [2019-10-13 23:22:42,961 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-10-13 23:22:42,961 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-10-13 23:22:42,962 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-10-13 23:22:42,962 INFO L378 AbstractCegarLoop]: Difference is false [2019-10-13 23:22:42,962 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-10-13 23:22:42,962 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-10-13 23:22:43,007 INFO L276 IsEmpty]: Start isEmpty. Operand 160 states. [2019-10-13 23:22:43,021 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-10-13 23:22:43,022 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 23:22:43,023 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 23:22:43,026 INFO L410 AbstractCegarLoop]: === Iteration 1 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 23:22:43,034 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 23:22:43,034 INFO L82 PathProgramCache]: Analyzing trace with hash -2046485733, now seen corresponding path program 1 times [2019-10-13 23:22:43,047 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-13 23:22:43,048 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2114813830] [2019-10-13 23:22:43,048 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 23:22:43,049 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 23:22:43,049 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 23:22:43,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 23:22:43,396 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 23:22:43,397 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2114813830] [2019-10-13 23:22:43,398 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 23:22:43,398 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-13 23:22:43,399 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1028598495] [2019-10-13 23:22:43,404 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-13 23:22:43,404 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-13 23:22:43,419 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-13 23:22:43,420 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-13 23:22:43,422 INFO L87 Difference]: Start difference. First operand 160 states. Second operand 4 states. [2019-10-13 23:22:43,576 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 23:22:43,576 INFO L93 Difference]: Finished difference Result 315 states and 500 transitions. [2019-10-13 23:22:43,578 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-13 23:22:43,579 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 20 [2019-10-13 23:22:43,580 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 23:22:43,604 INFO L225 Difference]: With dead ends: 315 [2019-10-13 23:22:43,605 INFO L226 Difference]: Without dead ends: 163 [2019-10-13 23:22:43,622 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-10-13 23:22:43,647 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 163 states. [2019-10-13 23:22:43,748 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 163 to 161. [2019-10-13 23:22:43,749 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 161 states. [2019-10-13 23:22:43,760 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 161 states to 161 states and 230 transitions. [2019-10-13 23:22:43,763 INFO L78 Accepts]: Start accepts. Automaton has 161 states and 230 transitions. Word has length 20 [2019-10-13 23:22:43,763 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 23:22:43,763 INFO L462 AbstractCegarLoop]: Abstraction has 161 states and 230 transitions. [2019-10-13 23:22:43,763 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-13 23:22:43,764 INFO L276 IsEmpty]: Start isEmpty. Operand 161 states and 230 transitions. [2019-10-13 23:22:43,768 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-10-13 23:22:43,768 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 23:22:43,769 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] [2019-10-13 23:22:43,769 INFO L410 AbstractCegarLoop]: === Iteration 2 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 23:22:43,771 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 23:22:43,771 INFO L82 PathProgramCache]: Analyzing trace with hash -1469294552, now seen corresponding path program 1 times [2019-10-13 23:22:43,771 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-13 23:22:43,772 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1163756744] [2019-10-13 23:22:43,772 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 23:22:43,772 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 23:22:43,773 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 23:22:43,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 23:22:43,909 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 23:22:43,910 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1163756744] [2019-10-13 23:22:43,910 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 23:22:43,910 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-13 23:22:43,910 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2052529624] [2019-10-13 23:22:43,912 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-13 23:22:43,912 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-13 23:22:43,913 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-13 23:22:43,913 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-13 23:22:43,913 INFO L87 Difference]: Start difference. First operand 161 states and 230 transitions. Second operand 4 states. [2019-10-13 23:22:43,981 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 23:22:43,981 INFO L93 Difference]: Finished difference Result 328 states and 476 transitions. [2019-10-13 23:22:43,984 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-13 23:22:43,984 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 21 [2019-10-13 23:22:43,984 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 23:22:43,989 INFO L225 Difference]: With dead ends: 328 [2019-10-13 23:22:43,989 INFO L226 Difference]: Without dead ends: 175 [2019-10-13 23:22:43,991 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-10-13 23:22:43,992 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 175 states. [2019-10-13 23:22:44,025 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 175 to 173. [2019-10-13 23:22:44,026 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 173 states. [2019-10-13 23:22:44,029 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 173 states to 173 states and 245 transitions. [2019-10-13 23:22:44,030 INFO L78 Accepts]: Start accepts. Automaton has 173 states and 245 transitions. Word has length 21 [2019-10-13 23:22:44,030 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 23:22:44,031 INFO L462 AbstractCegarLoop]: Abstraction has 173 states and 245 transitions. [2019-10-13 23:22:44,031 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-13 23:22:44,031 INFO L276 IsEmpty]: Start isEmpty. Operand 173 states and 245 transitions. [2019-10-13 23:22:44,033 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-10-13 23:22:44,033 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 23:22:44,033 INFO L380 BasicCegarLoop]: trace histogram [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] [2019-10-13 23:22:44,034 INFO L410 AbstractCegarLoop]: === Iteration 3 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 23:22:44,034 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 23:22:44,034 INFO L82 PathProgramCache]: Analyzing trace with hash -16432824, now seen corresponding path program 1 times [2019-10-13 23:22:44,034 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-13 23:22:44,035 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [167546757] [2019-10-13 23:22:44,035 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 23:22:44,035 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 23:22:44,035 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 23:22:44,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 23:22:44,084 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-13 23:22:44,085 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [167546757] [2019-10-13 23:22:44,085 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 23:22:44,085 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-13 23:22:44,085 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [966216970] [2019-10-13 23:22:44,086 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-13 23:22:44,086 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-13 23:22:44,087 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-13 23:22:44,087 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-13 23:22:44,087 INFO L87 Difference]: Start difference. First operand 173 states and 245 transitions. Second operand 3 states. [2019-10-13 23:22:44,113 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 23:22:44,113 INFO L93 Difference]: Finished difference Result 360 states and 522 transitions. [2019-10-13 23:22:44,113 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-13 23:22:44,114 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 28 [2019-10-13 23:22:44,114 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 23:22:44,117 INFO L225 Difference]: With dead ends: 360 [2019-10-13 23:22:44,117 INFO L226 Difference]: Without dead ends: 202 [2019-10-13 23:22:44,119 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-13 23:22:44,119 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 202 states. [2019-10-13 23:22:44,134 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 202 to 175. [2019-10-13 23:22:44,135 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 175 states. [2019-10-13 23:22:44,137 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 175 states to 175 states and 247 transitions. [2019-10-13 23:22:44,137 INFO L78 Accepts]: Start accepts. Automaton has 175 states and 247 transitions. Word has length 28 [2019-10-13 23:22:44,138 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 23:22:44,138 INFO L462 AbstractCegarLoop]: Abstraction has 175 states and 247 transitions. [2019-10-13 23:22:44,138 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-13 23:22:44,138 INFO L276 IsEmpty]: Start isEmpty. Operand 175 states and 247 transitions. [2019-10-13 23:22:44,140 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2019-10-13 23:22:44,140 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 23:22:44,140 INFO L380 BasicCegarLoop]: trace histogram [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 23:22:44,141 INFO L410 AbstractCegarLoop]: === Iteration 4 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 23:22:44,141 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 23:22:44,141 INFO L82 PathProgramCache]: Analyzing trace with hash -1543063508, now seen corresponding path program 1 times [2019-10-13 23:22:44,143 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-13 23:22:44,144 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [310866055] [2019-10-13 23:22:44,144 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 23:22:44,144 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 23:22:44,144 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 23:22:44,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 23:22:44,213 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-13 23:22:44,214 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [310866055] [2019-10-13 23:22:44,214 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 23:22:44,214 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-13 23:22:44,215 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1268543132] [2019-10-13 23:22:44,215 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-13 23:22:44,216 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-13 23:22:44,216 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-13 23:22:44,216 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-13 23:22:44,216 INFO L87 Difference]: Start difference. First operand 175 states and 247 transitions. Second operand 5 states. [2019-10-13 23:22:44,263 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 23:22:44,263 INFO L93 Difference]: Finished difference Result 338 states and 481 transitions. [2019-10-13 23:22:44,264 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-13 23:22:44,264 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 36 [2019-10-13 23:22:44,265 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 23:22:44,268 INFO L225 Difference]: With dead ends: 338 [2019-10-13 23:22:44,268 INFO L226 Difference]: Without dead ends: 183 [2019-10-13 23:22:44,270 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-13 23:22:44,271 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 183 states. [2019-10-13 23:22:44,297 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 183 to 179. [2019-10-13 23:22:44,298 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 179 states. [2019-10-13 23:22:44,302 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 179 states to 179 states and 251 transitions. [2019-10-13 23:22:44,302 INFO L78 Accepts]: Start accepts. Automaton has 179 states and 251 transitions. Word has length 36 [2019-10-13 23:22:44,303 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 23:22:44,303 INFO L462 AbstractCegarLoop]: Abstraction has 179 states and 251 transitions. [2019-10-13 23:22:44,306 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-13 23:22:44,306 INFO L276 IsEmpty]: Start isEmpty. Operand 179 states and 251 transitions. [2019-10-13 23:22:44,308 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2019-10-13 23:22:44,308 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 23:22:44,310 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] [2019-10-13 23:22:44,311 INFO L410 AbstractCegarLoop]: === Iteration 5 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 23:22:44,311 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 23:22:44,311 INFO L82 PathProgramCache]: Analyzing trace with hash -1623813277, now seen corresponding path program 1 times [2019-10-13 23:22:44,312 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-13 23:22:44,312 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1703180982] [2019-10-13 23:22:44,312 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 23:22:44,312 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 23:22:44,313 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 23:22:44,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 23:22:44,442 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 23:22:44,443 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1703180982] [2019-10-13 23:22:44,443 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 23:22:44,443 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-13 23:22:44,443 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1897882459] [2019-10-13 23:22:44,444 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-13 23:22:44,444 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-13 23:22:44,444 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-13 23:22:44,445 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-13 23:22:44,445 INFO L87 Difference]: Start difference. First operand 179 states and 251 transitions. Second operand 4 states. [2019-10-13 23:22:44,470 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 23:22:44,470 INFO L93 Difference]: Finished difference Result 301 states and 423 transitions. [2019-10-13 23:22:44,471 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-13 23:22:44,471 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 37 [2019-10-13 23:22:44,471 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 23:22:44,473 INFO L225 Difference]: With dead ends: 301 [2019-10-13 23:22:44,474 INFO L226 Difference]: Without dead ends: 175 [2019-10-13 23:22:44,475 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-13 23:22:44,476 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 175 states. [2019-10-13 23:22:44,485 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 175 to 175. [2019-10-13 23:22:44,486 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 175 states. [2019-10-13 23:22:44,488 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 175 states to 175 states and 243 transitions. [2019-10-13 23:22:44,488 INFO L78 Accepts]: Start accepts. Automaton has 175 states and 243 transitions. Word has length 37 [2019-10-13 23:22:44,489 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 23:22:44,489 INFO L462 AbstractCegarLoop]: Abstraction has 175 states and 243 transitions. [2019-10-13 23:22:44,489 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-13 23:22:44,489 INFO L276 IsEmpty]: Start isEmpty. Operand 175 states and 243 transitions. [2019-10-13 23:22:44,491 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2019-10-13 23:22:44,491 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 23:22:44,491 INFO L380 BasicCegarLoop]: trace histogram [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] [2019-10-13 23:22:44,491 INFO L410 AbstractCegarLoop]: === Iteration 6 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 23:22:44,492 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 23:22:44,492 INFO L82 PathProgramCache]: Analyzing trace with hash 1513406132, now seen corresponding path program 1 times [2019-10-13 23:22:44,492 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-13 23:22:44,492 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [702281058] [2019-10-13 23:22:44,493 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 23:22:44,493 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 23:22:44,493 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 23:22:44,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 23:22:44,584 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-10-13 23:22:44,585 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [702281058] [2019-10-13 23:22:44,586 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 23:22:44,586 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-13 23:22:44,586 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2120654189] [2019-10-13 23:22:44,587 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-13 23:22:44,587 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-13 23:22:44,587 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-13 23:22:44,588 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-13 23:22:44,588 INFO L87 Difference]: Start difference. First operand 175 states and 243 transitions. Second operand 4 states. [2019-10-13 23:22:44,667 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 23:22:44,667 INFO L93 Difference]: Finished difference Result 346 states and 490 transitions. [2019-10-13 23:22:44,668 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-13 23:22:44,668 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 38 [2019-10-13 23:22:44,668 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 23:22:44,673 INFO L225 Difference]: With dead ends: 346 [2019-10-13 23:22:44,674 INFO L226 Difference]: Without dead ends: 192 [2019-10-13 23:22:44,675 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-10-13 23:22:44,676 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 192 states. [2019-10-13 23:22:44,696 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 192 to 190. [2019-10-13 23:22:44,697 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 190 states. [2019-10-13 23:22:44,701 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 190 states to 190 states and 261 transitions. [2019-10-13 23:22:44,703 INFO L78 Accepts]: Start accepts. Automaton has 190 states and 261 transitions. Word has length 38 [2019-10-13 23:22:44,705 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 23:22:44,705 INFO L462 AbstractCegarLoop]: Abstraction has 190 states and 261 transitions. [2019-10-13 23:22:44,705 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-13 23:22:44,705 INFO L276 IsEmpty]: Start isEmpty. Operand 190 states and 261 transitions. [2019-10-13 23:22:44,708 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2019-10-13 23:22:44,708 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 23:22:44,708 INFO L380 BasicCegarLoop]: trace histogram [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 23:22:44,708 INFO L410 AbstractCegarLoop]: === Iteration 7 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 23:22:44,709 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 23:22:44,709 INFO L82 PathProgramCache]: Analyzing trace with hash -1572931515, now seen corresponding path program 1 times [2019-10-13 23:22:44,709 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-13 23:22:44,709 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1401861538] [2019-10-13 23:22:44,710 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 23:22:44,710 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 23:22:44,710 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 23:22:44,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 23:22:44,785 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2019-10-13 23:22:44,786 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1401861538] [2019-10-13 23:22:44,786 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 23:22:44,786 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-13 23:22:44,787 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1524638761] [2019-10-13 23:22:44,788 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-13 23:22:44,788 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-13 23:22:44,788 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-13 23:22:44,789 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-13 23:22:44,789 INFO L87 Difference]: Start difference. First operand 190 states and 261 transitions. Second operand 4 states. [2019-10-13 23:22:44,853 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 23:22:44,853 INFO L93 Difference]: Finished difference Result 364 states and 514 transitions. [2019-10-13 23:22:44,853 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-13 23:22:44,854 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 38 [2019-10-13 23:22:44,854 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 23:22:44,856 INFO L225 Difference]: With dead ends: 364 [2019-10-13 23:22:44,856 INFO L226 Difference]: Without dead ends: 197 [2019-10-13 23:22:44,857 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-10-13 23:22:44,859 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 197 states. [2019-10-13 23:22:44,878 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 197 to 195. [2019-10-13 23:22:44,878 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 195 states. [2019-10-13 23:22:44,881 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 195 states to 195 states and 265 transitions. [2019-10-13 23:22:44,881 INFO L78 Accepts]: Start accepts. Automaton has 195 states and 265 transitions. Word has length 38 [2019-10-13 23:22:44,882 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 23:22:44,882 INFO L462 AbstractCegarLoop]: Abstraction has 195 states and 265 transitions. [2019-10-13 23:22:44,882 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-13 23:22:44,883 INFO L276 IsEmpty]: Start isEmpty. Operand 195 states and 265 transitions. [2019-10-13 23:22:44,888 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-10-13 23:22:44,888 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 23:22:44,888 INFO L380 BasicCegarLoop]: trace histogram [3, 3, 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-13 23:22:44,889 INFO L410 AbstractCegarLoop]: === Iteration 8 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 23:22:44,889 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 23:22:44,889 INFO L82 PathProgramCache]: Analyzing trace with hash -523919551, now seen corresponding path program 1 times [2019-10-13 23:22:44,889 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-13 23:22:44,890 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [603357186] [2019-10-13 23:22:44,890 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 23:22:44,890 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 23:22:44,890 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 23:22:44,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 23:22:44,985 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2019-10-13 23:22:44,986 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [603357186] [2019-10-13 23:22:44,987 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 23:22:44,987 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-13 23:22:44,987 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2136084929] [2019-10-13 23:22:44,988 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-13 23:22:44,988 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-13 23:22:44,988 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-13 23:22:44,988 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-13 23:22:44,989 INFO L87 Difference]: Start difference. First operand 195 states and 265 transitions. Second operand 5 states. [2019-10-13 23:22:45,013 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 23:22:45,013 INFO L93 Difference]: Finished difference Result 362 states and 498 transitions. [2019-10-13 23:22:45,014 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-13 23:22:45,014 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 55 [2019-10-13 23:22:45,014 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 23:22:45,016 INFO L225 Difference]: With dead ends: 362 [2019-10-13 23:22:45,016 INFO L226 Difference]: Without dead ends: 197 [2019-10-13 23:22:45,017 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-13 23:22:45,021 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 197 states. [2019-10-13 23:22:45,029 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 197 to 195. [2019-10-13 23:22:45,029 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 195 states. [2019-10-13 23:22:45,031 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 195 states to 195 states and 264 transitions. [2019-10-13 23:22:45,031 INFO L78 Accepts]: Start accepts. Automaton has 195 states and 264 transitions. Word has length 55 [2019-10-13 23:22:45,031 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 23:22:45,031 INFO L462 AbstractCegarLoop]: Abstraction has 195 states and 264 transitions. [2019-10-13 23:22:45,031 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-13 23:22:45,032 INFO L276 IsEmpty]: Start isEmpty. Operand 195 states and 264 transitions. [2019-10-13 23:22:45,032 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2019-10-13 23:22:45,032 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 23:22:45,033 INFO L380 BasicCegarLoop]: trace histogram [3, 3, 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-13 23:22:45,033 INFO L410 AbstractCegarLoop]: === Iteration 9 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 23:22:45,033 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 23:22:45,033 INFO L82 PathProgramCache]: Analyzing trace with hash 1318466697, now seen corresponding path program 1 times [2019-10-13 23:22:45,034 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-13 23:22:45,034 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1957159964] [2019-10-13 23:22:45,034 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 23:22:45,037 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 23:22:45,037 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 23:22:45,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 23:22:45,083 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2019-10-13 23:22:45,084 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1957159964] [2019-10-13 23:22:45,084 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 23:22:45,084 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-13 23:22:45,085 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2061310830] [2019-10-13 23:22:45,085 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-13 23:22:45,085 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-13 23:22:45,086 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-13 23:22:45,086 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-13 23:22:45,086 INFO L87 Difference]: Start difference. First operand 195 states and 264 transitions. Second operand 4 states. [2019-10-13 23:22:45,138 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 23:22:45,138 INFO L93 Difference]: Finished difference Result 374 states and 518 transitions. [2019-10-13 23:22:45,139 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-13 23:22:45,139 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 57 [2019-10-13 23:22:45,139 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 23:22:45,141 INFO L225 Difference]: With dead ends: 374 [2019-10-13 23:22:45,141 INFO L226 Difference]: Without dead ends: 214 [2019-10-13 23:22:45,142 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-10-13 23:22:45,143 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 214 states. [2019-10-13 23:22:45,150 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 214 to 212. [2019-10-13 23:22:45,151 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 212 states. [2019-10-13 23:22:45,152 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 212 states to 212 states and 284 transitions. [2019-10-13 23:22:45,153 INFO L78 Accepts]: Start accepts. Automaton has 212 states and 284 transitions. Word has length 57 [2019-10-13 23:22:45,153 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 23:22:45,153 INFO L462 AbstractCegarLoop]: Abstraction has 212 states and 284 transitions. [2019-10-13 23:22:45,153 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-13 23:22:45,154 INFO L276 IsEmpty]: Start isEmpty. Operand 212 states and 284 transitions. [2019-10-13 23:22:45,154 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2019-10-13 23:22:45,154 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 23:22:45,155 INFO L380 BasicCegarLoop]: trace histogram [3, 3, 3, 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] [2019-10-13 23:22:45,155 INFO L410 AbstractCegarLoop]: === Iteration 10 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 23:22:45,155 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 23:22:45,155 INFO L82 PathProgramCache]: Analyzing trace with hash -1302104397, now seen corresponding path program 1 times [2019-10-13 23:22:45,155 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-13 23:22:45,156 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2095564574] [2019-10-13 23:22:45,156 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 23:22:45,156 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 23:22:45,156 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 23:22:45,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 23:22:45,220 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2019-10-13 23:22:45,221 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2095564574] [2019-10-13 23:22:45,221 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 23:22:45,222 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-13 23:22:45,223 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1113874836] [2019-10-13 23:22:45,223 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-13 23:22:45,224 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-13 23:22:45,224 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-13 23:22:45,224 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-13 23:22:45,224 INFO L87 Difference]: Start difference. First operand 212 states and 284 transitions. Second operand 4 states. [2019-10-13 23:22:45,276 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 23:22:45,276 INFO L93 Difference]: Finished difference Result 385 states and 530 transitions. [2019-10-13 23:22:45,277 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-13 23:22:45,277 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 58 [2019-10-13 23:22:45,277 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 23:22:45,279 INFO L225 Difference]: With dead ends: 385 [2019-10-13 23:22:45,280 INFO L226 Difference]: Without dead ends: 210 [2019-10-13 23:22:45,281 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-10-13 23:22:45,281 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 210 states. [2019-10-13 23:22:45,294 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 210 to 210. [2019-10-13 23:22:45,294 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 210 states. [2019-10-13 23:22:45,296 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 210 states to 210 states and 278 transitions. [2019-10-13 23:22:45,296 INFO L78 Accepts]: Start accepts. Automaton has 210 states and 278 transitions. Word has length 58 [2019-10-13 23:22:45,296 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 23:22:45,297 INFO L462 AbstractCegarLoop]: Abstraction has 210 states and 278 transitions. [2019-10-13 23:22:45,297 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-13 23:22:45,297 INFO L276 IsEmpty]: Start isEmpty. Operand 210 states and 278 transitions. [2019-10-13 23:22:45,298 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2019-10-13 23:22:45,298 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 23:22:45,298 INFO L380 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 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] [2019-10-13 23:22:45,298 INFO L410 AbstractCegarLoop]: === Iteration 11 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 23:22:45,298 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 23:22:45,299 INFO L82 PathProgramCache]: Analyzing trace with hash 1371108976, now seen corresponding path program 1 times [2019-10-13 23:22:45,299 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-13 23:22:45,299 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1489310615] [2019-10-13 23:22:45,299 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 23:22:45,299 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 23:22:45,299 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 23:22:45,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 23:22:45,388 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2019-10-13 23:22:45,388 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1489310615] [2019-10-13 23:22:45,389 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 23:22:45,389 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-13 23:22:45,389 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [606467698] [2019-10-13 23:22:45,390 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-13 23:22:45,390 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-13 23:22:45,390 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-13 23:22:45,391 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-13 23:22:45,391 INFO L87 Difference]: Start difference. First operand 210 states and 278 transitions. Second operand 5 states. [2019-10-13 23:22:45,415 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 23:22:45,415 INFO L93 Difference]: Finished difference Result 377 states and 506 transitions. [2019-10-13 23:22:45,415 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-13 23:22:45,416 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 76 [2019-10-13 23:22:45,416 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 23:22:45,418 INFO L225 Difference]: With dead ends: 377 [2019-10-13 23:22:45,418 INFO L226 Difference]: Without dead ends: 212 [2019-10-13 23:22:45,419 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-13 23:22:45,420 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 212 states. [2019-10-13 23:22:45,428 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 212 to 210. [2019-10-13 23:22:45,429 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 210 states. [2019-10-13 23:22:45,430 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 210 states to 210 states and 277 transitions. [2019-10-13 23:22:45,431 INFO L78 Accepts]: Start accepts. Automaton has 210 states and 277 transitions. Word has length 76 [2019-10-13 23:22:45,431 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 23:22:45,431 INFO L462 AbstractCegarLoop]: Abstraction has 210 states and 277 transitions. [2019-10-13 23:22:45,431 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-13 23:22:45,432 INFO L276 IsEmpty]: Start isEmpty. Operand 210 states and 277 transitions. [2019-10-13 23:22:45,432 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2019-10-13 23:22:45,432 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 23:22:45,433 INFO L380 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 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] [2019-10-13 23:22:45,433 INFO L410 AbstractCegarLoop]: === Iteration 12 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 23:22:45,433 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 23:22:45,433 INFO L82 PathProgramCache]: Analyzing trace with hash 1035009016, now seen corresponding path program 1 times [2019-10-13 23:22:45,434 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-13 23:22:45,434 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [714464260] [2019-10-13 23:22:45,434 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 23:22:45,434 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 23:22:45,434 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 23:22:45,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 23:22:45,517 INFO L134 CoverageAnalysis]: Checked inductivity of 59 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 59 trivial. 0 not checked. [2019-10-13 23:22:45,518 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [714464260] [2019-10-13 23:22:45,518 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 23:22:45,518 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-13 23:22:45,518 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [820104975] [2019-10-13 23:22:45,519 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-13 23:22:45,519 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-13 23:22:45,520 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-13 23:22:45,520 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-13 23:22:45,520 INFO L87 Difference]: Start difference. First operand 210 states and 277 transitions. Second operand 4 states. [2019-10-13 23:22:45,580 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 23:22:45,580 INFO L93 Difference]: Finished difference Result 366 states and 504 transitions. [2019-10-13 23:22:45,581 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-13 23:22:45,581 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 78 [2019-10-13 23:22:45,581 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 23:22:45,584 INFO L225 Difference]: With dead ends: 366 [2019-10-13 23:22:45,584 INFO L226 Difference]: Without dead ends: 208 [2019-10-13 23:22:45,586 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-10-13 23:22:45,589 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 208 states. [2019-10-13 23:22:45,597 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 208 to 208. [2019-10-13 23:22:45,597 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 208 states. [2019-10-13 23:22:45,598 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 208 states to 208 states and 273 transitions. [2019-10-13 23:22:45,599 INFO L78 Accepts]: Start accepts. Automaton has 208 states and 273 transitions. Word has length 78 [2019-10-13 23:22:45,600 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 23:22:45,600 INFO L462 AbstractCegarLoop]: Abstraction has 208 states and 273 transitions. [2019-10-13 23:22:45,600 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-13 23:22:45,601 INFO L276 IsEmpty]: Start isEmpty. Operand 208 states and 273 transitions. [2019-10-13 23:22:45,607 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2019-10-13 23:22:45,608 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 23:22:45,608 INFO L380 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 3, 3, 3, 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] [2019-10-13 23:22:45,608 INFO L410 AbstractCegarLoop]: === Iteration 13 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 23:22:45,608 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 23:22:45,609 INFO L82 PathProgramCache]: Analyzing trace with hash 1089906055, now seen corresponding path program 1 times [2019-10-13 23:22:45,609 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-13 23:22:45,609 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1655168501] [2019-10-13 23:22:45,609 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 23:22:45,609 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 23:22:45,610 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 23:22:45,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 23:22:45,677 INFO L134 CoverageAnalysis]: Checked inductivity of 75 backedges. 27 proven. 1 refuted. 0 times theorem prover too weak. 47 trivial. 0 not checked. [2019-10-13 23:22:45,678 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1655168501] [2019-10-13 23:22:45,678 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1734184203] [2019-10-13 23:22:45,678 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 23:22:45,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 23:22:45,823 INFO L256 TraceCheckSpWp]: Trace formula consists of 633 conjuncts, 3 conjunts are in the unsatisfiable core [2019-10-13 23:22:45,832 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-13 23:22:45,885 INFO L134 CoverageAnalysis]: Checked inductivity of 75 backedges. 29 proven. 1 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2019-10-13 23:22:45,886 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-10-13 23:22:46,003 INFO L134 CoverageAnalysis]: Checked inductivity of 75 backedges. 0 proven. 25 refuted. 0 times theorem prover too weak. 50 trivial. 0 not checked. [2019-10-13 23:22:46,004 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [5958538] [2019-10-13 23:22:46,052 INFO L162 IcfgInterpreter]: Started Sifa with 58 locations of interest [2019-10-13 23:22:46,053 INFO L169 IcfgInterpreter]: Building call graph [2019-10-13 23:22:46,062 INFO L174 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-10-13 23:22:46,071 INFO L179 IcfgInterpreter]: Starting interpretation [2019-10-13 23:22:46,072 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2019-10-13 23:22:46,850 INFO L199 IcfgInterpreter]: Interpreting procedure main with input of size 169 for LOIs [2019-10-13 23:22:47,142 WARN L191 SmtUtils]: Spent 126.00 ms on a formula simplification that was a NOOP. DAG size: 241 [2019-10-13 23:22:47,715 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-13 23:22:47,716 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: ε 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: ε 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.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.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 23:22:47,723 INFO L168 Benchmark]: Toolchain (without parser) took 6915.48 ms. Allocated memory was 136.3 MB in the beginning and 307.2 MB in the end (delta: 170.9 MB). Free memory was 100.1 MB in the beginning and 145.1 MB in the end (delta: -45.0 MB). Peak memory consumption was 125.9 MB. Max. memory is 7.1 GB. [2019-10-13 23:22:47,723 INFO L168 Benchmark]: CDTParser took 0.25 ms. Allocated memory is still 136.3 MB. Free memory was 119.6 MB in the beginning and 119.4 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. [2019-10-13 23:22:47,724 INFO L168 Benchmark]: CACSL2BoogieTranslator took 610.56 ms. Allocated memory was 136.3 MB in the beginning and 200.8 MB in the end (delta: 64.5 MB). Free memory was 99.7 MB in the beginning and 173.5 MB in the end (delta: -73.8 MB). Peak memory consumption was 24.9 MB. Max. memory is 7.1 GB. [2019-10-13 23:22:47,725 INFO L168 Benchmark]: Boogie Preprocessor took 66.17 ms. Allocated memory is still 200.8 MB. Free memory was 173.5 MB in the beginning and 170.6 MB in the end (delta: 2.8 MB). Peak memory consumption was 2.8 MB. Max. memory is 7.1 GB. [2019-10-13 23:22:47,726 INFO L168 Benchmark]: RCFGBuilder took 1373.73 ms. Allocated memory was 200.8 MB in the beginning and 230.2 MB in the end (delta: 29.4 MB). Free memory was 170.6 MB in the beginning and 185.2 MB in the end (delta: -14.5 MB). Peak memory consumption was 92.3 MB. Max. memory is 7.1 GB. [2019-10-13 23:22:47,727 INFO L168 Benchmark]: TraceAbstraction took 4856.89 ms. Allocated memory was 230.2 MB in the beginning and 307.2 MB in the end (delta: 77.1 MB). Free memory was 185.2 MB in the beginning and 145.1 MB in the end (delta: 40.0 MB). Peak memory consumption was 117.1 MB. Max. memory is 7.1 GB. [2019-10-13 23:22:47,731 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.25 ms. Allocated memory is still 136.3 MB. Free memory was 119.6 MB in the beginning and 119.4 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 610.56 ms. Allocated memory was 136.3 MB in the beginning and 200.8 MB in the end (delta: 64.5 MB). Free memory was 99.7 MB in the beginning and 173.5 MB in the end (delta: -73.8 MB). Peak memory consumption was 24.9 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 66.17 ms. Allocated memory is still 200.8 MB. Free memory was 173.5 MB in the beginning and 170.6 MB in the end (delta: 2.8 MB). Peak memory consumption was 2.8 MB. Max. memory is 7.1 GB. * RCFGBuilder took 1373.73 ms. Allocated memory was 200.8 MB in the beginning and 230.2 MB in the end (delta: 29.4 MB). Free memory was 170.6 MB in the beginning and 185.2 MB in the end (delta: -14.5 MB). Peak memory consumption was 92.3 MB. Max. memory is 7.1 GB. * TraceAbstraction took 4856.89 ms. Allocated memory was 230.2 MB in the beginning and 307.2 MB in the end (delta: 77.1 MB). Free memory was 185.2 MB in the beginning and 145.1 MB in the end (delta: 40.0 MB). Peak memory consumption was 117.1 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: ε de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: AssertionError: java.lang.IllegalArgumentException: Tried to insert element unknown in custom order: ε: 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...