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/eca-rers2012/Problem03_label27.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-36ac518-m [2019-10-07 00:58:38,637 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-10-07 00:58:38,639 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-10-07 00:58:38,658 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-10-07 00:58:38,658 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-10-07 00:58:38,660 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-10-07 00:58:38,662 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-10-07 00:58:38,672 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-10-07 00:58:38,677 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-10-07 00:58:38,681 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-10-07 00:58:38,683 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-10-07 00:58:38,684 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-10-07 00:58:38,684 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-10-07 00:58:38,686 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-10-07 00:58:38,689 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-10-07 00:58:38,691 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-10-07 00:58:38,693 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-10-07 00:58:38,695 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-10-07 00:58:38,697 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-10-07 00:58:38,702 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-10-07 00:58:38,708 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-10-07 00:58:38,711 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-10-07 00:58:38,715 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-10-07 00:58:38,716 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-10-07 00:58:38,718 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-10-07 00:58:38,719 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-10-07 00:58:38,719 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-10-07 00:58:38,721 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-10-07 00:58:38,723 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-10-07 00:58:38,724 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-10-07 00:58:38,725 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-10-07 00:58:38,727 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-10-07 00:58:38,728 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-10-07 00:58:38,728 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-10-07 00:58:38,730 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-10-07 00:58:38,730 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-10-07 00:58:38,731 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-10-07 00:58:38,731 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-10-07 00:58:38,731 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-10-07 00:58:38,732 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-10-07 00:58:38,734 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-10-07 00:58:38,735 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 00:58:38,761 INFO L113 SettingsManager]: Loading preferences was successful [2019-10-07 00:58:38,761 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-10-07 00:58:38,763 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-10-07 00:58:38,763 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-10-07 00:58:38,763 INFO L138 SettingsManager]: * Use SBE=true [2019-10-07 00:58:38,763 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-10-07 00:58:38,764 INFO L138 SettingsManager]: * sizeof long=4 [2019-10-07 00:58:38,764 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-10-07 00:58:38,764 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-10-07 00:58:38,764 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-10-07 00:58:38,764 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-10-07 00:58:38,765 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-10-07 00:58:38,765 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-10-07 00:58:38,765 INFO L138 SettingsManager]: * sizeof long double=12 [2019-10-07 00:58:38,765 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-10-07 00:58:38,765 INFO L138 SettingsManager]: * Use constant arrays=true [2019-10-07 00:58:38,765 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-10-07 00:58:38,766 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-10-07 00:58:38,766 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-10-07 00:58:38,766 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-10-07 00:58:38,766 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-10-07 00:58:38,766 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-07 00:58:38,767 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-10-07 00:58:38,767 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-10-07 00:58:38,767 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-10-07 00:58:38,767 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-10-07 00:58:38,767 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-10-07 00:58:38,768 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-10-07 00:58:38,768 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 00:58:39,055 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-10-07 00:58:39,068 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-10-07 00:58:39,071 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-10-07 00:58:39,073 INFO L271 PluginConnector]: Initializing CDTParser... [2019-10-07 00:58:39,073 INFO L275 PluginConnector]: CDTParser initialized [2019-10-07 00:58:39,074 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/eca-rers2012/Problem03_label27.c [2019-10-07 00:58:39,137 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9bc5830d3/639f066030dc457ca05540117a469fe6/FLAG2fdc60d48 [2019-10-07 00:58:39,767 INFO L306 CDTParser]: Found 1 translation units. [2019-10-07 00:58:39,767 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/eca-rers2012/Problem03_label27.c [2019-10-07 00:58:39,784 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9bc5830d3/639f066030dc457ca05540117a469fe6/FLAG2fdc60d48 [2019-10-07 00:58:39,995 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9bc5830d3/639f066030dc457ca05540117a469fe6 [2019-10-07 00:58:40,005 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-10-07 00:58:40,007 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-10-07 00:58:40,008 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-10-07 00:58:40,008 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-10-07 00:58:40,012 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-10-07 00:58:40,013 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.10 12:58:39" (1/1) ... [2019-10-07 00:58:40,016 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1d289120 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.10 12:58:40, skipping insertion in model container [2019-10-07 00:58:40,017 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.10 12:58:39" (1/1) ... [2019-10-07 00:58:40,024 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-10-07 00:58:40,101 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-10-07 00:58:40,929 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-07 00:58:40,946 INFO L188 MainTranslator]: Completed pre-run [2019-10-07 00:58:41,336 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-07 00:58:41,364 INFO L192 MainTranslator]: Completed translation [2019-10-07 00:58:41,365 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.10 12:58:41 WrapperNode [2019-10-07 00:58:41,365 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-10-07 00:58:41,366 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-10-07 00:58:41,367 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-10-07 00:58:41,367 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-10-07 00:58:41,382 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.10 12:58:41" (1/1) ... [2019-10-07 00:58:41,383 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.10 12:58:41" (1/1) ... [2019-10-07 00:58:41,430 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.10 12:58:41" (1/1) ... [2019-10-07 00:58:41,431 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.10 12:58:41" (1/1) ... [2019-10-07 00:58:41,506 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.10 12:58:41" (1/1) ... [2019-10-07 00:58:41,548 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.10 12:58:41" (1/1) ... [2019-10-07 00:58:41,563 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.10 12:58:41" (1/1) ... [2019-10-07 00:58:41,575 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-10-07 00:58:41,576 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-10-07 00:58:41,576 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-10-07 00:58:41,576 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-10-07 00:58:41,577 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.10 12:58:41" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-07 00:58:41,646 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-10-07 00:58:41,647 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-10-07 00:58:41,648 INFO L138 BoogieDeclarations]: Found implementation of procedure calculate_output [2019-10-07 00:58:41,648 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-10-07 00:58:41,648 INFO L130 BoogieDeclarations]: Found specification of procedure calculate_output [2019-10-07 00:58:41,649 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-10-07 00:58:41,650 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-10-07 00:58:41,650 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2019-10-07 00:58:41,650 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-10-07 00:58:41,650 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-10-07 00:58:41,651 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-10-07 00:58:44,891 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-10-07 00:58:44,892 INFO L284 CfgBuilder]: Removed 1 assume(true) statements. [2019-10-07 00:58:44,898 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.10 12:58:44 BoogieIcfgContainer [2019-10-07 00:58:44,899 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-10-07 00:58:44,900 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-10-07 00:58:44,900 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-10-07 00:58:44,907 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-10-07 00:58:44,908 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.10 12:58:39" (1/3) ... [2019-10-07 00:58:44,909 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7ef3e899 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.10 12:58:44, skipping insertion in model container [2019-10-07 00:58:44,909 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.10 12:58:41" (2/3) ... [2019-10-07 00:58:44,910 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7ef3e899 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.10 12:58:44, skipping insertion in model container [2019-10-07 00:58:44,910 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.10 12:58:44" (3/3) ... [2019-10-07 00:58:44,915 INFO L109 eAbstractionObserver]: Analyzing ICFG Problem03_label27.c [2019-10-07 00:58:44,925 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-10-07 00:58:44,935 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-10-07 00:58:44,946 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-10-07 00:58:44,988 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-10-07 00:58:44,988 INFO L374 AbstractCegarLoop]: Hoare is true [2019-10-07 00:58:44,988 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-10-07 00:58:44,989 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-10-07 00:58:44,989 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-10-07 00:58:44,989 INFO L378 AbstractCegarLoop]: Difference is false [2019-10-07 00:58:44,989 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-10-07 00:58:44,989 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-10-07 00:58:45,020 INFO L276 IsEmpty]: Start isEmpty. Operand 158 states. [2019-10-07 00:58:45,043 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 150 [2019-10-07 00:58:45,043 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 00:58:45,045 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 00:58:45,047 INFO L410 AbstractCegarLoop]: === Iteration 1 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 00:58:45,053 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 00:58:45,053 INFO L82 PathProgramCache]: Analyzing trace with hash 136466214, now seen corresponding path program 1 times [2019-10-07 00:58:45,063 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 00:58:45,063 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 00:58:45,063 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 00:58:45,064 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 00:58:45,064 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 00:58:45,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 00:58:45,814 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 00:58:45,815 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 00:58:45,816 INFO L211 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-07 00:58:45,816 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-07 00:58:45,822 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-07 00:58:45,837 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-07 00:58:45,838 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-07 00:58:45,840 INFO L87 Difference]: Start difference. First operand 158 states. Second operand 3 states. [2019-10-07 00:58:46,895 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-07 00:58:46,895 INFO L93 Difference]: Finished difference Result 462 states and 886 transitions. [2019-10-07 00:58:46,896 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-07 00:58:46,897 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 149 [2019-10-07 00:58:46,898 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-07 00:58:46,915 INFO L225 Difference]: With dead ends: 462 [2019-10-07 00:58:46,916 INFO L226 Difference]: Without dead ends: 301 [2019-10-07 00:58:46,921 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-07 00:58:46,941 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 301 states. [2019-10-07 00:58:46,995 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 301 to 301. [2019-10-07 00:58:46,996 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 301 states. [2019-10-07 00:58:47,001 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 301 states to 301 states and 569 transitions. [2019-10-07 00:58:47,003 INFO L78 Accepts]: Start accepts. Automaton has 301 states and 569 transitions. Word has length 149 [2019-10-07 00:58:47,007 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-07 00:58:47,008 INFO L462 AbstractCegarLoop]: Abstraction has 301 states and 569 transitions. [2019-10-07 00:58:47,008 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-07 00:58:47,008 INFO L276 IsEmpty]: Start isEmpty. Operand 301 states and 569 transitions. [2019-10-07 00:58:47,014 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 158 [2019-10-07 00:58:47,015 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 00:58:47,015 INFO L385 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 00:58:47,017 INFO L410 AbstractCegarLoop]: === Iteration 2 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 00:58:47,017 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 00:58:47,018 INFO L82 PathProgramCache]: Analyzing trace with hash -20879962, now seen corresponding path program 1 times [2019-10-07 00:58:47,019 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 00:58:47,019 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 00:58:47,019 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 00:58:47,020 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 00:58:47,020 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 00:58:47,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 00:58:47,229 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-07 00:58:47,229 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 00:58:47,230 INFO L211 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-07 00:58:47,230 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-07 00:58:47,233 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-07 00:58:47,234 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-07 00:58:47,234 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-07 00:58:47,234 INFO L87 Difference]: Start difference. First operand 301 states and 569 transitions. Second operand 5 states. [2019-10-07 00:58:48,614 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-07 00:58:48,615 INFO L93 Difference]: Finished difference Result 917 states and 1763 transitions. [2019-10-07 00:58:48,615 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-10-07 00:58:48,616 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 157 [2019-10-07 00:58:48,616 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-07 00:58:48,624 INFO L225 Difference]: With dead ends: 917 [2019-10-07 00:58:48,624 INFO L226 Difference]: Without dead ends: 621 [2019-10-07 00:58:48,628 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2019-10-07 00:58:48,630 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 621 states. [2019-10-07 00:58:48,697 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 621 to 603. [2019-10-07 00:58:48,697 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 603 states. [2019-10-07 00:58:48,701 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 603 states to 603 states and 1088 transitions. [2019-10-07 00:58:48,701 INFO L78 Accepts]: Start accepts. Automaton has 603 states and 1088 transitions. Word has length 157 [2019-10-07 00:58:48,702 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-07 00:58:48,702 INFO L462 AbstractCegarLoop]: Abstraction has 603 states and 1088 transitions. [2019-10-07 00:58:48,702 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-07 00:58:48,702 INFO L276 IsEmpty]: Start isEmpty. Operand 603 states and 1088 transitions. [2019-10-07 00:58:48,707 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 162 [2019-10-07 00:58:48,708 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 00:58:48,708 INFO L385 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 00:58:48,708 INFO L410 AbstractCegarLoop]: === Iteration 3 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 00:58:48,709 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 00:58:48,709 INFO L82 PathProgramCache]: Analyzing trace with hash -1532435694, now seen corresponding path program 1 times [2019-10-07 00:58:48,709 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 00:58:48,709 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 00:58:48,710 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 00:58:48,710 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 00:58:48,710 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 00:58:48,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 00:58:48,981 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-07 00:58:48,982 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 00:58:48,983 INFO L211 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-07 00:58:48,983 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-07 00:58:48,985 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-07 00:58:48,985 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-07 00:58:48,986 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-07 00:58:48,986 INFO L87 Difference]: Start difference. First operand 603 states and 1088 transitions. Second operand 3 states. [2019-10-07 00:58:50,164 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-07 00:58:50,164 INFO L93 Difference]: Finished difference Result 1793 states and 3296 transitions. [2019-10-07 00:58:50,165 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-07 00:58:50,165 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 161 [2019-10-07 00:58:50,166 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-07 00:58:50,175 INFO L225 Difference]: With dead ends: 1793 [2019-10-07 00:58:50,176 INFO L226 Difference]: Without dead ends: 1195 [2019-10-07 00:58:50,178 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-07 00:58:50,180 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1195 states. [2019-10-07 00:58:50,220 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1195 to 1195. [2019-10-07 00:58:50,220 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1195 states. [2019-10-07 00:58:50,227 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1195 states to 1195 states and 2022 transitions. [2019-10-07 00:58:50,227 INFO L78 Accepts]: Start accepts. Automaton has 1195 states and 2022 transitions. Word has length 161 [2019-10-07 00:58:50,228 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-07 00:58:50,228 INFO L462 AbstractCegarLoop]: Abstraction has 1195 states and 2022 transitions. [2019-10-07 00:58:50,228 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-07 00:58:50,229 INFO L276 IsEmpty]: Start isEmpty. Operand 1195 states and 2022 transitions. [2019-10-07 00:58:50,234 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 164 [2019-10-07 00:58:50,235 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 00:58:50,235 INFO L385 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 00:58:50,235 INFO L410 AbstractCegarLoop]: === Iteration 4 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 00:58:50,236 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 00:58:50,236 INFO L82 PathProgramCache]: Analyzing trace with hash -478381842, now seen corresponding path program 1 times [2019-10-07 00:58:50,236 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 00:58:50,236 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 00:58:50,237 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 00:58:50,237 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 00:58:50,237 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 00:58:50,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 00:58:50,446 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-07 00:58:50,446 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 00:58:50,447 INFO L211 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-07 00:58:50,447 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-07 00:58:50,447 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-07 00:58:50,448 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-07 00:58:50,448 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-07 00:58:50,448 INFO L87 Difference]: Start difference. First operand 1195 states and 2022 transitions. Second operand 3 states. [2019-10-07 00:58:51,560 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-07 00:58:51,560 INFO L93 Difference]: Finished difference Result 3279 states and 5801 transitions. [2019-10-07 00:58:51,561 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-07 00:58:51,561 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 163 [2019-10-07 00:58:51,562 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-07 00:58:51,576 INFO L225 Difference]: With dead ends: 3279 [2019-10-07 00:58:51,576 INFO L226 Difference]: Without dead ends: 2089 [2019-10-07 00:58:51,580 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-07 00:58:51,583 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2089 states. [2019-10-07 00:58:51,644 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2089 to 2089. [2019-10-07 00:58:51,645 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2089 states. [2019-10-07 00:58:51,655 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2089 states to 2089 states and 3518 transitions. [2019-10-07 00:58:51,656 INFO L78 Accepts]: Start accepts. Automaton has 2089 states and 3518 transitions. Word has length 163 [2019-10-07 00:58:51,656 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-07 00:58:51,656 INFO L462 AbstractCegarLoop]: Abstraction has 2089 states and 3518 transitions. [2019-10-07 00:58:51,656 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-07 00:58:51,657 INFO L276 IsEmpty]: Start isEmpty. Operand 2089 states and 3518 transitions. [2019-10-07 00:58:51,663 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 172 [2019-10-07 00:58:51,664 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 00:58:51,664 INFO L385 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 00:58:51,664 INFO L410 AbstractCegarLoop]: === Iteration 5 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 00:58:51,665 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 00:58:51,665 INFO L82 PathProgramCache]: Analyzing trace with hash 436280232, now seen corresponding path program 1 times [2019-10-07 00:58:51,665 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 00:58:51,665 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 00:58:51,666 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 00:58:51,666 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 00:58:51,666 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 00:58:51,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 00:58:51,772 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-07 00:58:51,772 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 00:58:51,772 INFO L211 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-07 00:58:51,773 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-07 00:58:51,773 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-07 00:58:51,773 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-07 00:58:51,774 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-10-07 00:58:51,774 INFO L87 Difference]: Start difference. First operand 2089 states and 3518 transitions. Second operand 6 states. [2019-10-07 00:58:53,127 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-07 00:58:53,128 INFO L93 Difference]: Finished difference Result 6222 states and 11450 transitions. [2019-10-07 00:58:53,129 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-10-07 00:58:53,129 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 171 [2019-10-07 00:58:53,131 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-07 00:58:53,181 INFO L225 Difference]: With dead ends: 6222 [2019-10-07 00:58:53,181 INFO L226 Difference]: Without dead ends: 4138 [2019-10-07 00:58:53,192 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2019-10-07 00:58:53,197 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4138 states. [2019-10-07 00:58:53,417 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4138 to 4074. [2019-10-07 00:58:53,418 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4074 states. [2019-10-07 00:58:53,449 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4074 states to 4074 states and 6862 transitions. [2019-10-07 00:58:53,450 INFO L78 Accepts]: Start accepts. Automaton has 4074 states and 6862 transitions. Word has length 171 [2019-10-07 00:58:53,450 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-07 00:58:53,451 INFO L462 AbstractCegarLoop]: Abstraction has 4074 states and 6862 transitions. [2019-10-07 00:58:53,451 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-07 00:58:53,451 INFO L276 IsEmpty]: Start isEmpty. Operand 4074 states and 6862 transitions. [2019-10-07 00:58:53,466 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 173 [2019-10-07 00:58:53,467 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 00:58:53,467 INFO L385 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 00:58:53,468 INFO L410 AbstractCegarLoop]: === Iteration 6 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 00:58:53,468 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 00:58:53,468 INFO L82 PathProgramCache]: Analyzing trace with hash -1768177375, now seen corresponding path program 1 times [2019-10-07 00:58:53,469 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 00:58:53,469 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 00:58:53,469 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 00:58:53,470 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 00:58:53,470 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 00:58:53,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 00:58:53,620 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 20 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-07 00:58:53,621 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 00:58:53,621 INFO L211 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-07 00:58:53,621 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-07 00:58:53,622 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-07 00:58:53,622 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-07 00:58:53,622 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-10-07 00:58:53,623 INFO L87 Difference]: Start difference. First operand 4074 states and 6862 transitions. Second operand 6 states. [2019-10-07 00:58:55,175 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-07 00:58:55,175 INFO L93 Difference]: Finished difference Result 11448 states and 20886 transitions. [2019-10-07 00:58:55,176 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-10-07 00:58:55,176 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 172 [2019-10-07 00:58:55,179 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-07 00:58:55,235 INFO L225 Difference]: With dead ends: 11448 [2019-10-07 00:58:55,235 INFO L226 Difference]: Without dead ends: 7379 [2019-10-07 00:58:55,252 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2019-10-07 00:58:55,260 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7379 states. [2019-10-07 00:58:55,521 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7379 to 7289. [2019-10-07 00:58:55,521 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7289 states. [2019-10-07 00:58:55,545 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7289 states to 7289 states and 11437 transitions. [2019-10-07 00:58:55,546 INFO L78 Accepts]: Start accepts. Automaton has 7289 states and 11437 transitions. Word has length 172 [2019-10-07 00:58:55,546 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-07 00:58:55,546 INFO L462 AbstractCegarLoop]: Abstraction has 7289 states and 11437 transitions. [2019-10-07 00:58:55,546 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-07 00:58:55,547 INFO L276 IsEmpty]: Start isEmpty. Operand 7289 states and 11437 transitions. [2019-10-07 00:58:55,584 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 184 [2019-10-07 00:58:55,584 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 00:58:55,585 INFO L385 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 00:58:55,585 INFO L410 AbstractCegarLoop]: === Iteration 7 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 00:58:55,589 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 00:58:55,590 INFO L82 PathProgramCache]: Analyzing trace with hash -826231148, now seen corresponding path program 1 times [2019-10-07 00:58:55,590 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 00:58:55,590 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 00:58:55,591 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 00:58:55,591 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 00:58:55,591 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 00:58:55,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 00:58:55,758 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 38 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-07 00:58:55,758 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 00:58:55,758 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2019-10-07 00:58:55,758 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 00:58:56,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 00:58:56,010 INFO L256 TraceCheckSpWp]: Trace formula consists of 1001 conjuncts, 11 conjunts are in the unsatisfiable core [2019-10-07 00:58:56,031 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-07 00:58:56,124 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 20 proven. 0 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2019-10-07 00:58:56,124 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-10-07 00:58:56,321 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 28 proven. 8 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-10-07 00:58:56,321 INFO L211 tionRefinementEngine]: Constructing automaton from 1 perfect and 2 imperfect interpolant sequences. [2019-10-07 00:58:56,322 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [6, 5] total 10 [2019-10-07 00:58:56,322 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-07 00:58:56,323 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-07 00:58:56,323 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2019-10-07 00:58:56,323 INFO L87 Difference]: Start difference. First operand 7289 states and 11437 transitions. Second operand 5 states. [2019-10-07 00:58:57,881 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-07 00:58:57,881 INFO L93 Difference]: Finished difference Result 18473 states and 30530 transitions. [2019-10-07 00:58:57,882 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-10-07 00:58:57,882 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 183 [2019-10-07 00:58:57,882 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-07 00:58:57,955 INFO L225 Difference]: With dead ends: 18473 [2019-10-07 00:58:57,955 INFO L226 Difference]: Without dead ends: 11189 [2019-10-07 00:58:57,981 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 374 GetRequests, 363 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=37, Invalid=119, Unknown=0, NotChecked=0, Total=156 [2019-10-07 00:58:57,994 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11189 states. [2019-10-07 00:58:58,488 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11189 to 9843. [2019-10-07 00:58:58,488 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9843 states. [2019-10-07 00:58:58,515 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9843 states to 9843 states and 15070 transitions. [2019-10-07 00:58:58,515 INFO L78 Accepts]: Start accepts. Automaton has 9843 states and 15070 transitions. Word has length 183 [2019-10-07 00:58:58,516 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-07 00:58:58,516 INFO L462 AbstractCegarLoop]: Abstraction has 9843 states and 15070 transitions. [2019-10-07 00:58:58,516 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-07 00:58:58,516 INFO L276 IsEmpty]: Start isEmpty. Operand 9843 states and 15070 transitions. [2019-10-07 00:58:58,546 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 193 [2019-10-07 00:58:58,546 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 00:58:58,546 INFO L385 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 00:58:58,752 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-07 00:58:58,752 INFO L410 AbstractCegarLoop]: === Iteration 8 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 00:58:58,753 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 00:58:58,753 INFO L82 PathProgramCache]: Analyzing trace with hash -998229849, now seen corresponding path program 1 times [2019-10-07 00:58:58,754 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 00:58:58,754 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 00:58:58,754 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 00:58:58,754 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 00:58:58,755 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 00:58:58,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 00:58:58,919 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 56 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-07 00:58:58,919 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 00:58:58,919 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2019-10-07 00:58:58,920 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 00:58:59,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 00:58:59,130 INFO L256 TraceCheckSpWp]: Trace formula consists of 1005 conjuncts, 7 conjunts are in the unsatisfiable core [2019-10-07 00:58:59,143 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-07 00:58:59,207 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 56 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-07 00:58:59,207 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-10-07 00:58:59,315 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 56 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-07 00:58:59,315 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [2019-10-07 00:58:59,397 INFO L162 IcfgInterpreter]: Started Sifa with 153 locations of interest [2019-10-07 00:58:59,397 INFO L169 IcfgInterpreter]: Building call graph [2019-10-07 00:58:59,405 INFO L174 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-10-07 00:58:59,414 INFO L179 IcfgInterpreter]: Starting interpretation [2019-10-07 00:58:59,414 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2019-10-07 00:59:00,256 WARN L191 SmtUtils]: Spent 138.00 ms on a formula simplification that was a NOOP. DAG size: 182 [2019-10-07 00:59:00,460 INFO L199 IcfgInterpreter]: Interpreting procedure main with input of size 206 for LOIs [2019-10-07 00:59:00,717 WARN L191 SmtUtils]: Spent 114.00 ms on a formula simplification that was a NOOP. DAG size: 298 [2019-10-07 00:59:01,016 WARN L191 SmtUtils]: Spent 119.00 ms on a formula simplification that was a NOOP. DAG size: 304 [2019-10-07 00:59:01,319 WARN L191 SmtUtils]: Spent 136.00 ms on a formula simplification that was a NOOP. DAG size: 310 [2019-10-07 00:59:02,292 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-07 00:59:02,293 FATAL L? ?]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction has thrown an exception: java.lang.AssertionError: java.lang.IllegalArgumentException: Tried to insert element unknown in custom order: ε at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.tryExecuteInterpolantGenerator(TraceAbstractionRefinementEngine.java:295) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.generateProof(TraceAbstractionRefinementEngine.java:177) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.executeStrategy(TraceAbstractionRefinementEngine.java:167) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:90) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.RefinementEngineFactory.runRefinementEngine(RefinementEngineFactory.java:133) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:436) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterateInternal(AbstractCegarLoop.java:419) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:368) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.iterate(TraceAbstractionStarter.java:332) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:170) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:122) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:120) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:316) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:55) Caused by: java.lang.IllegalArgumentException: Tried to insert element unknown in custom order: ε at de.uni_freiburg.informatik.ultimate.lib.sifa.PriorityWorklist.add(PriorityWorklist.java:97) at de.uni_freiburg.informatik.ultimate.lib.sifa.DagInterpreter.lambda$2(DagInterpreter.java:135) at java.lang.Iterable.forEach(Iterable.java:75) at java.util.Collections$UnmodifiableCollection.forEach(Collections.java:1080) at de.uni_freiburg.informatik.ultimate.lib.sifa.DagInterpreter.interpret(DagInterpreter.java:135) at de.uni_freiburg.informatik.ultimate.lib.sifa.DagInterpreter.interpret(DagInterpreter.java:104) at de.uni_freiburg.informatik.ultimate.lib.sifa.summarizers.TopInputCallSummarizer.computeTopSummary(TopInputCallSummarizer.java:78) at java.util.HashMap.computeIfAbsent(HashMap.java:1127) at de.uni_freiburg.informatik.ultimate.lib.sifa.summarizers.TopInputCallSummarizer.summarize(TopInputCallSummarizer.java:67) at de.uni_freiburg.informatik.ultimate.lib.sifa.DagInterpreter.ipretCallReturnSummary(DagInterpreter.java:230) at de.uni_freiburg.informatik.ultimate.lib.sifa.DagInterpreter.ipretTransAndStoreLoiPred(DagInterpreter.java:214) at de.uni_freiburg.informatik.ultimate.lib.sifa.DagInterpreter.ipretTrans(DagInterpreter.java:197) at de.uni_freiburg.informatik.ultimate.lib.sifa.DagInterpreter.ipretNode(DagInterpreter.java:166) at de.uni_freiburg.informatik.ultimate.lib.sifa.DagInterpreter.interpret(DagInterpreter.java:130) at de.uni_freiburg.informatik.ultimate.lib.sifa.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 00:59:02,300 INFO L168 Benchmark]: Toolchain (without parser) took 22292.37 ms. Allocated memory was 138.4 MB in the beginning and 700.4 MB in the end (delta: 562.0 MB). Free memory was 97.0 MB in the beginning and 401.4 MB in the end (delta: -304.5 MB). Peak memory consumption was 257.6 MB. Max. memory is 7.1 GB. [2019-10-07 00:59:02,301 INFO L168 Benchmark]: CDTParser took 0.26 ms. Allocated memory is still 138.4 MB. Free memory was 120.4 MB in the beginning and 120.2 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. [2019-10-07 00:59:02,302 INFO L168 Benchmark]: CACSL2BoogieTranslator took 1357.77 ms. Allocated memory was 138.4 MB in the beginning and 205.5 MB in the end (delta: 67.1 MB). Free memory was 96.8 MB in the beginning and 125.5 MB in the end (delta: -28.8 MB). Peak memory consumption was 43.6 MB. Max. memory is 7.1 GB. [2019-10-07 00:59:02,303 INFO L168 Benchmark]: Boogie Preprocessor took 208.86 ms. Allocated memory is still 205.5 MB. Free memory was 125.5 MB in the beginning and 113.5 MB in the end (delta: 12.1 MB). Peak memory consumption was 12.1 MB. Max. memory is 7.1 GB. [2019-10-07 00:59:02,304 INFO L168 Benchmark]: RCFGBuilder took 3323.21 ms. Allocated memory was 205.5 MB in the beginning and 314.6 MB in the end (delta: 109.1 MB). Free memory was 113.5 MB in the beginning and 259.1 MB in the end (delta: -145.6 MB). Peak memory consumption was 84.9 MB. Max. memory is 7.1 GB. [2019-10-07 00:59:02,305 INFO L168 Benchmark]: TraceAbstraction took 17397.83 ms. Allocated memory was 314.6 MB in the beginning and 700.4 MB in the end (delta: 385.9 MB). Free memory was 259.1 MB in the beginning and 401.4 MB in the end (delta: -142.3 MB). Peak memory consumption was 243.5 MB. Max. memory is 7.1 GB. [2019-10-07 00:59:02,313 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.26 ms. Allocated memory is still 138.4 MB. Free memory was 120.4 MB in the beginning and 120.2 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 1357.77 ms. Allocated memory was 138.4 MB in the beginning and 205.5 MB in the end (delta: 67.1 MB). Free memory was 96.8 MB in the beginning and 125.5 MB in the end (delta: -28.8 MB). Peak memory consumption was 43.6 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 208.86 ms. Allocated memory is still 205.5 MB. Free memory was 125.5 MB in the beginning and 113.5 MB in the end (delta: 12.1 MB). Peak memory consumption was 12.1 MB. Max. memory is 7.1 GB. * RCFGBuilder took 3323.21 ms. Allocated memory was 205.5 MB in the beginning and 314.6 MB in the end (delta: 109.1 MB). Free memory was 113.5 MB in the beginning and 259.1 MB in the end (delta: -145.6 MB). Peak memory consumption was 84.9 MB. Max. memory is 7.1 GB. * TraceAbstraction took 17397.83 ms. Allocated memory was 314.6 MB in the beginning and 700.4 MB in the end (delta: 385.9 MB). Free memory was 259.1 MB in the beginning and 401.4 MB in the end (delta: -142.3 MB). Peak memory consumption was 243.5 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: AssertionError: java.lang.IllegalArgumentException: Tried to insert element unknown in custom order: ε de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: AssertionError: java.lang.IllegalArgumentException: Tried to insert element unknown in custom order: ε: de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.tryExecuteInterpolantGenerator(TraceAbstractionRefinementEngine.java:295) RESULT: Ultimate could not prove your program: Toolchain returned no result. Received shutdown request...