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/systemc/kundu1.cil.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-36ac518-m [2019-10-07 17:13:37,619 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-10-07 17:13:37,622 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-10-07 17:13:37,634 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-10-07 17:13:37,634 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-10-07 17:13:37,635 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-10-07 17:13:37,636 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-10-07 17:13:37,638 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-10-07 17:13:37,640 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-10-07 17:13:37,640 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-10-07 17:13:37,641 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-10-07 17:13:37,642 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-10-07 17:13:37,643 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-10-07 17:13:37,644 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-10-07 17:13:37,645 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-10-07 17:13:37,646 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-10-07 17:13:37,646 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-10-07 17:13:37,647 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-10-07 17:13:37,649 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-10-07 17:13:37,651 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-10-07 17:13:37,652 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-10-07 17:13:37,653 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-10-07 17:13:37,654 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-10-07 17:13:37,655 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-10-07 17:13:37,657 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-10-07 17:13:37,658 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-10-07 17:13:37,658 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-10-07 17:13:37,659 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-10-07 17:13:37,659 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-10-07 17:13:37,660 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-10-07 17:13:37,661 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-10-07 17:13:37,661 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-10-07 17:13:37,662 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-10-07 17:13:37,663 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-10-07 17:13:37,664 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-10-07 17:13:37,664 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-10-07 17:13:37,664 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-10-07 17:13:37,665 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-10-07 17:13:37,665 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-10-07 17:13:37,666 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-10-07 17:13:37,666 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-10-07 17:13:37,667 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 17:13:37,681 INFO L113 SettingsManager]: Loading preferences was successful [2019-10-07 17:13:37,681 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-10-07 17:13:37,683 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-10-07 17:13:37,683 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-10-07 17:13:37,683 INFO L138 SettingsManager]: * Use SBE=true [2019-10-07 17:13:37,683 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-10-07 17:13:37,684 INFO L138 SettingsManager]: * sizeof long=4 [2019-10-07 17:13:37,684 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-10-07 17:13:37,684 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-10-07 17:13:37,684 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-10-07 17:13:37,684 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-10-07 17:13:37,685 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-10-07 17:13:37,685 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-10-07 17:13:37,685 INFO L138 SettingsManager]: * sizeof long double=12 [2019-10-07 17:13:37,685 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-10-07 17:13:37,685 INFO L138 SettingsManager]: * Use constant arrays=true [2019-10-07 17:13:37,685 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-10-07 17:13:37,686 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-10-07 17:13:37,686 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-10-07 17:13:37,686 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-10-07 17:13:37,686 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-10-07 17:13:37,687 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-07 17:13:37,687 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-10-07 17:13:37,687 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-10-07 17:13:37,687 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-10-07 17:13:37,687 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-10-07 17:13:37,688 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-10-07 17:13:37,688 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-10-07 17:13:37,688 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 17:13:37,970 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-10-07 17:13:37,982 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-10-07 17:13:37,985 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-10-07 17:13:37,987 INFO L271 PluginConnector]: Initializing CDTParser... [2019-10-07 17:13:37,987 INFO L275 PluginConnector]: CDTParser initialized [2019-10-07 17:13:37,988 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/systemc/kundu1.cil.c [2019-10-07 17:13:38,074 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ab3f1e2a5/8f4afdbe6f684a219c0970aeee324f9b/FLAGb2ef0239a [2019-10-07 17:13:38,608 INFO L306 CDTParser]: Found 1 translation units. [2019-10-07 17:13:38,608 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/systemc/kundu1.cil.c [2019-10-07 17:13:38,625 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ab3f1e2a5/8f4afdbe6f684a219c0970aeee324f9b/FLAGb2ef0239a [2019-10-07 17:13:38,988 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ab3f1e2a5/8f4afdbe6f684a219c0970aeee324f9b [2019-10-07 17:13:39,000 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-10-07 17:13:39,002 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-10-07 17:13:39,003 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-10-07 17:13:39,003 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-10-07 17:13:39,007 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-10-07 17:13:39,008 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.10 05:13:38" (1/1) ... [2019-10-07 17:13:39,011 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@79c54825 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.10 05:13:39, skipping insertion in model container [2019-10-07 17:13:39,011 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.10 05:13:38" (1/1) ... [2019-10-07 17:13:39,020 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-10-07 17:13:39,074 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-10-07 17:13:39,303 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-07 17:13:39,308 INFO L188 MainTranslator]: Completed pre-run [2019-10-07 17:13:39,432 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-07 17:13:39,452 INFO L192 MainTranslator]: Completed translation [2019-10-07 17:13:39,452 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.10 05:13:39 WrapperNode [2019-10-07 17:13:39,452 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-10-07 17:13:39,453 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-10-07 17:13:39,453 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-10-07 17:13:39,453 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-10-07 17:13:39,464 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.10 05:13:39" (1/1) ... [2019-10-07 17:13:39,464 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.10 05:13:39" (1/1) ... [2019-10-07 17:13:39,472 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.10 05:13:39" (1/1) ... [2019-10-07 17:13:39,473 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.10 05:13:39" (1/1) ... [2019-10-07 17:13:39,482 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.10 05:13:39" (1/1) ... [2019-10-07 17:13:39,492 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.10 05:13:39" (1/1) ... [2019-10-07 17:13:39,498 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.10 05:13:39" (1/1) ... [2019-10-07 17:13:39,501 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-10-07 17:13:39,502 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-10-07 17:13:39,502 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-10-07 17:13:39,502 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-10-07 17:13:39,504 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.10 05:13:39" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-07 17:13:39,558 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-10-07 17:13:39,559 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-10-07 17:13:39,559 INFO L138 BoogieDeclarations]: Found implementation of procedure error [2019-10-07 17:13:39,559 INFO L138 BoogieDeclarations]: Found implementation of procedure read_data [2019-10-07 17:13:39,559 INFO L138 BoogieDeclarations]: Found implementation of procedure write_data [2019-10-07 17:13:39,559 INFO L138 BoogieDeclarations]: Found implementation of procedure P_1 [2019-10-07 17:13:39,560 INFO L138 BoogieDeclarations]: Found implementation of procedure is_P_1_triggered [2019-10-07 17:13:39,560 INFO L138 BoogieDeclarations]: Found implementation of procedure C_1 [2019-10-07 17:13:39,561 INFO L138 BoogieDeclarations]: Found implementation of procedure is_C_1_triggered [2019-10-07 17:13:39,561 INFO L138 BoogieDeclarations]: Found implementation of procedure update_channels [2019-10-07 17:13:39,561 INFO L138 BoogieDeclarations]: Found implementation of procedure init_threads [2019-10-07 17:13:39,561 INFO L138 BoogieDeclarations]: Found implementation of procedure exists_runnable_thread [2019-10-07 17:13:39,561 INFO L138 BoogieDeclarations]: Found implementation of procedure eval [2019-10-07 17:13:39,561 INFO L138 BoogieDeclarations]: Found implementation of procedure fire_delta_events [2019-10-07 17:13:39,561 INFO L138 BoogieDeclarations]: Found implementation of procedure reset_delta_events [2019-10-07 17:13:39,562 INFO L138 BoogieDeclarations]: Found implementation of procedure fire_time_events [2019-10-07 17:13:39,562 INFO L138 BoogieDeclarations]: Found implementation of procedure reset_time_events [2019-10-07 17:13:39,562 INFO L138 BoogieDeclarations]: Found implementation of procedure activate_threads [2019-10-07 17:13:39,562 INFO L138 BoogieDeclarations]: Found implementation of procedure immediate_notify [2019-10-07 17:13:39,562 INFO L138 BoogieDeclarations]: Found implementation of procedure stop_simulation [2019-10-07 17:13:39,562 INFO L138 BoogieDeclarations]: Found implementation of procedure start_simulation [2019-10-07 17:13:39,563 INFO L138 BoogieDeclarations]: Found implementation of procedure init_model [2019-10-07 17:13:39,563 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-10-07 17:13:39,563 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-10-07 17:13:39,563 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-10-07 17:13:39,563 INFO L130 BoogieDeclarations]: Found specification of procedure error [2019-10-07 17:13:39,564 INFO L130 BoogieDeclarations]: Found specification of procedure immediate_notify [2019-10-07 17:13:39,564 INFO L130 BoogieDeclarations]: Found specification of procedure read_data [2019-10-07 17:13:39,564 INFO L130 BoogieDeclarations]: Found specification of procedure write_data [2019-10-07 17:13:39,564 INFO L130 BoogieDeclarations]: Found specification of procedure P_1 [2019-10-07 17:13:39,564 INFO L130 BoogieDeclarations]: Found specification of procedure is_P_1_triggered [2019-10-07 17:13:39,564 INFO L130 BoogieDeclarations]: Found specification of procedure C_1 [2019-10-07 17:13:39,565 INFO L130 BoogieDeclarations]: Found specification of procedure is_C_1_triggered [2019-10-07 17:13:39,565 INFO L130 BoogieDeclarations]: Found specification of procedure update_channels [2019-10-07 17:13:39,565 INFO L130 BoogieDeclarations]: Found specification of procedure init_threads [2019-10-07 17:13:39,565 INFO L130 BoogieDeclarations]: Found specification of procedure exists_runnable_thread [2019-10-07 17:13:39,565 INFO L130 BoogieDeclarations]: Found specification of procedure eval [2019-10-07 17:13:39,565 INFO L130 BoogieDeclarations]: Found specification of procedure fire_delta_events [2019-10-07 17:13:39,566 INFO L130 BoogieDeclarations]: Found specification of procedure reset_delta_events [2019-10-07 17:13:39,566 INFO L130 BoogieDeclarations]: Found specification of procedure fire_time_events [2019-10-07 17:13:39,566 INFO L130 BoogieDeclarations]: Found specification of procedure reset_time_events [2019-10-07 17:13:39,566 INFO L130 BoogieDeclarations]: Found specification of procedure activate_threads [2019-10-07 17:13:39,566 INFO L130 BoogieDeclarations]: Found specification of procedure stop_simulation [2019-10-07 17:13:39,566 INFO L130 BoogieDeclarations]: Found specification of procedure start_simulation [2019-10-07 17:13:39,566 INFO L130 BoogieDeclarations]: Found specification of procedure init_model [2019-10-07 17:13:39,566 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-10-07 17:13:39,566 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-10-07 17:13:39,567 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-10-07 17:13:40,324 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-10-07 17:13:40,324 INFO L284 CfgBuilder]: Removed 4 assume(true) statements. [2019-10-07 17:13:40,326 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.10 05:13:40 BoogieIcfgContainer [2019-10-07 17:13:40,326 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-10-07 17:13:40,327 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-10-07 17:13:40,328 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-10-07 17:13:40,331 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-10-07 17:13:40,331 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.10 05:13:38" (1/3) ... [2019-10-07 17:13:40,332 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@66afcee6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.10 05:13:40, skipping insertion in model container [2019-10-07 17:13:40,332 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.10 05:13:39" (2/3) ... [2019-10-07 17:13:40,333 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@66afcee6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.10 05:13:40, skipping insertion in model container [2019-10-07 17:13:40,333 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.10 05:13:40" (3/3) ... [2019-10-07 17:13:40,335 INFO L109 eAbstractionObserver]: Analyzing ICFG kundu1.cil.c [2019-10-07 17:13:40,345 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-10-07 17:13:40,354 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-10-07 17:13:40,366 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-10-07 17:13:40,396 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-10-07 17:13:40,396 INFO L374 AbstractCegarLoop]: Hoare is true [2019-10-07 17:13:40,396 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-10-07 17:13:40,396 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-10-07 17:13:40,397 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-10-07 17:13:40,397 INFO L378 AbstractCegarLoop]: Difference is false [2019-10-07 17:13:40,397 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-10-07 17:13:40,397 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-10-07 17:13:40,419 INFO L276 IsEmpty]: Start isEmpty. Operand 125 states. [2019-10-07 17:13:40,428 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2019-10-07 17:13:40,429 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 17:13:40,430 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, 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 17:13:40,432 INFO L410 AbstractCegarLoop]: === Iteration 1 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 17:13:40,437 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 17:13:40,437 INFO L82 PathProgramCache]: Analyzing trace with hash 68690287, now seen corresponding path program 1 times [2019-10-07 17:13:40,444 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 17:13:40,444 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 17:13:40,445 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 17:13:40,445 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 17:13:40,445 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 17:13:40,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 17:13:40,744 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 17:13:40,745 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 17:13:40,745 INFO L211 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-07 17:13:40,746 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-07 17:13:40,750 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-07 17:13:40,765 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-07 17:13:40,766 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-07 17:13:40,769 INFO L87 Difference]: Start difference. First operand 125 states. Second operand 4 states. [2019-10-07 17:13:41,222 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-07 17:13:41,223 INFO L93 Difference]: Finished difference Result 331 states and 443 transitions. [2019-10-07 17:13:41,223 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-07 17:13:41,225 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 59 [2019-10-07 17:13:41,225 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-07 17:13:41,247 INFO L225 Difference]: With dead ends: 331 [2019-10-07 17:13:41,247 INFO L226 Difference]: Without dead ends: 212 [2019-10-07 17:13:41,256 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 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 17:13:41,276 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 212 states. [2019-10-07 17:13:41,337 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 212 to 200. [2019-10-07 17:13:41,339 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 200 states. [2019-10-07 17:13:41,342 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 200 states to 200 states and 250 transitions. [2019-10-07 17:13:41,344 INFO L78 Accepts]: Start accepts. Automaton has 200 states and 250 transitions. Word has length 59 [2019-10-07 17:13:41,344 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-07 17:13:41,345 INFO L462 AbstractCegarLoop]: Abstraction has 200 states and 250 transitions. [2019-10-07 17:13:41,345 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-07 17:13:41,345 INFO L276 IsEmpty]: Start isEmpty. Operand 200 states and 250 transitions. [2019-10-07 17:13:41,348 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2019-10-07 17:13:41,348 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 17:13:41,349 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, 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 17:13:41,349 INFO L410 AbstractCegarLoop]: === Iteration 2 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 17:13:41,349 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 17:13:41,350 INFO L82 PathProgramCache]: Analyzing trace with hash -1696126322, now seen corresponding path program 1 times [2019-10-07 17:13:41,350 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 17:13:41,350 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 17:13:41,350 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 17:13:41,350 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 17:13:41,351 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 17:13:41,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 17:13:41,492 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 17:13:41,492 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 17:13:41,493 INFO L211 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-07 17:13:41,493 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-07 17:13:41,495 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-07 17:13:41,496 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-07 17:13:41,496 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-07 17:13:41,496 INFO L87 Difference]: Start difference. First operand 200 states and 250 transitions. Second operand 4 states. [2019-10-07 17:13:41,802 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-07 17:13:41,802 INFO L93 Difference]: Finished difference Result 559 states and 725 transitions. [2019-10-07 17:13:41,804 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-07 17:13:41,804 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 59 [2019-10-07 17:13:41,804 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-07 17:13:41,816 INFO L225 Difference]: With dead ends: 559 [2019-10-07 17:13:41,816 INFO L226 Difference]: Without dead ends: 375 [2019-10-07 17:13:41,821 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 1 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 17:13:41,826 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 375 states. [2019-10-07 17:13:41,909 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 375 to 352. [2019-10-07 17:13:41,911 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 352 states. [2019-10-07 17:13:41,916 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 352 states to 352 states and 431 transitions. [2019-10-07 17:13:41,916 INFO L78 Accepts]: Start accepts. Automaton has 352 states and 431 transitions. Word has length 59 [2019-10-07 17:13:41,917 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-07 17:13:41,922 INFO L462 AbstractCegarLoop]: Abstraction has 352 states and 431 transitions. [2019-10-07 17:13:41,923 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-07 17:13:41,923 INFO L276 IsEmpty]: Start isEmpty. Operand 352 states and 431 transitions. [2019-10-07 17:13:41,924 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2019-10-07 17:13:41,924 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 17:13:41,925 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, 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 17:13:41,925 INFO L410 AbstractCegarLoop]: === Iteration 3 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 17:13:41,925 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 17:13:41,926 INFO L82 PathProgramCache]: Analyzing trace with hash 321226243, now seen corresponding path program 1 times [2019-10-07 17:13:41,926 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 17:13:41,926 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 17:13:41,927 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 17:13:41,927 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 17:13:41,927 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 17:13:41,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 17:13:42,036 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 17:13:42,036 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 17:13:42,037 INFO L211 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-07 17:13:42,037 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-07 17:13:42,038 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-07 17:13:42,038 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-07 17:13:42,038 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-07 17:13:42,038 INFO L87 Difference]: Start difference. First operand 352 states and 431 transitions. Second operand 4 states. [2019-10-07 17:13:42,352 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-07 17:13:42,353 INFO L93 Difference]: Finished difference Result 867 states and 1105 transitions. [2019-10-07 17:13:42,354 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-07 17:13:42,354 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 60 [2019-10-07 17:13:42,354 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-07 17:13:42,361 INFO L225 Difference]: With dead ends: 867 [2019-10-07 17:13:42,363 INFO L226 Difference]: Without dead ends: 531 [2019-10-07 17:13:42,365 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 1 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 17:13:42,368 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 531 states. [2019-10-07 17:13:42,433 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 531 to 506. [2019-10-07 17:13:42,434 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 506 states. [2019-10-07 17:13:42,439 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 506 states to 506 states and 620 transitions. [2019-10-07 17:13:42,440 INFO L78 Accepts]: Start accepts. Automaton has 506 states and 620 transitions. Word has length 60 [2019-10-07 17:13:42,442 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-07 17:13:42,442 INFO L462 AbstractCegarLoop]: Abstraction has 506 states and 620 transitions. [2019-10-07 17:13:42,442 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-07 17:13:42,442 INFO L276 IsEmpty]: Start isEmpty. Operand 506 states and 620 transitions. [2019-10-07 17:13:42,446 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2019-10-07 17:13:42,446 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 17:13:42,446 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, 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 17:13:42,447 INFO L410 AbstractCegarLoop]: === Iteration 4 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 17:13:42,447 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 17:13:42,447 INFO L82 PathProgramCache]: Analyzing trace with hash -650448444, now seen corresponding path program 1 times [2019-10-07 17:13:42,447 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 17:13:42,447 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 17:13:42,448 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 17:13:42,448 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 17:13:42,448 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 17:13:42,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 17:13:42,615 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 17:13:42,615 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 17:13:42,616 INFO L211 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-07 17:13:42,616 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-07 17:13:42,616 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-07 17:13:42,616 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-07 17:13:42,617 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-10-07 17:13:42,617 INFO L87 Difference]: Start difference. First operand 506 states and 620 transitions. Second operand 6 states. [2019-10-07 17:13:42,744 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-07 17:13:42,744 INFO L93 Difference]: Finished difference Result 1015 states and 1266 transitions. [2019-10-07 17:13:42,748 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-10-07 17:13:42,748 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 60 [2019-10-07 17:13:42,749 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-07 17:13:42,753 INFO L225 Difference]: With dead ends: 1015 [2019-10-07 17:13:42,754 INFO L226 Difference]: Without dead ends: 599 [2019-10-07 17:13:42,756 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2019-10-07 17:13:42,757 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 599 states. [2019-10-07 17:13:42,794 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 599 to 585. [2019-10-07 17:13:42,794 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 585 states. [2019-10-07 17:13:42,798 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 585 states to 585 states and 719 transitions. [2019-10-07 17:13:42,799 INFO L78 Accepts]: Start accepts. Automaton has 585 states and 719 transitions. Word has length 60 [2019-10-07 17:13:42,800 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-07 17:13:42,800 INFO L462 AbstractCegarLoop]: Abstraction has 585 states and 719 transitions. [2019-10-07 17:13:42,800 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-07 17:13:42,800 INFO L276 IsEmpty]: Start isEmpty. Operand 585 states and 719 transitions. [2019-10-07 17:13:42,802 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2019-10-07 17:13:42,802 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 17:13:42,802 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 17:13:42,802 INFO L410 AbstractCegarLoop]: === Iteration 5 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 17:13:42,803 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 17:13:42,803 INFO L82 PathProgramCache]: Analyzing trace with hash 1879581246, now seen corresponding path program 1 times [2019-10-07 17:13:42,803 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 17:13:42,803 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 17:13:42,804 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 17:13:42,804 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 17:13:42,804 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 17:13:42,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 17:13:42,946 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 17:13:42,947 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 17:13:42,947 INFO L211 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-07 17:13:42,947 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-07 17:13:42,948 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-07 17:13:42,948 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-07 17:13:42,948 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-10-07 17:13:42,948 INFO L87 Difference]: Start difference. First operand 585 states and 719 transitions. Second operand 6 states. [2019-10-07 17:13:43,618 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-07 17:13:43,618 INFO L93 Difference]: Finished difference Result 1086 states and 1467 transitions. [2019-10-07 17:13:43,619 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-10-07 17:13:43,619 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 73 [2019-10-07 17:13:43,620 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-07 17:13:43,625 INFO L225 Difference]: With dead ends: 1086 [2019-10-07 17:13:43,626 INFO L226 Difference]: Without dead ends: 835 [2019-10-07 17:13:43,628 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2019-10-07 17:13:43,629 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 835 states. [2019-10-07 17:13:43,682 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 835 to 781. [2019-10-07 17:13:43,683 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 781 states. [2019-10-07 17:13:43,688 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 781 states to 781 states and 1032 transitions. [2019-10-07 17:13:43,689 INFO L78 Accepts]: Start accepts. Automaton has 781 states and 1032 transitions. Word has length 73 [2019-10-07 17:13:43,689 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-07 17:13:43,689 INFO L462 AbstractCegarLoop]: Abstraction has 781 states and 1032 transitions. [2019-10-07 17:13:43,690 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-07 17:13:43,690 INFO L276 IsEmpty]: Start isEmpty. Operand 781 states and 1032 transitions. [2019-10-07 17:13:43,691 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2019-10-07 17:13:43,692 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 17:13:43,692 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 17:13:43,692 INFO L410 AbstractCegarLoop]: === Iteration 6 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 17:13:43,692 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 17:13:43,693 INFO L82 PathProgramCache]: Analyzing trace with hash -1269060783, now seen corresponding path program 1 times [2019-10-07 17:13:43,693 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 17:13:43,693 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 17:13:43,693 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 17:13:43,693 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 17:13:43,693 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 17:13:43,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 17:13:43,868 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 17:13:43,869 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 17:13:43,869 INFO L211 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-07 17:13:43,869 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-10-07 17:13:43,870 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-10-07 17:13:43,870 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-10-07 17:13:43,870 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2019-10-07 17:13:43,870 INFO L87 Difference]: Start difference. First operand 781 states and 1032 transitions. Second operand 9 states. [2019-10-07 17:13:45,063 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-07 17:13:45,063 INFO L93 Difference]: Finished difference Result 1790 states and 2639 transitions. [2019-10-07 17:13:45,064 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-10-07 17:13:45,065 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 77 [2019-10-07 17:13:45,065 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-07 17:13:45,075 INFO L225 Difference]: With dead ends: 1790 [2019-10-07 17:13:45,075 INFO L226 Difference]: Without dead ends: 1382 [2019-10-07 17:13:45,079 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=65, Invalid=207, Unknown=0, NotChecked=0, Total=272 [2019-10-07 17:13:45,080 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1382 states. [2019-10-07 17:13:45,155 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1382 to 1255. [2019-10-07 17:13:45,155 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1255 states. [2019-10-07 17:13:45,163 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1255 states to 1255 states and 1765 transitions. [2019-10-07 17:13:45,164 INFO L78 Accepts]: Start accepts. Automaton has 1255 states and 1765 transitions. Word has length 77 [2019-10-07 17:13:45,164 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-07 17:13:45,164 INFO L462 AbstractCegarLoop]: Abstraction has 1255 states and 1765 transitions. [2019-10-07 17:13:45,164 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-10-07 17:13:45,165 INFO L276 IsEmpty]: Start isEmpty. Operand 1255 states and 1765 transitions. [2019-10-07 17:13:45,166 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2019-10-07 17:13:45,166 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 17:13:45,166 INFO L385 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 17:13:45,166 INFO L410 AbstractCegarLoop]: === Iteration 7 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 17:13:45,167 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 17:13:45,167 INFO L82 PathProgramCache]: Analyzing trace with hash -1025383731, now seen corresponding path program 1 times [2019-10-07 17:13:45,167 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 17:13:45,167 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 17:13:45,167 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 17:13:45,168 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 17:13:45,168 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 17:13:45,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 17:13:45,247 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 4 proven. 6 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-10-07 17:13:45,248 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 17:13:45,248 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2019-10-07 17:13:45,248 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 17:13:45,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 17:13:45,347 INFO L256 TraceCheckSpWp]: Trace formula consists of 460 conjuncts, 2 conjunts are in the unsatisfiable core [2019-10-07 17:13:45,357 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-07 17:13:45,407 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-07 17:13:45,408 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-10-07 17:13:45,491 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-10-07 17:13:45,492 INFO L211 tionRefinementEngine]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2019-10-07 17:13:45,492 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [7] total 9 [2019-10-07 17:13:45,493 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-07 17:13:45,494 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-07 17:13:45,494 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2019-10-07 17:13:45,494 INFO L87 Difference]: Start difference. First operand 1255 states and 1765 transitions. Second operand 4 states. [2019-10-07 17:13:45,633 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-07 17:13:45,633 INFO L93 Difference]: Finished difference Result 3044 states and 4222 transitions. [2019-10-07 17:13:45,633 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-07 17:13:45,634 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 76 [2019-10-07 17:13:45,635 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-07 17:13:45,648 INFO L225 Difference]: With dead ends: 3044 [2019-10-07 17:13:45,648 INFO L226 Difference]: Without dead ends: 1806 [2019-10-07 17:13:45,658 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 160 GetRequests, 153 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2019-10-07 17:13:45,660 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1806 states. [2019-10-07 17:13:45,797 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1806 to 1465. [2019-10-07 17:13:45,798 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1465 states. [2019-10-07 17:13:45,807 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1465 states to 1465 states and 1930 transitions. [2019-10-07 17:13:45,808 INFO L78 Accepts]: Start accepts. Automaton has 1465 states and 1930 transitions. Word has length 76 [2019-10-07 17:13:45,808 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-07 17:13:45,809 INFO L462 AbstractCegarLoop]: Abstraction has 1465 states and 1930 transitions. [2019-10-07 17:13:45,809 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-07 17:13:45,809 INFO L276 IsEmpty]: Start isEmpty. Operand 1465 states and 1930 transitions. [2019-10-07 17:13:45,812 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2019-10-07 17:13:45,812 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 17:13:45,812 INFO L385 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 17:13:46,021 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-07 17:13:46,021 INFO L410 AbstractCegarLoop]: === Iteration 8 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 17:13:46,021 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 17:13:46,022 INFO L82 PathProgramCache]: Analyzing trace with hash 550466613, now seen corresponding path program 1 times [2019-10-07 17:13:46,022 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 17:13:46,022 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 17:13:46,023 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 17:13:46,023 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 17:13:46,023 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 17:13:46,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 17:13:46,150 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 7 proven. 5 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-10-07 17:13:46,150 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 17:13:46,150 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2019-10-07 17:13:46,150 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-07 17:13:46,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 17:13:46,249 INFO L256 TraceCheckSpWp]: Trace formula consists of 488 conjuncts, 2 conjunts are in the unsatisfiable core [2019-10-07 17:13:46,253 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-07 17:13:46,286 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-07 17:13:46,286 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-10-07 17:13:46,383 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-10-07 17:13:46,384 INFO L211 tionRefinementEngine]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2019-10-07 17:13:46,384 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [9] total 11 [2019-10-07 17:13:46,385 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-07 17:13:46,385 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-07 17:13:46,386 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2019-10-07 17:13:46,386 INFO L87 Difference]: Start difference. First operand 1465 states and 1930 transitions. Second operand 4 states. [2019-10-07 17:13:46,532 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-07 17:13:46,533 INFO L93 Difference]: Finished difference Result 3383 states and 4415 transitions. [2019-10-07 17:13:46,533 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-07 17:13:46,533 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 80 [2019-10-07 17:13:46,535 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-07 17:13:46,546 INFO L225 Difference]: With dead ends: 3383 [2019-10-07 17:13:46,547 INFO L226 Difference]: Without dead ends: 1935 [2019-10-07 17:13:46,555 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 171 GetRequests, 160 SyntacticMatches, 2 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2019-10-07 17:13:46,557 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1935 states. [2019-10-07 17:13:46,658 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1935 to 1674. [2019-10-07 17:13:46,659 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1674 states. [2019-10-07 17:13:46,667 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1674 states to 1674 states and 2093 transitions. [2019-10-07 17:13:46,668 INFO L78 Accepts]: Start accepts. Automaton has 1674 states and 2093 transitions. Word has length 80 [2019-10-07 17:13:46,668 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-07 17:13:46,668 INFO L462 AbstractCegarLoop]: Abstraction has 1674 states and 2093 transitions. [2019-10-07 17:13:46,669 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-07 17:13:46,670 INFO L276 IsEmpty]: Start isEmpty. Operand 1674 states and 2093 transitions. [2019-10-07 17:13:46,674 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2019-10-07 17:13:46,674 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 17:13:46,674 INFO L385 BasicCegarLoop]: trace histogram [5, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 17:13:46,878 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-07 17:13:46,878 INFO L410 AbstractCegarLoop]: === Iteration 9 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 17:13:46,878 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 17:13:46,879 INFO L82 PathProgramCache]: Analyzing trace with hash 1858550324, now seen corresponding path program 1 times [2019-10-07 17:13:46,879 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 17:13:46,879 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 17:13:46,879 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 17:13:46,879 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 17:13:46,879 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 17:13:46,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 17:13:46,942 INFO L134 CoverageAnalysis]: Checked inductivity of 62 backedges. 21 proven. 0 refuted. 0 times theorem prover too weak. 41 trivial. 0 not checked. [2019-10-07 17:13:46,943 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 17:13:46,943 INFO L211 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-07 17:13:46,944 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-07 17:13:46,944 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-07 17:13:46,944 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-07 17:13:46,944 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-07 17:13:46,945 INFO L87 Difference]: Start difference. First operand 1674 states and 2093 transitions. Second operand 4 states. [2019-10-07 17:13:47,152 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-07 17:13:47,154 INFO L93 Difference]: Finished difference Result 2918 states and 3658 transitions. [2019-10-07 17:13:47,154 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-07 17:13:47,154 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 129 [2019-10-07 17:13:47,155 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-07 17:13:47,165 INFO L225 Difference]: With dead ends: 2918 [2019-10-07 17:13:47,165 INFO L226 Difference]: Without dead ends: 1674 [2019-10-07 17:13:47,169 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 17:13:47,171 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1674 states. [2019-10-07 17:13:47,262 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1674 to 1674. [2019-10-07 17:13:47,263 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1674 states. [2019-10-07 17:13:47,269 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1674 states to 1674 states and 2089 transitions. [2019-10-07 17:13:47,270 INFO L78 Accepts]: Start accepts. Automaton has 1674 states and 2089 transitions. Word has length 129 [2019-10-07 17:13:47,271 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-07 17:13:47,271 INFO L462 AbstractCegarLoop]: Abstraction has 1674 states and 2089 transitions. [2019-10-07 17:13:47,271 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-07 17:13:47,272 INFO L276 IsEmpty]: Start isEmpty. Operand 1674 states and 2089 transitions. [2019-10-07 17:13:47,275 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2019-10-07 17:13:47,275 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 17:13:47,275 INFO L385 BasicCegarLoop]: trace histogram [5, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 17:13:47,276 INFO L410 AbstractCegarLoop]: === Iteration 10 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 17:13:47,276 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 17:13:47,276 INFO L82 PathProgramCache]: Analyzing trace with hash -1602685328, now seen corresponding path program 1 times [2019-10-07 17:13:47,276 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 17:13:47,276 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 17:13:47,276 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 17:13:47,277 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 17:13:47,277 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 17:13:47,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 17:13:47,450 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 8 proven. 22 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2019-10-07 17:13:47,450 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 17:13:47,450 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2019-10-07 17:13:47,450 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-07 17:13:47,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 17:13:47,575 INFO L256 TraceCheckSpWp]: Trace formula consists of 622 conjuncts, 21 conjunts are in the unsatisfiable core [2019-10-07 17:13:47,596 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-07 17:13:47,791 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 58 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-10-07 17:13:47,791 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-10-07 17:13:47,999 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-07 17:13:48,098 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-07 17:13:48,098 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-07 17:13:48,122 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-07 17:13:48,146 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 21 proven. 6 refuted. 0 times theorem prover too weak. 37 trivial. 0 not checked. [2019-10-07 17:13:48,147 INFO L211 tionRefinementEngine]: Constructing automaton from 1 perfect and 2 imperfect interpolant sequences. [2019-10-07 17:13:48,147 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [11, 8] total 24 [2019-10-07 17:13:48,147 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-10-07 17:13:48,148 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-10-07 17:13:48,148 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=69, Invalid=483, Unknown=0, NotChecked=0, Total=552 [2019-10-07 17:13:48,148 INFO L87 Difference]: Start difference. First operand 1674 states and 2089 transitions. Second operand 11 states. [2019-10-07 17:13:49,539 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-07 17:13:49,540 INFO L93 Difference]: Finished difference Result 4988 states and 6359 transitions. [2019-10-07 17:13:49,540 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-10-07 17:13:49,540 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 131 [2019-10-07 17:13:49,540 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-07 17:13:49,564 INFO L225 Difference]: With dead ends: 4988 [2019-10-07 17:13:49,565 INFO L226 Difference]: Without dead ends: 3331 [2019-10-07 17:13:49,574 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 295 GetRequests, 259 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 194 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=224, Invalid=1182, Unknown=0, NotChecked=0, Total=1406 [2019-10-07 17:13:49,579 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3331 states. [2019-10-07 17:13:49,778 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3331 to 3281. [2019-10-07 17:13:49,779 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3281 states. [2019-10-07 17:13:49,791 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3281 states to 3281 states and 4012 transitions. [2019-10-07 17:13:49,792 INFO L78 Accepts]: Start accepts. Automaton has 3281 states and 4012 transitions. Word has length 131 [2019-10-07 17:13:49,793 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-07 17:13:49,793 INFO L462 AbstractCegarLoop]: Abstraction has 3281 states and 4012 transitions. [2019-10-07 17:13:49,793 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-10-07 17:13:49,793 INFO L276 IsEmpty]: Start isEmpty. Operand 3281 states and 4012 transitions. [2019-10-07 17:13:49,797 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2019-10-07 17:13:49,797 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 17:13:49,798 INFO L385 BasicCegarLoop]: trace histogram [5, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 17:13:50,002 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-07 17:13:50,003 INFO L410 AbstractCegarLoop]: === Iteration 11 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 17:13:50,003 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 17:13:50,004 INFO L82 PathProgramCache]: Analyzing trace with hash -1977951621, now seen corresponding path program 1 times [2019-10-07 17:13:50,004 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 17:13:50,004 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 17:13:50,004 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 17:13:50,005 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 17:13:50,005 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 17:13:50,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 17:13:50,111 INFO L134 CoverageAnalysis]: Checked inductivity of 65 backedges. 25 proven. 0 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2019-10-07 17:13:50,111 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 17:13:50,112 INFO L211 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-07 17:13:50,112 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-07 17:13:50,112 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-07 17:13:50,113 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-07 17:13:50,113 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-07 17:13:50,113 INFO L87 Difference]: Start difference. First operand 3281 states and 4012 transitions. Second operand 4 states. [2019-10-07 17:13:50,426 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-07 17:13:50,426 INFO L93 Difference]: Finished difference Result 6251 states and 7657 transitions. [2019-10-07 17:13:50,427 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-07 17:13:50,427 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 134 [2019-10-07 17:13:50,428 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-07 17:13:50,454 INFO L225 Difference]: With dead ends: 6251 [2019-10-07 17:13:50,455 INFO L226 Difference]: Without dead ends: 3671 [2019-10-07 17:13:50,468 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 4 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 17:13:50,475 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3671 states. [2019-10-07 17:13:50,723 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3671 to 3572. [2019-10-07 17:13:50,723 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3572 states. [2019-10-07 17:13:50,733 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3572 states to 3572 states and 4217 transitions. [2019-10-07 17:13:50,734 INFO L78 Accepts]: Start accepts. Automaton has 3572 states and 4217 transitions. Word has length 134 [2019-10-07 17:13:50,736 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-07 17:13:50,736 INFO L462 AbstractCegarLoop]: Abstraction has 3572 states and 4217 transitions. [2019-10-07 17:13:50,736 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-07 17:13:50,737 INFO L276 IsEmpty]: Start isEmpty. Operand 3572 states and 4217 transitions. [2019-10-07 17:13:50,739 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2019-10-07 17:13:50,740 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 17:13:50,740 INFO L385 BasicCegarLoop]: trace histogram [5, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 17:13:50,740 INFO L410 AbstractCegarLoop]: === Iteration 12 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 17:13:50,740 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 17:13:50,741 INFO L82 PathProgramCache]: Analyzing trace with hash -1810490110, now seen corresponding path program 1 times [2019-10-07 17:13:50,741 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 17:13:50,741 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 17:13:50,741 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 17:13:50,741 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 17:13:50,741 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 17:13:50,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 17:13:50,912 INFO L134 CoverageAnalysis]: Checked inductivity of 65 backedges. 19 proven. 13 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2019-10-07 17:13:50,913 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 17:13:50,913 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2019-10-07 17:13:50,913 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-07 17:13:51,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 17:13:51,057 INFO L256 TraceCheckSpWp]: Trace formula consists of 636 conjuncts, 7 conjunts are in the unsatisfiable core [2019-10-07 17:13:51,068 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-07 17:13:51,091 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-07 17:13:51,092 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-07 17:13:51,199 INFO L134 CoverageAnalysis]: Checked inductivity of 65 backedges. 59 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-10-07 17:13:51,200 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-10-07 17:13:51,570 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-07 17:13:51,571 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-07 17:13:51,572 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-07 17:13:51,590 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-07 17:13:51,640 INFO L134 CoverageAnalysis]: Checked inductivity of 65 backedges. 23 proven. 3 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2019-10-07 17:13:51,640 INFO L211 tionRefinementEngine]: Constructing automaton from 1 perfect and 2 imperfect interpolant sequences. [2019-10-07 17:13:51,641 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [11, 6] total 16 [2019-10-07 17:13:51,641 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-07 17:13:51,642 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-07 17:13:51,642 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=200, Unknown=0, NotChecked=0, Total=240 [2019-10-07 17:13:51,642 INFO L87 Difference]: Start difference. First operand 3572 states and 4217 transitions. Second operand 6 states. [2019-10-07 17:13:51,902 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-07 17:13:51,903 INFO L93 Difference]: Finished difference Result 6488 states and 7811 transitions. [2019-10-07 17:13:51,903 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-10-07 17:13:51,903 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 133 [2019-10-07 17:13:51,904 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-07 17:13:51,920 INFO L225 Difference]: With dead ends: 6488 [2019-10-07 17:13:51,921 INFO L226 Difference]: Without dead ends: 2933 [2019-10-07 17:13:51,931 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 281 GetRequests, 262 SyntacticMatches, 2 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 67 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=55, Invalid=287, Unknown=0, NotChecked=0, Total=342 [2019-10-07 17:13:51,935 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2933 states. [2019-10-07 17:13:52,089 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2933 to 2645. [2019-10-07 17:13:52,090 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2645 states. [2019-10-07 17:13:52,096 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2645 states to 2645 states and 3102 transitions. [2019-10-07 17:13:52,097 INFO L78 Accepts]: Start accepts. Automaton has 2645 states and 3102 transitions. Word has length 133 [2019-10-07 17:13:52,097 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-07 17:13:52,098 INFO L462 AbstractCegarLoop]: Abstraction has 2645 states and 3102 transitions. [2019-10-07 17:13:52,098 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-07 17:13:52,098 INFO L276 IsEmpty]: Start isEmpty. Operand 2645 states and 3102 transitions. [2019-10-07 17:13:52,100 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2019-10-07 17:13:52,101 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 17:13:52,101 INFO L385 BasicCegarLoop]: trace histogram [5, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 17:13:52,304 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-07 17:13:52,305 INFO L410 AbstractCegarLoop]: === Iteration 13 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 17:13:52,305 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 17:13:52,305 INFO L82 PathProgramCache]: Analyzing trace with hash 1820360425, now seen corresponding path program 1 times [2019-10-07 17:13:52,305 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 17:13:52,305 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 17:13:52,305 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 17:13:52,306 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 17:13:52,306 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 17:13:52,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 17:13:52,477 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 8 proven. 22 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2019-10-07 17:13:52,477 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 17:13:52,477 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2019-10-07 17:13:52,477 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-07 17:13:52,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 17:13:52,596 INFO L256 TraceCheckSpWp]: Trace formula consists of 657 conjuncts, 7 conjunts are in the unsatisfiable core [2019-10-07 17:13:52,600 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-07 17:13:52,712 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 52 proven. 4 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2019-10-07 17:13:52,713 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-10-07 17:13:52,819 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-07 17:13:52,836 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-07 17:13:52,881 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 21 proven. 0 refuted. 0 times theorem prover too weak. 43 trivial. 0 not checked. [2019-10-07 17:13:52,881 INFO L211 tionRefinementEngine]: Constructing automaton from 1 perfect and 2 imperfect interpolant sequences. [2019-10-07 17:13:52,882 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [11, 7] total 20 [2019-10-07 17:13:52,882 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-07 17:13:52,882 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-07 17:13:52,883 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=328, Unknown=0, NotChecked=0, Total=380 [2019-10-07 17:13:52,883 INFO L87 Difference]: Start difference. First operand 2645 states and 3102 transitions. Second operand 6 states. [2019-10-07 17:13:53,528 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-07 17:13:53,528 INFO L93 Difference]: Finished difference Result 5301 states and 6274 transitions. [2019-10-07 17:13:53,529 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-07 17:13:53,529 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 137 [2019-10-07 17:13:53,529 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-07 17:13:53,543 INFO L225 Difference]: With dead ends: 5301 [2019-10-07 17:13:53,543 INFO L226 Difference]: Without dead ends: 2218 [2019-10-07 17:13:53,551 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 292 GetRequests, 272 SyntacticMatches, 1 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 57 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=57, Invalid=363, Unknown=0, NotChecked=0, Total=420 [2019-10-07 17:13:53,554 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2218 states. [2019-10-07 17:13:53,700 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2218 to 2143. [2019-10-07 17:13:53,701 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2143 states. [2019-10-07 17:13:53,706 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2143 states to 2143 states and 2450 transitions. [2019-10-07 17:13:53,709 INFO L78 Accepts]: Start accepts. Automaton has 2143 states and 2450 transitions. Word has length 137 [2019-10-07 17:13:53,710 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-07 17:13:53,710 INFO L462 AbstractCegarLoop]: Abstraction has 2143 states and 2450 transitions. [2019-10-07 17:13:53,710 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-07 17:13:53,710 INFO L276 IsEmpty]: Start isEmpty. Operand 2143 states and 2450 transitions. [2019-10-07 17:13:53,713 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2019-10-07 17:13:53,713 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 17:13:53,714 INFO L385 BasicCegarLoop]: trace histogram [6, 4, 4, 4, 4, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 17:13:53,919 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-07 17:13:53,919 INFO L410 AbstractCegarLoop]: === Iteration 14 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 17:13:53,920 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 17:13:53,920 INFO L82 PathProgramCache]: Analyzing trace with hash 112536929, now seen corresponding path program 1 times [2019-10-07 17:13:53,920 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 17:13:53,920 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 17:13:53,920 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 17:13:53,920 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 17:13:53,921 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 17:13:53,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 17:13:54,104 INFO L134 CoverageAnalysis]: Checked inductivity of 91 backedges. 8 proven. 35 refuted. 0 times theorem prover too weak. 48 trivial. 0 not checked. [2019-10-07 17:13:54,104 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 17:13:54,104 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2019-10-07 17:13:54,104 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-07 17:13:54,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 17:13:54,230 INFO L256 TraceCheckSpWp]: Trace formula consists of 680 conjuncts, 10 conjunts are in the unsatisfiable core [2019-10-07 17:13:54,243 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-07 17:13:54,387 INFO L134 CoverageAnalysis]: Checked inductivity of 91 backedges. 72 proven. 11 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2019-10-07 17:13:54,388 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-10-07 17:13:54,526 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-07 17:13:54,543 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-07 17:13:54,581 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-07 17:13:54,588 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-07 17:13:54,638 INFO L134 CoverageAnalysis]: Checked inductivity of 91 backedges. 32 proven. 6 refuted. 0 times theorem prover too weak. 53 trivial. 0 not checked. [2019-10-07 17:13:54,638 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [2019-10-07 17:13:54,670 INFO L162 IcfgInterpreter]: Started Sifa with 90 locations of interest [2019-10-07 17:13:54,670 INFO L169 IcfgInterpreter]: Building call graph [2019-10-07 17:13:54,677 INFO L174 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-10-07 17:13:54,685 INFO L179 IcfgInterpreter]: Starting interpretation [2019-10-07 17:13:54,685 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2019-10-07 17:13:54,874 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.init with input of size 49 for LOIs [2019-10-07 17:13:54,902 INFO L199 IcfgInterpreter]: Interpreting procedure main with input of size 82 for LOIs [2019-10-07 17:13:55,300 INFO L199 IcfgInterpreter]: Interpreting procedure init_model with input of size 47 for LOIs [2019-10-07 17:13:55,400 INFO L199 IcfgInterpreter]: Interpreting procedure start_simulation with input of size 84 for LOIs [2019-10-07 17:13:57,818 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-07 17:13:57,824 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: CallReturnSummary for callee is_C_1_triggered 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: CallReturnSummary for callee is_C_1_triggered 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.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 17:13:57,835 INFO L168 Benchmark]: Toolchain (without parser) took 18827.33 ms. Allocated memory was 138.4 MB in the beginning and 694.2 MB in the end (delta: 555.7 MB). Free memory was 100.5 MB in the beginning and 501.8 MB in the end (delta: -401.2 MB). Peak memory consumption was 154.5 MB. Max. memory is 7.1 GB. [2019-10-07 17:13:57,836 INFO L168 Benchmark]: CDTParser took 0.20 ms. Allocated memory is still 138.4 MB. Free memory was 119.5 MB in the beginning and 119.2 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. [2019-10-07 17:13:57,837 INFO L168 Benchmark]: CACSL2BoogieTranslator took 449.82 ms. Allocated memory was 138.4 MB in the beginning and 199.8 MB in the end (delta: 61.3 MB). Free memory was 100.3 MB in the beginning and 176.5 MB in the end (delta: -76.2 MB). Peak memory consumption was 22.4 MB. Max. memory is 7.1 GB. [2019-10-07 17:13:57,838 INFO L168 Benchmark]: Boogie Preprocessor took 48.31 ms. Allocated memory is still 199.8 MB. Free memory was 175.8 MB in the beginning and 173.8 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 7.1 GB. [2019-10-07 17:13:57,839 INFO L168 Benchmark]: RCFGBuilder took 824.44 ms. Allocated memory is still 199.8 MB. Free memory was 173.8 MB in the beginning and 126.3 MB in the end (delta: 47.5 MB). Peak memory consumption was 47.5 MB. Max. memory is 7.1 GB. [2019-10-07 17:13:57,843 INFO L168 Benchmark]: TraceAbstraction took 17499.94 ms. Allocated memory was 199.8 MB in the beginning and 694.2 MB in the end (delta: 494.4 MB). Free memory was 126.3 MB in the beginning and 501.8 MB in the end (delta: -375.5 MB). Peak memory consumption was 118.9 MB. Max. memory is 7.1 GB. [2019-10-07 17:13:57,854 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.20 ms. Allocated memory is still 138.4 MB. Free memory was 119.5 MB in the beginning and 119.2 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 449.82 ms. Allocated memory was 138.4 MB in the beginning and 199.8 MB in the end (delta: 61.3 MB). Free memory was 100.3 MB in the beginning and 176.5 MB in the end (delta: -76.2 MB). Peak memory consumption was 22.4 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 48.31 ms. Allocated memory is still 199.8 MB. Free memory was 175.8 MB in the beginning and 173.8 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 7.1 GB. * RCFGBuilder took 824.44 ms. Allocated memory is still 199.8 MB. Free memory was 173.8 MB in the beginning and 126.3 MB in the end (delta: 47.5 MB). Peak memory consumption was 47.5 MB. Max. memory is 7.1 GB. * TraceAbstraction took 17499.94 ms. Allocated memory was 199.8 MB in the beginning and 694.2 MB in the end (delta: 494.4 MB). Free memory was 126.3 MB in the beginning and 501.8 MB in the end (delta: -375.5 MB). Peak memory consumption was 118.9 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: CallReturnSummary for callee is_C_1_triggered de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: AssertionError: java.lang.IllegalArgumentException: Tried to insert element unknown in custom order: CallReturnSummary for callee is_C_1_triggered: 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...