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.BOUNDED-10.pals.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-f4eb214f-m [2019-10-13 23:22:38,111 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-10-13 23:22:38,114 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-10-13 23:22:38,130 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-10-13 23:22:38,131 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-10-13 23:22:38,132 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-10-13 23:22:38,133 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-10-13 23:22:38,135 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-10-13 23:22:38,137 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-10-13 23:22:38,138 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-10-13 23:22:38,142 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-10-13 23:22:38,149 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-10-13 23:22:38,149 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-10-13 23:22:38,153 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-10-13 23:22:38,154 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-10-13 23:22:38,156 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-10-13 23:22:38,158 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-10-13 23:22:38,159 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-10-13 23:22:38,162 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-10-13 23:22:38,165 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-10-13 23:22:38,166 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-10-13 23:22:38,167 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-10-13 23:22:38,168 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-10-13 23:22:38,168 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-10-13 23:22:38,170 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-10-13 23:22:38,171 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-10-13 23:22:38,171 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-10-13 23:22:38,172 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-10-13 23:22:38,172 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-10-13 23:22:38,173 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-10-13 23:22:38,173 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-10-13 23:22:38,174 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-10-13 23:22:38,175 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-10-13 23:22:38,176 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-10-13 23:22:38,176 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-10-13 23:22:38,177 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-10-13 23:22:38,177 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-10-13 23:22:38,177 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-10-13 23:22:38,178 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-10-13 23:22:38,178 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-10-13 23:22:38,179 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-10-13 23:22:38,180 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:38,197 INFO L113 SettingsManager]: Loading preferences was successful [2019-10-13 23:22:38,197 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-10-13 23:22:38,198 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-10-13 23:22:38,198 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-10-13 23:22:38,199 INFO L138 SettingsManager]: * Use SBE=true [2019-10-13 23:22:38,199 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-10-13 23:22:38,199 INFO L138 SettingsManager]: * sizeof long=4 [2019-10-13 23:22:38,199 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-10-13 23:22:38,199 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-10-13 23:22:38,200 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-10-13 23:22:38,200 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-10-13 23:22:38,200 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-10-13 23:22:38,200 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-10-13 23:22:38,200 INFO L138 SettingsManager]: * sizeof long double=12 [2019-10-13 23:22:38,201 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-10-13 23:22:38,201 INFO L138 SettingsManager]: * Use constant arrays=true [2019-10-13 23:22:38,201 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-10-13 23:22:38,201 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-10-13 23:22:38,201 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-10-13 23:22:38,202 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-10-13 23:22:38,202 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-10-13 23:22:38,202 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-13 23:22:38,202 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-10-13 23:22:38,202 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-10-13 23:22:38,203 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-10-13 23:22:38,203 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-10-13 23:22:38,203 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-10-13 23:22:38,203 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-10-13 23:22:38,203 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:38,472 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-10-13 23:22:38,487 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-10-13 23:22:38,490 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-10-13 23:22:38,492 INFO L271 PluginConnector]: Initializing CDTParser... [2019-10-13 23:22:38,492 INFO L275 PluginConnector]: CDTParser initialized [2019-10-13 23:22:38,493 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.BOUNDED-10.pals.c [2019-10-13 23:22:38,572 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/faa8c337f/d14c751a04f8402b975a39d5a68ab3a4/FLAGf10215289 [2019-10-13 23:22:39,119 INFO L306 CDTParser]: Found 1 translation units. [2019-10-13 23:22:39,120 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/seq-mthreaded/pals_STARTPALS_Triplicated.1.ufo.BOUNDED-10.pals.c [2019-10-13 23:22:39,133 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/faa8c337f/d14c751a04f8402b975a39d5a68ab3a4/FLAGf10215289 [2019-10-13 23:22:39,382 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/faa8c337f/d14c751a04f8402b975a39d5a68ab3a4 [2019-10-13 23:22:39,391 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-10-13 23:22:39,392 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-10-13 23:22:39,393 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-10-13 23:22:39,393 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-10-13 23:22:39,397 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-10-13 23:22:39,398 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 11:22:39" (1/1) ... [2019-10-13 23:22:39,400 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@191613fc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 11:22:39, skipping insertion in model container [2019-10-13 23:22:39,401 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 11:22:39" (1/1) ... [2019-10-13 23:22:39,408 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-10-13 23:22:39,464 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-10-13 23:22:39,722 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-13 23:22:39,812 INFO L188 MainTranslator]: Completed pre-run [2019-10-13 23:22:39,903 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-13 23:22:39,924 INFO L192 MainTranslator]: Completed translation [2019-10-13 23:22:39,924 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 11:22:39 WrapperNode [2019-10-13 23:22:39,924 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-10-13 23:22:39,925 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-10-13 23:22:39,925 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-10-13 23:22:39,925 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-10-13 23:22:39,936 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:39" (1/1) ... [2019-10-13 23:22:39,937 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:39" (1/1) ... [2019-10-13 23:22:39,948 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:39" (1/1) ... [2019-10-13 23:22:39,948 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:39" (1/1) ... [2019-10-13 23:22:39,964 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:39" (1/1) ... [2019-10-13 23:22:39,975 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:39" (1/1) ... [2019-10-13 23:22:39,979 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:39" (1/1) ... [2019-10-13 23:22:39,984 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-10-13 23:22:39,984 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-10-13 23:22:39,984 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-10-13 23:22:39,985 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-10-13 23:22:39,986 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 11:22: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-13 23:22:40,047 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-10-13 23:22:40,047 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-10-13 23:22:40,047 INFO L138 BoogieDeclarations]: Found implementation of procedure add_history_type [2019-10-13 23:22:40,047 INFO L138 BoogieDeclarations]: Found implementation of procedure read_history_int8 [2019-10-13 23:22:40,047 INFO L138 BoogieDeclarations]: Found implementation of procedure read_history_bool [2019-10-13 23:22:40,048 INFO L138 BoogieDeclarations]: Found implementation of procedure write_history_int8 [2019-10-13 23:22:40,048 INFO L138 BoogieDeclarations]: Found implementation of procedure write_history_bool [2019-10-13 23:22:40,048 INFO L138 BoogieDeclarations]: Found implementation of procedure init [2019-10-13 23:22:40,049 INFO L138 BoogieDeclarations]: Found implementation of procedure check [2019-10-13 23:22:40,049 INFO L138 BoogieDeclarations]: Found implementation of procedure gate1_each_pals_period [2019-10-13 23:22:40,049 INFO L138 BoogieDeclarations]: Found implementation of procedure gate2_each_pals_period [2019-10-13 23:22:40,049 INFO L138 BoogieDeclarations]: Found implementation of procedure gate3_each_pals_period [2019-10-13 23:22:40,049 INFO L138 BoogieDeclarations]: Found implementation of procedure voter [2019-10-13 23:22:40,049 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-10-13 23:22:40,050 INFO L138 BoogieDeclarations]: Found implementation of procedure assert [2019-10-13 23:22:40,050 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-10-13 23:22:40,050 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_char [2019-10-13 23:22:40,050 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_bool [2019-10-13 23:22:40,050 INFO L130 BoogieDeclarations]: Found specification of procedure read [2019-10-13 23:22:40,050 INFO L130 BoogieDeclarations]: Found specification of procedure write [2019-10-13 23:22:40,051 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assume [2019-10-13 23:22:40,051 INFO L130 BoogieDeclarations]: Found specification of procedure assert [2019-10-13 23:22:40,051 INFO L130 BoogieDeclarations]: Found specification of procedure read_history_bool [2019-10-13 23:22:40,051 INFO L130 BoogieDeclarations]: Found specification of procedure read_history_int8 [2019-10-13 23:22:40,051 INFO L130 BoogieDeclarations]: Found specification of procedure add_history_type [2019-10-13 23:22:40,052 INFO L130 BoogieDeclarations]: Found specification of procedure write_history_int8 [2019-10-13 23:22:40,052 INFO L130 BoogieDeclarations]: Found specification of procedure write_history_bool [2019-10-13 23:22:40,052 INFO L130 BoogieDeclarations]: Found specification of procedure init [2019-10-13 23:22:40,052 INFO L130 BoogieDeclarations]: Found specification of procedure check [2019-10-13 23:22:40,052 INFO L130 BoogieDeclarations]: Found specification of procedure gate1_each_pals_period [2019-10-13 23:22:40,052 INFO L130 BoogieDeclarations]: Found specification of procedure gate2_each_pals_period [2019-10-13 23:22:40,053 INFO L130 BoogieDeclarations]: Found specification of procedure gate3_each_pals_period [2019-10-13 23:22:40,053 INFO L130 BoogieDeclarations]: Found specification of procedure voter [2019-10-13 23:22:40,053 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-10-13 23:22:40,053 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-10-13 23:22:40,053 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-10-13 23:22:41,322 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-10-13 23:22:41,322 INFO L284 CfgBuilder]: Removed 2 assume(true) statements. [2019-10-13 23:22:41,324 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 11:22:41 BoogieIcfgContainer [2019-10-13 23:22:41,324 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-10-13 23:22:41,325 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-10-13 23:22:41,325 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-10-13 23:22:41,329 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-10-13 23:22:41,330 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.10 11:22:39" (1/3) ... [2019-10-13 23:22:41,331 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6cf0873b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 11:22:41, skipping insertion in model container [2019-10-13 23:22:41,331 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 11:22:39" (2/3) ... [2019-10-13 23:22:41,331 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6cf0873b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 11:22:41, skipping insertion in model container [2019-10-13 23:22:41,332 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 11:22:41" (3/3) ... [2019-10-13 23:22:41,336 INFO L109 eAbstractionObserver]: Analyzing ICFG pals_STARTPALS_Triplicated.1.ufo.BOUNDED-10.pals.c [2019-10-13 23:22:41,345 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-10-13 23:22:41,357 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-10-13 23:22:41,369 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-10-13 23:22:41,398 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-10-13 23:22:41,398 INFO L374 AbstractCegarLoop]: Hoare is true [2019-10-13 23:22:41,398 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-10-13 23:22:41,398 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-10-13 23:22:41,398 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-10-13 23:22:41,398 INFO L378 AbstractCegarLoop]: Difference is false [2019-10-13 23:22:41,399 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-10-13 23:22:41,399 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-10-13 23:22:41,424 INFO L276 IsEmpty]: Start isEmpty. Operand 161 states. [2019-10-13 23:22:41,434 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-10-13 23:22:41,435 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 23:22:41,436 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:41,438 INFO L410 AbstractCegarLoop]: === Iteration 1 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 23:22:41,444 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 23:22:41,445 INFO L82 PathProgramCache]: Analyzing trace with hash 758147934, now seen corresponding path program 1 times [2019-10-13 23:22:41,454 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-13 23:22:41,455 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [525229423] [2019-10-13 23:22:41,455 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 23:22:41,455 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 23:22:41,455 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 23:22:41,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 23:22:41,732 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:41,733 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [525229423] [2019-10-13 23:22:41,734 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 23:22:41,734 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-13 23:22:41,735 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [70770421] [2019-10-13 23:22:41,740 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-13 23:22:41,740 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-13 23:22:41,757 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-13 23:22:41,758 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-13 23:22:41,761 INFO L87 Difference]: Start difference. First operand 161 states. Second operand 4 states. [2019-10-13 23:22:41,923 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 23:22:41,923 INFO L93 Difference]: Finished difference Result 320 states and 504 transitions. [2019-10-13 23:22:41,926 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-13 23:22:41,927 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 20 [2019-10-13 23:22:41,928 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 23:22:41,950 INFO L225 Difference]: With dead ends: 320 [2019-10-13 23:22:41,951 INFO L226 Difference]: Without dead ends: 164 [2019-10-13 23:22:41,962 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:41,982 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 164 states. [2019-10-13 23:22:42,051 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 164 to 162. [2019-10-13 23:22:42,052 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 162 states. [2019-10-13 23:22:42,061 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 162 states to 162 states and 231 transitions. [2019-10-13 23:22:42,063 INFO L78 Accepts]: Start accepts. Automaton has 162 states and 231 transitions. Word has length 20 [2019-10-13 23:22:42,064 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 23:22:42,064 INFO L462 AbstractCegarLoop]: Abstraction has 162 states and 231 transitions. [2019-10-13 23:22:42,064 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-13 23:22:42,065 INFO L276 IsEmpty]: Start isEmpty. Operand 162 states and 231 transitions. [2019-10-13 23:22:42,068 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-10-13 23:22:42,069 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 23:22:42,069 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:42,069 INFO L410 AbstractCegarLoop]: === Iteration 2 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 23:22:42,070 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 23:22:42,071 INFO L82 PathProgramCache]: Analyzing trace with hash 658096871, now seen corresponding path program 1 times [2019-10-13 23:22:42,071 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-13 23:22:42,071 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [203050115] [2019-10-13 23:22:42,072 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 23:22:42,072 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 23:22:42,072 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 23:22:42,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 23:22:42,205 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:42,205 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [203050115] [2019-10-13 23:22:42,206 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 23:22:42,206 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-13 23:22:42,207 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [222294675] [2019-10-13 23:22:42,217 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-13 23:22:42,218 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-13 23:22:42,218 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-13 23:22:42,218 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-13 23:22:42,218 INFO L87 Difference]: Start difference. First operand 162 states and 231 transitions. Second operand 4 states. [2019-10-13 23:22:42,284 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 23:22:42,284 INFO L93 Difference]: Finished difference Result 330 states and 478 transitions. [2019-10-13 23:22:42,285 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-13 23:22:42,285 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 21 [2019-10-13 23:22:42,285 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 23:22:42,288 INFO L225 Difference]: With dead ends: 330 [2019-10-13 23:22:42,288 INFO L226 Difference]: Without dead ends: 176 [2019-10-13 23:22:42,292 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:42,294 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 176 states. [2019-10-13 23:22:42,320 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 176 to 174. [2019-10-13 23:22:42,320 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 174 states. [2019-10-13 23:22:42,325 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 174 states to 174 states and 246 transitions. [2019-10-13 23:22:42,325 INFO L78 Accepts]: Start accepts. Automaton has 174 states and 246 transitions. Word has length 21 [2019-10-13 23:22:42,326 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 23:22:42,326 INFO L462 AbstractCegarLoop]: Abstraction has 174 states and 246 transitions. [2019-10-13 23:22:42,326 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-13 23:22:42,327 INFO L276 IsEmpty]: Start isEmpty. Operand 174 states and 246 transitions. [2019-10-13 23:22:42,331 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-10-13 23:22:42,331 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 23:22:42,332 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:42,332 INFO L410 AbstractCegarLoop]: === Iteration 3 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 23:22:42,332 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 23:22:42,333 INFO L82 PathProgramCache]: Analyzing trace with hash -1614839382, now seen corresponding path program 1 times [2019-10-13 23:22:42,334 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-13 23:22:42,334 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [676931205] [2019-10-13 23:22:42,334 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 23:22:42,336 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 23:22:42,336 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 23:22:42,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 23:22:42,402 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:42,403 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [676931205] [2019-10-13 23:22:42,403 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 23:22:42,403 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-13 23:22:42,404 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [843940745] [2019-10-13 23:22:42,404 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-13 23:22:42,404 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-13 23:22:42,405 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-13 23:22:42,405 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-13 23:22:42,405 INFO L87 Difference]: Start difference. First operand 174 states and 246 transitions. Second operand 3 states. [2019-10-13 23:22:42,430 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 23:22:42,430 INFO L93 Difference]: Finished difference Result 362 states and 524 transitions. [2019-10-13 23:22:42,430 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-13 23:22:42,431 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 28 [2019-10-13 23:22:42,431 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 23:22:42,435 INFO L225 Difference]: With dead ends: 362 [2019-10-13 23:22:42,435 INFO L226 Difference]: Without dead ends: 203 [2019-10-13 23:22:42,436 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:42,437 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 203 states. [2019-10-13 23:22:42,467 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 203 to 176. [2019-10-13 23:22:42,468 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 176 states. [2019-10-13 23:22:42,469 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 176 states to 176 states and 248 transitions. [2019-10-13 23:22:42,470 INFO L78 Accepts]: Start accepts. Automaton has 176 states and 248 transitions. Word has length 28 [2019-10-13 23:22:42,470 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 23:22:42,470 INFO L462 AbstractCegarLoop]: Abstraction has 176 states and 248 transitions. [2019-10-13 23:22:42,470 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-13 23:22:42,471 INFO L276 IsEmpty]: Start isEmpty. Operand 176 states and 248 transitions. [2019-10-13 23:22:42,472 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2019-10-13 23:22:42,472 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 23:22:42,472 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:42,473 INFO L410 AbstractCegarLoop]: === Iteration 4 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 23:22:42,473 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 23:22:42,473 INFO L82 PathProgramCache]: Analyzing trace with hash -1162341358, now seen corresponding path program 1 times [2019-10-13 23:22:42,473 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-13 23:22:42,473 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [84932252] [2019-10-13 23:22:42,474 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 23:22:42,474 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 23:22:42,474 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 23:22:42,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 23:22:42,550 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:42,550 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [84932252] [2019-10-13 23:22:42,551 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 23:22:42,551 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-13 23:22:42,551 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1540138959] [2019-10-13 23:22:42,552 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-13 23:22:42,552 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-13 23:22:42,552 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-13 23:22:42,552 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-13 23:22:42,553 INFO L87 Difference]: Start difference. First operand 176 states and 248 transitions. Second operand 5 states. [2019-10-13 23:22:42,587 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 23:22:42,587 INFO L93 Difference]: Finished difference Result 340 states and 483 transitions. [2019-10-13 23:22:42,588 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-13 23:22:42,588 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 36 [2019-10-13 23:22:42,588 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 23:22:42,591 INFO L225 Difference]: With dead ends: 340 [2019-10-13 23:22:42,591 INFO L226 Difference]: Without dead ends: 184 [2019-10-13 23:22:42,592 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:42,593 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 184 states. [2019-10-13 23:22:42,604 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 184 to 180. [2019-10-13 23:22:42,605 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 180 states. [2019-10-13 23:22:42,607 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 180 states to 180 states and 252 transitions. [2019-10-13 23:22:42,607 INFO L78 Accepts]: Start accepts. Automaton has 180 states and 252 transitions. Word has length 36 [2019-10-13 23:22:42,610 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 23:22:42,611 INFO L462 AbstractCegarLoop]: Abstraction has 180 states and 252 transitions. [2019-10-13 23:22:42,611 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-13 23:22:42,611 INFO L276 IsEmpty]: Start isEmpty. Operand 180 states and 252 transitions. [2019-10-13 23:22:42,612 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2019-10-13 23:22:42,612 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 23:22:42,613 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:42,613 INFO L410 AbstractCegarLoop]: === Iteration 5 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 23:22:42,613 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 23:22:42,613 INFO L82 PathProgramCache]: Analyzing trace with hash 985709149, now seen corresponding path program 1 times [2019-10-13 23:22:42,614 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-13 23:22:42,614 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [358626348] [2019-10-13 23:22:42,614 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 23:22:42,614 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 23:22:42,614 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 23:22:42,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 23:22:42,726 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:42,726 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [358626348] [2019-10-13 23:22:42,726 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 23:22:42,727 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-13 23:22:42,727 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [255338162] [2019-10-13 23:22:42,727 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-13 23:22:42,728 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-13 23:22:42,728 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-13 23:22:42,728 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-13 23:22:42,729 INFO L87 Difference]: Start difference. First operand 180 states and 252 transitions. Second operand 4 states. [2019-10-13 23:22:42,749 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 23:22:42,749 INFO L93 Difference]: Finished difference Result 303 states and 425 transitions. [2019-10-13 23:22:42,750 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-13 23:22:42,750 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 37 [2019-10-13 23:22:42,750 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 23:22:42,752 INFO L225 Difference]: With dead ends: 303 [2019-10-13 23:22:42,752 INFO L226 Difference]: Without dead ends: 176 [2019-10-13 23:22:42,753 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:42,754 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 176 states. [2019-10-13 23:22:42,764 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 176 to 176. [2019-10-13 23:22:42,764 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 176 states. [2019-10-13 23:22:42,766 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 176 states to 176 states and 244 transitions. [2019-10-13 23:22:42,766 INFO L78 Accepts]: Start accepts. Automaton has 176 states and 244 transitions. Word has length 37 [2019-10-13 23:22:42,767 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 23:22:42,767 INFO L462 AbstractCegarLoop]: Abstraction has 176 states and 244 transitions. [2019-10-13 23:22:42,767 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-13 23:22:42,767 INFO L276 IsEmpty]: Start isEmpty. Operand 176 states and 244 transitions. [2019-10-13 23:22:42,768 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2019-10-13 23:22:42,769 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 23:22:42,769 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:42,769 INFO L410 AbstractCegarLoop]: === Iteration 6 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 23:22:42,769 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 23:22:42,770 INFO L82 PathProgramCache]: Analyzing trace with hash -562127975, now seen corresponding path program 1 times [2019-10-13 23:22:42,770 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-13 23:22:42,770 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1895825039] [2019-10-13 23:22:42,770 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 23:22:42,771 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 23:22:42,771 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 23:22:42,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 23:22:42,855 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:42,855 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1895825039] [2019-10-13 23:22:42,855 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 23:22:42,856 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-13 23:22:42,856 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1048636835] [2019-10-13 23:22:42,857 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-13 23:22:42,858 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-13 23:22:42,858 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-13 23:22:42,858 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-13 23:22:42,858 INFO L87 Difference]: Start difference. First operand 176 states and 244 transitions. Second operand 4 states. [2019-10-13 23:22:42,928 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 23:22:42,929 INFO L93 Difference]: Finished difference Result 348 states and 492 transitions. [2019-10-13 23:22:42,929 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-13 23:22:42,929 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 38 [2019-10-13 23:22:42,930 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 23:22:42,932 INFO L225 Difference]: With dead ends: 348 [2019-10-13 23:22:42,932 INFO L226 Difference]: Without dead ends: 193 [2019-10-13 23:22:42,933 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:42,934 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 193 states. [2019-10-13 23:22:42,949 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 193 to 191. [2019-10-13 23:22:42,949 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 191 states. [2019-10-13 23:22:42,951 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 191 states to 191 states and 262 transitions. [2019-10-13 23:22:42,953 INFO L78 Accepts]: Start accepts. Automaton has 191 states and 262 transitions. Word has length 38 [2019-10-13 23:22:42,955 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 23:22:42,955 INFO L462 AbstractCegarLoop]: Abstraction has 191 states and 262 transitions. [2019-10-13 23:22:42,955 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-13 23:22:42,955 INFO L276 IsEmpty]: Start isEmpty. Operand 191 states and 262 transitions. [2019-10-13 23:22:42,958 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2019-10-13 23:22:42,958 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 23:22:42,959 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:42,959 INFO L410 AbstractCegarLoop]: === Iteration 7 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 23:22:42,959 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 23:22:42,959 INFO L82 PathProgramCache]: Analyzing trace with hash -2048456470, now seen corresponding path program 1 times [2019-10-13 23:22:42,959 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-13 23:22:42,960 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1760523052] [2019-10-13 23:22:42,960 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 23:22:42,960 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 23:22:42,960 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 23:22:42,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 23:22:43,025 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:43,025 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1760523052] [2019-10-13 23:22:43,026 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 23:22:43,026 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-13 23:22:43,026 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1070270943] [2019-10-13 23:22:43,027 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-13 23:22:43,027 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-13 23:22:43,027 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-13 23:22:43,028 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-13 23:22:43,028 INFO L87 Difference]: Start difference. First operand 191 states and 262 transitions. Second operand 4 states. [2019-10-13 23:22:43,088 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 23:22:43,089 INFO L93 Difference]: Finished difference Result 366 states and 516 transitions. [2019-10-13 23:22:43,089 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-13 23:22:43,089 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 38 [2019-10-13 23:22:43,090 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 23:22:43,093 INFO L225 Difference]: With dead ends: 366 [2019-10-13 23:22:43,093 INFO L226 Difference]: Without dead ends: 198 [2019-10-13 23:22:43,095 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:43,095 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 198 states. [2019-10-13 23:22:43,115 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 198 to 196. [2019-10-13 23:22:43,116 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 196 states. [2019-10-13 23:22:43,121 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 196 states to 196 states and 266 transitions. [2019-10-13 23:22:43,122 INFO L78 Accepts]: Start accepts. Automaton has 196 states and 266 transitions. Word has length 38 [2019-10-13 23:22:43,122 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 23:22:43,122 INFO L462 AbstractCegarLoop]: Abstraction has 196 states and 266 transitions. [2019-10-13 23:22:43,122 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-13 23:22:43,123 INFO L276 IsEmpty]: Start isEmpty. Operand 196 states and 266 transitions. [2019-10-13 23:22:43,127 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-10-13 23:22:43,127 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 23:22:43,127 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:43,128 INFO L410 AbstractCegarLoop]: === Iteration 8 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 23:22:43,128 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 23:22:43,130 INFO L82 PathProgramCache]: Analyzing trace with hash -905435297, now seen corresponding path program 1 times [2019-10-13 23:22:43,130 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-13 23:22:43,131 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1520349315] [2019-10-13 23:22:43,131 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 23:22:43,131 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 23:22:43,131 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 23:22:43,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 23:22:43,227 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:43,228 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1520349315] [2019-10-13 23:22:43,228 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 23:22:43,228 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-13 23:22:43,229 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1410560100] [2019-10-13 23:22:43,230 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-13 23:22:43,231 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-13 23:22:43,231 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-13 23:22:43,231 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-13 23:22:43,231 INFO L87 Difference]: Start difference. First operand 196 states and 266 transitions. Second operand 5 states. [2019-10-13 23:22:43,255 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 23:22:43,256 INFO L93 Difference]: Finished difference Result 364 states and 500 transitions. [2019-10-13 23:22:43,256 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-13 23:22:43,256 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 55 [2019-10-13 23:22:43,257 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 23:22:43,259 INFO L225 Difference]: With dead ends: 364 [2019-10-13 23:22:43,259 INFO L226 Difference]: Without dead ends: 198 [2019-10-13 23:22:43,260 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:43,262 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 198 states. [2019-10-13 23:22:43,272 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 198 to 196. [2019-10-13 23:22:43,272 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 196 states. [2019-10-13 23:22:43,274 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 196 states to 196 states and 265 transitions. [2019-10-13 23:22:43,274 INFO L78 Accepts]: Start accepts. Automaton has 196 states and 265 transitions. Word has length 55 [2019-10-13 23:22:43,274 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 23:22:43,274 INFO L462 AbstractCegarLoop]: Abstraction has 196 states and 265 transitions. [2019-10-13 23:22:43,274 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-13 23:22:43,275 INFO L276 IsEmpty]: Start isEmpty. Operand 196 states and 265 transitions. [2019-10-13 23:22:43,276 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2019-10-13 23:22:43,276 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 23:22:43,276 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:43,276 INFO L410 AbstractCegarLoop]: === Iteration 9 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 23:22:43,277 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 23:22:43,277 INFO L82 PathProgramCache]: Analyzing trace with hash 1171722150, now seen corresponding path program 1 times [2019-10-13 23:22:43,277 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-13 23:22:43,278 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [693415884] [2019-10-13 23:22:43,278 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 23:22:43,279 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 23:22:43,279 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 23:22:43,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 23:22:43,344 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:43,344 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [693415884] [2019-10-13 23:22:43,345 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 23:22:43,345 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-13 23:22:43,345 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [351935936] [2019-10-13 23:22:43,346 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-13 23:22:43,346 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-13 23:22:43,350 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-13 23:22:43,350 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-13 23:22:43,351 INFO L87 Difference]: Start difference. First operand 196 states and 265 transitions. Second operand 4 states. [2019-10-13 23:22:43,412 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 23:22:43,412 INFO L93 Difference]: Finished difference Result 376 states and 520 transitions. [2019-10-13 23:22:43,413 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-13 23:22:43,413 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 57 [2019-10-13 23:22:43,415 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 23:22:43,419 INFO L225 Difference]: With dead ends: 376 [2019-10-13 23:22:43,419 INFO L226 Difference]: Without dead ends: 215 [2019-10-13 23:22:43,428 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:43,429 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 215 states. [2019-10-13 23:22:43,440 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 215 to 213. [2019-10-13 23:22:43,440 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 213 states. [2019-10-13 23:22:43,441 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 213 states to 213 states and 285 transitions. [2019-10-13 23:22:43,442 INFO L78 Accepts]: Start accepts. Automaton has 213 states and 285 transitions. Word has length 57 [2019-10-13 23:22:43,442 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 23:22:43,442 INFO L462 AbstractCegarLoop]: Abstraction has 213 states and 285 transitions. [2019-10-13 23:22:43,442 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-13 23:22:43,443 INFO L276 IsEmpty]: Start isEmpty. Operand 213 states and 285 transitions. [2019-10-13 23:22:43,444 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2019-10-13 23:22:43,444 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 23:22:43,444 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:43,445 INFO L410 AbstractCegarLoop]: === Iteration 10 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 23:22:43,445 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 23:22:43,445 INFO L82 PathProgramCache]: Analyzing trace with hash -812439080, now seen corresponding path program 1 times [2019-10-13 23:22:43,445 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-13 23:22:43,445 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [383326818] [2019-10-13 23:22:43,446 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 23:22:43,446 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 23:22:43,446 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 23:22:43,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 23:22:43,516 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:43,517 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [383326818] [2019-10-13 23:22:43,518 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 23:22:43,518 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-13 23:22:43,518 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1368361216] [2019-10-13 23:22:43,518 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-13 23:22:43,519 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-13 23:22:43,519 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-13 23:22:43,519 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-13 23:22:43,519 INFO L87 Difference]: Start difference. First operand 213 states and 285 transitions. Second operand 4 states. [2019-10-13 23:22:43,565 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 23:22:43,566 INFO L93 Difference]: Finished difference Result 387 states and 532 transitions. [2019-10-13 23:22:43,566 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-13 23:22:43,566 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 58 [2019-10-13 23:22:43,567 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 23:22:43,568 INFO L225 Difference]: With dead ends: 387 [2019-10-13 23:22:43,568 INFO L226 Difference]: Without dead ends: 211 [2019-10-13 23:22:43,569 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:43,570 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 211 states. [2019-10-13 23:22:43,577 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 211 to 211. [2019-10-13 23:22:43,577 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 211 states. [2019-10-13 23:22:43,579 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 211 states to 211 states and 279 transitions. [2019-10-13 23:22:43,579 INFO L78 Accepts]: Start accepts. Automaton has 211 states and 279 transitions. Word has length 58 [2019-10-13 23:22:43,579 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 23:22:43,579 INFO L462 AbstractCegarLoop]: Abstraction has 211 states and 279 transitions. [2019-10-13 23:22:43,580 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-13 23:22:43,580 INFO L276 IsEmpty]: Start isEmpty. Operand 211 states and 279 transitions. [2019-10-13 23:22:43,580 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2019-10-13 23:22:43,581 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 23:22:43,581 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:43,581 INFO L410 AbstractCegarLoop]: === Iteration 11 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 23:22:43,581 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 23:22:43,581 INFO L82 PathProgramCache]: Analyzing trace with hash 1928367096, now seen corresponding path program 1 times [2019-10-13 23:22:43,582 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-13 23:22:43,582 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [429057357] [2019-10-13 23:22:43,582 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 23:22:43,582 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 23:22:43,582 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 23:22:43,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 23:22:43,634 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:43,635 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [429057357] [2019-10-13 23:22:43,635 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 23:22:43,635 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-13 23:22:43,635 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [226303185] [2019-10-13 23:22:43,636 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-13 23:22:43,636 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-13 23:22:43,636 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-13 23:22:43,636 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-13 23:22:43,637 INFO L87 Difference]: Start difference. First operand 211 states and 279 transitions. Second operand 5 states. [2019-10-13 23:22:43,674 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 23:22:43,674 INFO L93 Difference]: Finished difference Result 379 states and 508 transitions. [2019-10-13 23:22:43,675 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-13 23:22:43,675 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 76 [2019-10-13 23:22:43,675 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 23:22:43,677 INFO L225 Difference]: With dead ends: 379 [2019-10-13 23:22:43,677 INFO L226 Difference]: Without dead ends: 213 [2019-10-13 23:22:43,679 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:43,679 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 213 states. [2019-10-13 23:22:43,688 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 213 to 211. [2019-10-13 23:22:43,689 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 211 states. [2019-10-13 23:22:43,690 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 211 states to 211 states and 278 transitions. [2019-10-13 23:22:43,691 INFO L78 Accepts]: Start accepts. Automaton has 211 states and 278 transitions. Word has length 76 [2019-10-13 23:22:43,691 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 23:22:43,691 INFO L462 AbstractCegarLoop]: Abstraction has 211 states and 278 transitions. [2019-10-13 23:22:43,691 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-13 23:22:43,692 INFO L276 IsEmpty]: Start isEmpty. Operand 211 states and 278 transitions. [2019-10-13 23:22:43,692 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2019-10-13 23:22:43,693 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 23:22:43,693 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:43,693 INFO L410 AbstractCegarLoop]: === Iteration 12 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 23:22:43,693 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 23:22:43,694 INFO L82 PathProgramCache]: Analyzing trace with hash 1106817535, now seen corresponding path program 1 times [2019-10-13 23:22:43,694 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-13 23:22:43,694 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1967777065] [2019-10-13 23:22:43,694 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 23:22:43,695 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 23:22:43,695 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 23:22:43,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 23:22:43,756 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:43,757 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1967777065] [2019-10-13 23:22:43,757 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 23:22:43,757 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-13 23:22:43,757 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [472779785] [2019-10-13 23:22:43,758 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-13 23:22:43,758 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-13 23:22:43,758 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-13 23:22:43,758 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-13 23:22:43,758 INFO L87 Difference]: Start difference. First operand 211 states and 278 transitions. Second operand 4 states. [2019-10-13 23:22:43,874 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 23:22:43,874 INFO L93 Difference]: Finished difference Result 368 states and 506 transitions. [2019-10-13 23:22:43,874 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-13 23:22:43,874 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 78 [2019-10-13 23:22:43,875 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 23:22:43,877 INFO L225 Difference]: With dead ends: 368 [2019-10-13 23:22:43,877 INFO L226 Difference]: Without dead ends: 209 [2019-10-13 23:22:43,878 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,878 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 209 states. [2019-10-13 23:22:43,885 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 209 to 209. [2019-10-13 23:22:43,885 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 209 states. [2019-10-13 23:22:43,887 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 209 states to 209 states and 274 transitions. [2019-10-13 23:22:43,888 INFO L78 Accepts]: Start accepts. Automaton has 209 states and 274 transitions. Word has length 78 [2019-10-13 23:22:43,888 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 23:22:43,888 INFO L462 AbstractCegarLoop]: Abstraction has 209 states and 274 transitions. [2019-10-13 23:22:43,888 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-13 23:22:43,889 INFO L276 IsEmpty]: Start isEmpty. Operand 209 states and 274 transitions. [2019-10-13 23:22:43,889 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2019-10-13 23:22:43,890 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 23:22:43,890 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:43,890 INFO L410 AbstractCegarLoop]: === Iteration 13 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 23:22:43,890 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 23:22:43,890 INFO L82 PathProgramCache]: Analyzing trace with hash 1814640674, now seen corresponding path program 1 times [2019-10-13 23:22:43,891 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-13 23:22:43,891 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [397338498] [2019-10-13 23:22:43,891 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 23:22:43,891 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 23:22:43,891 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 23:22:43,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 23:22:43,959 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:43,959 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [397338498] [2019-10-13 23:22:43,959 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1231706763] [2019-10-13 23:22:43,960 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:44,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 23:22:44,124 INFO L256 TraceCheckSpWp]: Trace formula consists of 633 conjuncts, 3 conjunts are in the unsatisfiable core [2019-10-13 23:22:44,135 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-13 23:22:44,196 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:44,197 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-10-13 23:22:44,324 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:44,325 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1949203653] [2019-10-13 23:22:44,367 INFO L162 IcfgInterpreter]: Started Sifa with 58 locations of interest [2019-10-13 23:22:44,368 INFO L169 IcfgInterpreter]: Building call graph [2019-10-13 23:22:44,380 INFO L174 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-10-13 23:22:44,389 INFO L179 IcfgInterpreter]: Starting interpretation [2019-10-13 23:22:44,390 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2019-10-13 23:22:45,139 INFO L199 IcfgInterpreter]: Interpreting procedure main with input of size 169 for LOIs [2019-10-13 23:22:45,439 WARN L191 SmtUtils]: Spent 110.00 ms on a formula simplification that was a NOOP. DAG size: 241 [2019-10-13 23:22:45,980 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-13 23:22:45,981 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:45,989 INFO L168 Benchmark]: Toolchain (without parser) took 6596.52 ms. Allocated memory was 138.4 MB in the beginning and 331.9 MB in the end (delta: 193.5 MB). Free memory was 101.9 MB in the beginning and 298.6 MB in the end (delta: -196.7 MB). Peak memory consumption was 164.5 MB. Max. memory is 7.1 GB. [2019-10-13 23:22:45,990 INFO L168 Benchmark]: CDTParser took 0.22 ms. Allocated memory is still 138.4 MB. Free memory was 120.4 MB in the beginning and 120.2 MB in the end (delta: 209.8 kB). Peak memory consumption was 209.8 kB. Max. memory is 7.1 GB. [2019-10-13 23:22:45,991 INFO L168 Benchmark]: CACSL2BoogieTranslator took 531.50 ms. Allocated memory was 138.4 MB in the beginning and 202.9 MB in the end (delta: 64.5 MB). Free memory was 101.7 MB in the beginning and 177.2 MB in the end (delta: -75.5 MB). Peak memory consumption was 26.5 MB. Max. memory is 7.1 GB. [2019-10-13 23:22:45,994 INFO L168 Benchmark]: Boogie Preprocessor took 59.18 ms. Allocated memory is still 202.9 MB. Free memory was 177.2 MB in the beginning and 173.8 MB in the end (delta: 3.4 MB). Peak memory consumption was 3.4 MB. Max. memory is 7.1 GB. [2019-10-13 23:22:45,994 INFO L168 Benchmark]: RCFGBuilder took 1339.86 ms. Allocated memory was 202.9 MB in the beginning and 235.9 MB in the end (delta: 33.0 MB). Free memory was 173.8 MB in the beginning and 187.9 MB in the end (delta: -14.1 MB). Peak memory consumption was 89.6 MB. Max. memory is 7.1 GB. [2019-10-13 23:22:45,997 INFO L168 Benchmark]: TraceAbstraction took 4662.00 ms. Allocated memory was 235.9 MB in the beginning and 331.9 MB in the end (delta: 95.9 MB). Free memory was 187.9 MB in the beginning and 298.6 MB in the end (delta: -110.7 MB). Peak memory consumption was 153.0 MB. Max. memory is 7.1 GB. [2019-10-13 23:22:46,006 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.22 ms. Allocated memory is still 138.4 MB. Free memory was 120.4 MB in the beginning and 120.2 MB in the end (delta: 209.8 kB). Peak memory consumption was 209.8 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 531.50 ms. Allocated memory was 138.4 MB in the beginning and 202.9 MB in the end (delta: 64.5 MB). Free memory was 101.7 MB in the beginning and 177.2 MB in the end (delta: -75.5 MB). Peak memory consumption was 26.5 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 59.18 ms. Allocated memory is still 202.9 MB. Free memory was 177.2 MB in the beginning and 173.8 MB in the end (delta: 3.4 MB). Peak memory consumption was 3.4 MB. Max. memory is 7.1 GB. * RCFGBuilder took 1339.86 ms. Allocated memory was 202.9 MB in the beginning and 235.9 MB in the end (delta: 33.0 MB). Free memory was 173.8 MB in the beginning and 187.9 MB in the end (delta: -14.1 MB). Peak memory consumption was 89.6 MB. Max. memory is 7.1 GB. * TraceAbstraction took 4662.00 ms. Allocated memory was 235.9 MB in the beginning and 331.9 MB in the end (delta: 95.9 MB). Free memory was 187.9 MB in the beginning and 298.6 MB in the end (delta: -110.7 MB). Peak memory consumption was 153.0 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...