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_label56.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-f4eb214f-m [2019-10-13 21:42:02,961 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-10-13 21:42:02,965 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-10-13 21:42:02,985 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-10-13 21:42:02,985 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-10-13 21:42:02,986 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-10-13 21:42:02,987 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-10-13 21:42:02,989 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-10-13 21:42:02,993 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-10-13 21:42:02,994 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-10-13 21:42:02,995 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-10-13 21:42:02,998 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-10-13 21:42:02,999 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-10-13 21:42:03,000 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-10-13 21:42:03,004 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-10-13 21:42:03,005 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-10-13 21:42:03,006 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-10-13 21:42:03,007 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-10-13 21:42:03,008 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-10-13 21:42:03,010 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-10-13 21:42:03,012 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-10-13 21:42:03,013 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-10-13 21:42:03,014 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-10-13 21:42:03,015 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-10-13 21:42:03,017 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-10-13 21:42:03,017 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-10-13 21:42:03,018 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-10-13 21:42:03,018 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-10-13 21:42:03,019 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-10-13 21:42:03,020 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-10-13 21:42:03,020 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-10-13 21:42:03,021 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-10-13 21:42:03,022 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-10-13 21:42:03,022 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-10-13 21:42:03,023 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-10-13 21:42:03,023 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-10-13 21:42:03,024 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-10-13 21:42:03,024 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-10-13 21:42:03,025 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-10-13 21:42:03,026 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-10-13 21:42:03,026 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-10-13 21:42:03,027 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2019-10-13 21:42:03,050 INFO L113 SettingsManager]: Loading preferences was successful [2019-10-13 21:42:03,050 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-10-13 21:42:03,052 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-10-13 21:42:03,052 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-10-13 21:42:03,053 INFO L138 SettingsManager]: * Use SBE=true [2019-10-13 21:42:03,053 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-10-13 21:42:03,053 INFO L138 SettingsManager]: * sizeof long=4 [2019-10-13 21:42:03,054 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-10-13 21:42:03,054 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-10-13 21:42:03,054 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-10-13 21:42:03,055 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-10-13 21:42:03,055 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-10-13 21:42:03,056 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-10-13 21:42:03,056 INFO L138 SettingsManager]: * sizeof long double=12 [2019-10-13 21:42:03,056 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-10-13 21:42:03,056 INFO L138 SettingsManager]: * Use constant arrays=true [2019-10-13 21:42:03,057 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-10-13 21:42:03,057 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-10-13 21:42:03,057 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-10-13 21:42:03,057 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-10-13 21:42:03,058 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-10-13 21:42:03,058 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-13 21:42:03,058 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-10-13 21:42:03,058 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-10-13 21:42:03,059 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-10-13 21:42:03,059 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-10-13 21:42:03,059 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-10-13 21:42:03,059 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-10-13 21:42:03,059 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:42:03,336 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-10-13 21:42:03,349 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-10-13 21:42:03,355 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-10-13 21:42:03,356 INFO L271 PluginConnector]: Initializing CDTParser... [2019-10-13 21:42:03,357 INFO L275 PluginConnector]: CDTParser initialized [2019-10-13 21:42:03,358 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/eca-rers2012/Problem03_label56.c [2019-10-13 21:42:03,439 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e0fe2e79e/fcba3594ad04474f9bdf1bd95b257786/FLAG9444179a4 [2019-10-13 21:42:04,061 INFO L306 CDTParser]: Found 1 translation units. [2019-10-13 21:42:04,062 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/eca-rers2012/Problem03_label56.c [2019-10-13 21:42:04,085 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e0fe2e79e/fcba3594ad04474f9bdf1bd95b257786/FLAG9444179a4 [2019-10-13 21:42:04,281 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e0fe2e79e/fcba3594ad04474f9bdf1bd95b257786 [2019-10-13 21:42:04,293 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-10-13 21:42:04,294 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-10-13 21:42:04,296 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-10-13 21:42:04,296 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-10-13 21:42:04,300 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-10-13 21:42:04,301 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 09:42:04" (1/1) ... [2019-10-13 21:42:04,304 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@47fbaaba and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:42:04, skipping insertion in model container [2019-10-13 21:42:04,304 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 09:42:04" (1/1) ... [2019-10-13 21:42:04,312 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-10-13 21:42:04,398 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-10-13 21:42:05,248 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-13 21:42:05,264 INFO L188 MainTranslator]: Completed pre-run [2019-10-13 21:42:05,540 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-13 21:42:05,566 INFO L192 MainTranslator]: Completed translation [2019-10-13 21:42:05,566 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:42:05 WrapperNode [2019-10-13 21:42:05,567 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-10-13 21:42:05,568 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-10-13 21:42:05,568 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-10-13 21:42:05,569 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-10-13 21:42:05,583 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:42:05" (1/1) ... [2019-10-13 21:42:05,583 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:42:05" (1/1) ... [2019-10-13 21:42:05,616 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:42:05" (1/1) ... [2019-10-13 21:42:05,617 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:42:05" (1/1) ... [2019-10-13 21:42:05,701 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:42:05" (1/1) ... [2019-10-13 21:42:05,731 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:42:05" (1/1) ... [2019-10-13 21:42:05,743 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:42:05" (1/1) ... [2019-10-13 21:42:05,759 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-10-13 21:42:05,760 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-10-13 21:42:05,760 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-10-13 21:42:05,760 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-10-13 21:42:05,761 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:42:05" (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:42:05,817 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-10-13 21:42:05,818 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-10-13 21:42:05,818 INFO L138 BoogieDeclarations]: Found implementation of procedure calculate_output [2019-10-13 21:42:05,818 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-10-13 21:42:05,818 INFO L130 BoogieDeclarations]: Found specification of procedure calculate_output [2019-10-13 21:42:05,819 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-10-13 21:42:05,820 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-10-13 21:42:05,820 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2019-10-13 21:42:05,820 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-10-13 21:42:05,820 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-10-13 21:42:05,820 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-10-13 21:42:09,147 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-10-13 21:42:09,148 INFO L284 CfgBuilder]: Removed 1 assume(true) statements. [2019-10-13 21:42:09,183 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 09:42:09 BoogieIcfgContainer [2019-10-13 21:42:09,184 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-10-13 21:42:09,185 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-10-13 21:42:09,187 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-10-13 21:42:09,191 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-10-13 21:42:09,192 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.10 09:42:04" (1/3) ... [2019-10-13 21:42:09,193 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@caad44a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 09:42:09, skipping insertion in model container [2019-10-13 21:42:09,193 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:42:05" (2/3) ... [2019-10-13 21:42:09,194 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@caad44a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 09:42:09, skipping insertion in model container [2019-10-13 21:42:09,194 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 09:42:09" (3/3) ... [2019-10-13 21:42:09,202 INFO L109 eAbstractionObserver]: Analyzing ICFG Problem03_label56.c [2019-10-13 21:42:09,215 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-10-13 21:42:09,225 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-10-13 21:42:09,236 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-10-13 21:42:09,266 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-10-13 21:42:09,266 INFO L374 AbstractCegarLoop]: Hoare is true [2019-10-13 21:42:09,266 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-10-13 21:42:09,266 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-10-13 21:42:09,266 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-10-13 21:42:09,267 INFO L378 AbstractCegarLoop]: Difference is false [2019-10-13 21:42:09,267 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-10-13 21:42:09,267 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-10-13 21:42:09,302 INFO L276 IsEmpty]: Start isEmpty. Operand 158 states. [2019-10-13 21:42:09,322 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 150 [2019-10-13 21:42:09,322 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:42:09,324 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:42:09,326 INFO L410 AbstractCegarLoop]: === Iteration 1 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:42:09,333 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:42:09,334 INFO L82 PathProgramCache]: Analyzing trace with hash 268795079, now seen corresponding path program 1 times [2019-10-13 21:42:09,344 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-13 21:42:09,344 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1075535290] [2019-10-13 21:42:09,345 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:42:09,345 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:42:09,345 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:42:09,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:42:10,110 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:42:10,110 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1075535290] [2019-10-13 21:42:10,111 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:42:10,112 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-13 21:42:10,112 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1785227759] [2019-10-13 21:42:10,117 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-13 21:42:10,117 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-13 21:42:10,132 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-13 21:42:10,133 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-13 21:42:10,135 INFO L87 Difference]: Start difference. First operand 158 states. Second operand 3 states. [2019-10-13 21:42:11,226 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:42:11,226 INFO L93 Difference]: Finished difference Result 462 states and 886 transitions. [2019-10-13 21:42:11,227 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-13 21:42:11,229 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 149 [2019-10-13 21:42:11,231 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:42:11,260 INFO L225 Difference]: With dead ends: 462 [2019-10-13 21:42:11,260 INFO L226 Difference]: Without dead ends: 301 [2019-10-13 21:42:11,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:42:11,288 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 301 states. [2019-10-13 21:42:11,392 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 301 to 301. [2019-10-13 21:42:11,395 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 301 states. [2019-10-13 21:42:11,399 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 301 states to 301 states and 535 transitions. [2019-10-13 21:42:11,401 INFO L78 Accepts]: Start accepts. Automaton has 301 states and 535 transitions. Word has length 149 [2019-10-13 21:42:11,408 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:42:11,408 INFO L462 AbstractCegarLoop]: Abstraction has 301 states and 535 transitions. [2019-10-13 21:42:11,409 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-13 21:42:11,410 INFO L276 IsEmpty]: Start isEmpty. Operand 301 states and 535 transitions. [2019-10-13 21:42:11,424 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 162 [2019-10-13 21:42:11,424 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:42:11,425 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:42:11,425 INFO L410 AbstractCegarLoop]: === Iteration 2 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:42:11,425 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:42:11,426 INFO L82 PathProgramCache]: Analyzing trace with hash -1139431629, now seen corresponding path program 1 times [2019-10-13 21:42:11,426 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-13 21:42:11,429 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [93586867] [2019-10-13 21:42:11,430 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:42:11,430 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:42:11,430 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:42:11,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:42:11,729 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:42:11,730 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [93586867] [2019-10-13 21:42:11,730 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:42:11,730 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-13 21:42:11,731 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1349254592] [2019-10-13 21:42:11,733 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-13 21:42:11,734 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-13 21:42:11,734 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-13 21:42:11,734 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-13 21:42:11,734 INFO L87 Difference]: Start difference. First operand 301 states and 535 transitions. Second operand 3 states. [2019-10-13 21:42:12,852 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:42:12,853 INFO L93 Difference]: Finished difference Result 891 states and 1606 transitions. [2019-10-13 21:42:12,853 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-13 21:42:12,853 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 161 [2019-10-13 21:42:12,854 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:42:12,860 INFO L225 Difference]: With dead ends: 891 [2019-10-13 21:42:12,860 INFO L226 Difference]: Without dead ends: 595 [2019-10-13 21:42:12,864 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:42:12,866 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 595 states. [2019-10-13 21:42:12,892 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 595 to 595. [2019-10-13 21:42:12,892 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 595 states. [2019-10-13 21:42:12,896 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 595 states to 595 states and 983 transitions. [2019-10-13 21:42:12,896 INFO L78 Accepts]: Start accepts. Automaton has 595 states and 983 transitions. Word has length 161 [2019-10-13 21:42:12,897 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:42:12,897 INFO L462 AbstractCegarLoop]: Abstraction has 595 states and 983 transitions. [2019-10-13 21:42:12,897 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-13 21:42:12,897 INFO L276 IsEmpty]: Start isEmpty. Operand 595 states and 983 transitions. [2019-10-13 21:42:12,902 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 164 [2019-10-13 21:42:12,902 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:42:12,902 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:42:12,903 INFO L410 AbstractCegarLoop]: === Iteration 3 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:42:12,903 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:42:12,903 INFO L82 PathProgramCache]: Analyzing trace with hash -763512625, now seen corresponding path program 1 times [2019-10-13 21:42:12,904 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-13 21:42:12,904 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1740770627] [2019-10-13 21:42:12,904 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:42:12,904 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:42:12,904 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:42:12,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:42:13,109 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:42:13,110 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1740770627] [2019-10-13 21:42:13,110 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:42:13,111 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-13 21:42:13,111 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1449480658] [2019-10-13 21:42:13,114 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-13 21:42:13,115 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-13 21:42:13,116 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-13 21:42:13,121 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-13 21:42:13,121 INFO L87 Difference]: Start difference. First operand 595 states and 983 transitions. Second operand 3 states. [2019-10-13 21:42:14,243 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:42:14,244 INFO L93 Difference]: Finished difference Result 1773 states and 2983 transitions. [2019-10-13 21:42:14,244 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-13 21:42:14,244 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 163 [2019-10-13 21:42:14,245 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:42:14,255 INFO L225 Difference]: With dead ends: 1773 [2019-10-13 21:42:14,255 INFO L226 Difference]: Without dead ends: 1183 [2019-10-13 21:42:14,260 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:42:14,263 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1183 states. [2019-10-13 21:42:14,301 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1183 to 1183. [2019-10-13 21:42:14,301 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1183 states. [2019-10-13 21:42:14,307 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1183 states to 1183 states and 1943 transitions. [2019-10-13 21:42:14,307 INFO L78 Accepts]: Start accepts. Automaton has 1183 states and 1943 transitions. Word has length 163 [2019-10-13 21:42:14,308 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:42:14,308 INFO L462 AbstractCegarLoop]: Abstraction has 1183 states and 1943 transitions. [2019-10-13 21:42:14,308 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-13 21:42:14,309 INFO L276 IsEmpty]: Start isEmpty. Operand 1183 states and 1943 transitions. [2019-10-13 21:42:14,314 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 167 [2019-10-13 21:42:14,314 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:42:14,314 INFO L380 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:14,314 INFO L410 AbstractCegarLoop]: === Iteration 4 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:42:14,315 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:42:14,315 INFO L82 PathProgramCache]: Analyzing trace with hash -1767076692, now seen corresponding path program 1 times [2019-10-13 21:42:14,315 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-13 21:42:14,316 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1675830772] [2019-10-13 21:42:14,316 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:42:14,316 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:42:14,316 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:42:14,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:42:14,460 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-13 21:42:14,461 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1675830772] [2019-10-13 21:42:14,461 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:42:14,461 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-13 21:42:14,462 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [429351046] [2019-10-13 21:42:14,462 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-13 21:42:14,463 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-13 21:42:14,463 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-13 21:42:14,463 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-10-13 21:42:14,463 INFO L87 Difference]: Start difference. First operand 1183 states and 1943 transitions. Second operand 6 states. [2019-10-13 21:42:15,985 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:42:15,986 INFO L93 Difference]: Finished difference Result 3649 states and 6586 transitions. [2019-10-13 21:42:15,986 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-10-13 21:42:15,986 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 166 [2019-10-13 21:42:15,987 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:42:16,011 INFO L225 Difference]: With dead ends: 3649 [2019-10-13 21:42:16,011 INFO L226 Difference]: Without dead ends: 2471 [2019-10-13 21:42:16,016 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 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:42:16,019 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2471 states. [2019-10-13 21:42:16,113 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2471 to 2397. [2019-10-13 21:42:16,113 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2397 states. [2019-10-13 21:42:16,125 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2397 states to 2397 states and 4013 transitions. [2019-10-13 21:42:16,126 INFO L78 Accepts]: Start accepts. Automaton has 2397 states and 4013 transitions. Word has length 166 [2019-10-13 21:42:16,126 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:42:16,126 INFO L462 AbstractCegarLoop]: Abstraction has 2397 states and 4013 transitions. [2019-10-13 21:42:16,126 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-13 21:42:16,126 INFO L276 IsEmpty]: Start isEmpty. Operand 2397 states and 4013 transitions. [2019-10-13 21:42:16,135 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 172 [2019-10-13 21:42:16,135 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:42:16,135 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:42:16,136 INFO L410 AbstractCegarLoop]: === Iteration 5 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:42:16,136 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:42:16,136 INFO L82 PathProgramCache]: Analyzing trace with hash 1452481995, now seen corresponding path program 1 times [2019-10-13 21:42:16,136 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-13 21:42:16,137 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1019537653] [2019-10-13 21:42:16,137 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:42:16,137 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:42:16,137 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:42:16,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:42:16,247 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:42:16,247 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1019537653] [2019-10-13 21:42:16,248 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:42:16,248 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-13 21:42:16,248 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [502044951] [2019-10-13 21:42:16,249 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-13 21:42:16,249 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-13 21:42:16,249 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-13 21:42:16,250 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-10-13 21:42:16,250 INFO L87 Difference]: Start difference. First operand 2397 states and 4013 transitions. Second operand 6 states. [2019-10-13 21:42:17,763 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:42:17,764 INFO L93 Difference]: Finished difference Result 7162 states and 13203 transitions. [2019-10-13 21:42:17,764 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-10-13 21:42:17,764 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 171 [2019-10-13 21:42:17,765 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:42:17,800 INFO L225 Difference]: With dead ends: 7162 [2019-10-13 21:42:17,800 INFO L226 Difference]: Without dead ends: 4770 [2019-10-13 21:42:17,810 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:42:17,816 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4770 states. [2019-10-13 21:42:18,007 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4770 to 4694. [2019-10-13 21:42:18,008 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4694 states. [2019-10-13 21:42:18,034 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4694 states to 4694 states and 7852 transitions. [2019-10-13 21:42:18,035 INFO L78 Accepts]: Start accepts. Automaton has 4694 states and 7852 transitions. Word has length 171 [2019-10-13 21:42:18,035 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:42:18,035 INFO L462 AbstractCegarLoop]: Abstraction has 4694 states and 7852 transitions. [2019-10-13 21:42:18,035 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-13 21:42:18,036 INFO L276 IsEmpty]: Start isEmpty. Operand 4694 states and 7852 transitions. [2019-10-13 21:42:18,053 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 179 [2019-10-13 21:42:18,053 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:42:18,054 INFO L380 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 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] [2019-10-13 21:42:18,054 INFO L410 AbstractCegarLoop]: === Iteration 6 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:42:18,054 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:42:18,055 INFO L82 PathProgramCache]: Analyzing trace with hash 1765869504, now seen corresponding path program 1 times [2019-10-13 21:42:18,055 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-13 21:42:18,055 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1375544203] [2019-10-13 21:42:18,055 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:42:18,056 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:42:18,056 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:42:18,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:42:18,195 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 33 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-13 21:42:18,195 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1375544203] [2019-10-13 21:42:18,196 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [415825374] [2019-10-13 21:42:18,196 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:42:18,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:42:18,490 INFO L256 TraceCheckSpWp]: Trace formula consists of 1030 conjuncts, 4 conjunts are in the unsatisfiable core [2019-10-13 21:42:18,505 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-13 21:42:18,619 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 26 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2019-10-13 21:42:18,619 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-10-13 21:42:18,701 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 26 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2019-10-13 21:42:18,702 INFO L223 tionRefinementEngine]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2019-10-13 21:42:18,702 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [6] total 7 [2019-10-13 21:42:18,702 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1098280594] [2019-10-13 21:42:18,703 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-13 21:42:18,703 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-13 21:42:18,703 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-13 21:42:18,704 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2019-10-13 21:42:18,704 INFO L87 Difference]: Start difference. First operand 4694 states and 7852 transitions. Second operand 3 states. [2019-10-13 21:42:19,796 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:42:19,798 INFO L93 Difference]: Finished difference Result 13398 states and 23056 transitions. [2019-10-13 21:42:19,798 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-13 21:42:19,798 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 178 [2019-10-13 21:42:19,799 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:42:19,862 INFO L225 Difference]: With dead ends: 13398 [2019-10-13 21:42:19,862 INFO L226 Difference]: Without dead ends: 8709 [2019-10-13 21:42:19,880 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 361 GetRequests, 354 SyntacticMatches, 2 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2019-10-13 21:42:19,895 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8709 states. [2019-10-13 21:42:20,285 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8709 to 8266. [2019-10-13 21:42:20,286 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8266 states. [2019-10-13 21:42:20,321 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8266 states to 8266 states and 14231 transitions. [2019-10-13 21:42:20,322 INFO L78 Accepts]: Start accepts. Automaton has 8266 states and 14231 transitions. Word has length 178 [2019-10-13 21:42:20,322 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:42:20,322 INFO L462 AbstractCegarLoop]: Abstraction has 8266 states and 14231 transitions. [2019-10-13 21:42:20,323 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-13 21:42:20,323 INFO L276 IsEmpty]: Start isEmpty. Operand 8266 states and 14231 transitions. [2019-10-13 21:42:20,358 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 184 [2019-10-13 21:42:20,358 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:42:20,359 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:42:20,566 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-13 21:42:20,567 INFO L410 AbstractCegarLoop]: === Iteration 7 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:42:20,567 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:42:20,567 INFO L82 PathProgramCache]: Analyzing trace with hash 112488247, now seen corresponding path program 1 times [2019-10-13 21:42:20,567 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-13 21:42:20,568 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [756404884] [2019-10-13 21:42:20,568 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:42:20,569 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:42:20,569 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:42:20,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:42:20,743 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:42:20,743 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [756404884] [2019-10-13 21:42:20,743 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [579071014] [2019-10-13 21:42:20,744 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:20,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:42:20,925 INFO L256 TraceCheckSpWp]: Trace formula consists of 1021 conjuncts, 11 conjunts are in the unsatisfiable core [2019-10-13 21:42:20,933 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-13 21:42:20,986 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:42:20,986 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-10-13 21:42:21,057 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:42:21,058 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 2 imperfect interpolant sequences. [2019-10-13 21:42:21,058 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [6, 5] total 10 [2019-10-13 21:42:21,059 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1962755443] [2019-10-13 21:42:21,059 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-13 21:42:21,060 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-13 21:42:21,060 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-13 21:42:21,060 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2019-10-13 21:42:21,061 INFO L87 Difference]: Start difference. First operand 8266 states and 14231 transitions. Second operand 5 states. [2019-10-13 21:42:22,582 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:42:22,582 INFO L93 Difference]: Finished difference Result 18748 states and 33874 transitions. [2019-10-13 21:42:22,583 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-10-13 21:42:22,583 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 183 [2019-10-13 21:42:22,583 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:42:22,655 INFO L225 Difference]: With dead ends: 18748 [2019-10-13 21:42:22,656 INFO L226 Difference]: Without dead ends: 10487 [2019-10-13 21:42:22,684 INFO L600 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-13 21:42:22,697 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10487 states. [2019-10-13 21:42:23,048 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10487 to 10212. [2019-10-13 21:42:23,049 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10212 states. [2019-10-13 21:42:23,086 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10212 states to 10212 states and 17569 transitions. [2019-10-13 21:42:23,087 INFO L78 Accepts]: Start accepts. Automaton has 10212 states and 17569 transitions. Word has length 183 [2019-10-13 21:42:23,087 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:42:23,087 INFO L462 AbstractCegarLoop]: Abstraction has 10212 states and 17569 transitions. [2019-10-13 21:42:23,087 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-13 21:42:23,088 INFO L276 IsEmpty]: Start isEmpty. Operand 10212 states and 17569 transitions. [2019-10-13 21:42:23,131 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 193 [2019-10-13 21:42:23,132 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:42:23,132 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:23,339 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-13 21:42:23,340 INFO L410 AbstractCegarLoop]: === Iteration 8 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:42:23,340 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:42:23,340 INFO L82 PathProgramCache]: Analyzing trace with hash -1988359256, now seen corresponding path program 1 times [2019-10-13 21:42:23,341 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-13 21:42:23,341 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1685473279] [2019-10-13 21:42:23,341 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:42:23,341 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:42:23,342 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:42:23,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:42:23,513 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:23,513 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1685473279] [2019-10-13 21:42:23,514 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [878201541] [2019-10-13 21:42:23,514 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-13 21:42:23,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:42:23,875 INFO L256 TraceCheckSpWp]: Trace formula consists of 1025 conjuncts, 7 conjunts are in the unsatisfiable core [2019-10-13 21:42:23,880 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-13 21:42:23,921 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:23,922 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-10-13 21:42:23,998 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:23,998 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [2032280304] [2019-10-13 21:42:24,069 INFO L162 IcfgInterpreter]: Started Sifa with 153 locations of interest [2019-10-13 21:42:24,069 INFO L169 IcfgInterpreter]: Building call graph [2019-10-13 21:42:24,078 INFO L174 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-10-13 21:42:24,089 INFO L179 IcfgInterpreter]: Starting interpretation [2019-10-13 21:42:24,090 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2019-10-13 21:42:24,953 INFO L199 IcfgInterpreter]: Interpreting procedure main with input of size 206 for LOIs [2019-10-13 21:42:25,230 WARN L191 SmtUtils]: Spent 155.00 ms on a formula simplification that was a NOOP. DAG size: 227 [2019-10-13 21:42:25,357 WARN L191 SmtUtils]: Spent 126.00 ms on a formula simplification that was a NOOP. DAG size: 298 [2019-10-13 21:42:25,636 WARN L191 SmtUtils]: Spent 123.00 ms on a formula simplification that was a NOOP. DAG size: 304 [2019-10-13 21:42:25,920 WARN L191 SmtUtils]: Spent 134.00 ms on a formula simplification that was a NOOP. DAG size: 310 [2019-10-13 21:42:26,223 WARN L191 SmtUtils]: Spent 110.00 ms on a formula simplification that was a NOOP. DAG size: 278 [2019-10-13 21:42:27,036 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-13 21:42:27,038 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:27,044 INFO L168 Benchmark]: Toolchain (without parser) took 22750.16 ms. Allocated memory was 144.7 MB in the beginning and 680.0 MB in the end (delta: 535.3 MB). Free memory was 96.3 MB in the beginning and 565.3 MB in the end (delta: -469.0 MB). Peak memory consumption was 66.3 MB. Max. memory is 7.1 GB. [2019-10-13 21:42:27,045 INFO L168 Benchmark]: CDTParser took 0.24 ms. Allocated memory is still 144.7 MB. Free memory was 119.8 MB in the beginning and 119.6 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:27,046 INFO L168 Benchmark]: CACSL2BoogieTranslator took 1272.27 ms. Allocated memory was 144.7 MB in the beginning and 207.1 MB in the end (delta: 62.4 MB). Free memory was 96.1 MB in the beginning and 133.2 MB in the end (delta: -37.1 MB). Peak memory consumption was 37.6 MB. Max. memory is 7.1 GB. [2019-10-13 21:42:27,047 INFO L168 Benchmark]: Boogie Preprocessor took 191.32 ms. Allocated memory is still 207.1 MB. Free memory was 133.2 MB in the beginning and 121.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:27,048 INFO L168 Benchmark]: RCFGBuilder took 3424.12 ms. Allocated memory was 207.1 MB in the beginning and 312.5 MB in the end (delta: 105.4 MB). Free memory was 121.3 MB in the beginning and 263.3 MB in the end (delta: -142.0 MB). Peak memory consumption was 92.1 MB. Max. memory is 7.1 GB. [2019-10-13 21:42:27,049 INFO L168 Benchmark]: TraceAbstraction took 17857.00 ms. Allocated memory was 312.5 MB in the beginning and 680.0 MB in the end (delta: 367.5 MB). Free memory was 263.3 MB in the beginning and 565.3 MB in the end (delta: -301.9 MB). Peak memory consumption was 65.6 MB. Max. memory is 7.1 GB. [2019-10-13 21:42:27,053 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.24 ms. Allocated memory is still 144.7 MB. Free memory was 119.8 MB in the beginning and 119.6 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 1272.27 ms. Allocated memory was 144.7 MB in the beginning and 207.1 MB in the end (delta: 62.4 MB). Free memory was 96.1 MB in the beginning and 133.2 MB in the end (delta: -37.1 MB). Peak memory consumption was 37.6 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 191.32 ms. Allocated memory is still 207.1 MB. Free memory was 133.2 MB in the beginning and 121.3 MB in the end (delta: 11.9 MB). Peak memory consumption was 11.9 MB. Max. memory is 7.1 GB. * RCFGBuilder took 3424.12 ms. Allocated memory was 207.1 MB in the beginning and 312.5 MB in the end (delta: 105.4 MB). Free memory was 121.3 MB in the beginning and 263.3 MB in the end (delta: -142.0 MB). Peak memory consumption was 92.1 MB. Max. memory is 7.1 GB. * TraceAbstraction took 17857.00 ms. Allocated memory was 312.5 MB in the beginning and 680.0 MB in the end (delta: 367.5 MB). Free memory was 263.3 MB in the beginning and 565.3 MB in the end (delta: -301.9 MB). Peak memory consumption was 65.6 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...