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-36ac518-m [2019-10-07 15:54:35,940 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-10-07 15:54:35,942 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-10-07 15:54:35,961 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-10-07 15:54:35,962 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-10-07 15:54:35,964 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-10-07 15:54:35,966 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-10-07 15:54:35,976 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-10-07 15:54:35,981 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-10-07 15:54:35,983 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-10-07 15:54:35,985 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-10-07 15:54:35,986 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-10-07 15:54:35,986 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-10-07 15:54:35,988 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-10-07 15:54:35,991 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-10-07 15:54:35,992 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-10-07 15:54:35,994 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-10-07 15:54:35,995 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-10-07 15:54:35,997 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-10-07 15:54:36,001 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-10-07 15:54:36,005 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-10-07 15:54:36,008 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-10-07 15:54:36,011 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-10-07 15:54:36,012 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-10-07 15:54:36,014 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-10-07 15:54:36,014 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-10-07 15:54:36,015 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-10-07 15:54:36,016 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-10-07 15:54:36,017 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-10-07 15:54:36,018 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-10-07 15:54:36,018 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-10-07 15:54:36,020 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-10-07 15:54:36,021 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-10-07 15:54:36,022 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-10-07 15:54:36,023 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-10-07 15:54:36,023 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-10-07 15:54:36,024 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-10-07 15:54:36,024 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-10-07 15:54:36,024 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-10-07 15:54:36,025 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-10-07 15:54:36,026 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-10-07 15:54:36,027 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2019-10-07 15:54:36,059 INFO L113 SettingsManager]: Loading preferences was successful [2019-10-07 15:54:36,059 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-10-07 15:54:36,062 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-10-07 15:54:36,062 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-10-07 15:54:36,062 INFO L138 SettingsManager]: * Use SBE=true [2019-10-07 15:54:36,063 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-10-07 15:54:36,063 INFO L138 SettingsManager]: * sizeof long=4 [2019-10-07 15:54:36,063 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-10-07 15:54:36,064 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-10-07 15:54:36,064 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-10-07 15:54:36,064 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-10-07 15:54:36,064 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-10-07 15:54:36,064 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-10-07 15:54:36,065 INFO L138 SettingsManager]: * sizeof long double=12 [2019-10-07 15:54:36,065 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-10-07 15:54:36,065 INFO L138 SettingsManager]: * Use constant arrays=true [2019-10-07 15:54:36,065 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-10-07 15:54:36,065 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-10-07 15:54:36,066 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-10-07 15:54:36,066 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-10-07 15:54:36,066 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-10-07 15:54:36,067 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-07 15:54:36,067 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-10-07 15:54:36,068 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-10-07 15:54:36,068 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-10-07 15:54:36,068 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-10-07 15:54:36,068 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-10-07 15:54:36,068 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-10-07 15:54:36,069 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Trace refinement strategy -> SIFA_TAIPAN Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.sifa: Abstract Domain -> CompoundDomain Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder: Size of a code block -> LoopFreeBlock Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.sifa: Call Summarizer -> TopInputCallSummarizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.sifa: Fluid -> SizeLimitFluid Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.sifa: Simplification Technique -> SIMPLIFY_QUICK [2019-10-07 15:54:36,350 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-10-07 15:54:36,363 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-10-07 15:54:36,366 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-10-07 15:54:36,368 INFO L271 PluginConnector]: Initializing CDTParser... [2019-10-07 15:54:36,368 INFO L275 PluginConnector]: CDTParser initialized [2019-10-07 15:54:36,369 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-07 15:54:36,447 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b5076ba12/375dcf4f71ca4002ad5a31497fe3699c/FLAG31b2ff7f6 [2019-10-07 15:54:36,963 INFO L306 CDTParser]: Found 1 translation units. [2019-10-07 15:54:36,963 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/seq-mthreaded/pals_STARTPALS_Triplicated.1.ufo.BOUNDED-10.pals.c [2019-10-07 15:54:36,973 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b5076ba12/375dcf4f71ca4002ad5a31497fe3699c/FLAG31b2ff7f6 [2019-10-07 15:54:37,332 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b5076ba12/375dcf4f71ca4002ad5a31497fe3699c [2019-10-07 15:54:37,342 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-10-07 15:54:37,344 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-10-07 15:54:37,345 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-10-07 15:54:37,345 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-10-07 15:54:37,350 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-10-07 15:54:37,351 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.10 03:54:37" (1/1) ... [2019-10-07 15:54:37,354 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@247f10a8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.10 03:54:37, skipping insertion in model container [2019-10-07 15:54:37,354 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.10 03:54:37" (1/1) ... [2019-10-07 15:54:37,362 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-10-07 15:54:37,405 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-10-07 15:54:37,760 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-07 15:54:37,770 INFO L188 MainTranslator]: Completed pre-run [2019-10-07 15:54:37,831 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-07 15:54:37,856 INFO L192 MainTranslator]: Completed translation [2019-10-07 15:54:37,856 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.10 03:54:37 WrapperNode [2019-10-07 15:54:37,856 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-10-07 15:54:37,857 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-10-07 15:54:37,857 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-10-07 15:54:37,857 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-10-07 15:54:37,871 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.10 03:54:37" (1/1) ... [2019-10-07 15:54:37,872 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.10 03:54:37" (1/1) ... [2019-10-07 15:54:37,887 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.10 03:54:37" (1/1) ... [2019-10-07 15:54:37,888 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.10 03:54:37" (1/1) ... [2019-10-07 15:54:37,904 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.10 03:54:37" (1/1) ... [2019-10-07 15:54:37,917 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.10 03:54:37" (1/1) ... [2019-10-07 15:54:37,921 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.10 03:54:37" (1/1) ... [2019-10-07 15:54:37,927 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-10-07 15:54:37,927 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-10-07 15:54:37,927 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-10-07 15:54:37,927 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-10-07 15:54:37,928 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.10 03:54:37" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-07 15:54:37,983 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-10-07 15:54:37,983 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-10-07 15:54:37,983 INFO L138 BoogieDeclarations]: Found implementation of procedure add_history_type [2019-10-07 15:54:37,983 INFO L138 BoogieDeclarations]: Found implementation of procedure read_history_int8 [2019-10-07 15:54:37,984 INFO L138 BoogieDeclarations]: Found implementation of procedure read_history_bool [2019-10-07 15:54:37,984 INFO L138 BoogieDeclarations]: Found implementation of procedure write_history_int8 [2019-10-07 15:54:37,984 INFO L138 BoogieDeclarations]: Found implementation of procedure write_history_bool [2019-10-07 15:54:37,984 INFO L138 BoogieDeclarations]: Found implementation of procedure init [2019-10-07 15:54:37,984 INFO L138 BoogieDeclarations]: Found implementation of procedure check [2019-10-07 15:54:37,985 INFO L138 BoogieDeclarations]: Found implementation of procedure gate1_each_pals_period [2019-10-07 15:54:37,985 INFO L138 BoogieDeclarations]: Found implementation of procedure gate2_each_pals_period [2019-10-07 15:54:37,985 INFO L138 BoogieDeclarations]: Found implementation of procedure gate3_each_pals_period [2019-10-07 15:54:37,985 INFO L138 BoogieDeclarations]: Found implementation of procedure voter [2019-10-07 15:54:37,985 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-10-07 15:54:37,985 INFO L138 BoogieDeclarations]: Found implementation of procedure assert [2019-10-07 15:54:37,986 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-10-07 15:54:37,986 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_char [2019-10-07 15:54:37,986 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_bool [2019-10-07 15:54:37,986 INFO L130 BoogieDeclarations]: Found specification of procedure read [2019-10-07 15:54:37,986 INFO L130 BoogieDeclarations]: Found specification of procedure write [2019-10-07 15:54:37,986 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assume [2019-10-07 15:54:37,987 INFO L130 BoogieDeclarations]: Found specification of procedure assert [2019-10-07 15:54:37,987 INFO L130 BoogieDeclarations]: Found specification of procedure read_history_bool [2019-10-07 15:54:37,987 INFO L130 BoogieDeclarations]: Found specification of procedure read_history_int8 [2019-10-07 15:54:37,987 INFO L130 BoogieDeclarations]: Found specification of procedure add_history_type [2019-10-07 15:54:37,987 INFO L130 BoogieDeclarations]: Found specification of procedure write_history_int8 [2019-10-07 15:54:37,987 INFO L130 BoogieDeclarations]: Found specification of procedure write_history_bool [2019-10-07 15:54:37,988 INFO L130 BoogieDeclarations]: Found specification of procedure init [2019-10-07 15:54:37,988 INFO L130 BoogieDeclarations]: Found specification of procedure check [2019-10-07 15:54:37,988 INFO L130 BoogieDeclarations]: Found specification of procedure gate1_each_pals_period [2019-10-07 15:54:37,988 INFO L130 BoogieDeclarations]: Found specification of procedure gate2_each_pals_period [2019-10-07 15:54:37,988 INFO L130 BoogieDeclarations]: Found specification of procedure gate3_each_pals_period [2019-10-07 15:54:37,988 INFO L130 BoogieDeclarations]: Found specification of procedure voter [2019-10-07 15:54:37,989 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-10-07 15:54:37,989 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-10-07 15:54:37,989 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-10-07 15:54:39,188 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-10-07 15:54:39,189 INFO L284 CfgBuilder]: Removed 2 assume(true) statements. [2019-10-07 15:54:39,190 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.10 03:54:39 BoogieIcfgContainer [2019-10-07 15:54:39,190 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-10-07 15:54:39,191 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-10-07 15:54:39,192 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-10-07 15:54:39,195 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-10-07 15:54:39,195 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.10 03:54:37" (1/3) ... [2019-10-07 15:54:39,196 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7c125938 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.10 03:54:39, skipping insertion in model container [2019-10-07 15:54:39,196 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.10 03:54:37" (2/3) ... [2019-10-07 15:54:39,197 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7c125938 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.10 03:54:39, skipping insertion in model container [2019-10-07 15:54:39,197 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.10 03:54:39" (3/3) ... [2019-10-07 15:54:39,199 INFO L109 eAbstractionObserver]: Analyzing ICFG pals_STARTPALS_Triplicated.1.ufo.BOUNDED-10.pals.c [2019-10-07 15:54:39,209 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-10-07 15:54:39,217 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-10-07 15:54:39,229 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-10-07 15:54:39,261 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-10-07 15:54:39,261 INFO L374 AbstractCegarLoop]: Hoare is true [2019-10-07 15:54:39,261 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-10-07 15:54:39,262 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-10-07 15:54:39,262 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-10-07 15:54:39,262 INFO L378 AbstractCegarLoop]: Difference is false [2019-10-07 15:54:39,262 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-10-07 15:54:39,263 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-10-07 15:54:39,291 INFO L276 IsEmpty]: Start isEmpty. Operand 161 states. [2019-10-07 15:54:39,300 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-10-07 15:54:39,300 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 15:54:39,301 INFO L385 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-07 15:54:39,304 INFO L410 AbstractCegarLoop]: === Iteration 1 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 15:54:39,310 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 15:54:39,310 INFO L82 PathProgramCache]: Analyzing trace with hash 758147934, now seen corresponding path program 1 times [2019-10-07 15:54:39,321 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 15:54:39,322 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 15:54:39,322 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 15:54:39,323 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 15:54:39,323 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 15:54:39,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 15:54:39,660 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-07 15:54:39,660 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 15:54:39,661 INFO L211 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-07 15:54:39,663 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-07 15:54:39,667 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-07 15:54:39,681 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-07 15:54:39,681 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-07 15:54:39,684 INFO L87 Difference]: Start difference. First operand 161 states. Second operand 4 states. [2019-10-07 15:54:39,833 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-07 15:54:39,833 INFO L93 Difference]: Finished difference Result 320 states and 504 transitions. [2019-10-07 15:54:39,837 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-07 15:54:39,839 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 20 [2019-10-07 15:54:39,839 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-07 15:54:39,863 INFO L225 Difference]: With dead ends: 320 [2019-10-07 15:54:39,863 INFO L226 Difference]: Without dead ends: 164 [2019-10-07 15:54:39,874 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-10-07 15:54:39,892 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 164 states. [2019-10-07 15:54:39,933 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 164 to 162. [2019-10-07 15:54:39,935 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 162 states. [2019-10-07 15:54:39,938 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 162 states to 162 states and 231 transitions. [2019-10-07 15:54:39,940 INFO L78 Accepts]: Start accepts. Automaton has 162 states and 231 transitions. Word has length 20 [2019-10-07 15:54:39,941 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-07 15:54:39,941 INFO L462 AbstractCegarLoop]: Abstraction has 162 states and 231 transitions. [2019-10-07 15:54:39,941 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-07 15:54:39,941 INFO L276 IsEmpty]: Start isEmpty. Operand 162 states and 231 transitions. [2019-10-07 15:54:39,943 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-10-07 15:54:39,943 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 15:54:39,944 INFO L385 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-07 15:54:39,944 INFO L410 AbstractCegarLoop]: === Iteration 2 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 15:54:39,944 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 15:54:39,944 INFO L82 PathProgramCache]: Analyzing trace with hash 658096871, now seen corresponding path program 1 times [2019-10-07 15:54:39,945 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 15:54:39,945 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 15:54:39,948 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 15:54:39,949 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 15:54:39,949 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 15:54:39,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 15:54:40,073 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-07 15:54:40,073 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 15:54:40,074 INFO L211 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-07 15:54:40,074 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-07 15:54:40,076 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-07 15:54:40,076 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-07 15:54:40,076 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-07 15:54:40,076 INFO L87 Difference]: Start difference. First operand 162 states and 231 transitions. Second operand 4 states. [2019-10-07 15:54:40,146 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-07 15:54:40,147 INFO L93 Difference]: Finished difference Result 330 states and 478 transitions. [2019-10-07 15:54:40,147 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-07 15:54:40,147 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 21 [2019-10-07 15:54:40,148 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-07 15:54:40,150 INFO L225 Difference]: With dead ends: 330 [2019-10-07 15:54:40,151 INFO L226 Difference]: Without dead ends: 176 [2019-10-07 15:54:40,152 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-10-07 15:54:40,153 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 176 states. [2019-10-07 15:54:40,171 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 176 to 174. [2019-10-07 15:54:40,171 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 174 states. [2019-10-07 15:54:40,173 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 174 states to 174 states and 246 transitions. [2019-10-07 15:54:40,174 INFO L78 Accepts]: Start accepts. Automaton has 174 states and 246 transitions. Word has length 21 [2019-10-07 15:54:40,174 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-07 15:54:40,174 INFO L462 AbstractCegarLoop]: Abstraction has 174 states and 246 transitions. [2019-10-07 15:54:40,174 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-07 15:54:40,175 INFO L276 IsEmpty]: Start isEmpty. Operand 174 states and 246 transitions. [2019-10-07 15:54:40,176 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-10-07 15:54:40,176 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 15:54:40,177 INFO L385 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-07 15:54:40,177 INFO L410 AbstractCegarLoop]: === Iteration 3 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 15:54:40,177 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 15:54:40,177 INFO L82 PathProgramCache]: Analyzing trace with hash -1614839382, now seen corresponding path program 1 times [2019-10-07 15:54:40,178 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 15:54:40,178 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 15:54:40,178 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 15:54:40,178 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 15:54:40,178 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 15:54:40,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 15:54:40,238 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-07 15:54:40,239 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 15:54:40,239 INFO L211 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-07 15:54:40,239 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-07 15:54:40,240 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-07 15:54:40,240 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-07 15:54:40,240 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-07 15:54:40,240 INFO L87 Difference]: Start difference. First operand 174 states and 246 transitions. Second operand 3 states. [2019-10-07 15:54:40,269 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-07 15:54:40,269 INFO L93 Difference]: Finished difference Result 362 states and 524 transitions. [2019-10-07 15:54:40,270 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-07 15:54:40,270 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 28 [2019-10-07 15:54:40,270 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-07 15:54:40,274 INFO L225 Difference]: With dead ends: 362 [2019-10-07 15:54:40,274 INFO L226 Difference]: Without dead ends: 203 [2019-10-07 15:54:40,275 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-07 15:54:40,276 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 203 states. [2019-10-07 15:54:40,301 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 203 to 176. [2019-10-07 15:54:40,301 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 176 states. [2019-10-07 15:54:40,303 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 176 states to 176 states and 248 transitions. [2019-10-07 15:54:40,304 INFO L78 Accepts]: Start accepts. Automaton has 176 states and 248 transitions. Word has length 28 [2019-10-07 15:54:40,304 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-07 15:54:40,304 INFO L462 AbstractCegarLoop]: Abstraction has 176 states and 248 transitions. [2019-10-07 15:54:40,304 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-07 15:54:40,304 INFO L276 IsEmpty]: Start isEmpty. Operand 176 states and 248 transitions. [2019-10-07 15:54:40,306 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2019-10-07 15:54:40,306 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 15:54:40,306 INFO L385 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-07 15:54:40,307 INFO L410 AbstractCegarLoop]: === Iteration 4 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 15:54:40,307 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 15:54:40,307 INFO L82 PathProgramCache]: Analyzing trace with hash -1162341358, now seen corresponding path program 1 times [2019-10-07 15:54:40,307 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 15:54:40,308 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 15:54:40,308 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 15:54:40,308 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 15:54:40,308 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 15:54:40,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 15:54:40,394 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-07 15:54:40,395 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 15:54:40,395 INFO L211 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-07 15:54:40,396 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-07 15:54:40,397 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-07 15:54:40,397 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-07 15:54:40,398 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-07 15:54:40,398 INFO L87 Difference]: Start difference. First operand 176 states and 248 transitions. Second operand 5 states. [2019-10-07 15:54:40,454 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-07 15:54:40,454 INFO L93 Difference]: Finished difference Result 340 states and 483 transitions. [2019-10-07 15:54:40,456 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-07 15:54:40,456 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 36 [2019-10-07 15:54:40,457 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-07 15:54:40,462 INFO L225 Difference]: With dead ends: 340 [2019-10-07 15:54:40,462 INFO L226 Difference]: Without dead ends: 184 [2019-10-07 15:54:40,464 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-07 15:54:40,465 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 184 states. [2019-10-07 15:54:40,489 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 184 to 180. [2019-10-07 15:54:40,489 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 180 states. [2019-10-07 15:54:40,491 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 180 states to 180 states and 252 transitions. [2019-10-07 15:54:40,492 INFO L78 Accepts]: Start accepts. Automaton has 180 states and 252 transitions. Word has length 36 [2019-10-07 15:54:40,492 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-07 15:54:40,492 INFO L462 AbstractCegarLoop]: Abstraction has 180 states and 252 transitions. [2019-10-07 15:54:40,492 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-07 15:54:40,492 INFO L276 IsEmpty]: Start isEmpty. Operand 180 states and 252 transitions. [2019-10-07 15:54:40,494 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2019-10-07 15:54:40,494 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 15:54:40,494 INFO L385 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-07 15:54:40,495 INFO L410 AbstractCegarLoop]: === Iteration 5 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 15:54:40,495 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 15:54:40,495 INFO L82 PathProgramCache]: Analyzing trace with hash 985709149, now seen corresponding path program 1 times [2019-10-07 15:54:40,496 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 15:54:40,496 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 15:54:40,496 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 15:54:40,496 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 15:54:40,496 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 15:54:40,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 15:54:40,592 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-07 15:54:40,593 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 15:54:40,593 INFO L211 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-07 15:54:40,593 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-07 15:54:40,594 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-07 15:54:40,594 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-07 15:54:40,595 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-07 15:54:40,596 INFO L87 Difference]: Start difference. First operand 180 states and 252 transitions. Second operand 4 states. [2019-10-07 15:54:40,632 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-07 15:54:40,633 INFO L93 Difference]: Finished difference Result 303 states and 425 transitions. [2019-10-07 15:54:40,637 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-07 15:54:40,638 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 37 [2019-10-07 15:54:40,638 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-07 15:54:40,641 INFO L225 Difference]: With dead ends: 303 [2019-10-07 15:54:40,641 INFO L226 Difference]: Without dead ends: 176 [2019-10-07 15:54:40,643 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-07 15:54:40,644 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 176 states. [2019-10-07 15:54:40,662 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 176 to 176. [2019-10-07 15:54:40,662 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 176 states. [2019-10-07 15:54:40,691 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 176 states to 176 states and 244 transitions. [2019-10-07 15:54:40,691 INFO L78 Accepts]: Start accepts. Automaton has 176 states and 244 transitions. Word has length 37 [2019-10-07 15:54:40,692 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-07 15:54:40,692 INFO L462 AbstractCegarLoop]: Abstraction has 176 states and 244 transitions. [2019-10-07 15:54:40,692 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-07 15:54:40,692 INFO L276 IsEmpty]: Start isEmpty. Operand 176 states and 244 transitions. [2019-10-07 15:54:40,699 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2019-10-07 15:54:40,700 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 15:54:40,700 INFO L385 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-07 15:54:40,700 INFO L410 AbstractCegarLoop]: === Iteration 6 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 15:54:40,703 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 15:54:40,703 INFO L82 PathProgramCache]: Analyzing trace with hash -562127975, now seen corresponding path program 1 times [2019-10-07 15:54:40,703 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 15:54:40,704 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 15:54:40,704 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 15:54:40,704 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 15:54:40,704 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 15:54:40,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 15:54:40,772 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-10-07 15:54:40,772 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 15:54:40,772 INFO L211 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-07 15:54:40,772 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-07 15:54:40,773 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-07 15:54:40,773 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-07 15:54:40,774 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-07 15:54:40,774 INFO L87 Difference]: Start difference. First operand 176 states and 244 transitions. Second operand 4 states. [2019-10-07 15:54:40,835 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-07 15:54:40,835 INFO L93 Difference]: Finished difference Result 348 states and 492 transitions. [2019-10-07 15:54:40,836 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-07 15:54:40,836 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 38 [2019-10-07 15:54:40,836 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-07 15:54:40,838 INFO L225 Difference]: With dead ends: 348 [2019-10-07 15:54:40,838 INFO L226 Difference]: Without dead ends: 193 [2019-10-07 15:54:40,839 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-10-07 15:54:40,840 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 193 states. [2019-10-07 15:54:40,848 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 193 to 191. [2019-10-07 15:54:40,849 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 191 states. [2019-10-07 15:54:40,850 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 191 states to 191 states and 262 transitions. [2019-10-07 15:54:40,851 INFO L78 Accepts]: Start accepts. Automaton has 191 states and 262 transitions. Word has length 38 [2019-10-07 15:54:40,851 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-07 15:54:40,851 INFO L462 AbstractCegarLoop]: Abstraction has 191 states and 262 transitions. [2019-10-07 15:54:40,852 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-07 15:54:40,852 INFO L276 IsEmpty]: Start isEmpty. Operand 191 states and 262 transitions. [2019-10-07 15:54:40,852 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2019-10-07 15:54:40,853 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 15:54:40,853 INFO L385 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-07 15:54:40,853 INFO L410 AbstractCegarLoop]: === Iteration 7 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 15:54:40,853 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 15:54:40,853 INFO L82 PathProgramCache]: Analyzing trace with hash -2048456470, now seen corresponding path program 1 times [2019-10-07 15:54:40,854 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 15:54:40,854 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 15:54:40,854 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 15:54:40,854 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 15:54:40,854 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 15:54:40,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 15:54:40,898 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2019-10-07 15:54:40,899 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 15:54:40,899 INFO L211 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-07 15:54:40,899 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-07 15:54:40,900 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-07 15:54:40,900 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-07 15:54:40,900 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-07 15:54:40,900 INFO L87 Difference]: Start difference. First operand 191 states and 262 transitions. Second operand 4 states. [2019-10-07 15:54:40,960 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-07 15:54:40,961 INFO L93 Difference]: Finished difference Result 366 states and 516 transitions. [2019-10-07 15:54:40,961 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-07 15:54:40,961 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 38 [2019-10-07 15:54:40,962 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-07 15:54:40,964 INFO L225 Difference]: With dead ends: 366 [2019-10-07 15:54:40,964 INFO L226 Difference]: Without dead ends: 198 [2019-10-07 15:54:40,965 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-10-07 15:54:40,966 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 198 states. [2019-10-07 15:54:40,974 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 198 to 196. [2019-10-07 15:54:40,974 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 196 states. [2019-10-07 15:54:40,976 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 196 states to 196 states and 266 transitions. [2019-10-07 15:54:40,977 INFO L78 Accepts]: Start accepts. Automaton has 196 states and 266 transitions. Word has length 38 [2019-10-07 15:54:40,977 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-07 15:54:40,977 INFO L462 AbstractCegarLoop]: Abstraction has 196 states and 266 transitions. [2019-10-07 15:54:40,978 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-07 15:54:40,978 INFO L276 IsEmpty]: Start isEmpty. Operand 196 states and 266 transitions. [2019-10-07 15:54:40,979 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-10-07 15:54:40,979 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 15:54:40,979 INFO L385 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-07 15:54:40,979 INFO L410 AbstractCegarLoop]: === Iteration 8 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 15:54:40,979 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 15:54:40,980 INFO L82 PathProgramCache]: Analyzing trace with hash -905435297, now seen corresponding path program 1 times [2019-10-07 15:54:40,980 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 15:54:40,980 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 15:54:40,980 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 15:54:40,980 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 15:54:40,981 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 15:54:40,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 15:54:41,036 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2019-10-07 15:54:41,037 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 15:54:41,037 INFO L211 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-07 15:54:41,037 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-07 15:54:41,038 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-07 15:54:41,038 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-07 15:54:41,038 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-07 15:54:41,038 INFO L87 Difference]: Start difference. First operand 196 states and 266 transitions. Second operand 5 states. [2019-10-07 15:54:41,061 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-07 15:54:41,062 INFO L93 Difference]: Finished difference Result 364 states and 500 transitions. [2019-10-07 15:54:41,062 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-07 15:54:41,062 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 55 [2019-10-07 15:54:41,063 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-07 15:54:41,065 INFO L225 Difference]: With dead ends: 364 [2019-10-07 15:54:41,065 INFO L226 Difference]: Without dead ends: 198 [2019-10-07 15:54:41,066 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-07 15:54:41,066 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 198 states. [2019-10-07 15:54:41,074 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 198 to 196. [2019-10-07 15:54:41,074 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 196 states. [2019-10-07 15:54:41,076 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 196 states to 196 states and 265 transitions. [2019-10-07 15:54:41,077 INFO L78 Accepts]: Start accepts. Automaton has 196 states and 265 transitions. Word has length 55 [2019-10-07 15:54:41,077 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-07 15:54:41,077 INFO L462 AbstractCegarLoop]: Abstraction has 196 states and 265 transitions. [2019-10-07 15:54:41,077 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-07 15:54:41,077 INFO L276 IsEmpty]: Start isEmpty. Operand 196 states and 265 transitions. [2019-10-07 15:54:41,078 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2019-10-07 15:54:41,078 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 15:54:41,078 INFO L385 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-07 15:54:41,079 INFO L410 AbstractCegarLoop]: === Iteration 9 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 15:54:41,079 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 15:54:41,079 INFO L82 PathProgramCache]: Analyzing trace with hash 1171722150, now seen corresponding path program 1 times [2019-10-07 15:54:41,079 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 15:54:41,080 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 15:54:41,080 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 15:54:41,080 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 15:54:41,080 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 15:54:41,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 15:54:41,148 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2019-10-07 15:54:41,148 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 15:54:41,149 INFO L211 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-07 15:54:41,149 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-07 15:54:41,149 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-07 15:54:41,150 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-07 15:54:41,151 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-07 15:54:41,151 INFO L87 Difference]: Start difference. First operand 196 states and 265 transitions. Second operand 4 states. [2019-10-07 15:54:41,202 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-07 15:54:41,202 INFO L93 Difference]: Finished difference Result 376 states and 520 transitions. [2019-10-07 15:54:41,202 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-07 15:54:41,203 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 57 [2019-10-07 15:54:41,204 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-07 15:54:41,207 INFO L225 Difference]: With dead ends: 376 [2019-10-07 15:54:41,207 INFO L226 Difference]: Without dead ends: 215 [2019-10-07 15:54:41,208 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-10-07 15:54:41,209 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 215 states. [2019-10-07 15:54:41,220 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 215 to 213. [2019-10-07 15:54:41,220 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 213 states. [2019-10-07 15:54:41,222 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 213 states to 213 states and 285 transitions. [2019-10-07 15:54:41,223 INFO L78 Accepts]: Start accepts. Automaton has 213 states and 285 transitions. Word has length 57 [2019-10-07 15:54:41,225 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-07 15:54:41,226 INFO L462 AbstractCegarLoop]: Abstraction has 213 states and 285 transitions. [2019-10-07 15:54:41,226 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-07 15:54:41,226 INFO L276 IsEmpty]: Start isEmpty. Operand 213 states and 285 transitions. [2019-10-07 15:54:41,228 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2019-10-07 15:54:41,228 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 15:54:41,228 INFO L385 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-07 15:54:41,228 INFO L410 AbstractCegarLoop]: === Iteration 10 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 15:54:41,229 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 15:54:41,229 INFO L82 PathProgramCache]: Analyzing trace with hash -812439080, now seen corresponding path program 1 times [2019-10-07 15:54:41,232 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 15:54:41,232 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 15:54:41,232 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 15:54:41,233 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 15:54:41,233 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 15:54:41,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 15:54:41,310 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2019-10-07 15:54:41,311 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 15:54:41,311 INFO L211 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-07 15:54:41,311 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-07 15:54:41,312 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-07 15:54:41,312 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-07 15:54:41,312 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-07 15:54:41,312 INFO L87 Difference]: Start difference. First operand 213 states and 285 transitions. Second operand 4 states. [2019-10-07 15:54:41,363 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-07 15:54:41,363 INFO L93 Difference]: Finished difference Result 387 states and 532 transitions. [2019-10-07 15:54:41,363 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-07 15:54:41,364 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 58 [2019-10-07 15:54:41,364 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-07 15:54:41,366 INFO L225 Difference]: With dead ends: 387 [2019-10-07 15:54:41,367 INFO L226 Difference]: Without dead ends: 211 [2019-10-07 15:54:41,368 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-10-07 15:54:41,369 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 211 states. [2019-10-07 15:54:41,382 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 211 to 211. [2019-10-07 15:54:41,382 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 211 states. [2019-10-07 15:54:41,385 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 211 states to 211 states and 279 transitions. [2019-10-07 15:54:41,385 INFO L78 Accepts]: Start accepts. Automaton has 211 states and 279 transitions. Word has length 58 [2019-10-07 15:54:41,385 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-07 15:54:41,386 INFO L462 AbstractCegarLoop]: Abstraction has 211 states and 279 transitions. [2019-10-07 15:54:41,386 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-07 15:54:41,386 INFO L276 IsEmpty]: Start isEmpty. Operand 211 states and 279 transitions. [2019-10-07 15:54:41,387 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2019-10-07 15:54:41,387 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 15:54:41,387 INFO L385 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-07 15:54:41,387 INFO L410 AbstractCegarLoop]: === Iteration 11 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 15:54:41,388 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 15:54:41,388 INFO L82 PathProgramCache]: Analyzing trace with hash 1928367096, now seen corresponding path program 1 times [2019-10-07 15:54:41,388 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 15:54:41,388 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 15:54:41,388 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 15:54:41,388 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 15:54:41,389 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 15:54:41,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 15:54:41,479 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2019-10-07 15:54:41,479 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 15:54:41,479 INFO L211 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-07 15:54:41,479 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-07 15:54:41,480 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-07 15:54:41,481 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-07 15:54:41,481 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-07 15:54:41,481 INFO L87 Difference]: Start difference. First operand 211 states and 279 transitions. Second operand 5 states. [2019-10-07 15:54:41,502 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-07 15:54:41,503 INFO L93 Difference]: Finished difference Result 379 states and 508 transitions. [2019-10-07 15:54:41,503 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-07 15:54:41,503 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 76 [2019-10-07 15:54:41,504 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-07 15:54:41,505 INFO L225 Difference]: With dead ends: 379 [2019-10-07 15:54:41,505 INFO L226 Difference]: Without dead ends: 213 [2019-10-07 15:54:41,507 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-07 15:54:41,507 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 213 states. [2019-10-07 15:54:41,514 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 213 to 211. [2019-10-07 15:54:41,514 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 211 states. [2019-10-07 15:54:41,516 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 211 states to 211 states and 278 transitions. [2019-10-07 15:54:41,516 INFO L78 Accepts]: Start accepts. Automaton has 211 states and 278 transitions. Word has length 76 [2019-10-07 15:54:41,517 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-07 15:54:41,517 INFO L462 AbstractCegarLoop]: Abstraction has 211 states and 278 transitions. [2019-10-07 15:54:41,517 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-07 15:54:41,517 INFO L276 IsEmpty]: Start isEmpty. Operand 211 states and 278 transitions. [2019-10-07 15:54:41,518 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2019-10-07 15:54:41,518 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 15:54:41,518 INFO L385 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-07 15:54:41,518 INFO L410 AbstractCegarLoop]: === Iteration 12 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 15:54:41,518 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 15:54:41,519 INFO L82 PathProgramCache]: Analyzing trace with hash 1106817535, now seen corresponding path program 1 times [2019-10-07 15:54:41,519 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 15:54:41,519 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 15:54:41,519 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 15:54:41,519 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 15:54:41,519 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 15:54:41,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 15:54:41,567 INFO L134 CoverageAnalysis]: Checked inductivity of 59 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 59 trivial. 0 not checked. [2019-10-07 15:54:41,568 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 15:54:41,568 INFO L211 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-07 15:54:41,568 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-07 15:54:41,569 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-07 15:54:41,569 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-07 15:54:41,569 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-07 15:54:41,569 INFO L87 Difference]: Start difference. First operand 211 states and 278 transitions. Second operand 4 states. [2019-10-07 15:54:41,625 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-07 15:54:41,625 INFO L93 Difference]: Finished difference Result 368 states and 506 transitions. [2019-10-07 15:54:41,625 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-07 15:54:41,626 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 78 [2019-10-07 15:54:41,626 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-07 15:54:41,628 INFO L225 Difference]: With dead ends: 368 [2019-10-07 15:54:41,628 INFO L226 Difference]: Without dead ends: 209 [2019-10-07 15:54:41,629 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-10-07 15:54:41,630 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 209 states. [2019-10-07 15:54:41,636 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 209 to 209. [2019-10-07 15:54:41,636 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 209 states. [2019-10-07 15:54:41,637 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 209 states to 209 states and 274 transitions. [2019-10-07 15:54:41,638 INFO L78 Accepts]: Start accepts. Automaton has 209 states and 274 transitions. Word has length 78 [2019-10-07 15:54:41,638 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-07 15:54:41,638 INFO L462 AbstractCegarLoop]: Abstraction has 209 states and 274 transitions. [2019-10-07 15:54:41,638 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-07 15:54:41,639 INFO L276 IsEmpty]: Start isEmpty. Operand 209 states and 274 transitions. [2019-10-07 15:54:41,639 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2019-10-07 15:54:41,640 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 15:54:41,640 INFO L385 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-07 15:54:41,640 INFO L410 AbstractCegarLoop]: === Iteration 13 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 15:54:41,640 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 15:54:41,640 INFO L82 PathProgramCache]: Analyzing trace with hash 1814640674, now seen corresponding path program 1 times [2019-10-07 15:54:41,641 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 15:54:41,641 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 15:54:41,641 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 15:54:41,641 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 15:54:41,641 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 15:54:41,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 15:54:41,691 INFO L134 CoverageAnalysis]: Checked inductivity of 75 backedges. 27 proven. 1 refuted. 0 times theorem prover too weak. 47 trivial. 0 not checked. [2019-10-07 15:54:41,692 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 15:54:41,692 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2019-10-07 15:54:41,692 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-07 15:54:41,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 15:54:41,837 INFO L256 TraceCheckSpWp]: Trace formula consists of 633 conjuncts, 3 conjunts are in the unsatisfiable core [2019-10-07 15:54:41,847 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-07 15:54:41,891 INFO L134 CoverageAnalysis]: Checked inductivity of 75 backedges. 29 proven. 1 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2019-10-07 15:54:41,892 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-10-07 15:54:42,014 INFO L134 CoverageAnalysis]: Checked inductivity of 75 backedges. 0 proven. 25 refuted. 0 times theorem prover too weak. 50 trivial. 0 not checked. [2019-10-07 15:54:42,014 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [2019-10-07 15:54:42,047 INFO L162 IcfgInterpreter]: Started Sifa with 58 locations of interest [2019-10-07 15:54:42,048 INFO L169 IcfgInterpreter]: Building call graph [2019-10-07 15:54:42,053 INFO L174 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-10-07 15:54:42,059 INFO L179 IcfgInterpreter]: Starting interpretation [2019-10-07 15:54:42,060 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2019-10-07 15:54:42,744 WARN L191 SmtUtils]: Spent 105.00 ms on a formula simplification that was a NOOP. DAG size: 145 [2019-10-07 15:54:42,758 INFO L199 IcfgInterpreter]: Interpreting procedure main with input of size 169 for LOIs [2019-10-07 15:54:43,082 WARN L191 SmtUtils]: Spent 139.00 ms on a formula simplification that was a NOOP. DAG size: 241 [2019-10-07 15:54:43,633 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-07 15:54:43,634 FATAL L? ?]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction has thrown an exception: java.lang.AssertionError: java.lang.IllegalArgumentException: Tried to insert element unknown in custom order: ε at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.tryExecuteInterpolantGenerator(TraceAbstractionRefinementEngine.java:295) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.generateProof(TraceAbstractionRefinementEngine.java:177) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.executeStrategy(TraceAbstractionRefinementEngine.java:167) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:90) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.RefinementEngineFactory.runRefinementEngine(RefinementEngineFactory.java:133) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:436) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterateInternal(AbstractCegarLoop.java:419) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:368) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.iterate(TraceAbstractionStarter.java:332) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:170) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:122) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:120) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:316) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:55) Caused by: java.lang.IllegalArgumentException: Tried to insert element unknown in custom order: ε at de.uni_freiburg.informatik.ultimate.lib.sifa.PriorityWorklist.add(PriorityWorklist.java:97) at de.uni_freiburg.informatik.ultimate.lib.sifa.DagInterpreter.lambda$2(DagInterpreter.java:135) at java.lang.Iterable.forEach(Iterable.java:75) at java.util.Collections$UnmodifiableCollection.forEach(Collections.java:1080) at de.uni_freiburg.informatik.ultimate.lib.sifa.DagInterpreter.interpret(DagInterpreter.java:135) at de.uni_freiburg.informatik.ultimate.lib.sifa.DagInterpreter.interpret(DagInterpreter.java:104) at de.uni_freiburg.informatik.ultimate.lib.sifa.summarizers.TopInputCallSummarizer.computeTopSummary(TopInputCallSummarizer.java:78) at java.util.HashMap.computeIfAbsent(HashMap.java:1127) at de.uni_freiburg.informatik.ultimate.lib.sifa.summarizers.TopInputCallSummarizer.summarize(TopInputCallSummarizer.java:67) at de.uni_freiburg.informatik.ultimate.lib.sifa.DagInterpreter.ipretCallReturnSummary(DagInterpreter.java:230) at de.uni_freiburg.informatik.ultimate.lib.sifa.DagInterpreter.ipretTransAndStoreLoiPred(DagInterpreter.java:214) at de.uni_freiburg.informatik.ultimate.lib.sifa.DagInterpreter.ipretTrans(DagInterpreter.java:197) at de.uni_freiburg.informatik.ultimate.lib.sifa.DagInterpreter.ipretNode(DagInterpreter.java:166) at de.uni_freiburg.informatik.ultimate.lib.sifa.DagInterpreter.interpret(DagInterpreter.java:130) at de.uni_freiburg.informatik.ultimate.lib.sifa.DagInterpreter.interpret(DagInterpreter.java:104) at de.uni_freiburg.informatik.ultimate.lib.sifa.summarizers.TopInputCallSummarizer.computeTopSummary(TopInputCallSummarizer.java:78) at java.util.HashMap.computeIfAbsent(HashMap.java:1127) at de.uni_freiburg.informatik.ultimate.lib.sifa.summarizers.TopInputCallSummarizer.summarize(TopInputCallSummarizer.java:67) at de.uni_freiburg.informatik.ultimate.lib.sifa.DagInterpreter.ipretCallReturnSummary(DagInterpreter.java:230) at de.uni_freiburg.informatik.ultimate.lib.sifa.DagInterpreter.ipretTransAndStoreLoiPred(DagInterpreter.java:214) at de.uni_freiburg.informatik.ultimate.lib.sifa.DagInterpreter.ipretTrans(DagInterpreter.java:197) at de.uni_freiburg.informatik.ultimate.lib.sifa.DagInterpreter.ipretNode(DagInterpreter.java:166) at de.uni_freiburg.informatik.ultimate.lib.sifa.DagInterpreter.interpret(DagInterpreter.java:130) at de.uni_freiburg.informatik.ultimate.lib.sifa.IcfgInterpreter.interpretLoisInProcedure(IcfgInterpreter.java:139) at de.uni_freiburg.informatik.ultimate.lib.sifa.IcfgInterpreter.interpret(IcfgInterpreter.java:129) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:99) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:67) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:99) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:75) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.tryExecuteInterpolantGenerator(TraceAbstractionRefinementEngine.java:287) ... 21 more [2019-10-07 15:54:43,641 INFO L168 Benchmark]: Toolchain (without parser) took 6296.77 ms. Allocated memory was 138.9 MB in the beginning and 334.5 MB in the end (delta: 195.6 MB). Free memory was 100.9 MB in the beginning and 293.5 MB in the end (delta: -192.6 MB). Peak memory consumption was 3.0 MB. Max. memory is 7.1 GB. [2019-10-07 15:54:43,642 INFO L168 Benchmark]: CDTParser took 0.23 ms. Allocated memory is still 138.9 MB. Free memory was 120.9 MB in the beginning and 120.7 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. [2019-10-07 15:54:43,643 INFO L168 Benchmark]: CACSL2BoogieTranslator took 511.92 ms. Allocated memory was 138.9 MB in the beginning and 202.9 MB in the end (delta: 64.0 MB). Free memory was 100.7 MB in the beginning and 176.0 MB in the end (delta: -75.3 MB). Peak memory consumption was 25.1 MB. Max. memory is 7.1 GB. [2019-10-07 15:54:43,643 INFO L168 Benchmark]: Boogie Preprocessor took 69.77 ms. Allocated memory is still 202.9 MB. Free memory was 176.0 MB in the beginning and 173.5 MB in the end (delta: 2.5 MB). Peak memory consumption was 2.5 MB. Max. memory is 7.1 GB. [2019-10-07 15:54:43,644 INFO L168 Benchmark]: RCFGBuilder took 1263.35 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.5 MB in the beginning and 185.4 MB in the end (delta: -11.9 MB). Peak memory consumption was 87.7 MB. Max. memory is 7.1 GB. [2019-10-07 15:54:43,645 INFO L168 Benchmark]: TraceAbstraction took 4447.41 ms. Allocated memory was 235.9 MB in the beginning and 334.5 MB in the end (delta: 98.6 MB). Free memory was 185.4 MB in the beginning and 293.5 MB in the end (delta: -108.1 MB). There was no memory consumed. Max. memory is 7.1 GB. [2019-10-07 15:54:43,649 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.23 ms. Allocated memory is still 138.9 MB. Free memory was 120.9 MB in the beginning and 120.7 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 511.92 ms. Allocated memory was 138.9 MB in the beginning and 202.9 MB in the end (delta: 64.0 MB). Free memory was 100.7 MB in the beginning and 176.0 MB in the end (delta: -75.3 MB). Peak memory consumption was 25.1 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 69.77 ms. Allocated memory is still 202.9 MB. Free memory was 176.0 MB in the beginning and 173.5 MB in the end (delta: 2.5 MB). Peak memory consumption was 2.5 MB. Max. memory is 7.1 GB. * RCFGBuilder took 1263.35 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.5 MB in the beginning and 185.4 MB in the end (delta: -11.9 MB). Peak memory consumption was 87.7 MB. Max. memory is 7.1 GB. * TraceAbstraction took 4447.41 ms. Allocated memory was 235.9 MB in the beginning and 334.5 MB in the end (delta: 98.6 MB). Free memory was 185.4 MB in the beginning and 293.5 MB in the end (delta: -108.1 MB). There was no memory consumed. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: AssertionError: java.lang.IllegalArgumentException: Tried to insert element unknown in custom order: ε de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: AssertionError: java.lang.IllegalArgumentException: Tried to insert element unknown in custom order: ε: de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.tryExecuteInterpolantGenerator(TraceAbstractionRefinementEngine.java:295) RESULT: Ultimate could not prove your program: Toolchain returned no result. Received shutdown request...