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_label43.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-f4eb214f-m [2019-10-13 21:41:55,649 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-10-13 21:41:55,652 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-10-13 21:41:55,664 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-10-13 21:41:55,665 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-10-13 21:41:55,666 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-10-13 21:41:55,667 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-10-13 21:41:55,669 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-10-13 21:41:55,671 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-10-13 21:41:55,672 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-10-13 21:41:55,673 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-10-13 21:41:55,674 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-10-13 21:41:55,674 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-10-13 21:41:55,675 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-10-13 21:41:55,676 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-10-13 21:41:55,677 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-10-13 21:41:55,678 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-10-13 21:41:55,679 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-10-13 21:41:55,681 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-10-13 21:41:55,683 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-10-13 21:41:55,685 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-10-13 21:41:55,686 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-10-13 21:41:55,687 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-10-13 21:41:55,688 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-10-13 21:41:55,691 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-10-13 21:41:55,691 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-10-13 21:41:55,691 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-10-13 21:41:55,692 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-10-13 21:41:55,693 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-10-13 21:41:55,696 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-10-13 21:41:55,697 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-10-13 21:41:55,698 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-10-13 21:41:55,699 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-10-13 21:41:55,699 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-10-13 21:41:55,700 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-10-13 21:41:55,701 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-10-13 21:41:55,703 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-10-13 21:41:55,704 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-10-13 21:41:55,704 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-10-13 21:41:55,705 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-10-13 21:41:55,706 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-10-13 21:41:55,706 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:55,737 INFO L113 SettingsManager]: Loading preferences was successful [2019-10-13 21:41:55,737 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-10-13 21:41:55,740 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-10-13 21:41:55,740 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-10-13 21:41:55,740 INFO L138 SettingsManager]: * Use SBE=true [2019-10-13 21:41:55,740 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-10-13 21:41:55,741 INFO L138 SettingsManager]: * sizeof long=4 [2019-10-13 21:41:55,741 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-10-13 21:41:55,741 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-10-13 21:41:55,741 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-10-13 21:41:55,742 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-10-13 21:41:55,743 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-10-13 21:41:55,743 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-10-13 21:41:55,743 INFO L138 SettingsManager]: * sizeof long double=12 [2019-10-13 21:41:55,743 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-10-13 21:41:55,744 INFO L138 SettingsManager]: * Use constant arrays=true [2019-10-13 21:41:55,744 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-10-13 21:41:55,744 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-10-13 21:41:55,744 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-10-13 21:41:55,744 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-10-13 21:41:55,745 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-10-13 21:41:55,745 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-13 21:41:55,745 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-10-13 21:41:55,746 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-10-13 21:41:55,746 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-10-13 21:41:55,746 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-10-13 21:41:55,746 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-10-13 21:41:55,746 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-10-13 21:41:55,746 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:56,036 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-10-13 21:41:56,058 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-10-13 21:41:56,063 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-10-13 21:41:56,064 INFO L271 PluginConnector]: Initializing CDTParser... [2019-10-13 21:41:56,065 INFO L275 PluginConnector]: CDTParser initialized [2019-10-13 21:41:56,065 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/eca-rers2012/Problem03_label43.c [2019-10-13 21:41:56,131 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9efcb9713/c3ec9b4eaa3b4d318f584efae8cb1069/FLAG321cc1f68 [2019-10-13 21:41:56,839 INFO L306 CDTParser]: Found 1 translation units. [2019-10-13 21:41:56,839 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/eca-rers2012/Problem03_label43.c [2019-10-13 21:41:56,862 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9efcb9713/c3ec9b4eaa3b4d318f584efae8cb1069/FLAG321cc1f68 [2019-10-13 21:41:57,025 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9efcb9713/c3ec9b4eaa3b4d318f584efae8cb1069 [2019-10-13 21:41:57,035 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-10-13 21:41:57,037 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-10-13 21:41:57,038 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-10-13 21:41:57,038 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-10-13 21:41:57,042 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-10-13 21:41:57,044 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 09:41:57" (1/1) ... [2019-10-13 21:41:57,048 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@72b11530 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:41:57, skipping insertion in model container [2019-10-13 21:41:57,048 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 09:41:57" (1/1) ... [2019-10-13 21:41:57,057 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-10-13 21:41:57,149 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-10-13 21:41:57,970 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-13 21:41:57,978 INFO L188 MainTranslator]: Completed pre-run [2019-10-13 21:41:58,398 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-13 21:41:58,425 INFO L192 MainTranslator]: Completed translation [2019-10-13 21:41:58,426 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:41:58 WrapperNode [2019-10-13 21:41:58,427 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-10-13 21:41:58,428 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-10-13 21:41:58,428 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-10-13 21:41:58,428 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-10-13 21:41:58,445 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:58" (1/1) ... [2019-10-13 21:41:58,445 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:58" (1/1) ... [2019-10-13 21:41:58,491 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:58" (1/1) ... [2019-10-13 21:41:58,492 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:58" (1/1) ... [2019-10-13 21:41:58,566 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:58" (1/1) ... [2019-10-13 21:41:58,594 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:58" (1/1) ... [2019-10-13 21:41:58,610 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:58" (1/1) ... [2019-10-13 21:41:58,624 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-10-13 21:41:58,625 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-10-13 21:41:58,625 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-10-13 21:41:58,625 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-10-13 21:41:58,626 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:41:58" (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:58,695 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-10-13 21:41:58,696 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-10-13 21:41:58,696 INFO L138 BoogieDeclarations]: Found implementation of procedure calculate_output [2019-10-13 21:41:58,696 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-10-13 21:41:58,696 INFO L130 BoogieDeclarations]: Found specification of procedure calculate_output [2019-10-13 21:41:58,696 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-10-13 21:41:58,697 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-10-13 21:41:58,697 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2019-10-13 21:41:58,697 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-10-13 21:41:58,697 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-10-13 21:41:58,697 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-10-13 21:42:01,791 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-10-13 21:42:01,791 INFO L284 CfgBuilder]: Removed 1 assume(true) statements. [2019-10-13 21:42:01,793 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 09:42:01 BoogieIcfgContainer [2019-10-13 21:42:01,793 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-10-13 21:42:01,794 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-10-13 21:42:01,794 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-10-13 21:42:01,798 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-10-13 21:42:01,799 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.10 09:41:57" (1/3) ... [2019-10-13 21:42:01,800 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3385f28c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 09:42:01, skipping insertion in model container [2019-10-13 21:42:01,800 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:41:58" (2/3) ... [2019-10-13 21:42:01,800 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3385f28c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 09:42:01, skipping insertion in model container [2019-10-13 21:42:01,801 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 09:42:01" (3/3) ... [2019-10-13 21:42:01,803 INFO L109 eAbstractionObserver]: Analyzing ICFG Problem03_label43.c [2019-10-13 21:42:01,813 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-10-13 21:42:01,826 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-10-13 21:42:01,837 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-10-13 21:42:01,876 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-10-13 21:42:01,876 INFO L374 AbstractCegarLoop]: Hoare is true [2019-10-13 21:42:01,876 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-10-13 21:42:01,877 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-10-13 21:42:01,877 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-10-13 21:42:01,877 INFO L378 AbstractCegarLoop]: Difference is false [2019-10-13 21:42:01,877 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-10-13 21:42:01,878 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-10-13 21:42:01,909 INFO L276 IsEmpty]: Start isEmpty. Operand 158 states. [2019-10-13 21:42:01,931 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 150 [2019-10-13 21:42:01,931 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:42:01,932 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:01,934 INFO L410 AbstractCegarLoop]: === Iteration 1 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:42:01,942 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:42:01,942 INFO L82 PathProgramCache]: Analyzing trace with hash 136465446, now seen corresponding path program 1 times [2019-10-13 21:42:01,952 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-13 21:42:01,953 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [371265588] [2019-10-13 21:42:01,953 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:42:01,953 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:42:01,953 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:42:02,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:42:02,776 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:02,777 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [371265588] [2019-10-13 21:42:02,778 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:42:02,778 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-13 21:42:02,779 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1431392800] [2019-10-13 21:42:02,786 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-13 21:42:02,786 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-13 21:42:02,800 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-13 21:42:02,801 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-10-13 21:42:02,803 INFO L87 Difference]: Start difference. First operand 158 states. Second operand 4 states. [2019-10-13 21:42:04,555 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:42:04,556 INFO L93 Difference]: Finished difference Result 613 states and 1182 transitions. [2019-10-13 21:42:04,557 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-13 21:42:04,558 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 149 [2019-10-13 21:42:04,560 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:42:04,580 INFO L225 Difference]: With dead ends: 613 [2019-10-13 21:42:04,581 INFO L226 Difference]: Without dead ends: 448 [2019-10-13 21:42:04,586 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-10-13 21:42:04,606 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 448 states. [2019-10-13 21:42:04,665 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 448 to 301. [2019-10-13 21:42:04,667 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 301 states. [2019-10-13 21:42:04,669 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 301 states to 301 states and 570 transitions. [2019-10-13 21:42:04,671 INFO L78 Accepts]: Start accepts. Automaton has 301 states and 570 transitions. Word has length 149 [2019-10-13 21:42:04,672 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:42:04,672 INFO L462 AbstractCegarLoop]: Abstraction has 301 states and 570 transitions. [2019-10-13 21:42:04,672 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-13 21:42:04,673 INFO L276 IsEmpty]: Start isEmpty. Operand 301 states and 570 transitions. [2019-10-13 21:42:04,678 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 158 [2019-10-13 21:42:04,678 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:42:04,679 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:42:04,679 INFO L410 AbstractCegarLoop]: === Iteration 2 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:42:04,680 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:42:04,680 INFO L82 PathProgramCache]: Analyzing trace with hash 243766760, now seen corresponding path program 1 times [2019-10-13 21:42:04,680 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-13 21:42:04,680 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1008284483] [2019-10-13 21:42:04,681 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:42:04,681 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:42:04,681 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:42:04,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:42:04,916 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:42:04,917 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1008284483] [2019-10-13 21:42:04,917 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:42:04,918 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-13 21:42:04,918 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1726277635] [2019-10-13 21:42:04,920 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-13 21:42:04,920 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-13 21:42:04,920 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-13 21:42:04,921 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-13 21:42:04,921 INFO L87 Difference]: Start difference. First operand 301 states and 570 transitions. Second operand 5 states. [2019-10-13 21:42:06,152 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:42:06,152 INFO L93 Difference]: Finished difference Result 917 states and 1764 transitions. [2019-10-13 21:42:06,154 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-10-13 21:42:06,154 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 157 [2019-10-13 21:42:06,155 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:42:06,160 INFO L225 Difference]: With dead ends: 917 [2019-10-13 21:42:06,160 INFO L226 Difference]: Without dead ends: 621 [2019-10-13 21:42:06,164 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2019-10-13 21:42:06,166 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 621 states. [2019-10-13 21:42:06,212 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 621 to 605. [2019-10-13 21:42:06,212 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 605 states. [2019-10-13 21:42:06,216 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 605 states to 605 states and 1112 transitions. [2019-10-13 21:42:06,216 INFO L78 Accepts]: Start accepts. Automaton has 605 states and 1112 transitions. Word has length 157 [2019-10-13 21:42:06,216 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:42:06,217 INFO L462 AbstractCegarLoop]: Abstraction has 605 states and 1112 transitions. [2019-10-13 21:42:06,217 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-13 21:42:06,217 INFO L276 IsEmpty]: Start isEmpty. Operand 605 states and 1112 transitions. [2019-10-13 21:42:06,223 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 159 [2019-10-13 21:42:06,223 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:42:06,224 INFO L380 BasicCegarLoop]: trace histogram [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, 1, 1, 1] [2019-10-13 21:42:06,224 INFO L410 AbstractCegarLoop]: === Iteration 3 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:42:06,224 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:42:06,225 INFO L82 PathProgramCache]: Analyzing trace with hash 558835389, now seen corresponding path program 1 times [2019-10-13 21:42:06,225 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-13 21:42:06,225 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1426794640] [2019-10-13 21:42:06,225 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:42:06,225 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:42:06,226 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:42:06,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:42:06,399 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-13 21:42:06,399 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1426794640] [2019-10-13 21:42:06,400 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:42:06,400 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-13 21:42:06,400 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1066051664] [2019-10-13 21:42:06,401 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-13 21:42:06,401 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-13 21:42:06,402 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-13 21:42:06,406 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-10-13 21:42:06,406 INFO L87 Difference]: Start difference. First operand 605 states and 1112 transitions. Second operand 6 states. [2019-10-13 21:42:07,904 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:42:07,904 INFO L93 Difference]: Finished difference Result 1879 states and 3733 transitions. [2019-10-13 21:42:07,905 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-10-13 21:42:07,905 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 158 [2019-10-13 21:42:07,905 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:42:07,918 INFO L225 Difference]: With dead ends: 1879 [2019-10-13 21:42:07,918 INFO L226 Difference]: Without dead ends: 1279 [2019-10-13 21:42:07,921 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2019-10-13 21:42:07,923 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1279 states. [2019-10-13 21:42:08,026 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1279 to 1221. [2019-10-13 21:42:08,027 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1221 states. [2019-10-13 21:42:08,035 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1221 states to 1221 states and 2240 transitions. [2019-10-13 21:42:08,036 INFO L78 Accepts]: Start accepts. Automaton has 1221 states and 2240 transitions. Word has length 158 [2019-10-13 21:42:08,038 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:42:08,038 INFO L462 AbstractCegarLoop]: Abstraction has 1221 states and 2240 transitions. [2019-10-13 21:42:08,038 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-13 21:42:08,038 INFO L276 IsEmpty]: Start isEmpty. Operand 1221 states and 2240 transitions. [2019-10-13 21:42:08,051 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 162 [2019-10-13 21:42:08,051 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:42:08,052 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:08,052 INFO L410 AbstractCegarLoop]: === Iteration 4 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:42:08,052 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:42:08,053 INFO L82 PathProgramCache]: Analyzing trace with hash -1532436462, now seen corresponding path program 1 times [2019-10-13 21:42:08,053 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-13 21:42:08,053 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [689381031] [2019-10-13 21:42:08,053 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:42:08,053 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:42:08,054 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:42:08,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:42:08,314 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:08,315 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [689381031] [2019-10-13 21:42:08,315 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:42:08,315 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-13 21:42:08,316 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [591405608] [2019-10-13 21:42:08,316 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-13 21:42:08,316 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-13 21:42:08,317 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-13 21:42:08,317 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-13 21:42:08,317 INFO L87 Difference]: Start difference. First operand 1221 states and 2240 transitions. Second operand 3 states. [2019-10-13 21:42:09,299 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:42:09,300 INFO L93 Difference]: Finished difference Result 3637 states and 6909 transitions. [2019-10-13 21:42:09,300 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-13 21:42:09,300 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 161 [2019-10-13 21:42:09,301 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:42:09,319 INFO L225 Difference]: With dead ends: 3637 [2019-10-13 21:42:09,319 INFO L226 Difference]: Without dead ends: 2421 [2019-10-13 21:42:09,324 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:09,327 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2421 states. [2019-10-13 21:42:09,399 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2421 to 2421. [2019-10-13 21:42:09,399 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2421 states. [2019-10-13 21:42:09,413 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2421 states to 2421 states and 4302 transitions. [2019-10-13 21:42:09,413 INFO L78 Accepts]: Start accepts. Automaton has 2421 states and 4302 transitions. Word has length 161 [2019-10-13 21:42:09,414 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:42:09,414 INFO L462 AbstractCegarLoop]: Abstraction has 2421 states and 4302 transitions. [2019-10-13 21:42:09,414 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-13 21:42:09,415 INFO L276 IsEmpty]: Start isEmpty. Operand 2421 states and 4302 transitions. [2019-10-13 21:42:09,424 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 169 [2019-10-13 21:42:09,425 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:42:09,425 INFO L380 BasicCegarLoop]: trace histogram [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, 1, 1, 1] [2019-10-13 21:42:09,425 INFO L410 AbstractCegarLoop]: === Iteration 5 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:42:09,426 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:42:09,426 INFO L82 PathProgramCache]: Analyzing trace with hash -2126716471, now seen corresponding path program 1 times [2019-10-13 21:42:09,426 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-13 21:42:09,426 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [794853236] [2019-10-13 21:42:09,427 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:42:09,427 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:42:09,427 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:42:09,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:42:09,586 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-13 21:42:09,587 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [794853236] [2019-10-13 21:42:09,587 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:42:09,587 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-13 21:42:09,587 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1486297799] [2019-10-13 21:42:09,588 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-13 21:42:09,588 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-13 21:42:09,588 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-13 21:42:09,589 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-10-13 21:42:09,589 INFO L87 Difference]: Start difference. First operand 2421 states and 4302 transitions. Second operand 6 states. [2019-10-13 21:42:10,963 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:42:10,966 INFO L93 Difference]: Finished difference Result 7089 states and 14040 transitions. [2019-10-13 21:42:10,966 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-10-13 21:42:10,966 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 168 [2019-10-13 21:42:10,967 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:42:11,010 INFO L225 Difference]: With dead ends: 7089 [2019-10-13 21:42:11,011 INFO L226 Difference]: Without dead ends: 4673 [2019-10-13 21:42:11,020 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:11,026 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4673 states. [2019-10-13 21:42:11,264 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4673 to 4587. [2019-10-13 21:42:11,265 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4587 states. [2019-10-13 21:42:11,285 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4587 states to 4587 states and 7937 transitions. [2019-10-13 21:42:11,286 INFO L78 Accepts]: Start accepts. Automaton has 4587 states and 7937 transitions. Word has length 168 [2019-10-13 21:42:11,286 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:42:11,286 INFO L462 AbstractCegarLoop]: Abstraction has 4587 states and 7937 transitions. [2019-10-13 21:42:11,286 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-13 21:42:11,286 INFO L276 IsEmpty]: Start isEmpty. Operand 4587 states and 7937 transitions. [2019-10-13 21:42:11,302 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 172 [2019-10-13 21:42:11,302 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:42:11,303 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:11,303 INFO L410 AbstractCegarLoop]: === Iteration 6 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:42:11,303 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:42:11,304 INFO L82 PathProgramCache]: Analyzing trace with hash 700926954, now seen corresponding path program 1 times [2019-10-13 21:42:11,304 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-13 21:42:11,304 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [310611093] [2019-10-13 21:42:11,304 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:42:11,304 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:42:11,305 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:42:11,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:42:11,426 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:11,426 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [310611093] [2019-10-13 21:42:11,427 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:42:11,428 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-13 21:42:11,428 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [135851199] [2019-10-13 21:42:11,430 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-13 21:42:11,430 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-13 21:42:11,430 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-13 21:42:11,430 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-10-13 21:42:11,432 INFO L87 Difference]: Start difference. First operand 4587 states and 7937 transitions. Second operand 6 states. [2019-10-13 21:42:12,835 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:42:12,835 INFO L93 Difference]: Finished difference Result 10680 states and 19949 transitions. [2019-10-13 21:42:12,836 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-10-13 21:42:12,836 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 171 [2019-10-13 21:42:12,836 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:42:12,883 INFO L225 Difference]: With dead ends: 10680 [2019-10-13 21:42:12,884 INFO L226 Difference]: Without dead ends: 6098 [2019-10-13 21:42:12,901 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:12,909 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6098 states. [2019-10-13 21:42:13,274 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6098 to 5964. [2019-10-13 21:42:13,275 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5964 states. [2019-10-13 21:42:13,294 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5964 states to 5964 states and 9941 transitions. [2019-10-13 21:42:13,295 INFO L78 Accepts]: Start accepts. Automaton has 5964 states and 9941 transitions. Word has length 171 [2019-10-13 21:42:13,295 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:42:13,295 INFO L462 AbstractCegarLoop]: Abstraction has 5964 states and 9941 transitions. [2019-10-13 21:42:13,295 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-13 21:42:13,296 INFO L276 IsEmpty]: Start isEmpty. Operand 5964 states and 9941 transitions. [2019-10-13 21:42:13,328 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 184 [2019-10-13 21:42:13,328 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:42:13,338 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:13,338 INFO L410 AbstractCegarLoop]: === Iteration 7 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:42:13,339 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:42:13,340 INFO L82 PathProgramCache]: Analyzing trace with hash -561584426, now seen corresponding path program 1 times [2019-10-13 21:42:13,340 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-13 21:42:13,341 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1715572165] [2019-10-13 21:42:13,341 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:42:13,341 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:42:13,342 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:42:13,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:42:13,502 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:13,503 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1715572165] [2019-10-13 21:42:13,503 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [583601414] [2019-10-13 21:42:13,503 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:13,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:42:13,733 INFO L256 TraceCheckSpWp]: Trace formula consists of 999 conjuncts, 11 conjunts are in the unsatisfiable core [2019-10-13 21:42:13,747 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-13 21:42:13,820 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:13,820 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-10-13 21:42:13,908 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:13,910 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 2 imperfect interpolant sequences. [2019-10-13 21:42:13,910 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [6, 5] total 10 [2019-10-13 21:42:13,910 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [596668965] [2019-10-13 21:42:13,911 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-13 21:42:13,911 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-13 21:42:13,912 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-13 21:42:13,912 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2019-10-13 21:42:13,912 INFO L87 Difference]: Start difference. First operand 5964 states and 9941 transitions. Second operand 5 states. [2019-10-13 21:42:15,459 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:42:15,459 INFO L93 Difference]: Finished difference Result 17184 states and 31006 transitions. [2019-10-13 21:42:15,460 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-10-13 21:42:15,460 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 183 [2019-10-13 21:42:15,462 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:42:15,545 INFO L225 Difference]: With dead ends: 17184 [2019-10-13 21:42:15,545 INFO L226 Difference]: Without dead ends: 11225 [2019-10-13 21:42:15,568 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:15,582 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11225 states. [2019-10-13 21:42:16,140 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11225 to 11079. [2019-10-13 21:42:16,141 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11079 states. [2019-10-13 21:42:16,176 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11079 states to 11079 states and 18790 transitions. [2019-10-13 21:42:16,177 INFO L78 Accepts]: Start accepts. Automaton has 11079 states and 18790 transitions. Word has length 183 [2019-10-13 21:42:16,177 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:42:16,177 INFO L462 AbstractCegarLoop]: Abstraction has 11079 states and 18790 transitions. [2019-10-13 21:42:16,177 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-13 21:42:16,177 INFO L276 IsEmpty]: Start isEmpty. Operand 11079 states and 18790 transitions. [2019-10-13 21:42:16,216 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 193 [2019-10-13 21:42:16,216 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:42:16,216 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:16,420 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-13 21:42:16,421 INFO L410 AbstractCegarLoop]: === Iteration 8 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:42:16,421 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:42:16,422 INFO L82 PathProgramCache]: Analyzing trace with hash -733583127, now seen corresponding path program 1 times [2019-10-13 21:42:16,422 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-13 21:42:16,422 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1782098092] [2019-10-13 21:42:16,422 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:42:16,422 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:42:16,423 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:42:16,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:42:16,600 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:16,601 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1782098092] [2019-10-13 21:42:16,601 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1263902667] [2019-10-13 21:42:16,601 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:16,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:42:16,900 INFO L256 TraceCheckSpWp]: Trace formula consists of 1003 conjuncts, 7 conjunts are in the unsatisfiable core [2019-10-13 21:42:16,907 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-13 21:42:16,945 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:16,946 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-10-13 21:42:17,017 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:17,018 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [913078434] [2019-10-13 21:42:17,055 INFO L162 IcfgInterpreter]: Started Sifa with 153 locations of interest [2019-10-13 21:42:17,055 INFO L169 IcfgInterpreter]: Building call graph [2019-10-13 21:42:17,063 INFO L174 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-10-13 21:42:17,072 INFO L179 IcfgInterpreter]: Starting interpretation [2019-10-13 21:42:17,073 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2019-10-13 21:42:17,952 INFO L199 IcfgInterpreter]: Interpreting procedure main with input of size 206 for LOIs [2019-10-13 21:42:18,108 WARN L191 SmtUtils]: Spent 111.00 ms on a formula simplification that was a NOOP. DAG size: 206 [2019-10-13 21:42:18,311 WARN L191 SmtUtils]: Spent 148.00 ms on a formula simplification that was a NOOP. DAG size: 298 [2019-10-13 21:42:18,583 WARN L191 SmtUtils]: Spent 123.00 ms on a formula simplification that was a NOOP. DAG size: 304 [2019-10-13 21:42:18,840 WARN L191 SmtUtils]: Spent 101.00 ms on a formula simplification that was a NOOP. DAG size: 310 [2019-10-13 21:42:19,697 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-13 21:42:19,698 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:19,705 INFO L168 Benchmark]: Toolchain (without parser) took 22667.50 ms. Allocated memory was 146.3 MB in the beginning and 682.1 MB in the end (delta: 535.8 MB). Free memory was 99.0 MB in the beginning and 542.5 MB in the end (delta: -443.5 MB). Peak memory consumption was 92.3 MB. Max. memory is 7.1 GB. [2019-10-13 21:42:19,705 INFO L168 Benchmark]: CDTParser took 0.22 ms. Allocated memory is still 146.3 MB. Free memory is still 122.3 MB. There was no memory consumed. Max. memory is 7.1 GB. [2019-10-13 21:42:19,706 INFO L168 Benchmark]: CACSL2BoogieTranslator took 1389.13 ms. Allocated memory was 146.3 MB in the beginning and 207.1 MB in the end (delta: 60.8 MB). Free memory was 98.6 MB in the beginning and 125.5 MB in the end (delta: -26.9 MB). Peak memory consumption was 42.0 MB. Max. memory is 7.1 GB. [2019-10-13 21:42:19,707 INFO L168 Benchmark]: Boogie Preprocessor took 196.84 ms. Allocated memory is still 207.1 MB. Free memory was 125.5 MB in the beginning and 114.2 MB in the end (delta: 11.3 MB). Peak memory consumption was 11.3 MB. Max. memory is 7.1 GB. [2019-10-13 21:42:19,708 INFO L168 Benchmark]: RCFGBuilder took 3168.13 ms. Allocated memory was 207.1 MB in the beginning and 307.8 MB in the end (delta: 100.7 MB). Free memory was 114.2 MB in the beginning and 233.1 MB in the end (delta: -118.9 MB). Peak memory consumption was 77.5 MB. Max. memory is 7.1 GB. [2019-10-13 21:42:19,709 INFO L168 Benchmark]: TraceAbstraction took 17908.61 ms. Allocated memory was 307.8 MB in the beginning and 682.1 MB in the end (delta: 374.3 MB). Free memory was 233.1 MB in the beginning and 542.5 MB in the end (delta: -309.5 MB). Peak memory consumption was 64.9 MB. Max. memory is 7.1 GB. [2019-10-13 21:42:19,713 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.22 ms. Allocated memory is still 146.3 MB. Free memory is still 122.3 MB. There was no memory consumed. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 1389.13 ms. Allocated memory was 146.3 MB in the beginning and 207.1 MB in the end (delta: 60.8 MB). Free memory was 98.6 MB in the beginning and 125.5 MB in the end (delta: -26.9 MB). Peak memory consumption was 42.0 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 196.84 ms. Allocated memory is still 207.1 MB. Free memory was 125.5 MB in the beginning and 114.2 MB in the end (delta: 11.3 MB). Peak memory consumption was 11.3 MB. Max. memory is 7.1 GB. * RCFGBuilder took 3168.13 ms. Allocated memory was 207.1 MB in the beginning and 307.8 MB in the end (delta: 100.7 MB). Free memory was 114.2 MB in the beginning and 233.1 MB in the end (delta: -118.9 MB). Peak memory consumption was 77.5 MB. Max. memory is 7.1 GB. * TraceAbstraction took 17908.61 ms. Allocated memory was 307.8 MB in the beginning and 682.1 MB in the end (delta: 374.3 MB). Free memory was 233.1 MB in the beginning and 542.5 MB in the end (delta: -309.5 MB). Peak memory consumption was 64.9 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: AssertionError: java.lang.IllegalArgumentException: Tried to insert element unknown in custom order: ε 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...