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_label30.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-36ac518-m [2019-10-07 00:58:50,375 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-10-07 00:58:50,380 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-10-07 00:58:50,398 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-10-07 00:58:50,399 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-10-07 00:58:50,401 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-10-07 00:58:50,403 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-10-07 00:58:50,413 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-10-07 00:58:50,418 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-10-07 00:58:50,421 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-10-07 00:58:50,422 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-10-07 00:58:50,424 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-10-07 00:58:50,424 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-10-07 00:58:50,426 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-10-07 00:58:50,428 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-10-07 00:58:50,429 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-10-07 00:58:50,431 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-10-07 00:58:50,432 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-10-07 00:58:50,433 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-10-07 00:58:50,436 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-10-07 00:58:50,440 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-10-07 00:58:50,443 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-10-07 00:58:50,445 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-10-07 00:58:50,446 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-10-07 00:58:50,448 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-10-07 00:58:50,448 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-10-07 00:58:50,448 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-10-07 00:58:50,450 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-10-07 00:58:50,452 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-10-07 00:58:50,453 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-10-07 00:58:50,453 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-10-07 00:58:50,455 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-10-07 00:58:50,456 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-10-07 00:58:50,457 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-10-07 00:58:50,459 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-10-07 00:58:50,459 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-10-07 00:58:50,460 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-10-07 00:58:50,460 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-10-07 00:58:50,460 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-10-07 00:58:50,461 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-10-07 00:58:50,463 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-10-07 00:58:50,463 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2019-10-07 00:58:50,491 INFO L113 SettingsManager]: Loading preferences was successful [2019-10-07 00:58:50,491 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-10-07 00:58:50,493 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-10-07 00:58:50,493 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-10-07 00:58:50,493 INFO L138 SettingsManager]: * Use SBE=true [2019-10-07 00:58:50,493 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-10-07 00:58:50,494 INFO L138 SettingsManager]: * sizeof long=4 [2019-10-07 00:58:50,494 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-10-07 00:58:50,494 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-10-07 00:58:50,494 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-10-07 00:58:50,494 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-10-07 00:58:50,495 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-10-07 00:58:50,495 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-10-07 00:58:50,495 INFO L138 SettingsManager]: * sizeof long double=12 [2019-10-07 00:58:50,496 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-10-07 00:58:50,496 INFO L138 SettingsManager]: * Use constant arrays=true [2019-10-07 00:58:50,496 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-10-07 00:58:50,496 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-10-07 00:58:50,496 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-10-07 00:58:50,497 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-10-07 00:58:50,497 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-10-07 00:58:50,497 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-07 00:58:50,497 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-10-07 00:58:50,497 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-10-07 00:58:50,497 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-10-07 00:58:50,498 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-10-07 00:58:50,498 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-10-07 00:58:50,498 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-10-07 00:58:50,499 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Trace refinement strategy -> SIFA_TAIPAN Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.sifa: Abstract Domain -> CompoundDomain Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder: Size of a code block -> LoopFreeBlock Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.sifa: Call Summarizer -> TopInputCallSummarizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.sifa: Fluid -> SizeLimitFluid Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.sifa: Simplification Technique -> SIMPLIFY_QUICK [2019-10-07 00:58:50,784 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-10-07 00:58:50,798 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-10-07 00:58:50,802 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-10-07 00:58:50,804 INFO L271 PluginConnector]: Initializing CDTParser... [2019-10-07 00:58:50,804 INFO L275 PluginConnector]: CDTParser initialized [2019-10-07 00:58:50,805 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/eca-rers2012/Problem03_label30.c [2019-10-07 00:58:50,891 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/24f677e69/cba20f9397a944cc83f1efb2885ea0af/FLAG19248bab7 [2019-10-07 00:58:51,633 INFO L306 CDTParser]: Found 1 translation units. [2019-10-07 00:58:51,634 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/eca-rers2012/Problem03_label30.c [2019-10-07 00:58:51,651 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/24f677e69/cba20f9397a944cc83f1efb2885ea0af/FLAG19248bab7 [2019-10-07 00:58:51,828 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/24f677e69/cba20f9397a944cc83f1efb2885ea0af [2019-10-07 00:58:51,840 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-10-07 00:58:51,842 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-10-07 00:58:51,845 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-10-07 00:58:51,845 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-10-07 00:58:51,849 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-10-07 00:58:51,850 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.10 12:58:51" (1/1) ... [2019-10-07 00:58:51,853 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3306400a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.10 12:58:51, skipping insertion in model container [2019-10-07 00:58:51,853 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.10 12:58:51" (1/1) ... [2019-10-07 00:58:51,859 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-10-07 00:58:51,944 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-10-07 00:58:52,675 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-07 00:58:52,681 INFO L188 MainTranslator]: Completed pre-run [2019-10-07 00:58:53,006 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-07 00:58:53,035 INFO L192 MainTranslator]: Completed translation [2019-10-07 00:58:53,035 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.10 12:58:53 WrapperNode [2019-10-07 00:58:53,036 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-10-07 00:58:53,036 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-10-07 00:58:53,037 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-10-07 00:58:53,037 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-10-07 00:58:53,051 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.10 12:58:53" (1/1) ... [2019-10-07 00:58:53,052 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.10 12:58:53" (1/1) ... [2019-10-07 00:58:53,092 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.10 12:58:53" (1/1) ... [2019-10-07 00:58:53,093 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.10 12:58:53" (1/1) ... [2019-10-07 00:58:53,147 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.10 12:58:53" (1/1) ... [2019-10-07 00:58:53,165 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.10 12:58:53" (1/1) ... [2019-10-07 00:58:53,175 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.10 12:58:53" (1/1) ... [2019-10-07 00:58:53,189 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-10-07 00:58:53,190 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-10-07 00:58:53,190 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-10-07 00:58:53,190 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-10-07 00:58:53,191 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.10 12:58:53" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-07 00:58:53,264 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-10-07 00:58:53,264 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-10-07 00:58:53,264 INFO L138 BoogieDeclarations]: Found implementation of procedure calculate_output [2019-10-07 00:58:53,265 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-10-07 00:58:53,265 INFO L130 BoogieDeclarations]: Found specification of procedure calculate_output [2019-10-07 00:58:53,265 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-10-07 00:58:53,265 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-10-07 00:58:53,266 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2019-10-07 00:58:53,266 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-10-07 00:58:53,266 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-10-07 00:58:53,266 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-10-07 00:58:56,310 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-10-07 00:58:56,310 INFO L284 CfgBuilder]: Removed 1 assume(true) statements. [2019-10-07 00:58:56,312 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.10 12:58:56 BoogieIcfgContainer [2019-10-07 00:58:56,312 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-10-07 00:58:56,314 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-10-07 00:58:56,314 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-10-07 00:58:56,317 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-10-07 00:58:56,318 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.10 12:58:51" (1/3) ... [2019-10-07 00:58:56,319 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2fec73e1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.10 12:58:56, skipping insertion in model container [2019-10-07 00:58:56,319 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.10 12:58:53" (2/3) ... [2019-10-07 00:58:56,319 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2fec73e1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.10 12:58:56, skipping insertion in model container [2019-10-07 00:58:56,320 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.10 12:58:56" (3/3) ... [2019-10-07 00:58:56,321 INFO L109 eAbstractionObserver]: Analyzing ICFG Problem03_label30.c [2019-10-07 00:58:56,332 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-10-07 00:58:56,341 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-10-07 00:58:56,353 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-10-07 00:58:56,381 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-10-07 00:58:56,381 INFO L374 AbstractCegarLoop]: Hoare is true [2019-10-07 00:58:56,381 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-10-07 00:58:56,382 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-10-07 00:58:56,382 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-10-07 00:58:56,382 INFO L378 AbstractCegarLoop]: Difference is false [2019-10-07 00:58:56,382 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-10-07 00:58:56,382 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-10-07 00:58:56,406 INFO L276 IsEmpty]: Start isEmpty. Operand 158 states. [2019-10-07 00:58:56,420 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 150 [2019-10-07 00:58:56,420 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 00:58:56,421 INFO L385 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-07 00:58:56,423 INFO L410 AbstractCegarLoop]: === Iteration 1 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 00:58:56,428 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 00:58:56,428 INFO L82 PathProgramCache]: Analyzing trace with hash 136471846, now seen corresponding path program 1 times [2019-10-07 00:58:56,435 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 00:58:56,435 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 00:58:56,435 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 00:58:56,436 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 00:58:56,436 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 00:58:56,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 00:58:57,213 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-07 00:58:57,214 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 00:58:57,215 INFO L211 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-07 00:58:57,216 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-07 00:58:57,222 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-07 00:58:57,237 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-07 00:58:57,238 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-07 00:58:57,241 INFO L87 Difference]: Start difference. First operand 158 states. Second operand 3 states. [2019-10-07 00:58:58,441 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-07 00:58:58,441 INFO L93 Difference]: Finished difference Result 462 states and 886 transitions. [2019-10-07 00:58:58,441 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-07 00:58:58,442 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 149 [2019-10-07 00:58:58,444 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-07 00:58:58,460 INFO L225 Difference]: With dead ends: 462 [2019-10-07 00:58:58,460 INFO L226 Difference]: Without dead ends: 301 [2019-10-07 00:58:58,465 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-07 00:58:58,484 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 301 states. [2019-10-07 00:58:58,533 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 301 to 301. [2019-10-07 00:58:58,534 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 301 states. [2019-10-07 00:58:58,537 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 301 states to 301 states and 564 transitions. [2019-10-07 00:58:58,539 INFO L78 Accepts]: Start accepts. Automaton has 301 states and 564 transitions. Word has length 149 [2019-10-07 00:58:58,540 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-07 00:58:58,540 INFO L462 AbstractCegarLoop]: Abstraction has 301 states and 564 transitions. [2019-10-07 00:58:58,540 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-07 00:58:58,540 INFO L276 IsEmpty]: Start isEmpty. Operand 301 states and 564 transitions. [2019-10-07 00:58:58,547 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 159 [2019-10-07 00:58:58,548 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 00:58:58,548 INFO L385 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-07 00:58:58,548 INFO L410 AbstractCegarLoop]: === Iteration 2 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 00:58:58,549 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 00:58:58,549 INFO L82 PathProgramCache]: Analyzing trace with hash 558841789, now seen corresponding path program 1 times [2019-10-07 00:58:58,549 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 00:58:58,549 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 00:58:58,549 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 00:58:58,550 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 00:58:58,550 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 00:58:58,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 00:58:58,711 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-07 00:58:58,711 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 00:58:58,711 INFO L211 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-07 00:58:58,712 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-07 00:58:58,714 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-07 00:58:58,714 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-07 00:58:58,714 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-10-07 00:58:58,714 INFO L87 Difference]: Start difference. First operand 301 states and 564 transitions. Second operand 6 states. [2019-10-07 00:59:00,252 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-07 00:59:00,253 INFO L93 Difference]: Finished difference Result 929 states and 1794 transitions. [2019-10-07 00:59:00,253 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-10-07 00:59:00,253 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 158 [2019-10-07 00:59:00,254 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-07 00:59:00,262 INFO L225 Difference]: With dead ends: 929 [2019-10-07 00:59:00,263 INFO L226 Difference]: Without dead ends: 633 [2019-10-07 00:59:00,266 INFO L606 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-07 00:59:00,268 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 633 states. [2019-10-07 00:59:00,328 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 633 to 603. [2019-10-07 00:59:00,328 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 603 states. [2019-10-07 00:59:00,333 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 603 states to 603 states and 1113 transitions. [2019-10-07 00:59:00,333 INFO L78 Accepts]: Start accepts. Automaton has 603 states and 1113 transitions. Word has length 158 [2019-10-07 00:59:00,333 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-07 00:59:00,334 INFO L462 AbstractCegarLoop]: Abstraction has 603 states and 1113 transitions. [2019-10-07 00:59:00,334 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-07 00:59:00,334 INFO L276 IsEmpty]: Start isEmpty. Operand 603 states and 1113 transitions. [2019-10-07 00:59:00,341 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 162 [2019-10-07 00:59:00,341 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 00:59:00,341 INFO L385 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-07 00:59:00,342 INFO L410 AbstractCegarLoop]: === Iteration 3 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 00:59:00,342 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 00:59:00,342 INFO L82 PathProgramCache]: Analyzing trace with hash -1532430062, now seen corresponding path program 1 times [2019-10-07 00:59:00,343 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 00:59:00,343 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 00:59:00,343 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 00:59:00,343 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 00:59:00,343 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 00:59:00,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 00:59:00,627 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-07 00:59:00,628 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 00:59:00,629 INFO L211 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-07 00:59:00,630 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-07 00:59:00,631 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-07 00:59:00,631 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-07 00:59:00,632 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-07 00:59:00,632 INFO L87 Difference]: Start difference. First operand 603 states and 1113 transitions. Second operand 3 states. [2019-10-07 00:59:01,697 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-07 00:59:01,697 INFO L93 Difference]: Finished difference Result 1793 states and 3375 transitions. [2019-10-07 00:59:01,698 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-07 00:59:01,698 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 161 [2019-10-07 00:59:01,699 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-07 00:59:01,720 INFO L225 Difference]: With dead ends: 1793 [2019-10-07 00:59:01,721 INFO L226 Difference]: Without dead ends: 1195 [2019-10-07 00:59:01,726 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-07 00:59:01,729 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1195 states. [2019-10-07 00:59:01,818 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1195 to 1195. [2019-10-07 00:59:01,818 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1195 states. [2019-10-07 00:59:01,826 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1195 states to 1195 states and 2084 transitions. [2019-10-07 00:59:01,827 INFO L78 Accepts]: Start accepts. Automaton has 1195 states and 2084 transitions. Word has length 161 [2019-10-07 00:59:01,830 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-07 00:59:01,839 INFO L462 AbstractCegarLoop]: Abstraction has 1195 states and 2084 transitions. [2019-10-07 00:59:01,839 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-07 00:59:01,839 INFO L276 IsEmpty]: Start isEmpty. Operand 1195 states and 2084 transitions. [2019-10-07 00:59:01,854 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 182 [2019-10-07 00:59:01,854 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 00:59:01,855 INFO L385 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-07 00:59:01,855 INFO L410 AbstractCegarLoop]: === Iteration 4 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 00:59:01,856 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 00:59:01,856 INFO L82 PathProgramCache]: Analyzing trace with hash -627082077, now seen corresponding path program 1 times [2019-10-07 00:59:01,857 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 00:59:01,857 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 00:59:01,857 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 00:59:01,857 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 00:59:01,857 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 00:59:01,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 00:59:02,159 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 29 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-07 00:59:02,160 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 00:59:02,160 INFO L211 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-07 00:59:02,160 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-07 00:59:02,162 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-07 00:59:02,162 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-07 00:59:02,163 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-07 00:59:02,163 INFO L87 Difference]: Start difference. First operand 1195 states and 2084 transitions. Second operand 3 states. [2019-10-07 00:59:03,100 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-07 00:59:03,101 INFO L93 Difference]: Finished difference Result 3569 states and 6416 transitions. [2019-10-07 00:59:03,102 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-07 00:59:03,103 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 181 [2019-10-07 00:59:03,103 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-07 00:59:03,120 INFO L225 Difference]: With dead ends: 3569 [2019-10-07 00:59:03,121 INFO L226 Difference]: Without dead ends: 2379 [2019-10-07 00:59:03,125 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-07 00:59:03,128 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2379 states. [2019-10-07 00:59:03,197 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2379 to 2379. [2019-10-07 00:59:03,198 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2379 states. [2019-10-07 00:59:03,211 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2379 states to 2379 states and 4177 transitions. [2019-10-07 00:59:03,211 INFO L78 Accepts]: Start accepts. Automaton has 2379 states and 4177 transitions. Word has length 181 [2019-10-07 00:59:03,212 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-07 00:59:03,212 INFO L462 AbstractCegarLoop]: Abstraction has 2379 states and 4177 transitions. [2019-10-07 00:59:03,212 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-07 00:59:03,212 INFO L276 IsEmpty]: Start isEmpty. Operand 2379 states and 4177 transitions. [2019-10-07 00:59:03,222 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 208 [2019-10-07 00:59:03,223 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 00:59:03,223 INFO L385 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-07 00:59:03,223 INFO L410 AbstractCegarLoop]: === Iteration 5 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 00:59:03,224 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 00:59:03,224 INFO L82 PathProgramCache]: Analyzing trace with hash 938383816, now seen corresponding path program 1 times [2019-10-07 00:59:03,224 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 00:59:03,224 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 00:59:03,225 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 00:59:03,225 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 00:59:03,225 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 00:59:03,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 00:59:03,407 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 55 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-07 00:59:03,408 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 00:59:03,408 INFO L211 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-07 00:59:03,408 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-07 00:59:03,409 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-07 00:59:03,409 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-07 00:59:03,409 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-10-07 00:59:03,410 INFO L87 Difference]: Start difference. First operand 2379 states and 4177 transitions. Second operand 6 states. [2019-10-07 00:59:04,796 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-07 00:59:04,799 INFO L93 Difference]: Finished difference Result 6011 states and 11153 transitions. [2019-10-07 00:59:04,799 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-10-07 00:59:04,799 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 207 [2019-10-07 00:59:04,801 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-07 00:59:04,833 INFO L225 Difference]: With dead ends: 6011 [2019-10-07 00:59:04,833 INFO L226 Difference]: Without dead ends: 3637 [2019-10-07 00:59:04,842 INFO L606 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-07 00:59:04,847 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3637 states. [2019-10-07 00:59:04,969 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3637 to 3607. [2019-10-07 00:59:04,970 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3607 states. [2019-10-07 00:59:04,989 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3607 states to 3607 states and 6391 transitions. [2019-10-07 00:59:04,989 INFO L78 Accepts]: Start accepts. Automaton has 3607 states and 6391 transitions. Word has length 207 [2019-10-07 00:59:04,990 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-07 00:59:04,990 INFO L462 AbstractCegarLoop]: Abstraction has 3607 states and 6391 transitions. [2019-10-07 00:59:04,990 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-07 00:59:04,990 INFO L276 IsEmpty]: Start isEmpty. Operand 3607 states and 6391 transitions. [2019-10-07 00:59:05,002 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 220 [2019-10-07 00:59:05,002 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 00:59:05,003 INFO L385 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2019-10-07 00:59:05,003 INFO L410 AbstractCegarLoop]: === Iteration 6 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 00:59:05,003 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 00:59:05,004 INFO L82 PathProgramCache]: Analyzing trace with hash -853528908, now seen corresponding path program 1 times [2019-10-07 00:59:05,004 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 00:59:05,004 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 00:59:05,004 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 00:59:05,004 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 00:59:05,005 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 00:59:05,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 00:59:05,373 INFO L134 CoverageAnalysis]: Checked inductivity of 76 backedges. 74 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-07 00:59:05,374 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 00:59:05,374 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2019-10-07 00:59:05,374 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-07 00:59:05,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 00:59:05,689 INFO L256 TraceCheckSpWp]: Trace formula consists of 1072 conjuncts, 11 conjunts are in the unsatisfiable core [2019-10-07 00:59:05,705 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-07 00:59:05,790 INFO L134 CoverageAnalysis]: Checked inductivity of 76 backedges. 20 proven. 0 refuted. 0 times theorem prover too weak. 56 trivial. 0 not checked. [2019-10-07 00:59:05,790 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-10-07 00:59:05,893 INFO L134 CoverageAnalysis]: Checked inductivity of 76 backedges. 64 proven. 8 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-10-07 00:59:05,894 INFO L211 tionRefinementEngine]: Constructing automaton from 1 perfect and 2 imperfect interpolant sequences. [2019-10-07 00:59:05,894 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [6, 5] total 10 [2019-10-07 00:59:05,895 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-07 00:59:05,895 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-07 00:59:05,896 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2019-10-07 00:59:05,896 INFO L87 Difference]: Start difference. First operand 3607 states and 6391 transitions. Second operand 5 states. [2019-10-07 00:59:07,575 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-07 00:59:07,576 INFO L93 Difference]: Finished difference Result 9793 states and 18332 transitions. [2019-10-07 00:59:07,576 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-10-07 00:59:07,578 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 219 [2019-10-07 00:59:07,578 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-07 00:59:07,647 INFO L225 Difference]: With dead ends: 9793 [2019-10-07 00:59:07,647 INFO L226 Difference]: Without dead ends: 6191 [2019-10-07 00:59:07,665 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 446 GetRequests, 435 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=45, Invalid=111, Unknown=0, NotChecked=0, Total=156 [2019-10-07 00:59:07,677 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6191 states. [2019-10-07 00:59:07,965 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6191 to 6121. [2019-10-07 00:59:07,970 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6121 states. [2019-10-07 00:59:07,990 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6121 states to 6121 states and 10956 transitions. [2019-10-07 00:59:07,991 INFO L78 Accepts]: Start accepts. Automaton has 6121 states and 10956 transitions. Word has length 219 [2019-10-07 00:59:07,991 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-07 00:59:07,991 INFO L462 AbstractCegarLoop]: Abstraction has 6121 states and 10956 transitions. [2019-10-07 00:59:07,991 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-07 00:59:07,991 INFO L276 IsEmpty]: Start isEmpty. Operand 6121 states and 10956 transitions. [2019-10-07 00:59:08,018 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 258 [2019-10-07 00:59:08,018 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 00:59:08,019 INFO L385 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-07 00:59:08,229 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-07 00:59:08,229 INFO L410 AbstractCegarLoop]: === Iteration 7 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 00:59:08,230 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 00:59:08,230 INFO L82 PathProgramCache]: Analyzing trace with hash 1798011981, now seen corresponding path program 1 times [2019-10-07 00:59:08,233 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 00:59:08,235 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 00:59:08,236 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 00:59:08,236 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 00:59:08,236 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 00:59:08,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 00:59:08,436 INFO L134 CoverageAnalysis]: Checked inductivity of 115 backedges. 102 proven. 9 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-10-07 00:59:08,436 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 00:59:08,437 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2019-10-07 00:59:08,437 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-07 00:59:08,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 00:59:08,703 INFO L256 TraceCheckSpWp]: Trace formula consists of 1087 conjuncts, 6 conjunts are in the unsatisfiable core [2019-10-07 00:59:08,712 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-07 00:59:08,909 INFO L134 CoverageAnalysis]: Checked inductivity of 115 backedges. 22 proven. 0 refuted. 0 times theorem prover too weak. 93 trivial. 0 not checked. [2019-10-07 00:59:08,910 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-10-07 00:59:09,025 INFO L134 CoverageAnalysis]: Checked inductivity of 115 backedges. 102 proven. 9 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-10-07 00:59:09,026 INFO L211 tionRefinementEngine]: Constructing automaton from 1 perfect and 2 imperfect interpolant sequences. [2019-10-07 00:59:09,026 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [6, 5] total 11 [2019-10-07 00:59:09,027 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-07 00:59:09,027 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-07 00:59:09,027 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=76, Unknown=0, NotChecked=0, Total=110 [2019-10-07 00:59:09,028 INFO L87 Difference]: Start difference. First operand 6121 states and 10956 transitions. Second operand 5 states. [2019-10-07 00:59:10,500 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-07 00:59:10,500 INFO L93 Difference]: Finished difference Result 16347 states and 30478 transitions. [2019-10-07 00:59:10,501 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-07 00:59:10,501 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 257 [2019-10-07 00:59:10,501 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-07 00:59:10,571 INFO L225 Difference]: With dead ends: 16347 [2019-10-07 00:59:10,571 INFO L226 Difference]: Without dead ends: 10231 [2019-10-07 00:59:10,600 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 521 GetRequests, 509 SyntacticMatches, 2 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=41, Invalid=91, Unknown=0, NotChecked=0, Total=132 [2019-10-07 00:59:10,618 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10231 states. [2019-10-07 00:59:11,082 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10231 to 10139. [2019-10-07 00:59:11,083 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10139 states. [2019-10-07 00:59:11,116 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10139 states to 10139 states and 17607 transitions. [2019-10-07 00:59:11,117 INFO L78 Accepts]: Start accepts. Automaton has 10139 states and 17607 transitions. Word has length 257 [2019-10-07 00:59:11,117 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-07 00:59:11,117 INFO L462 AbstractCegarLoop]: Abstraction has 10139 states and 17607 transitions. [2019-10-07 00:59:11,117 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-07 00:59:11,118 INFO L276 IsEmpty]: Start isEmpty. Operand 10139 states and 17607 transitions. [2019-10-07 00:59:11,163 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 266 [2019-10-07 00:59:11,163 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 00:59:11,164 INFO L385 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-07 00:59:11,373 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-07 00:59:11,374 INFO L410 AbstractCegarLoop]: === Iteration 8 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 00:59:11,374 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 00:59:11,374 INFO L82 PathProgramCache]: Analyzing trace with hash 691493853, now seen corresponding path program 1 times [2019-10-07 00:59:11,375 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 00:59:11,375 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 00:59:11,375 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 00:59:11,375 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 00:59:11,375 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 00:59:11,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 00:59:11,632 INFO L134 CoverageAnalysis]: Checked inductivity of 131 backedges. 129 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-07 00:59:11,632 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 00:59:11,632 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2019-10-07 00:59:11,632 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-07 00:59:11,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 00:59:11,881 INFO L256 TraceCheckSpWp]: Trace formula consists of 1095 conjuncts, 7 conjunts are in the unsatisfiable core [2019-10-07 00:59:11,895 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-07 00:59:11,955 INFO L134 CoverageAnalysis]: Checked inductivity of 131 backedges. 129 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-07 00:59:11,955 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-10-07 00:59:12,123 INFO L134 CoverageAnalysis]: Checked inductivity of 131 backedges. 129 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-07 00:59:12,123 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [2019-10-07 00:59:12,168 INFO L162 IcfgInterpreter]: Started Sifa with 153 locations of interest [2019-10-07 00:59:12,168 INFO L169 IcfgInterpreter]: Building call graph [2019-10-07 00:59:12,177 INFO L174 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-10-07 00:59:12,289 INFO L179 IcfgInterpreter]: Starting interpretation [2019-10-07 00:59:12,289 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2019-10-07 00:59:13,265 INFO L199 IcfgInterpreter]: Interpreting procedure main with input of size 208 for LOIs [2019-10-07 00:59:13,561 WARN L191 SmtUtils]: Spent 134.00 ms on a formula simplification that was a NOOP. DAG size: 298 [2019-10-07 00:59:13,801 WARN L191 SmtUtils]: Spent 103.00 ms on a formula simplification that was a NOOP. DAG size: 304 [2019-10-07 00:59:14,028 WARN L191 SmtUtils]: Spent 135.00 ms on a formula simplification that was a NOOP. DAG size: 237 [2019-10-07 00:59:14,139 WARN L191 SmtUtils]: Spent 108.00 ms on a formula simplification that was a NOOP. DAG size: 310 [2019-10-07 00:59:15,013 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-07 00:59:15,014 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: assume true; at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.tryExecuteInterpolantGenerator(TraceAbstractionRefinementEngine.java:295) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.generateProof(TraceAbstractionRefinementEngine.java:177) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.executeStrategy(TraceAbstractionRefinementEngine.java:167) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:90) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.RefinementEngineFactory.runRefinementEngine(RefinementEngineFactory.java:133) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:436) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterateInternal(AbstractCegarLoop.java:419) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:368) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.iterate(TraceAbstractionStarter.java:332) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:170) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:122) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:120) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:316) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:55) Caused by: java.lang.IllegalArgumentException: Tried to insert element unknown in custom order: assume true; at de.uni_freiburg.informatik.ultimate.lib.sifa.PriorityWorklist.add(PriorityWorklist.java:97) at de.uni_freiburg.informatik.ultimate.lib.sifa.DagInterpreter.lambda$2(DagInterpreter.java:135) at java.lang.Iterable.forEach(Iterable.java:75) at java.util.Collections$UnmodifiableCollection.forEach(Collections.java:1080) at de.uni_freiburg.informatik.ultimate.lib.sifa.DagInterpreter.interpret(DagInterpreter.java:135) at de.uni_freiburg.informatik.ultimate.lib.sifa.DagInterpreter.interpret(DagInterpreter.java:104) at de.uni_freiburg.informatik.ultimate.lib.sifa.summarizers.TopInputCallSummarizer.computeTopSummary(TopInputCallSummarizer.java:78) at java.util.HashMap.computeIfAbsent(HashMap.java:1127) at de.uni_freiburg.informatik.ultimate.lib.sifa.summarizers.TopInputCallSummarizer.summarize(TopInputCallSummarizer.java:67) at de.uni_freiburg.informatik.ultimate.lib.sifa.DagInterpreter.ipretCallReturnSummary(DagInterpreter.java:230) at de.uni_freiburg.informatik.ultimate.lib.sifa.DagInterpreter.ipretTransAndStoreLoiPred(DagInterpreter.java:214) at de.uni_freiburg.informatik.ultimate.lib.sifa.DagInterpreter.ipretTrans(DagInterpreter.java:197) at de.uni_freiburg.informatik.ultimate.lib.sifa.DagInterpreter.ipretNode(DagInterpreter.java:166) at de.uni_freiburg.informatik.ultimate.lib.sifa.DagInterpreter.interpret(DagInterpreter.java:130) at de.uni_freiburg.informatik.ultimate.lib.sifa.IcfgInterpreter.interpretLoisInProcedure(IcfgInterpreter.java:139) at de.uni_freiburg.informatik.ultimate.lib.sifa.IcfgInterpreter.interpret(IcfgInterpreter.java:129) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:99) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:67) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:99) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:75) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.tryExecuteInterpolantGenerator(TraceAbstractionRefinementEngine.java:287) ... 21 more [2019-10-07 00:59:15,022 INFO L168 Benchmark]: Toolchain (without parser) took 23179.51 ms. Allocated memory was 138.4 MB in the beginning and 705.2 MB in the end (delta: 566.8 MB). Free memory was 96.6 MB in the beginning and 306.2 MB in the end (delta: -209.6 MB). Peak memory consumption was 357.2 MB. Max. memory is 7.1 GB. [2019-10-07 00:59:15,023 INFO L168 Benchmark]: CDTParser took 0.23 ms. Allocated memory is still 138.4 MB. Free memory was 121.6 MB in the beginning and 121.4 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. [2019-10-07 00:59:15,024 INFO L168 Benchmark]: CACSL2BoogieTranslator took 1191.13 ms. Allocated memory was 138.4 MB in the beginning and 205.0 MB in the end (delta: 66.6 MB). Free memory was 96.4 MB in the beginning and 122.9 MB in the end (delta: -26.5 MB). Peak memory consumption was 45.3 MB. Max. memory is 7.1 GB. [2019-10-07 00:59:15,024 INFO L168 Benchmark]: Boogie Preprocessor took 153.14 ms. Allocated memory is still 205.0 MB. Free memory was 122.9 MB in the beginning and 111.2 MB in the end (delta: 11.8 MB). Peak memory consumption was 11.8 MB. Max. memory is 7.1 GB. [2019-10-07 00:59:15,027 INFO L168 Benchmark]: RCFGBuilder took 3122.43 ms. Allocated memory was 205.0 MB in the beginning and 310.4 MB in the end (delta: 105.4 MB). Free memory was 111.2 MB in the beginning and 248.4 MB in the end (delta: -137.2 MB). Peak memory consumption was 83.1 MB. Max. memory is 7.1 GB. [2019-10-07 00:59:15,028 INFO L168 Benchmark]: TraceAbstraction took 18705.90 ms. Allocated memory was 310.4 MB in the beginning and 705.2 MB in the end (delta: 394.8 MB). Free memory was 248.4 MB in the beginning and 306.2 MB in the end (delta: -57.8 MB). Peak memory consumption was 337.0 MB. Max. memory is 7.1 GB. [2019-10-07 00:59:15,038 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.23 ms. Allocated memory is still 138.4 MB. Free memory was 121.6 MB in the beginning and 121.4 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 1191.13 ms. Allocated memory was 138.4 MB in the beginning and 205.0 MB in the end (delta: 66.6 MB). Free memory was 96.4 MB in the beginning and 122.9 MB in the end (delta: -26.5 MB). Peak memory consumption was 45.3 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 153.14 ms. Allocated memory is still 205.0 MB. Free memory was 122.9 MB in the beginning and 111.2 MB in the end (delta: 11.8 MB). Peak memory consumption was 11.8 MB. Max. memory is 7.1 GB. * RCFGBuilder took 3122.43 ms. Allocated memory was 205.0 MB in the beginning and 310.4 MB in the end (delta: 105.4 MB). Free memory was 111.2 MB in the beginning and 248.4 MB in the end (delta: -137.2 MB). Peak memory consumption was 83.1 MB. Max. memory is 7.1 GB. * TraceAbstraction took 18705.90 ms. Allocated memory was 310.4 MB in the beginning and 705.2 MB in the end (delta: 394.8 MB). Free memory was 248.4 MB in the beginning and 306.2 MB in the end (delta: -57.8 MB). Peak memory consumption was 337.0 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: assume true; de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: AssertionError: java.lang.IllegalArgumentException: Tried to insert element unknown in custom order: assume true;: de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.tryExecuteInterpolantGenerator(TraceAbstractionRefinementEngine.java:295) RESULT: Ultimate could not prove your program: Toolchain returned no result. Received shutdown request...