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_label22.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-36ac518-m [2019-10-07 00:58:37,286 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-10-07 00:58:37,288 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-10-07 00:58:37,305 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-10-07 00:58:37,305 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-10-07 00:58:37,307 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-10-07 00:58:37,309 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-10-07 00:58:37,318 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-10-07 00:58:37,323 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-10-07 00:58:37,325 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-10-07 00:58:37,326 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-10-07 00:58:37,328 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-10-07 00:58:37,328 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-10-07 00:58:37,330 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-10-07 00:58:37,332 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-10-07 00:58:37,333 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-10-07 00:58:37,334 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-10-07 00:58:37,335 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-10-07 00:58:37,336 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-10-07 00:58:37,341 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-10-07 00:58:37,344 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-10-07 00:58:37,347 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-10-07 00:58:37,349 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-10-07 00:58:37,350 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-10-07 00:58:37,352 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-10-07 00:58:37,352 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-10-07 00:58:37,352 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-10-07 00:58:37,354 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-10-07 00:58:37,355 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-10-07 00:58:37,356 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-10-07 00:58:37,356 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-10-07 00:58:37,357 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-10-07 00:58:37,357 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-10-07 00:58:37,358 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-10-07 00:58:37,359 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-10-07 00:58:37,359 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-10-07 00:58:37,360 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-10-07 00:58:37,360 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-10-07 00:58:37,360 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-10-07 00:58:37,361 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-10-07 00:58:37,362 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-10-07 00:58:37,363 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:37,396 INFO L113 SettingsManager]: Loading preferences was successful [2019-10-07 00:58:37,397 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-10-07 00:58:37,398 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-10-07 00:58:37,398 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-10-07 00:58:37,398 INFO L138 SettingsManager]: * Use SBE=true [2019-10-07 00:58:37,398 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-10-07 00:58:37,399 INFO L138 SettingsManager]: * sizeof long=4 [2019-10-07 00:58:37,399 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-10-07 00:58:37,399 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-10-07 00:58:37,399 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-10-07 00:58:37,399 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-10-07 00:58:37,399 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-10-07 00:58:37,400 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-10-07 00:58:37,400 INFO L138 SettingsManager]: * sizeof long double=12 [2019-10-07 00:58:37,402 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-10-07 00:58:37,403 INFO L138 SettingsManager]: * Use constant arrays=true [2019-10-07 00:58:37,403 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-10-07 00:58:37,403 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-10-07 00:58:37,403 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-10-07 00:58:37,403 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-10-07 00:58:37,404 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-10-07 00:58:37,404 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-07 00:58:37,404 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-10-07 00:58:37,404 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-10-07 00:58:37,404 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-10-07 00:58:37,405 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-10-07 00:58:37,405 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-10-07 00:58:37,405 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-10-07 00:58:37,405 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:37,679 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-10-07 00:58:37,691 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-10-07 00:58:37,695 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-10-07 00:58:37,696 INFO L271 PluginConnector]: Initializing CDTParser... [2019-10-07 00:58:37,697 INFO L275 PluginConnector]: CDTParser initialized [2019-10-07 00:58:37,697 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/eca-rers2012/Problem03_label22.c [2019-10-07 00:58:37,757 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/15432b6a6/1add173cd7384bbd9c88ebc325308cc4/FLAGbfcb3c601 [2019-10-07 00:58:38,347 INFO L306 CDTParser]: Found 1 translation units. [2019-10-07 00:58:38,348 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/eca-rers2012/Problem03_label22.c [2019-10-07 00:58:38,364 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/15432b6a6/1add173cd7384bbd9c88ebc325308cc4/FLAGbfcb3c601 [2019-10-07 00:58:38,517 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/15432b6a6/1add173cd7384bbd9c88ebc325308cc4 [2019-10-07 00:58:38,527 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-10-07 00:58:38,528 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-10-07 00:58:38,529 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-10-07 00:58:38,529 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-10-07 00:58:38,533 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-10-07 00:58:38,534 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.10 12:58:38" (1/1) ... [2019-10-07 00:58:38,536 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@413b6478 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.10 12:58:38, skipping insertion in model container [2019-10-07 00:58:38,537 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.10 12:58:38" (1/1) ... [2019-10-07 00:58:38,544 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-10-07 00:58:38,628 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-10-07 00:58:39,405 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-07 00:58:39,412 INFO L188 MainTranslator]: Completed pre-run [2019-10-07 00:58:39,716 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-07 00:58:39,748 INFO L192 MainTranslator]: Completed translation [2019-10-07 00:58:39,749 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.10 12:58:39 WrapperNode [2019-10-07 00:58:39,750 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-10-07 00:58:39,751 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-10-07 00:58:39,751 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-10-07 00:58:39,751 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-10-07 00:58:39,770 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:39" (1/1) ... [2019-10-07 00:58:39,771 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:39" (1/1) ... [2019-10-07 00:58:39,809 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:39" (1/1) ... [2019-10-07 00:58:39,810 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:39" (1/1) ... [2019-10-07 00:58:39,891 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:39" (1/1) ... [2019-10-07 00:58:39,915 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:39" (1/1) ... [2019-10-07 00:58:39,932 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:39" (1/1) ... [2019-10-07 00:58:39,947 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-10-07 00:58:39,954 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-10-07 00:58:39,954 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-10-07 00:58:39,954 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-10-07 00:58:39,955 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.10 12:58:39" (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:40,021 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-10-07 00:58:40,021 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-10-07 00:58:40,021 INFO L138 BoogieDeclarations]: Found implementation of procedure calculate_output [2019-10-07 00:58:40,021 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-10-07 00:58:40,022 INFO L130 BoogieDeclarations]: Found specification of procedure calculate_output [2019-10-07 00:58:40,023 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-10-07 00:58:40,023 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-10-07 00:58:40,024 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2019-10-07 00:58:40,024 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-10-07 00:58:40,024 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-10-07 00:58:40,024 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-10-07 00:58:43,009 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-10-07 00:58:43,009 INFO L284 CfgBuilder]: Removed 1 assume(true) statements. [2019-10-07 00:58:43,011 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.10 12:58:43 BoogieIcfgContainer [2019-10-07 00:58:43,011 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-10-07 00:58:43,012 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-10-07 00:58:43,013 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-10-07 00:58:43,016 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-10-07 00:58:43,016 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.10 12:58:38" (1/3) ... [2019-10-07 00:58:43,017 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6ef4bdfb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.10 12:58:43, skipping insertion in model container [2019-10-07 00:58:43,017 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.10 12:58:39" (2/3) ... [2019-10-07 00:58:43,018 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6ef4bdfb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.10 12:58:43, skipping insertion in model container [2019-10-07 00:58:43,018 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.10 12:58:43" (3/3) ... [2019-10-07 00:58:43,020 INFO L109 eAbstractionObserver]: Analyzing ICFG Problem03_label22.c [2019-10-07 00:58:43,029 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-10-07 00:58:43,037 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-10-07 00:58:43,048 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-10-07 00:58:43,075 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-10-07 00:58:43,075 INFO L374 AbstractCegarLoop]: Hoare is true [2019-10-07 00:58:43,075 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-10-07 00:58:43,075 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-10-07 00:58:43,075 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-10-07 00:58:43,076 INFO L378 AbstractCegarLoop]: Difference is false [2019-10-07 00:58:43,076 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-10-07 00:58:43,076 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-10-07 00:58:43,097 INFO L276 IsEmpty]: Start isEmpty. Operand 158 states. [2019-10-07 00:58:43,111 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 150 [2019-10-07 00:58:43,111 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 00:58:43,112 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:43,114 INFO L410 AbstractCegarLoop]: === Iteration 1 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 00:58:43,119 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 00:58:43,120 INFO L82 PathProgramCache]: Analyzing trace with hash 136469798, now seen corresponding path program 1 times [2019-10-07 00:58:43,129 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 00:58:43,129 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 00:58:43,129 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 00:58:43,130 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 00:58:43,130 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 00:58:43,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 00:58:43,849 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:43,850 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 00:58:43,850 INFO L211 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-07 00:58:43,851 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-07 00:58:43,855 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-07 00:58:43,869 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-07 00:58:43,870 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-07 00:58:43,872 INFO L87 Difference]: Start difference. First operand 158 states. Second operand 3 states. [2019-10-07 00:58:44,980 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-07 00:58:44,980 INFO L93 Difference]: Finished difference Result 462 states and 886 transitions. [2019-10-07 00:58:44,981 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-07 00:58:44,982 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 149 [2019-10-07 00:58:44,984 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-07 00:58:45,006 INFO L225 Difference]: With dead ends: 462 [2019-10-07 00:58:45,006 INFO L226 Difference]: Without dead ends: 301 [2019-10-07 00:58:45,011 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:45,030 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 301 states. [2019-10-07 00:58:45,078 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 301 to 301. [2019-10-07 00:58:45,079 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 301 states. [2019-10-07 00:58:45,082 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 301 states to 301 states and 564 transitions. [2019-10-07 00:58:45,084 INFO L78 Accepts]: Start accepts. Automaton has 301 states and 564 transitions. Word has length 149 [2019-10-07 00:58:45,085 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-07 00:58:45,085 INFO L462 AbstractCegarLoop]: Abstraction has 301 states and 564 transitions. [2019-10-07 00:58:45,085 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-07 00:58:45,085 INFO L276 IsEmpty]: Start isEmpty. Operand 301 states and 564 transitions. [2019-10-07 00:58:45,090 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 159 [2019-10-07 00:58:45,090 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 00:58:45,090 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:45,090 INFO L410 AbstractCegarLoop]: === Iteration 2 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 00:58:45,091 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 00:58:45,091 INFO L82 PathProgramCache]: Analyzing trace with hash 558839741, now seen corresponding path program 1 times [2019-10-07 00:58:45,094 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 00:58:45,094 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 00:58:45,095 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 00:58:45,095 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 00:58:45,095 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 00:58:45,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 00:58:45,289 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:45,289 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 00:58:45,289 INFO L211 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-07 00:58:45,290 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-07 00:58:45,291 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-07 00:58:45,292 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-07 00:58:45,292 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-10-07 00:58:45,292 INFO L87 Difference]: Start difference. First operand 301 states and 564 transitions. Second operand 6 states. [2019-10-07 00:58:46,701 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-07 00:58:46,702 INFO L93 Difference]: Finished difference Result 929 states and 1794 transitions. [2019-10-07 00:58:46,702 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-10-07 00:58:46,702 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 158 [2019-10-07 00:58:46,703 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-07 00:58:46,710 INFO L225 Difference]: With dead ends: 929 [2019-10-07 00:58:46,710 INFO L226 Difference]: Without dead ends: 633 [2019-10-07 00:58:46,713 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:58:46,715 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 633 states. [2019-10-07 00:58:46,794 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 633 to 603. [2019-10-07 00:58:46,794 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 603 states. [2019-10-07 00:58:46,799 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 603 states to 603 states and 1113 transitions. [2019-10-07 00:58:46,799 INFO L78 Accepts]: Start accepts. Automaton has 603 states and 1113 transitions. Word has length 158 [2019-10-07 00:58:46,800 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-07 00:58:46,800 INFO L462 AbstractCegarLoop]: Abstraction has 603 states and 1113 transitions. [2019-10-07 00:58:46,800 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-07 00:58:46,800 INFO L276 IsEmpty]: Start isEmpty. Operand 603 states and 1113 transitions. [2019-10-07 00:58:46,808 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 162 [2019-10-07 00:58:46,808 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 00:58:46,809 INFO L385 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-07 00:58:46,809 INFO L410 AbstractCegarLoop]: === Iteration 3 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 00:58:46,809 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 00:58:46,809 INFO L82 PathProgramCache]: Analyzing trace with hash -1532432110, now seen corresponding path program 1 times [2019-10-07 00:58:46,810 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 00:58:46,810 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 00:58:46,810 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 00:58:46,812 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 00:58:46,812 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 00:58:46,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 00:58:47,102 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-07 00:58:47,103 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 00:58:47,103 INFO L211 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-07 00:58:47,104 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-07 00:58:47,105 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-07 00:58:47,105 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-07 00:58:47,105 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-07 00:58:47,106 INFO L87 Difference]: Start difference. First operand 603 states and 1113 transitions. Second operand 3 states. [2019-10-07 00:58:48,042 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-07 00:58:48,043 INFO L93 Difference]: Finished difference Result 1793 states and 3375 transitions. [2019-10-07 00:58:48,043 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-07 00:58:48,043 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 161 [2019-10-07 00:58:48,044 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-07 00:58:48,052 INFO L225 Difference]: With dead ends: 1793 [2019-10-07 00:58:48,052 INFO L226 Difference]: Without dead ends: 1195 [2019-10-07 00:58:48,056 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:48,058 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1195 states. [2019-10-07 00:58:48,093 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1195 to 1195. [2019-10-07 00:58:48,093 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1195 states. [2019-10-07 00:58:48,099 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1195 states to 1195 states and 2084 transitions. [2019-10-07 00:58:48,099 INFO L78 Accepts]: Start accepts. Automaton has 1195 states and 2084 transitions. Word has length 161 [2019-10-07 00:58:48,100 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-07 00:58:48,100 INFO L462 AbstractCegarLoop]: Abstraction has 1195 states and 2084 transitions. [2019-10-07 00:58:48,100 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-07 00:58:48,101 INFO L276 IsEmpty]: Start isEmpty. Operand 1195 states and 2084 transitions. [2019-10-07 00:58:48,106 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 182 [2019-10-07 00:58:48,106 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 00:58:48,107 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:58:48,107 INFO L410 AbstractCegarLoop]: === Iteration 4 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 00:58:48,107 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 00:58:48,107 INFO L82 PathProgramCache]: Analyzing trace with hash -627084125, now seen corresponding path program 1 times [2019-10-07 00:58:48,108 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 00:58:48,108 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 00:58:48,108 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 00:58:48,108 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 00:58:48,108 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 00:58:48,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 00:58:48,402 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:58:48,403 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 00:58:48,403 INFO L211 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-07 00:58:48,403 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-07 00:58:48,404 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-07 00:58:48,404 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-07 00:58:48,404 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-07 00:58:48,405 INFO L87 Difference]: Start difference. First operand 1195 states and 2084 transitions. Second operand 3 states. [2019-10-07 00:58:49,223 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-07 00:58:49,224 INFO L93 Difference]: Finished difference Result 3571 states and 6400 transitions. [2019-10-07 00:58:49,225 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-07 00:58:49,225 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 181 [2019-10-07 00:58:49,226 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-07 00:58:49,243 INFO L225 Difference]: With dead ends: 3571 [2019-10-07 00:58:49,244 INFO L226 Difference]: Without dead ends: 2381 [2019-10-07 00:58:49,248 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:49,251 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2381 states. [2019-10-07 00:58:49,319 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2381 to 2381. [2019-10-07 00:58:49,320 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2381 states. [2019-10-07 00:58:49,331 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2381 states to 2381 states and 4191 transitions. [2019-10-07 00:58:49,331 INFO L78 Accepts]: Start accepts. Automaton has 2381 states and 4191 transitions. Word has length 181 [2019-10-07 00:58:49,332 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-07 00:58:49,332 INFO L462 AbstractCegarLoop]: Abstraction has 2381 states and 4191 transitions. [2019-10-07 00:58:49,332 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-07 00:58:49,332 INFO L276 IsEmpty]: Start isEmpty. Operand 2381 states and 4191 transitions. [2019-10-07 00:58:49,341 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 238 [2019-10-07 00:58:49,341 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 00:58:49,342 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:49,342 INFO L410 AbstractCegarLoop]: === Iteration 5 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 00:58:49,342 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 00:58:49,343 INFO L82 PathProgramCache]: Analyzing trace with hash 188197188, now seen corresponding path program 1 times [2019-10-07 00:58:49,343 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 00:58:49,343 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 00:58:49,343 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 00:58:49,343 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 00:58:49,344 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 00:58:49,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 00:58:49,547 INFO L134 CoverageAnalysis]: Checked inductivity of 95 backedges. 82 proven. 9 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-10-07 00:58:49,548 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 00:58:49,548 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2019-10-07 00:58:49,548 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-07 00:58:49,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 00:58:49,792 INFO L256 TraceCheckSpWp]: Trace formula consists of 1066 conjuncts, 6 conjunts are in the unsatisfiable core [2019-10-07 00:58:49,823 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-07 00:58:49,972 INFO L134 CoverageAnalysis]: Checked inductivity of 95 backedges. 22 proven. 0 refuted. 0 times theorem prover too weak. 73 trivial. 0 not checked. [2019-10-07 00:58:49,972 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-10-07 00:58:50,078 INFO L134 CoverageAnalysis]: Checked inductivity of 95 backedges. 82 proven. 9 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-10-07 00:58:50,078 INFO L211 tionRefinementEngine]: Constructing automaton from 1 perfect and 2 imperfect interpolant sequences. [2019-10-07 00:58:50,079 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [6, 5] total 11 [2019-10-07 00:58:50,079 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-07 00:58:50,080 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-07 00:58:50,080 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=76, Unknown=0, NotChecked=0, Total=110 [2019-10-07 00:58:50,080 INFO L87 Difference]: Start difference. First operand 2381 states and 4191 transitions. Second operand 5 states. [2019-10-07 00:58:51,279 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-07 00:58:51,279 INFO L93 Difference]: Finished difference Result 6967 states and 13483 transitions. [2019-10-07 00:58:51,280 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-07 00:58:51,281 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 237 [2019-10-07 00:58:51,281 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-07 00:58:51,323 INFO L225 Difference]: With dead ends: 6967 [2019-10-07 00:58:51,323 INFO L226 Difference]: Without dead ends: 4591 [2019-10-07 00:58:51,333 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 481 GetRequests, 469 SyntacticMatches, 2 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=41, Invalid=91, Unknown=0, NotChecked=0, Total=132 [2019-10-07 00:58:51,338 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4591 states. [2019-10-07 00:58:51,490 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4591 to 4527. [2019-10-07 00:58:51,490 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4527 states. [2019-10-07 00:58:51,518 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4527 states to 4527 states and 7991 transitions. [2019-10-07 00:58:51,519 INFO L78 Accepts]: Start accepts. Automaton has 4527 states and 7991 transitions. Word has length 237 [2019-10-07 00:58:51,519 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-07 00:58:51,519 INFO L462 AbstractCegarLoop]: Abstraction has 4527 states and 7991 transitions. [2019-10-07 00:58:51,519 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-07 00:58:51,519 INFO L276 IsEmpty]: Start isEmpty. Operand 4527 states and 7991 transitions. [2019-10-07 00:58:51,544 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 239 [2019-10-07 00:58:51,544 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 00:58:51,545 INFO L385 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-07 00:58:51,750 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-07 00:58:51,750 INFO L410 AbstractCegarLoop]: === Iteration 6 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 00:58:51,751 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 00:58:51,751 INFO L82 PathProgramCache]: Analyzing trace with hash 1363875243, now seen corresponding path program 1 times [2019-10-07 00:58:51,751 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 00:58:51,751 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 00:58:51,752 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 00:58:51,752 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 00:58:51,752 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 00:58:51,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 00:58:52,124 INFO L134 CoverageAnalysis]: Checked inductivity of 97 backedges. 95 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-07 00:58:52,125 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 00:58:52,127 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2019-10-07 00:58:52,127 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-07 00:58:52,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 00:58:52,341 INFO L256 TraceCheckSpWp]: Trace formula consists of 1061 conjuncts, 11 conjunts are in the unsatisfiable core [2019-10-07 00:58:52,348 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-07 00:58:52,427 INFO L134 CoverageAnalysis]: Checked inductivity of 97 backedges. 24 proven. 0 refuted. 0 times theorem prover too weak. 73 trivial. 0 not checked. [2019-10-07 00:58:52,427 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-10-07 00:58:52,685 WARN L191 SmtUtils]: Spent 182.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 38 [2019-10-07 00:58:52,741 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-07 00:58:52,743 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-07 00:58:52,743 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-07 00:58:52,744 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-07 00:58:52,751 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-07 00:58:52,751 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-07 00:58:52,757 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-07 00:58:52,757 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-07 00:58:52,758 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-07 00:58:52,759 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-07 00:58:52,762 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-07 00:58:52,764 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-07 00:58:52,765 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-07 00:58:52,766 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-07 00:58:52,767 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-07 00:58:52,768 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-07 00:58:52,770 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-07 00:58:52,771 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-07 00:58:52,772 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-07 00:58:52,776 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-07 00:58:52,776 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-07 00:58:52,777 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-07 00:58:52,778 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-07 00:58:52,781 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-07 00:58:52,782 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-07 00:58:52,784 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-07 00:58:52,785 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-07 00:58:52,870 INFO L134 CoverageAnalysis]: Checked inductivity of 97 backedges. 83 proven. 10 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-10-07 00:58:52,871 INFO L211 tionRefinementEngine]: Constructing automaton from 1 perfect and 2 imperfect interpolant sequences. [2019-10-07 00:58:52,871 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [6, 5] total 11 [2019-10-07 00:58:52,872 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-07 00:58:52,872 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-07 00:58:52,872 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2019-10-07 00:58:52,873 INFO L87 Difference]: Start difference. First operand 4527 states and 7991 transitions. Second operand 5 states. [2019-10-07 00:58:54,136 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-07 00:58:54,136 INFO L93 Difference]: Finished difference Result 11335 states and 20858 transitions. [2019-10-07 00:58:54,137 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-10-07 00:58:54,137 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 238 [2019-10-07 00:58:54,137 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-07 00:58:54,195 INFO L225 Difference]: With dead ends: 11335 [2019-10-07 00:58:54,195 INFO L226 Difference]: Without dead ends: 6813 [2019-10-07 00:58:54,214 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 484 GetRequests, 472 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=43, Invalid=139, Unknown=0, NotChecked=0, Total=182 [2019-10-07 00:58:54,223 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6813 states. [2019-10-07 00:58:54,411 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6813 to 6761. [2019-10-07 00:58:54,411 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6761 states. [2019-10-07 00:58:54,431 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6761 states to 6761 states and 11040 transitions. [2019-10-07 00:58:54,431 INFO L78 Accepts]: Start accepts. Automaton has 6761 states and 11040 transitions. Word has length 238 [2019-10-07 00:58:54,431 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-07 00:58:54,432 INFO L462 AbstractCegarLoop]: Abstraction has 6761 states and 11040 transitions. [2019-10-07 00:58:54,432 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-07 00:58:54,432 INFO L276 IsEmpty]: Start isEmpty. Operand 6761 states and 11040 transitions. [2019-10-07 00:58:54,458 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 246 [2019-10-07 00:58:54,459 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 00:58:54,459 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:54,663 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-07 00:58:54,664 INFO L410 AbstractCegarLoop]: === Iteration 7 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 00:58:54,664 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 00:58:54,664 INFO L82 PathProgramCache]: Analyzing trace with hash 715321556, now seen corresponding path program 1 times [2019-10-07 00:58:54,664 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 00:58:54,664 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 00:58:54,665 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 00:58:54,665 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 00:58:54,665 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 00:58:54,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 00:58:55,035 INFO L134 CoverageAnalysis]: Checked inductivity of 111 backedges. 109 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-07 00:58:55,035 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 00:58:55,036 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2019-10-07 00:58:55,036 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:58:55,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 00:58:55,335 INFO L256 TraceCheckSpWp]: Trace formula consists of 1074 conjuncts, 13 conjunts are in the unsatisfiable core [2019-10-07 00:58:55,341 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-07 00:58:55,519 INFO L134 CoverageAnalysis]: Checked inductivity of 111 backedges. 109 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-07 00:58:55,520 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-10-07 00:58:55,782 WARN L191 SmtUtils]: Spent 156.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 40 [2019-10-07 00:58:55,826 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-07 00:58:55,827 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-07 00:58:55,827 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-07 00:58:55,828 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-07 00:58:55,829 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-07 00:58:55,830 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-07 00:58:55,831 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-07 00:58:55,832 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-07 00:58:55,832 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-07 00:58:56,090 INFO L134 CoverageAnalysis]: Checked inductivity of 111 backedges. 109 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-07 00:58:56,090 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [2019-10-07 00:58:56,147 INFO L162 IcfgInterpreter]: Started Sifa with 153 locations of interest [2019-10-07 00:58:56,147 INFO L169 IcfgInterpreter]: Building call graph [2019-10-07 00:58:56,158 INFO L174 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-10-07 00:58:56,167 INFO L179 IcfgInterpreter]: Starting interpretation [2019-10-07 00:58:56,167 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2019-10-07 00:58:56,495 WARN L191 SmtUtils]: Spent 152.00 ms on a formula simplification that was a NOOP. DAG size: 182 [2019-10-07 00:58:57,106 INFO L199 IcfgInterpreter]: Interpreting procedure main with input of size 210 for LOIs [2019-10-07 00:58:57,454 WARN L191 SmtUtils]: Spent 174.00 ms on a formula simplification that was a NOOP. DAG size: 298 [2019-10-07 00:58:57,740 WARN L191 SmtUtils]: Spent 103.00 ms on a formula simplification that was a NOOP. DAG size: 231 [2019-10-07 00:58:57,976 WARN L191 SmtUtils]: Spent 234.00 ms on a formula simplification that was a NOOP. DAG size: 304 [2019-10-07 00:58:58,140 WARN L191 SmtUtils]: Spent 154.00 ms on a formula simplification that was a NOOP. DAG size: 219 [2019-10-07 00:58:58,412 WARN L191 SmtUtils]: Spent 144.00 ms on a formula simplification that was a NOOP. DAG size: 310 [2019-10-07 00:58:59,262 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-07 00:58:59,264 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:58:59,270 INFO L168 Benchmark]: Toolchain (without parser) took 20742.00 ms. Allocated memory was 145.2 MB in the beginning and 649.1 MB in the end (delta: 503.8 MB). Free memory was 96.6 MB in the beginning and 235.2 MB in the end (delta: -138.7 MB). Peak memory consumption was 365.2 MB. Max. memory is 7.1 GB. [2019-10-07 00:58:59,271 INFO L168 Benchmark]: CDTParser took 0.21 ms. Allocated memory is still 145.2 MB. Free memory was 120.3 MB in the beginning and 120.1 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:58:59,272 INFO L168 Benchmark]: CACSL2BoogieTranslator took 1221.16 ms. Allocated memory was 145.2 MB in the beginning and 208.1 MB in the end (delta: 62.9 MB). Free memory was 96.1 MB in the beginning and 133.2 MB in the end (delta: -37.0 MB). Peak memory consumption was 35.2 MB. Max. memory is 7.1 GB. [2019-10-07 00:58:59,274 INFO L168 Benchmark]: Boogie Preprocessor took 202.44 ms. Allocated memory is still 208.1 MB. Free memory was 133.2 MB in the beginning and 121.6 MB in the end (delta: 11.6 MB). Peak memory consumption was 11.6 MB. Max. memory is 7.1 GB. [2019-10-07 00:58:59,277 INFO L168 Benchmark]: RCFGBuilder took 3057.61 ms. Allocated memory was 208.1 MB in the beginning and 303.6 MB in the end (delta: 95.4 MB). Free memory was 121.6 MB in the beginning and 245.7 MB in the end (delta: -124.2 MB). Peak memory consumption was 86.6 MB. Max. memory is 7.1 GB. [2019-10-07 00:58:59,278 INFO L168 Benchmark]: TraceAbstraction took 16256.19 ms. Allocated memory was 303.6 MB in the beginning and 649.1 MB in the end (delta: 345.5 MB). Free memory was 245.7 MB in the beginning and 235.2 MB in the end (delta: 10.5 MB). Peak memory consumption was 356.0 MB. Max. memory is 7.1 GB. [2019-10-07 00:58:59,282 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.21 ms. Allocated memory is still 145.2 MB. Free memory was 120.3 MB in the beginning and 120.1 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 1221.16 ms. Allocated memory was 145.2 MB in the beginning and 208.1 MB in the end (delta: 62.9 MB). Free memory was 96.1 MB in the beginning and 133.2 MB in the end (delta: -37.0 MB). Peak memory consumption was 35.2 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 202.44 ms. Allocated memory is still 208.1 MB. Free memory was 133.2 MB in the beginning and 121.6 MB in the end (delta: 11.6 MB). Peak memory consumption was 11.6 MB. Max. memory is 7.1 GB. * RCFGBuilder took 3057.61 ms. Allocated memory was 208.1 MB in the beginning and 303.6 MB in the end (delta: 95.4 MB). Free memory was 121.6 MB in the beginning and 245.7 MB in the end (delta: -124.2 MB). Peak memory consumption was 86.6 MB. Max. memory is 7.1 GB. * TraceAbstraction took 16256.19 ms. Allocated memory was 303.6 MB in the beginning and 649.1 MB in the end (delta: 345.5 MB). Free memory was 245.7 MB in the beginning and 235.2 MB in the end (delta: 10.5 MB). Peak memory consumption was 356.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...