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-f4eb214f-m [2019-10-13 21:41:42,039 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-10-13 21:41:42,042 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-10-13 21:41:42,054 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-10-13 21:41:42,055 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-10-13 21:41:42,056 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-10-13 21:41:42,057 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-10-13 21:41:42,059 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-10-13 21:41:42,061 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-10-13 21:41:42,062 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-10-13 21:41:42,063 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-10-13 21:41:42,065 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-10-13 21:41:42,065 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-10-13 21:41:42,066 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-10-13 21:41:42,067 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-10-13 21:41:42,069 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-10-13 21:41:42,070 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-10-13 21:41:42,071 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-10-13 21:41:42,072 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-10-13 21:41:42,074 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-10-13 21:41:42,076 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-10-13 21:41:42,077 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-10-13 21:41:42,078 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-10-13 21:41:42,079 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-10-13 21:41:42,081 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-10-13 21:41:42,081 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-10-13 21:41:42,082 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-10-13 21:41:42,083 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-10-13 21:41:42,083 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-10-13 21:41:42,084 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-10-13 21:41:42,084 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-10-13 21:41:42,085 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-10-13 21:41:42,086 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-10-13 21:41:42,087 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-10-13 21:41:42,088 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-10-13 21:41:42,088 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-10-13 21:41:42,089 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-10-13 21:41:42,089 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-10-13 21:41:42,089 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-10-13 21:41:42,090 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-10-13 21:41:42,091 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-10-13 21:41:42,092 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2019-10-13 21:41:42,106 INFO L113 SettingsManager]: Loading preferences was successful [2019-10-13 21:41:42,107 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-10-13 21:41:42,108 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-10-13 21:41:42,108 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-10-13 21:41:42,108 INFO L138 SettingsManager]: * Use SBE=true [2019-10-13 21:41:42,109 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-10-13 21:41:42,109 INFO L138 SettingsManager]: * sizeof long=4 [2019-10-13 21:41:42,109 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-10-13 21:41:42,109 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-10-13 21:41:42,110 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-10-13 21:41:42,110 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-10-13 21:41:42,110 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-10-13 21:41:42,110 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-10-13 21:41:42,110 INFO L138 SettingsManager]: * sizeof long double=12 [2019-10-13 21:41:42,111 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-10-13 21:41:42,111 INFO L138 SettingsManager]: * Use constant arrays=true [2019-10-13 21:41:42,111 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-10-13 21:41:42,111 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-10-13 21:41:42,111 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-10-13 21:41:42,112 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-10-13 21:41:42,112 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-10-13 21:41:42,112 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-13 21:41:42,112 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-10-13 21:41:42,112 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-10-13 21:41:42,113 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-10-13 21:41:42,113 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-10-13 21:41:42,113 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-10-13 21:41:42,113 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-10-13 21:41:42,114 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Trace refinement strategy -> SIFA_TAIPAN Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.sifa: Abstract Domain -> CompoundDomain Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder: Size of a code block -> LoopFreeBlock Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.sifa: Call Summarizer -> TopInputCallSummarizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.sifa: Fluid -> SizeLimitFluid Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.sifa: Simplification Technique -> SIMPLIFY_QUICK [2019-10-13 21:41:42,410 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-10-13 21:41:42,423 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-10-13 21:41:42,426 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-10-13 21:41:42,428 INFO L271 PluginConnector]: Initializing CDTParser... [2019-10-13 21:41:42,428 INFO L275 PluginConnector]: CDTParser initialized [2019-10-13 21:41:42,429 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-13 21:41:42,490 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7ca738552/50fdaedf5f384f8cb97c21c470e01e7e/FLAG4e675874b [2019-10-13 21:41:43,127 INFO L306 CDTParser]: Found 1 translation units. [2019-10-13 21:41:43,128 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/eca-rers2012/Problem03_label27.c [2019-10-13 21:41:43,150 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7ca738552/50fdaedf5f384f8cb97c21c470e01e7e/FLAG4e675874b [2019-10-13 21:41:43,338 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7ca738552/50fdaedf5f384f8cb97c21c470e01e7e [2019-10-13 21:41:43,350 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-10-13 21:41:43,352 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-10-13 21:41:43,354 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-10-13 21:41:43,354 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-10-13 21:41:43,358 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-10-13 21:41:43,359 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 09:41:43" (1/1) ... [2019-10-13 21:41:43,362 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2837cd28 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:41:43, skipping insertion in model container [2019-10-13 21:41:43,363 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 09:41:43" (1/1) ... [2019-10-13 21:41:43,371 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-10-13 21:41:43,459 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-10-13 21:41:44,231 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-13 21:41:44,238 INFO L188 MainTranslator]: Completed pre-run [2019-10-13 21:41:44,469 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-13 21:41:44,498 INFO L192 MainTranslator]: Completed translation [2019-10-13 21:41:44,499 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:41:44 WrapperNode [2019-10-13 21:41:44,499 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-10-13 21:41:44,500 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-10-13 21:41:44,500 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-10-13 21:41:44,501 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-10-13 21:41:44,520 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:41:44" (1/1) ... [2019-10-13 21:41:44,521 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:41:44" (1/1) ... [2019-10-13 21:41:44,569 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:41:44" (1/1) ... [2019-10-13 21:41:44,569 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:41:44" (1/1) ... [2019-10-13 21:41:44,632 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:41:44" (1/1) ... [2019-10-13 21:41:44,648 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:41:44" (1/1) ... [2019-10-13 21:41:44,658 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:41:44" (1/1) ... [2019-10-13 21:41:44,673 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-10-13 21:41:44,674 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-10-13 21:41:44,674 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-10-13 21:41:44,674 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-10-13 21:41:44,675 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:41:44" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-13 21:41:44,751 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-10-13 21:41:44,752 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-10-13 21:41:44,752 INFO L138 BoogieDeclarations]: Found implementation of procedure calculate_output [2019-10-13 21:41:44,752 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-10-13 21:41:44,752 INFO L130 BoogieDeclarations]: Found specification of procedure calculate_output [2019-10-13 21:41:44,752 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-10-13 21:41:44,752 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-10-13 21:41:44,752 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2019-10-13 21:41:44,753 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-10-13 21:41:44,753 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-10-13 21:41:44,753 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-10-13 21:41:47,877 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-10-13 21:41:47,877 INFO L284 CfgBuilder]: Removed 1 assume(true) statements. [2019-10-13 21:41:47,879 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 09:41:47 BoogieIcfgContainer [2019-10-13 21:41:47,879 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-10-13 21:41:47,880 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-10-13 21:41:47,880 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-10-13 21:41:47,883 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-10-13 21:41:47,884 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.10 09:41:43" (1/3) ... [2019-10-13 21:41:47,885 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2eb47625 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 09:41:47, skipping insertion in model container [2019-10-13 21:41:47,885 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:41:44" (2/3) ... [2019-10-13 21:41:47,885 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2eb47625 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 09:41:47, skipping insertion in model container [2019-10-13 21:41:47,886 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 09:41:47" (3/3) ... [2019-10-13 21:41:47,888 INFO L109 eAbstractionObserver]: Analyzing ICFG Problem03_label27.c [2019-10-13 21:41:47,898 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-10-13 21:41:47,907 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-10-13 21:41:47,919 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-10-13 21:41:47,947 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-10-13 21:41:47,947 INFO L374 AbstractCegarLoop]: Hoare is true [2019-10-13 21:41:47,948 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-10-13 21:41:47,948 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-10-13 21:41:47,948 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-10-13 21:41:47,948 INFO L378 AbstractCegarLoop]: Difference is false [2019-10-13 21:41:47,948 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-10-13 21:41:47,948 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-10-13 21:41:47,973 INFO L276 IsEmpty]: Start isEmpty. Operand 158 states. [2019-10-13 21:41:47,989 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 150 [2019-10-13 21:41:47,989 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:41:47,991 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 21:41:47,993 INFO L410 AbstractCegarLoop]: === Iteration 1 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:41:47,999 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:41:48,000 INFO L82 PathProgramCache]: Analyzing trace with hash 136466214, now seen corresponding path program 1 times [2019-10-13 21:41:48,010 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-13 21:41:48,010 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [387267208] [2019-10-13 21:41:48,011 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:41:48,011 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:41:48,011 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:41:48,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:41:48,783 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-13 21:41:48,784 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [387267208] [2019-10-13 21:41:48,785 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:41:48,786 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-13 21:41:48,786 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1509520748] [2019-10-13 21:41:48,794 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-13 21:41:48,794 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-13 21:41:48,810 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-13 21:41:48,811 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-13 21:41:48,813 INFO L87 Difference]: Start difference. First operand 158 states. Second operand 3 states. [2019-10-13 21:41:49,873 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:41:49,874 INFO L93 Difference]: Finished difference Result 462 states and 886 transitions. [2019-10-13 21:41:49,878 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-13 21:41:49,879 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 149 [2019-10-13 21:41:49,881 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:41:49,898 INFO L225 Difference]: With dead ends: 462 [2019-10-13 21:41:49,898 INFO L226 Difference]: Without dead ends: 301 [2019-10-13 21:41:49,903 INFO L600 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-13 21:41:49,925 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 301 states. [2019-10-13 21:41:49,976 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 301 to 301. [2019-10-13 21:41:49,978 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 301 states. [2019-10-13 21:41:49,981 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 301 states to 301 states and 569 transitions. [2019-10-13 21:41:49,983 INFO L78 Accepts]: Start accepts. Automaton has 301 states and 569 transitions. Word has length 149 [2019-10-13 21:41:49,984 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:41:49,984 INFO L462 AbstractCegarLoop]: Abstraction has 301 states and 569 transitions. [2019-10-13 21:41:49,984 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-13 21:41:49,984 INFO L276 IsEmpty]: Start isEmpty. Operand 301 states and 569 transitions. [2019-10-13 21:41:49,990 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 158 [2019-10-13 21:41:49,990 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:41:49,990 INFO L380 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-13 21:41:49,991 INFO L410 AbstractCegarLoop]: === Iteration 2 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:41:49,991 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:41:49,991 INFO L82 PathProgramCache]: Analyzing trace with hash -20879962, now seen corresponding path program 1 times [2019-10-13 21:41:49,992 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-13 21:41:49,992 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1530121426] [2019-10-13 21:41:49,992 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:41:49,992 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:41:49,992 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:41:50,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:41:50,158 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-13 21:41:50,158 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1530121426] [2019-10-13 21:41:50,158 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:41:50,159 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-13 21:41:50,159 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [870676383] [2019-10-13 21:41:50,162 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-13 21:41:50,162 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-13 21:41:50,163 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-13 21:41:50,163 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-13 21:41:50,163 INFO L87 Difference]: Start difference. First operand 301 states and 569 transitions. Second operand 5 states. [2019-10-13 21:41:51,651 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:41:51,651 INFO L93 Difference]: Finished difference Result 917 states and 1763 transitions. [2019-10-13 21:41:51,652 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-10-13 21:41:51,652 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 157 [2019-10-13 21:41:51,653 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:41:51,660 INFO L225 Difference]: With dead ends: 917 [2019-10-13 21:41:51,660 INFO L226 Difference]: Without dead ends: 621 [2019-10-13 21:41:51,663 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2019-10-13 21:41:51,665 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 621 states. [2019-10-13 21:41:51,745 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 621 to 603. [2019-10-13 21:41:51,745 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 603 states. [2019-10-13 21:41:51,753 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 603 states to 603 states and 1088 transitions. [2019-10-13 21:41:51,756 INFO L78 Accepts]: Start accepts. Automaton has 603 states and 1088 transitions. Word has length 157 [2019-10-13 21:41:51,756 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:41:51,756 INFO L462 AbstractCegarLoop]: Abstraction has 603 states and 1088 transitions. [2019-10-13 21:41:51,756 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-13 21:41:51,757 INFO L276 IsEmpty]: Start isEmpty. Operand 603 states and 1088 transitions. [2019-10-13 21:41:51,768 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 162 [2019-10-13 21:41:51,769 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:41:51,769 INFO L380 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-13 21:41:51,769 INFO L410 AbstractCegarLoop]: === Iteration 3 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:41:51,769 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:41:51,770 INFO L82 PathProgramCache]: Analyzing trace with hash -1532435694, now seen corresponding path program 1 times [2019-10-13 21:41:51,770 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-13 21:41:51,770 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [671111386] [2019-10-13 21:41:51,770 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:41:51,771 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:41:51,771 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:41:51,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:41:52,048 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-13 21:41:52,048 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [671111386] [2019-10-13 21:41:52,049 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:41:52,049 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-13 21:41:52,049 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1031876390] [2019-10-13 21:41:52,050 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-13 21:41:52,050 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-13 21:41:52,051 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-13 21:41:52,051 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-13 21:41:52,051 INFO L87 Difference]: Start difference. First operand 603 states and 1088 transitions. Second operand 3 states. [2019-10-13 21:41:53,244 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:41:53,245 INFO L93 Difference]: Finished difference Result 1793 states and 3296 transitions. [2019-10-13 21:41:53,246 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-13 21:41:53,247 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 161 [2019-10-13 21:41:53,248 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:41:53,263 INFO L225 Difference]: With dead ends: 1793 [2019-10-13 21:41:53,263 INFO L226 Difference]: Without dead ends: 1195 [2019-10-13 21:41:53,267 INFO L600 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-13 21:41:53,277 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1195 states. [2019-10-13 21:41:53,339 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1195 to 1195. [2019-10-13 21:41:53,340 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1195 states. [2019-10-13 21:41:53,351 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1195 states to 1195 states and 2022 transitions. [2019-10-13 21:41:53,351 INFO L78 Accepts]: Start accepts. Automaton has 1195 states and 2022 transitions. Word has length 161 [2019-10-13 21:41:53,353 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:41:53,353 INFO L462 AbstractCegarLoop]: Abstraction has 1195 states and 2022 transitions. [2019-10-13 21:41:53,353 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-13 21:41:53,353 INFO L276 IsEmpty]: Start isEmpty. Operand 1195 states and 2022 transitions. [2019-10-13 21:41:53,362 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 164 [2019-10-13 21:41:53,362 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:41:53,362 INFO L380 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-13 21:41:53,363 INFO L410 AbstractCegarLoop]: === Iteration 4 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:41:53,364 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:41:53,364 INFO L82 PathProgramCache]: Analyzing trace with hash -478381842, now seen corresponding path program 1 times [2019-10-13 21:41:53,364 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-13 21:41:53,365 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [853948747] [2019-10-13 21:41:53,365 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:41:53,365 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:41:53,365 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:41:53,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:41:53,655 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-13 21:41:53,656 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [853948747] [2019-10-13 21:41:53,656 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:41:53,656 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-13 21:41:53,657 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [572254059] [2019-10-13 21:41:53,658 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-13 21:41:53,658 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-13 21:41:53,658 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-13 21:41:53,659 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-13 21:41:53,659 INFO L87 Difference]: Start difference. First operand 1195 states and 2022 transitions. Second operand 3 states. [2019-10-13 21:41:54,794 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:41:54,794 INFO L93 Difference]: Finished difference Result 3279 states and 5801 transitions. [2019-10-13 21:41:54,795 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-13 21:41:54,795 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 163 [2019-10-13 21:41:54,796 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:41:54,812 INFO L225 Difference]: With dead ends: 3279 [2019-10-13 21:41:54,812 INFO L226 Difference]: Without dead ends: 2089 [2019-10-13 21:41:54,816 INFO L600 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-13 21:41:54,819 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2089 states. [2019-10-13 21:41:54,881 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2089 to 2089. [2019-10-13 21:41:54,882 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2089 states. [2019-10-13 21:41:54,893 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2089 states to 2089 states and 3518 transitions. [2019-10-13 21:41:54,894 INFO L78 Accepts]: Start accepts. Automaton has 2089 states and 3518 transitions. Word has length 163 [2019-10-13 21:41:54,894 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:41:54,895 INFO L462 AbstractCegarLoop]: Abstraction has 2089 states and 3518 transitions. [2019-10-13 21:41:54,895 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-13 21:41:54,895 INFO L276 IsEmpty]: Start isEmpty. Operand 2089 states and 3518 transitions. [2019-10-13 21:41:54,904 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 172 [2019-10-13 21:41:54,904 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:41:54,904 INFO L380 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-13 21:41:54,905 INFO L410 AbstractCegarLoop]: === Iteration 5 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:41:54,905 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:41:54,905 INFO L82 PathProgramCache]: Analyzing trace with hash 436280232, now seen corresponding path program 1 times [2019-10-13 21:41:54,905 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-13 21:41:54,906 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [153726090] [2019-10-13 21:41:54,906 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:41:54,906 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:41:54,906 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:41:54,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:41:55,025 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-13 21:41:55,025 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [153726090] [2019-10-13 21:41:55,026 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:41:55,026 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-13 21:41:55,026 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2123726127] [2019-10-13 21:41:55,027 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-13 21:41:55,027 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-13 21:41:55,028 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-13 21:41:55,028 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-10-13 21:41:55,028 INFO L87 Difference]: Start difference. First operand 2089 states and 3518 transitions. Second operand 6 states. [2019-10-13 21:41:56,489 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:41:56,491 INFO L93 Difference]: Finished difference Result 6222 states and 11450 transitions. [2019-10-13 21:41:56,492 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-10-13 21:41:56,492 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 171 [2019-10-13 21:41:56,492 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:41:56,530 INFO L225 Difference]: With dead ends: 6222 [2019-10-13 21:41:56,530 INFO L226 Difference]: Without dead ends: 4138 [2019-10-13 21:41:56,537 INFO L600 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-13 21:41:56,542 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4138 states. [2019-10-13 21:41:56,689 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4138 to 4074. [2019-10-13 21:41:56,690 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4074 states. [2019-10-13 21:41:56,713 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4074 states to 4074 states and 6862 transitions. [2019-10-13 21:41:56,714 INFO L78 Accepts]: Start accepts. Automaton has 4074 states and 6862 transitions. Word has length 171 [2019-10-13 21:41:56,714 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:41:56,714 INFO L462 AbstractCegarLoop]: Abstraction has 4074 states and 6862 transitions. [2019-10-13 21:41:56,714 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-13 21:41:56,714 INFO L276 IsEmpty]: Start isEmpty. Operand 4074 states and 6862 transitions. [2019-10-13 21:41:56,730 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 173 [2019-10-13 21:41:56,730 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:41:56,730 INFO L380 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-13 21:41:56,731 INFO L410 AbstractCegarLoop]: === Iteration 6 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:41:56,731 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:41:56,731 INFO L82 PathProgramCache]: Analyzing trace with hash -1768177375, now seen corresponding path program 1 times [2019-10-13 21:41:56,732 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-13 21:41:56,732 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1960693348] [2019-10-13 21:41:56,732 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:41:56,732 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:41:56,732 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:41:56,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:41:56,888 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-13 21:41:56,889 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1960693348] [2019-10-13 21:41:56,890 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:41:56,891 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-13 21:41:56,891 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [267093709] [2019-10-13 21:41:56,893 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-13 21:41:56,893 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-13 21:41:56,894 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-13 21:41:56,894 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-10-13 21:41:56,895 INFO L87 Difference]: Start difference. First operand 4074 states and 6862 transitions. Second operand 6 states. [2019-10-13 21:41:58,294 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:41:58,294 INFO L93 Difference]: Finished difference Result 11448 states and 20886 transitions. [2019-10-13 21:41:58,295 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-10-13 21:41:58,295 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 172 [2019-10-13 21:41:58,295 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:41:58,347 INFO L225 Difference]: With dead ends: 11448 [2019-10-13 21:41:58,348 INFO L226 Difference]: Without dead ends: 7379 [2019-10-13 21:41:58,365 INFO L600 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-13 21:41:58,374 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7379 states. [2019-10-13 21:41:58,636 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7379 to 7289. [2019-10-13 21:41:58,637 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7289 states. [2019-10-13 21:41:58,656 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7289 states to 7289 states and 11437 transitions. [2019-10-13 21:41:58,657 INFO L78 Accepts]: Start accepts. Automaton has 7289 states and 11437 transitions. Word has length 172 [2019-10-13 21:41:58,657 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:41:58,657 INFO L462 AbstractCegarLoop]: Abstraction has 7289 states and 11437 transitions. [2019-10-13 21:41:58,657 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-13 21:41:58,658 INFO L276 IsEmpty]: Start isEmpty. Operand 7289 states and 11437 transitions. [2019-10-13 21:41:58,679 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 184 [2019-10-13 21:41:58,681 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:41:58,683 INFO L380 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-13 21:41:58,683 INFO L410 AbstractCegarLoop]: === Iteration 7 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:41:58,683 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:41:58,684 INFO L82 PathProgramCache]: Analyzing trace with hash -826231148, now seen corresponding path program 1 times [2019-10-13 21:41:58,684 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-13 21:41:58,684 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2002557458] [2019-10-13 21:41:58,684 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:41:58,684 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:41:58,685 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:41:58,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:41:58,832 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-13 21:41:58,832 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2002557458] [2019-10-13 21:41:58,832 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1839042090] [2019-10-13 21:41:58,833 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-13 21:41:59,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:41:59,158 INFO L256 TraceCheckSpWp]: Trace formula consists of 1001 conjuncts, 11 conjunts are in the unsatisfiable core [2019-10-13 21:41:59,295 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-13 21:41:59,416 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-13 21:41:59,417 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-10-13 21:41:59,555 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-13 21:41:59,557 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 2 imperfect interpolant sequences. [2019-10-13 21:41:59,558 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [6, 5] total 10 [2019-10-13 21:41:59,558 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [995653929] [2019-10-13 21:41:59,558 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-13 21:41:59,559 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-13 21:41:59,559 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-13 21:41:59,559 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2019-10-13 21:41:59,559 INFO L87 Difference]: Start difference. First operand 7289 states and 11437 transitions. Second operand 5 states. [2019-10-13 21:42:01,182 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:42:01,183 INFO L93 Difference]: Finished difference Result 18473 states and 30530 transitions. [2019-10-13 21:42:01,183 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-10-13 21:42:01,183 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 183 [2019-10-13 21:42:01,183 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:42:01,257 INFO L225 Difference]: With dead ends: 18473 [2019-10-13 21:42:01,257 INFO L226 Difference]: Without dead ends: 11189 [2019-10-13 21:42:01,279 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 374 GetRequests, 363 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=37, Invalid=119, Unknown=0, NotChecked=0, Total=156 [2019-10-13 21:42:01,293 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11189 states. [2019-10-13 21:42:01,630 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11189 to 9843. [2019-10-13 21:42:01,631 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9843 states. [2019-10-13 21:42:01,657 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9843 states to 9843 states and 15070 transitions. [2019-10-13 21:42:01,658 INFO L78 Accepts]: Start accepts. Automaton has 9843 states and 15070 transitions. Word has length 183 [2019-10-13 21:42:01,658 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:42:01,658 INFO L462 AbstractCegarLoop]: Abstraction has 9843 states and 15070 transitions. [2019-10-13 21:42:01,658 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-13 21:42:01,659 INFO L276 IsEmpty]: Start isEmpty. Operand 9843 states and 15070 transitions. [2019-10-13 21:42:01,687 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 193 [2019-10-13 21:42:01,688 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:42:01,688 INFO L380 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-13 21:42:01,893 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-13 21:42:01,894 INFO L410 AbstractCegarLoop]: === Iteration 8 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:42:01,894 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:42:01,894 INFO L82 PathProgramCache]: Analyzing trace with hash -998229849, now seen corresponding path program 1 times [2019-10-13 21:42:01,895 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-13 21:42:01,895 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [882054770] [2019-10-13 21:42:01,896 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:42:01,896 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:42:01,896 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:42:01,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:42:02,087 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-13 21:42:02,088 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [882054770] [2019-10-13 21:42:02,088 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [449953568] [2019-10-13 21:42:02,088 INFO L94 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-13 21:42:02,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:42:02,321 INFO L256 TraceCheckSpWp]: Trace formula consists of 1005 conjuncts, 7 conjunts are in the unsatisfiable core [2019-10-13 21:42:02,333 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-13 21:42:02,393 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-13 21:42:02,394 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-10-13 21:42:02,483 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-13 21:42:02,483 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1674611792] [2019-10-13 21:42:02,557 INFO L162 IcfgInterpreter]: Started Sifa with 153 locations of interest [2019-10-13 21:42:02,557 INFO L169 IcfgInterpreter]: Building call graph [2019-10-13 21:42:02,568 INFO L174 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-10-13 21:42:02,577 INFO L179 IcfgInterpreter]: Starting interpretation [2019-10-13 21:42:02,577 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2019-10-13 21:42:02,924 WARN L191 SmtUtils]: Spent 131.00 ms on a formula simplification that was a NOOP. DAG size: 182 [2019-10-13 21:42:03,278 WARN L191 SmtUtils]: Spent 125.00 ms on a formula simplification that was a NOOP. DAG size: 182 [2019-10-13 21:42:03,951 INFO L199 IcfgInterpreter]: Interpreting procedure main with input of size 206 for LOIs [2019-10-13 21:42:04,249 WARN L191 SmtUtils]: Spent 134.00 ms on a formula simplification that was a NOOP. DAG size: 298 [2019-10-13 21:42:04,595 WARN L191 SmtUtils]: Spent 185.00 ms on a formula simplification that was a NOOP. DAG size: 304 [2019-10-13 21:42:04,879 WARN L191 SmtUtils]: Spent 121.00 ms on a formula simplification that was a NOOP. DAG size: 310 [2019-10-13 21:42:05,174 WARN L191 SmtUtils]: Spent 118.00 ms on a formula simplification that was a NOOP. DAG size: 278 [2019-10-13 21:42:05,825 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-13 21:42:05,826 FATAL L? ?]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction has thrown an exception: java.lang.AssertionError: java.lang.IllegalArgumentException: Tried to insert element unknown in custom order: ε at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.tryExecuteInterpolantGenerator(TraceAbstractionRefinementEngine.java:307) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.generateProof(TraceAbstractionRefinementEngine.java:184) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.executeStrategy(TraceAbstractionRefinementEngine.java:174) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.RefinementEngineFactory.runRefinementEngine(RefinementEngineFactory.java:124) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterateInternal(AbstractCegarLoop.java:419) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:368) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.iterate(TraceAbstractionStarter.java:332) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:170) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:122) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:120) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:316) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:55) Caused by: java.lang.IllegalArgumentException: Tried to insert element unknown in custom order: ε at de.uni_freiburg.informatik.ultimate.lib.sifa.PriorityWorklist.add(PriorityWorklist.java:97) at de.uni_freiburg.informatik.ultimate.lib.sifa.DagInterpreter.lambda$2(DagInterpreter.java:135) at java.lang.Iterable.forEach(Iterable.java:75) at java.util.Collections$UnmodifiableCollection.forEach(Collections.java:1080) at de.uni_freiburg.informatik.ultimate.lib.sifa.DagInterpreter.interpret(DagInterpreter.java:135) at de.uni_freiburg.informatik.ultimate.lib.sifa.DagInterpreter.interpret(DagInterpreter.java:104) at de.uni_freiburg.informatik.ultimate.lib.sifa.summarizers.TopInputCallSummarizer.computeTopSummary(TopInputCallSummarizer.java:78) at java.util.HashMap.computeIfAbsent(HashMap.java:1127) at de.uni_freiburg.informatik.ultimate.lib.sifa.summarizers.TopInputCallSummarizer.summarize(TopInputCallSummarizer.java:67) at de.uni_freiburg.informatik.ultimate.lib.sifa.DagInterpreter.ipretCallReturnSummary(DagInterpreter.java:230) at de.uni_freiburg.informatik.ultimate.lib.sifa.DagInterpreter.ipretTransAndStoreLoiPred(DagInterpreter.java:214) at de.uni_freiburg.informatik.ultimate.lib.sifa.DagInterpreter.ipretTrans(DagInterpreter.java:197) at de.uni_freiburg.informatik.ultimate.lib.sifa.DagInterpreter.ipretNode(DagInterpreter.java:166) at de.uni_freiburg.informatik.ultimate.lib.sifa.DagInterpreter.interpret(DagInterpreter.java:130) at de.uni_freiburg.informatik.ultimate.lib.sifa.IcfgInterpreter.interpretLoisInProcedure(IcfgInterpreter.java:139) at de.uni_freiburg.informatik.ultimate.lib.sifa.IcfgInterpreter.interpret(IcfgInterpreter.java:129) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:102) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:67) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.tryExecuteInterpolantGenerator(TraceAbstractionRefinementEngine.java:299) ... 21 more [2019-10-13 21:42:05,834 INFO L168 Benchmark]: Toolchain (without parser) took 22481.29 ms. Allocated memory was 144.2 MB in the beginning and 659.0 MB in the end (delta: 514.9 MB). Free memory was 96.6 MB in the beginning and 176.2 MB in the end (delta: -79.6 MB). Peak memory consumption was 435.3 MB. Max. memory is 7.1 GB. [2019-10-13 21:42:05,835 INFO L168 Benchmark]: CDTParser took 0.19 ms. Allocated memory is still 144.2 MB. Free memory was 120.5 MB in the beginning and 120.3 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. [2019-10-13 21:42:05,836 INFO L168 Benchmark]: CACSL2BoogieTranslator took 1146.14 ms. Allocated memory was 144.2 MB in the beginning and 207.1 MB in the end (delta: 62.9 MB). Free memory was 96.4 MB in the beginning and 130.2 MB in the end (delta: -33.8 MB). Peak memory consumption was 37.1 MB. Max. memory is 7.1 GB. [2019-10-13 21:42:05,836 INFO L168 Benchmark]: Boogie Preprocessor took 173.24 ms. Allocated memory is still 207.1 MB. Free memory was 130.2 MB in the beginning and 118.3 MB in the end (delta: 11.9 MB). Peak memory consumption was 11.9 MB. Max. memory is 7.1 GB. [2019-10-13 21:42:05,837 INFO L168 Benchmark]: RCFGBuilder took 3205.38 ms. Allocated memory was 207.1 MB in the beginning and 312.5 MB in the end (delta: 105.4 MB). Free memory was 118.3 MB in the beginning and 263.4 MB in the end (delta: -145.1 MB). Peak memory consumption was 90.6 MB. Max. memory is 7.1 GB. [2019-10-13 21:42:05,838 INFO L168 Benchmark]: TraceAbstraction took 17951.75 ms. Allocated memory was 312.5 MB in the beginning and 659.0 MB in the end (delta: 346.6 MB). Free memory was 263.4 MB in the beginning and 176.2 MB in the end (delta: 87.2 MB). Peak memory consumption was 433.8 MB. Max. memory is 7.1 GB. [2019-10-13 21:42:05,843 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.19 ms. Allocated memory is still 144.2 MB. Free memory was 120.5 MB in the beginning and 120.3 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 1146.14 ms. Allocated memory was 144.2 MB in the beginning and 207.1 MB in the end (delta: 62.9 MB). Free memory was 96.4 MB in the beginning and 130.2 MB in the end (delta: -33.8 MB). Peak memory consumption was 37.1 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 173.24 ms. Allocated memory is still 207.1 MB. Free memory was 130.2 MB in the beginning and 118.3 MB in the end (delta: 11.9 MB). Peak memory consumption was 11.9 MB. Max. memory is 7.1 GB. * RCFGBuilder took 3205.38 ms. Allocated memory was 207.1 MB in the beginning and 312.5 MB in the end (delta: 105.4 MB). Free memory was 118.3 MB in the beginning and 263.4 MB in the end (delta: -145.1 MB). Peak memory consumption was 90.6 MB. Max. memory is 7.1 GB. * TraceAbstraction took 17951.75 ms. Allocated memory was 312.5 MB in the beginning and 659.0 MB in the end (delta: 346.6 MB). Free memory was 263.4 MB in the beginning and 176.2 MB in the end (delta: 87.2 MB). Peak memory consumption was 433.8 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: AssertionError: java.lang.IllegalArgumentException: Tried to insert element unknown in custom order: ε de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: AssertionError: java.lang.IllegalArgumentException: Tried to insert element unknown in custom order: ε: de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.tryExecuteInterpolantGenerator(TraceAbstractionRefinementEngine.java:307) RESULT: Ultimate could not prove your program: Toolchain returned no result. Received shutdown request...