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-36ac518-m [2019-10-07 15:54:38,024 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-10-07 15:54:38,028 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-10-07 15:54:38,047 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-10-07 15:54:38,047 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-10-07 15:54:38,049 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-10-07 15:54:38,051 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-10-07 15:54:38,062 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-10-07 15:54:38,067 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-10-07 15:54:38,069 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-10-07 15:54:38,071 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-10-07 15:54:38,073 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-10-07 15:54:38,073 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-10-07 15:54:38,075 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-10-07 15:54:38,077 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-10-07 15:54:38,078 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-10-07 15:54:38,080 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-10-07 15:54:38,081 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-10-07 15:54:38,082 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-10-07 15:54:38,088 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-10-07 15:54:38,092 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-10-07 15:54:38,096 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-10-07 15:54:38,098 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-10-07 15:54:38,099 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-10-07 15:54:38,101 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-10-07 15:54:38,101 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-10-07 15:54:38,101 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-10-07 15:54:38,103 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-10-07 15:54:38,104 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-10-07 15:54:38,105 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-10-07 15:54:38,105 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-10-07 15:54:38,107 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-10-07 15:54:38,108 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-10-07 15:54:38,109 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-10-07 15:54:38,110 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-10-07 15:54:38,111 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-10-07 15:54:38,112 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-10-07 15:54:38,112 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-10-07 15:54:38,112 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-10-07 15:54:38,113 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-10-07 15:54:38,115 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-10-07 15:54:38,116 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2019-10-07 15:54:38,140 INFO L113 SettingsManager]: Loading preferences was successful [2019-10-07 15:54:38,141 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-10-07 15:54:38,142 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-10-07 15:54:38,142 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-10-07 15:54:38,142 INFO L138 SettingsManager]: * Use SBE=true [2019-10-07 15:54:38,143 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-10-07 15:54:38,143 INFO L138 SettingsManager]: * sizeof long=4 [2019-10-07 15:54:38,143 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-10-07 15:54:38,143 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-10-07 15:54:38,143 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-10-07 15:54:38,144 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-10-07 15:54:38,144 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-10-07 15:54:38,144 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-10-07 15:54:38,144 INFO L138 SettingsManager]: * sizeof long double=12 [2019-10-07 15:54:38,144 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-10-07 15:54:38,145 INFO L138 SettingsManager]: * Use constant arrays=true [2019-10-07 15:54:38,145 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-10-07 15:54:38,145 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-10-07 15:54:38,145 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-10-07 15:54:38,145 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-10-07 15:54:38,146 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-10-07 15:54:38,146 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-07 15:54:38,146 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-10-07 15:54:38,146 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-10-07 15:54:38,146 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-10-07 15:54:38,147 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-10-07 15:54:38,147 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-10-07 15:54:38,147 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-10-07 15:54:38,147 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Trace refinement strategy -> SIFA_TAIPAN Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.sifa: Abstract Domain -> CompoundDomain Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder: Size of a code block -> LoopFreeBlock Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.sifa: Call Summarizer -> TopInputCallSummarizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.sifa: Fluid -> SizeLimitFluid Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.sifa: Simplification Technique -> SIMPLIFY_QUICK [2019-10-07 15:54:38,446 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-10-07 15:54:38,461 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-10-07 15:54:38,465 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-10-07 15:54:38,466 INFO L271 PluginConnector]: Initializing CDTParser... [2019-10-07 15:54:38,467 INFO L275 PluginConnector]: CDTParser initialized [2019-10-07 15:54:38,467 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-07 15:54:38,544 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5e2b51e9d/6564f00f5b0a405bb8173b8727837055/FLAGc1c2b92ca [2019-10-07 15:54:39,092 INFO L306 CDTParser]: Found 1 translation units. [2019-10-07 15:54:39,092 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/seq-mthreaded/pals_STARTPALS_Triplicated.1.ufo.UNBOUNDED.pals.c [2019-10-07 15:54:39,102 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5e2b51e9d/6564f00f5b0a405bb8173b8727837055/FLAGc1c2b92ca [2019-10-07 15:54:39,392 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5e2b51e9d/6564f00f5b0a405bb8173b8727837055 [2019-10-07 15:54:39,402 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-10-07 15:54:39,404 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-10-07 15:54:39,405 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-10-07 15:54:39,405 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-10-07 15:54:39,409 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-10-07 15:54:39,410 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.10 03:54:39" (1/1) ... [2019-10-07 15:54:39,413 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2b536ee0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.10 03:54:39, skipping insertion in model container [2019-10-07 15:54:39,413 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.10 03:54:39" (1/1) ... [2019-10-07 15:54:39,421 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-10-07 15:54:39,478 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-10-07 15:54:39,782 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-07 15:54:39,792 INFO L188 MainTranslator]: Completed pre-run [2019-10-07 15:54:39,944 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-07 15:54:39,967 INFO L192 MainTranslator]: Completed translation [2019-10-07 15:54:39,967 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.10 03:54:39 WrapperNode [2019-10-07 15:54:39,968 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-10-07 15:54:39,968 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-10-07 15:54:39,968 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-10-07 15:54:39,969 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-10-07 15:54:39,981 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.10 03:54:39" (1/1) ... [2019-10-07 15:54:39,982 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.10 03:54:39" (1/1) ... [2019-10-07 15:54:40,000 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.10 03:54:39" (1/1) ... [2019-10-07 15:54:40,000 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.10 03:54:39" (1/1) ... [2019-10-07 15:54:40,017 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.10 03:54:39" (1/1) ... [2019-10-07 15:54:40,030 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.10 03:54:39" (1/1) ... [2019-10-07 15:54:40,035 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.10 03:54:39" (1/1) ... [2019-10-07 15:54:40,040 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-10-07 15:54:40,041 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-10-07 15:54:40,041 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-10-07 15:54:40,041 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-10-07 15:54:40,042 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.10 03:54:39" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-07 15:54:40,103 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-10-07 15:54:40,103 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-10-07 15:54:40,103 INFO L138 BoogieDeclarations]: Found implementation of procedure add_history_type [2019-10-07 15:54:40,103 INFO L138 BoogieDeclarations]: Found implementation of procedure read_history_int8 [2019-10-07 15:54:40,104 INFO L138 BoogieDeclarations]: Found implementation of procedure read_history_bool [2019-10-07 15:54:40,104 INFO L138 BoogieDeclarations]: Found implementation of procedure write_history_int8 [2019-10-07 15:54:40,104 INFO L138 BoogieDeclarations]: Found implementation of procedure write_history_bool [2019-10-07 15:54:40,104 INFO L138 BoogieDeclarations]: Found implementation of procedure init [2019-10-07 15:54:40,104 INFO L138 BoogieDeclarations]: Found implementation of procedure check [2019-10-07 15:54:40,104 INFO L138 BoogieDeclarations]: Found implementation of procedure gate1_each_pals_period [2019-10-07 15:54:40,105 INFO L138 BoogieDeclarations]: Found implementation of procedure gate2_each_pals_period [2019-10-07 15:54:40,105 INFO L138 BoogieDeclarations]: Found implementation of procedure gate3_each_pals_period [2019-10-07 15:54:40,105 INFO L138 BoogieDeclarations]: Found implementation of procedure voter [2019-10-07 15:54:40,105 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-10-07 15:54:40,105 INFO L138 BoogieDeclarations]: Found implementation of procedure assert [2019-10-07 15:54:40,106 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-10-07 15:54:40,106 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_char [2019-10-07 15:54:40,106 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_bool [2019-10-07 15:54:40,106 INFO L130 BoogieDeclarations]: Found specification of procedure read [2019-10-07 15:54:40,106 INFO L130 BoogieDeclarations]: Found specification of procedure write [2019-10-07 15:54:40,106 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assume [2019-10-07 15:54:40,107 INFO L130 BoogieDeclarations]: Found specification of procedure assert [2019-10-07 15:54:40,107 INFO L130 BoogieDeclarations]: Found specification of procedure read_history_bool [2019-10-07 15:54:40,107 INFO L130 BoogieDeclarations]: Found specification of procedure read_history_int8 [2019-10-07 15:54:40,107 INFO L130 BoogieDeclarations]: Found specification of procedure add_history_type [2019-10-07 15:54:40,107 INFO L130 BoogieDeclarations]: Found specification of procedure write_history_int8 [2019-10-07 15:54:40,107 INFO L130 BoogieDeclarations]: Found specification of procedure write_history_bool [2019-10-07 15:54:40,108 INFO L130 BoogieDeclarations]: Found specification of procedure init [2019-10-07 15:54:40,108 INFO L130 BoogieDeclarations]: Found specification of procedure check [2019-10-07 15:54:40,108 INFO L130 BoogieDeclarations]: Found specification of procedure gate1_each_pals_period [2019-10-07 15:54:40,108 INFO L130 BoogieDeclarations]: Found specification of procedure gate2_each_pals_period [2019-10-07 15:54:40,108 INFO L130 BoogieDeclarations]: Found specification of procedure gate3_each_pals_period [2019-10-07 15:54:40,108 INFO L130 BoogieDeclarations]: Found specification of procedure voter [2019-10-07 15:54:40,109 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-10-07 15:54:40,109 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-10-07 15:54:40,109 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-10-07 15:54:41,340 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-10-07 15:54:41,342 INFO L284 CfgBuilder]: Removed 2 assume(true) statements. [2019-10-07 15:54:41,344 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.10 03:54:41 BoogieIcfgContainer [2019-10-07 15:54:41,344 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-10-07 15:54:41,345 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-10-07 15:54:41,346 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-10-07 15:54:41,350 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-10-07 15:54:41,350 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.10 03:54:39" (1/3) ... [2019-10-07 15:54:41,351 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@545c263e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.10 03:54:41, skipping insertion in model container [2019-10-07 15:54:41,351 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.10 03:54:39" (2/3) ... [2019-10-07 15:54:41,352 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@545c263e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.10 03:54:41, skipping insertion in model container [2019-10-07 15:54:41,352 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.10 03:54:41" (3/3) ... [2019-10-07 15:54:41,354 INFO L109 eAbstractionObserver]: Analyzing ICFG pals_STARTPALS_Triplicated.1.ufo.UNBOUNDED.pals.c [2019-10-07 15:54:41,365 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-10-07 15:54:41,373 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-10-07 15:54:41,385 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-10-07 15:54:41,414 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-10-07 15:54:41,414 INFO L374 AbstractCegarLoop]: Hoare is true [2019-10-07 15:54:41,414 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-10-07 15:54:41,414 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-10-07 15:54:41,415 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-10-07 15:54:41,415 INFO L378 AbstractCegarLoop]: Difference is false [2019-10-07 15:54:41,415 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-10-07 15:54:41,415 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-10-07 15:54:41,439 INFO L276 IsEmpty]: Start isEmpty. Operand 160 states. [2019-10-07 15:54:41,447 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-10-07 15:54:41,448 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 15:54:41,449 INFO L385 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-07 15:54:41,451 INFO L410 AbstractCegarLoop]: === Iteration 1 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 15:54:41,457 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 15:54:41,457 INFO L82 PathProgramCache]: Analyzing trace with hash -2046485733, now seen corresponding path program 1 times [2019-10-07 15:54:41,467 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 15:54:41,467 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 15:54:41,468 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 15:54:41,468 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 15:54:41,468 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 15:54:41,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 15:54:41,834 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-07 15:54:41,835 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 15:54:41,836 INFO L211 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-07 15:54:41,837 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-07 15:54:41,841 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-07 15:54:41,857 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-07 15:54:41,858 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-07 15:54:41,861 INFO L87 Difference]: Start difference. First operand 160 states. Second operand 4 states. [2019-10-07 15:54:42,011 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-07 15:54:42,011 INFO L93 Difference]: Finished difference Result 315 states and 500 transitions. [2019-10-07 15:54:42,012 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-07 15:54:42,013 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 20 [2019-10-07 15:54:42,014 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-07 15:54:42,029 INFO L225 Difference]: With dead ends: 315 [2019-10-07 15:54:42,029 INFO L226 Difference]: Without dead ends: 163 [2019-10-07 15:54:42,046 INFO L606 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-07 15:54:42,065 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 163 states. [2019-10-07 15:54:42,118 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 163 to 161. [2019-10-07 15:54:42,119 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 161 states. [2019-10-07 15:54:42,123 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 161 states to 161 states and 230 transitions. [2019-10-07 15:54:42,125 INFO L78 Accepts]: Start accepts. Automaton has 161 states and 230 transitions. Word has length 20 [2019-10-07 15:54:42,126 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-07 15:54:42,126 INFO L462 AbstractCegarLoop]: Abstraction has 161 states and 230 transitions. [2019-10-07 15:54:42,126 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-07 15:54:42,126 INFO L276 IsEmpty]: Start isEmpty. Operand 161 states and 230 transitions. [2019-10-07 15:54:42,129 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-10-07 15:54:42,129 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 15:54:42,129 INFO L385 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-07 15:54:42,129 INFO L410 AbstractCegarLoop]: === Iteration 2 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 15:54:42,130 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 15:54:42,130 INFO L82 PathProgramCache]: Analyzing trace with hash -1469294552, now seen corresponding path program 1 times [2019-10-07 15:54:42,130 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 15:54:42,130 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 15:54:42,131 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 15:54:42,131 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 15:54:42,131 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 15:54:42,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 15:54:42,243 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-07 15:54:42,243 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 15:54:42,244 INFO L211 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-07 15:54:42,244 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-07 15:54:42,246 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-07 15:54:42,246 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-07 15:54:42,247 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-07 15:54:42,247 INFO L87 Difference]: Start difference. First operand 161 states and 230 transitions. Second operand 4 states. [2019-10-07 15:54:42,310 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-07 15:54:42,311 INFO L93 Difference]: Finished difference Result 328 states and 476 transitions. [2019-10-07 15:54:42,311 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-07 15:54:42,311 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 21 [2019-10-07 15:54:42,312 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-07 15:54:42,315 INFO L225 Difference]: With dead ends: 328 [2019-10-07 15:54:42,315 INFO L226 Difference]: Without dead ends: 175 [2019-10-07 15:54:42,317 INFO L606 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-07 15:54:42,318 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 175 states. [2019-10-07 15:54:42,350 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 175 to 173. [2019-10-07 15:54:42,350 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 173 states. [2019-10-07 15:54:42,357 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 173 states to 173 states and 245 transitions. [2019-10-07 15:54:42,358 INFO L78 Accepts]: Start accepts. Automaton has 173 states and 245 transitions. Word has length 21 [2019-10-07 15:54:42,358 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-07 15:54:42,358 INFO L462 AbstractCegarLoop]: Abstraction has 173 states and 245 transitions. [2019-10-07 15:54:42,359 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-07 15:54:42,359 INFO L276 IsEmpty]: Start isEmpty. Operand 173 states and 245 transitions. [2019-10-07 15:54:42,363 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-10-07 15:54:42,363 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 15:54:42,363 INFO L385 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-07 15:54:42,364 INFO L410 AbstractCegarLoop]: === Iteration 3 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 15:54:42,364 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 15:54:42,365 INFO L82 PathProgramCache]: Analyzing trace with hash -16432824, now seen corresponding path program 1 times [2019-10-07 15:54:42,365 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 15:54:42,365 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 15:54:42,366 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 15:54:42,366 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 15:54:42,368 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 15:54:42,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 15:54:42,469 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-07 15:54:42,470 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 15:54:42,471 INFO L211 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-07 15:54:42,471 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-07 15:54:42,472 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-07 15:54:42,473 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-07 15:54:42,474 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-07 15:54:42,474 INFO L87 Difference]: Start difference. First operand 173 states and 245 transitions. Second operand 3 states. [2019-10-07 15:54:42,525 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-07 15:54:42,526 INFO L93 Difference]: Finished difference Result 360 states and 522 transitions. [2019-10-07 15:54:42,526 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-07 15:54:42,526 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 28 [2019-10-07 15:54:42,527 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-07 15:54:42,534 INFO L225 Difference]: With dead ends: 360 [2019-10-07 15:54:42,534 INFO L226 Difference]: Without dead ends: 202 [2019-10-07 15:54:42,535 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-07 15:54:42,537 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 202 states. [2019-10-07 15:54:42,564 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 202 to 175. [2019-10-07 15:54:42,564 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 175 states. [2019-10-07 15:54:42,567 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 175 states to 175 states and 247 transitions. [2019-10-07 15:54:42,567 INFO L78 Accepts]: Start accepts. Automaton has 175 states and 247 transitions. Word has length 28 [2019-10-07 15:54:42,568 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-07 15:54:42,568 INFO L462 AbstractCegarLoop]: Abstraction has 175 states and 247 transitions. [2019-10-07 15:54:42,568 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-07 15:54:42,568 INFO L276 IsEmpty]: Start isEmpty. Operand 175 states and 247 transitions. [2019-10-07 15:54:42,570 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2019-10-07 15:54:42,570 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 15:54:42,570 INFO L385 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-07 15:54:42,571 INFO L410 AbstractCegarLoop]: === Iteration 4 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 15:54:42,571 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 15:54:42,571 INFO L82 PathProgramCache]: Analyzing trace with hash -1543063508, now seen corresponding path program 1 times [2019-10-07 15:54:42,571 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 15:54:42,572 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 15:54:42,572 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 15:54:42,572 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 15:54:42,573 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 15:54:42,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 15:54:42,641 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-07 15:54:42,642 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 15:54:42,642 INFO L211 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-07 15:54:42,643 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-07 15:54:42,643 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-07 15:54:42,644 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-07 15:54:42,644 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-07 15:54:42,644 INFO L87 Difference]: Start difference. First operand 175 states and 247 transitions. Second operand 5 states. [2019-10-07 15:54:42,684 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-07 15:54:42,684 INFO L93 Difference]: Finished difference Result 338 states and 481 transitions. [2019-10-07 15:54:42,685 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-07 15:54:42,685 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 36 [2019-10-07 15:54:42,685 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-07 15:54:42,687 INFO L225 Difference]: With dead ends: 338 [2019-10-07 15:54:42,688 INFO L226 Difference]: Without dead ends: 183 [2019-10-07 15:54:42,689 INFO L606 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-07 15:54:42,690 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 183 states. [2019-10-07 15:54:42,708 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 183 to 179. [2019-10-07 15:54:42,709 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 179 states. [2019-10-07 15:54:42,711 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 179 states to 179 states and 251 transitions. [2019-10-07 15:54:42,711 INFO L78 Accepts]: Start accepts. Automaton has 179 states and 251 transitions. Word has length 36 [2019-10-07 15:54:42,712 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-07 15:54:42,712 INFO L462 AbstractCegarLoop]: Abstraction has 179 states and 251 transitions. [2019-10-07 15:54:42,712 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-07 15:54:42,712 INFO L276 IsEmpty]: Start isEmpty. Operand 179 states and 251 transitions. [2019-10-07 15:54:42,714 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2019-10-07 15:54:42,714 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 15:54:42,714 INFO L385 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-07 15:54:42,714 INFO L410 AbstractCegarLoop]: === Iteration 5 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 15:54:42,715 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 15:54:42,715 INFO L82 PathProgramCache]: Analyzing trace with hash -1623813277, now seen corresponding path program 1 times [2019-10-07 15:54:42,715 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 15:54:42,715 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 15:54:42,716 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 15:54:42,716 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 15:54:42,716 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 15:54:42,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 15:54:42,823 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-07 15:54:42,824 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 15:54:42,824 INFO L211 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-07 15:54:42,824 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-07 15:54:42,825 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-07 15:54:42,825 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-07 15:54:42,825 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-07 15:54:42,826 INFO L87 Difference]: Start difference. First operand 179 states and 251 transitions. Second operand 4 states. [2019-10-07 15:54:42,852 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-07 15:54:42,852 INFO L93 Difference]: Finished difference Result 301 states and 423 transitions. [2019-10-07 15:54:42,853 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-07 15:54:42,853 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 37 [2019-10-07 15:54:42,853 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-07 15:54:42,856 INFO L225 Difference]: With dead ends: 301 [2019-10-07 15:54:42,856 INFO L226 Difference]: Without dead ends: 175 [2019-10-07 15:54:42,857 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-07 15:54:42,858 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 175 states. [2019-10-07 15:54:42,866 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 175 to 175. [2019-10-07 15:54:42,867 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 175 states. [2019-10-07 15:54:42,869 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 175 states to 175 states and 243 transitions. [2019-10-07 15:54:42,869 INFO L78 Accepts]: Start accepts. Automaton has 175 states and 243 transitions. Word has length 37 [2019-10-07 15:54:42,869 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-07 15:54:42,870 INFO L462 AbstractCegarLoop]: Abstraction has 175 states and 243 transitions. [2019-10-07 15:54:42,870 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-07 15:54:42,870 INFO L276 IsEmpty]: Start isEmpty. Operand 175 states and 243 transitions. [2019-10-07 15:54:42,871 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2019-10-07 15:54:42,871 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 15:54:42,872 INFO L385 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-07 15:54:42,872 INFO L410 AbstractCegarLoop]: === Iteration 6 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 15:54:42,872 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 15:54:42,872 INFO L82 PathProgramCache]: Analyzing trace with hash 1513406132, now seen corresponding path program 1 times [2019-10-07 15:54:42,873 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 15:54:42,873 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 15:54:42,873 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 15:54:42,873 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 15:54:42,874 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 15:54:42,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 15:54:42,965 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-07 15:54:42,965 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 15:54:42,966 INFO L211 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-07 15:54:42,966 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-07 15:54:42,966 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-07 15:54:42,967 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-07 15:54:42,967 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-07 15:54:42,969 INFO L87 Difference]: Start difference. First operand 175 states and 243 transitions. Second operand 4 states. [2019-10-07 15:54:43,033 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-07 15:54:43,034 INFO L93 Difference]: Finished difference Result 346 states and 490 transitions. [2019-10-07 15:54:43,034 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-07 15:54:43,035 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 38 [2019-10-07 15:54:43,035 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-07 15:54:43,037 INFO L225 Difference]: With dead ends: 346 [2019-10-07 15:54:43,037 INFO L226 Difference]: Without dead ends: 192 [2019-10-07 15:54:43,038 INFO L606 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-07 15:54:43,039 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 192 states. [2019-10-07 15:54:43,047 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 192 to 190. [2019-10-07 15:54:43,047 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 190 states. [2019-10-07 15:54:43,049 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 190 states to 190 states and 261 transitions. [2019-10-07 15:54:43,050 INFO L78 Accepts]: Start accepts. Automaton has 190 states and 261 transitions. Word has length 38 [2019-10-07 15:54:43,050 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-07 15:54:43,050 INFO L462 AbstractCegarLoop]: Abstraction has 190 states and 261 transitions. [2019-10-07 15:54:43,050 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-07 15:54:43,050 INFO L276 IsEmpty]: Start isEmpty. Operand 190 states and 261 transitions. [2019-10-07 15:54:43,051 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2019-10-07 15:54:43,052 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 15:54:43,052 INFO L385 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-07 15:54:43,052 INFO L410 AbstractCegarLoop]: === Iteration 7 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 15:54:43,052 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 15:54:43,052 INFO L82 PathProgramCache]: Analyzing trace with hash -1572931515, now seen corresponding path program 1 times [2019-10-07 15:54:43,053 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 15:54:43,053 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 15:54:43,053 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 15:54:43,053 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 15:54:43,053 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 15:54:43,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 15:54:43,097 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-07 15:54:43,097 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 15:54:43,097 INFO L211 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-07 15:54:43,098 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-07 15:54:43,098 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-07 15:54:43,098 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-07 15:54:43,098 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-07 15:54:43,099 INFO L87 Difference]: Start difference. First operand 190 states and 261 transitions. Second operand 4 states. [2019-10-07 15:54:43,161 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-07 15:54:43,162 INFO L93 Difference]: Finished difference Result 364 states and 514 transitions. [2019-10-07 15:54:43,162 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-07 15:54:43,162 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 38 [2019-10-07 15:54:43,163 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-07 15:54:43,165 INFO L225 Difference]: With dead ends: 364 [2019-10-07 15:54:43,165 INFO L226 Difference]: Without dead ends: 197 [2019-10-07 15:54:43,166 INFO L606 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-07 15:54:43,167 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 197 states. [2019-10-07 15:54:43,175 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 197 to 195. [2019-10-07 15:54:43,175 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 195 states. [2019-10-07 15:54:43,177 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 195 states to 195 states and 265 transitions. [2019-10-07 15:54:43,178 INFO L78 Accepts]: Start accepts. Automaton has 195 states and 265 transitions. Word has length 38 [2019-10-07 15:54:43,178 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-07 15:54:43,178 INFO L462 AbstractCegarLoop]: Abstraction has 195 states and 265 transitions. [2019-10-07 15:54:43,179 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-07 15:54:43,179 INFO L276 IsEmpty]: Start isEmpty. Operand 195 states and 265 transitions. [2019-10-07 15:54:43,180 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-10-07 15:54:43,180 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 15:54:43,180 INFO L385 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-07 15:54:43,180 INFO L410 AbstractCegarLoop]: === Iteration 8 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 15:54:43,181 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 15:54:43,181 INFO L82 PathProgramCache]: Analyzing trace with hash -523919551, now seen corresponding path program 1 times [2019-10-07 15:54:43,182 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 15:54:43,182 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 15:54:43,183 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 15:54:43,183 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 15:54:43,183 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 15:54:43,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 15:54:43,268 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-07 15:54:43,268 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 15:54:43,268 INFO L211 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-07 15:54:43,269 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-07 15:54:43,269 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-07 15:54:43,269 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-07 15:54:43,270 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-07 15:54:43,270 INFO L87 Difference]: Start difference. First operand 195 states and 265 transitions. Second operand 5 states. [2019-10-07 15:54:43,292 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-07 15:54:43,292 INFO L93 Difference]: Finished difference Result 362 states and 498 transitions. [2019-10-07 15:54:43,293 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-07 15:54:43,293 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 55 [2019-10-07 15:54:43,293 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-07 15:54:43,295 INFO L225 Difference]: With dead ends: 362 [2019-10-07 15:54:43,295 INFO L226 Difference]: Without dead ends: 197 [2019-10-07 15:54:43,297 INFO L606 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-07 15:54:43,297 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 197 states. [2019-10-07 15:54:43,305 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 197 to 195. [2019-10-07 15:54:43,306 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 195 states. [2019-10-07 15:54:43,307 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 195 states to 195 states and 264 transitions. [2019-10-07 15:54:43,308 INFO L78 Accepts]: Start accepts. Automaton has 195 states and 264 transitions. Word has length 55 [2019-10-07 15:54:43,308 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-07 15:54:43,309 INFO L462 AbstractCegarLoop]: Abstraction has 195 states and 264 transitions. [2019-10-07 15:54:43,309 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-07 15:54:43,309 INFO L276 IsEmpty]: Start isEmpty. Operand 195 states and 264 transitions. [2019-10-07 15:54:43,310 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2019-10-07 15:54:43,310 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 15:54:43,310 INFO L385 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-07 15:54:43,310 INFO L410 AbstractCegarLoop]: === Iteration 9 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 15:54:43,311 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 15:54:43,311 INFO L82 PathProgramCache]: Analyzing trace with hash 1318466697, now seen corresponding path program 1 times [2019-10-07 15:54:43,311 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 15:54:43,311 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 15:54:43,311 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 15:54:43,312 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 15:54:43,312 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 15:54:43,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 15:54:43,358 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-07 15:54:43,358 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 15:54:43,358 INFO L211 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-07 15:54:43,358 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-07 15:54:43,359 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-07 15:54:43,359 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-07 15:54:43,360 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-07 15:54:43,360 INFO L87 Difference]: Start difference. First operand 195 states and 264 transitions. Second operand 4 states. [2019-10-07 15:54:43,423 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-07 15:54:43,423 INFO L93 Difference]: Finished difference Result 374 states and 518 transitions. [2019-10-07 15:54:43,424 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-07 15:54:43,424 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 57 [2019-10-07 15:54:43,424 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-07 15:54:43,426 INFO L225 Difference]: With dead ends: 374 [2019-10-07 15:54:43,426 INFO L226 Difference]: Without dead ends: 214 [2019-10-07 15:54:43,427 INFO L606 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-07 15:54:43,428 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 214 states. [2019-10-07 15:54:43,436 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 214 to 212. [2019-10-07 15:54:43,436 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 212 states. [2019-10-07 15:54:43,438 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 212 states to 212 states and 284 transitions. [2019-10-07 15:54:43,439 INFO L78 Accepts]: Start accepts. Automaton has 212 states and 284 transitions. Word has length 57 [2019-10-07 15:54:43,439 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-07 15:54:43,439 INFO L462 AbstractCegarLoop]: Abstraction has 212 states and 284 transitions. [2019-10-07 15:54:43,439 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-07 15:54:43,439 INFO L276 IsEmpty]: Start isEmpty. Operand 212 states and 284 transitions. [2019-10-07 15:54:43,440 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2019-10-07 15:54:43,440 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 15:54:43,440 INFO L385 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-07 15:54:43,441 INFO L410 AbstractCegarLoop]: === Iteration 10 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 15:54:43,441 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 15:54:43,441 INFO L82 PathProgramCache]: Analyzing trace with hash -1302104397, now seen corresponding path program 1 times [2019-10-07 15:54:43,441 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 15:54:43,442 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 15:54:43,442 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 15:54:43,442 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 15:54:43,442 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 15:54:43,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 15:54:43,489 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-07 15:54:43,490 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 15:54:43,490 INFO L211 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-07 15:54:43,490 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-07 15:54:43,491 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-07 15:54:43,491 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-07 15:54:43,491 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-07 15:54:43,491 INFO L87 Difference]: Start difference. First operand 212 states and 284 transitions. Second operand 4 states. [2019-10-07 15:54:43,546 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-07 15:54:43,547 INFO L93 Difference]: Finished difference Result 385 states and 530 transitions. [2019-10-07 15:54:43,547 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-07 15:54:43,547 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 58 [2019-10-07 15:54:43,548 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-07 15:54:43,549 INFO L225 Difference]: With dead ends: 385 [2019-10-07 15:54:43,549 INFO L226 Difference]: Without dead ends: 210 [2019-10-07 15:54:43,551 INFO L606 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-07 15:54:43,551 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 210 states. [2019-10-07 15:54:43,559 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 210 to 210. [2019-10-07 15:54:43,559 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 210 states. [2019-10-07 15:54:43,561 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 210 states to 210 states and 278 transitions. [2019-10-07 15:54:43,561 INFO L78 Accepts]: Start accepts. Automaton has 210 states and 278 transitions. Word has length 58 [2019-10-07 15:54:43,561 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-07 15:54:43,562 INFO L462 AbstractCegarLoop]: Abstraction has 210 states and 278 transitions. [2019-10-07 15:54:43,562 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-07 15:54:43,562 INFO L276 IsEmpty]: Start isEmpty. Operand 210 states and 278 transitions. [2019-10-07 15:54:43,563 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2019-10-07 15:54:43,563 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 15:54:43,563 INFO L385 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-07 15:54:43,563 INFO L410 AbstractCegarLoop]: === Iteration 11 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 15:54:43,563 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 15:54:43,564 INFO L82 PathProgramCache]: Analyzing trace with hash 1371108976, now seen corresponding path program 1 times [2019-10-07 15:54:43,564 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 15:54:43,564 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 15:54:43,564 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 15:54:43,564 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 15:54:43,564 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 15:54:43,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 15:54:43,644 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-07 15:54:43,644 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 15:54:43,645 INFO L211 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-07 15:54:43,645 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-07 15:54:43,646 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-07 15:54:43,646 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-07 15:54:43,647 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-07 15:54:43,647 INFO L87 Difference]: Start difference. First operand 210 states and 278 transitions. Second operand 5 states. [2019-10-07 15:54:43,669 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-07 15:54:43,669 INFO L93 Difference]: Finished difference Result 377 states and 506 transitions. [2019-10-07 15:54:43,670 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-07 15:54:43,670 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 76 [2019-10-07 15:54:43,670 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-07 15:54:43,672 INFO L225 Difference]: With dead ends: 377 [2019-10-07 15:54:43,673 INFO L226 Difference]: Without dead ends: 212 [2019-10-07 15:54:43,674 INFO L606 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-07 15:54:43,674 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 212 states. [2019-10-07 15:54:43,683 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 212 to 210. [2019-10-07 15:54:43,683 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 210 states. [2019-10-07 15:54:43,685 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 210 states to 210 states and 277 transitions. [2019-10-07 15:54:43,685 INFO L78 Accepts]: Start accepts. Automaton has 210 states and 277 transitions. Word has length 76 [2019-10-07 15:54:43,685 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-07 15:54:43,686 INFO L462 AbstractCegarLoop]: Abstraction has 210 states and 277 transitions. [2019-10-07 15:54:43,686 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-07 15:54:43,686 INFO L276 IsEmpty]: Start isEmpty. Operand 210 states and 277 transitions. [2019-10-07 15:54:43,687 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2019-10-07 15:54:43,687 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 15:54:43,688 INFO L385 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-07 15:54:43,688 INFO L410 AbstractCegarLoop]: === Iteration 12 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 15:54:43,688 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 15:54:43,688 INFO L82 PathProgramCache]: Analyzing trace with hash 1035009016, now seen corresponding path program 1 times [2019-10-07 15:54:43,689 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 15:54:43,689 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 15:54:43,689 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 15:54:43,689 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 15:54:43,689 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 15:54:43,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 15:54:43,774 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-07 15:54:43,774 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 15:54:43,774 INFO L211 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-07 15:54:43,775 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-07 15:54:43,775 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-07 15:54:43,775 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-07 15:54:43,776 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-07 15:54:43,776 INFO L87 Difference]: Start difference. First operand 210 states and 277 transitions. Second operand 4 states. [2019-10-07 15:54:43,840 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-07 15:54:43,841 INFO L93 Difference]: Finished difference Result 366 states and 504 transitions. [2019-10-07 15:54:43,841 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-07 15:54:43,841 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 78 [2019-10-07 15:54:43,842 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-07 15:54:43,843 INFO L225 Difference]: With dead ends: 366 [2019-10-07 15:54:43,843 INFO L226 Difference]: Without dead ends: 208 [2019-10-07 15:54:43,845 INFO L606 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-07 15:54:43,845 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 208 states. [2019-10-07 15:54:43,852 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 208 to 208. [2019-10-07 15:54:43,852 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 208 states. [2019-10-07 15:54:43,854 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 208 states to 208 states and 273 transitions. [2019-10-07 15:54:43,854 INFO L78 Accepts]: Start accepts. Automaton has 208 states and 273 transitions. Word has length 78 [2019-10-07 15:54:43,854 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-07 15:54:43,855 INFO L462 AbstractCegarLoop]: Abstraction has 208 states and 273 transitions. [2019-10-07 15:54:43,855 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-07 15:54:43,855 INFO L276 IsEmpty]: Start isEmpty. Operand 208 states and 273 transitions. [2019-10-07 15:54:43,856 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2019-10-07 15:54:43,856 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 15:54:43,856 INFO L385 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-07 15:54:43,856 INFO L410 AbstractCegarLoop]: === Iteration 13 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 15:54:43,857 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 15:54:43,857 INFO L82 PathProgramCache]: Analyzing trace with hash 1089906055, now seen corresponding path program 1 times [2019-10-07 15:54:43,857 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 15:54:43,857 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 15:54:43,857 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 15:54:43,858 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 15:54:43,858 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 15:54:43,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 15:54:43,907 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-07 15:54:43,907 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 15:54:43,907 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2019-10-07 15:54:43,908 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-07 15:54:44,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 15:54:44,070 INFO L256 TraceCheckSpWp]: Trace formula consists of 633 conjuncts, 3 conjunts are in the unsatisfiable core [2019-10-07 15:54:44,083 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-07 15:54:44,143 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-07 15:54:44,144 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-10-07 15:54:44,266 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-07 15:54:44,266 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [2019-10-07 15:54:44,317 INFO L162 IcfgInterpreter]: Started Sifa with 58 locations of interest [2019-10-07 15:54:44,318 INFO L169 IcfgInterpreter]: Building call graph [2019-10-07 15:54:44,324 INFO L174 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-10-07 15:54:44,333 INFO L179 IcfgInterpreter]: Starting interpretation [2019-10-07 15:54:44,334 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2019-10-07 15:54:44,981 INFO L199 IcfgInterpreter]: Interpreting procedure main with input of size 169 for LOIs [2019-10-07 15:54:45,636 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-07 15:54:45,637 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:295) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.generateProof(TraceAbstractionRefinementEngine.java:177) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.executeStrategy(TraceAbstractionRefinementEngine.java:167) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:90) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.RefinementEngineFactory.runRefinementEngine(RefinementEngineFactory.java:133) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:436) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterateInternal(AbstractCegarLoop.java:419) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:368) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.iterate(TraceAbstractionStarter.java:332) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:170) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:122) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:120) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:316) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:55) Caused by: java.lang.IllegalArgumentException: Tried to insert element unknown in custom order: ε 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:99) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:67) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:99) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:75) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.tryExecuteInterpolantGenerator(TraceAbstractionRefinementEngine.java:287) ... 21 more [2019-10-07 15:54:45,644 INFO L168 Benchmark]: Toolchain (without parser) took 6239.18 ms. Allocated memory was 138.9 MB in the beginning and 325.6 MB in the end (delta: 186.6 MB). Free memory was 103.4 MB in the beginning and 293.4 MB in the end (delta: -190.1 MB). Peak memory consumption was 162.3 MB. Max. memory is 7.1 GB. [2019-10-07 15:54:45,645 INFO L168 Benchmark]: CDTParser took 1.30 ms. Allocated memory is still 138.9 MB. Free memory was 122.2 MB in the beginning and 122.0 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. [2019-10-07 15:54:45,646 INFO L168 Benchmark]: CACSL2BoogieTranslator took 562.99 ms. Allocated memory was 138.9 MB in the beginning and 202.9 MB in the end (delta: 64.0 MB). Free memory was 103.2 MB in the beginning and 177.3 MB in the end (delta: -74.2 MB). Peak memory consumption was 27.0 MB. Max. memory is 7.1 GB. [2019-10-07 15:54:45,646 INFO L168 Benchmark]: Boogie Preprocessor took 72.04 ms. Allocated memory is still 202.9 MB. Free memory was 177.3 MB in the beginning and 174.3 MB in the end (delta: 3.1 MB). Peak memory consumption was 3.1 MB. Max. memory is 7.1 GB. [2019-10-07 15:54:45,647 INFO L168 Benchmark]: RCFGBuilder took 1303.27 ms. Allocated memory was 202.9 MB in the beginning and 235.9 MB in the end (delta: 33.0 MB). Free memory was 174.3 MB in the beginning and 187.9 MB in the end (delta: -13.7 MB). Peak memory consumption was 88.5 MB. Max. memory is 7.1 GB. [2019-10-07 15:54:45,648 INFO L168 Benchmark]: TraceAbstraction took 4296.42 ms. Allocated memory was 235.9 MB in the beginning and 325.6 MB in the end (delta: 89.7 MB). Free memory was 186.5 MB in the beginning and 293.4 MB in the end (delta: -106.9 MB). Peak memory consumption was 148.4 MB. Max. memory is 7.1 GB. [2019-10-07 15:54:45,653 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 1.30 ms. Allocated memory is still 138.9 MB. Free memory was 122.2 MB in the beginning and 122.0 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 562.99 ms. Allocated memory was 138.9 MB in the beginning and 202.9 MB in the end (delta: 64.0 MB). Free memory was 103.2 MB in the beginning and 177.3 MB in the end (delta: -74.2 MB). Peak memory consumption was 27.0 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 72.04 ms. Allocated memory is still 202.9 MB. Free memory was 177.3 MB in the beginning and 174.3 MB in the end (delta: 3.1 MB). Peak memory consumption was 3.1 MB. Max. memory is 7.1 GB. * RCFGBuilder took 1303.27 ms. Allocated memory was 202.9 MB in the beginning and 235.9 MB in the end (delta: 33.0 MB). Free memory was 174.3 MB in the beginning and 187.9 MB in the end (delta: -13.7 MB). Peak memory consumption was 88.5 MB. Max. memory is 7.1 GB. * TraceAbstraction took 4296.42 ms. Allocated memory was 235.9 MB in the beginning and 325.6 MB in the end (delta: 89.7 MB). Free memory was 186.5 MB in the beginning and 293.4 MB in the end (delta: -106.9 MB). Peak memory consumption was 148.4 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: AssertionError: java.lang.IllegalArgumentException: Tried to insert element unknown in custom order: ε 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:295) RESULT: Ultimate could not prove your program: Toolchain returned no result. Received shutdown request...