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/Problem02_label15.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-f4eb214f-m [2019-10-13 21:41:01,556 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-10-13 21:41:01,559 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-10-13 21:41:01,576 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-10-13 21:41:01,577 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-10-13 21:41:01,579 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-10-13 21:41:01,581 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-10-13 21:41:01,590 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-10-13 21:41:01,596 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-10-13 21:41:01,600 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-10-13 21:41:01,602 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-10-13 21:41:01,603 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-10-13 21:41:01,603 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-10-13 21:41:01,605 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-10-13 21:41:01,608 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-10-13 21:41:01,610 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-10-13 21:41:01,611 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-10-13 21:41:01,612 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-10-13 21:41:01,614 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-10-13 21:41:01,619 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-10-13 21:41:01,624 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-10-13 21:41:01,628 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-10-13 21:41:01,631 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-10-13 21:41:01,632 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-10-13 21:41:01,634 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-10-13 21:41:01,635 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-10-13 21:41:01,635 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-10-13 21:41:01,637 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-10-13 21:41:01,638 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-10-13 21:41:01,640 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-10-13 21:41:01,640 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-10-13 21:41:01,642 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-10-13 21:41:01,643 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-10-13 21:41:01,644 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-10-13 21:41:01,646 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-10-13 21:41:01,646 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-10-13 21:41:01,647 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-10-13 21:41:01,647 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-10-13 21:41:01,647 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-10-13 21:41:01,648 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-10-13 21:41:01,650 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-10-13 21:41:01,651 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2019-10-13 21:41:01,674 INFO L113 SettingsManager]: Loading preferences was successful [2019-10-13 21:41:01,675 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-10-13 21:41:01,676 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-10-13 21:41:01,678 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-10-13 21:41:01,678 INFO L138 SettingsManager]: * Use SBE=true [2019-10-13 21:41:01,679 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-10-13 21:41:01,679 INFO L138 SettingsManager]: * sizeof long=4 [2019-10-13 21:41:01,679 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-10-13 21:41:01,679 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-10-13 21:41:01,679 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-10-13 21:41:01,680 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-10-13 21:41:01,680 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-10-13 21:41:01,680 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-10-13 21:41:01,680 INFO L138 SettingsManager]: * sizeof long double=12 [2019-10-13 21:41:01,680 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-10-13 21:41:01,681 INFO L138 SettingsManager]: * Use constant arrays=true [2019-10-13 21:41:01,681 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-10-13 21:41:01,682 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-10-13 21:41:01,682 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-10-13 21:41:01,683 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-10-13 21:41:01,683 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-10-13 21:41:01,683 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-13 21:41:01,683 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-10-13 21:41:01,684 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-10-13 21:41:01,684 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-10-13 21:41:01,684 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-10-13 21:41:01,684 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-10-13 21:41:01,684 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-10-13 21:41:01,685 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Trace refinement strategy -> SIFA_TAIPAN Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.sifa: Abstract Domain -> CompoundDomain Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder: Size of a code block -> LoopFreeBlock Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.sifa: Call Summarizer -> TopInputCallSummarizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.sifa: Fluid -> SizeLimitFluid Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.sifa: Simplification Technique -> SIMPLIFY_QUICK [2019-10-13 21:41:01,978 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-10-13 21:41:01,992 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-10-13 21:41:01,996 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-10-13 21:41:01,998 INFO L271 PluginConnector]: Initializing CDTParser... [2019-10-13 21:41:01,998 INFO L275 PluginConnector]: CDTParser initialized [2019-10-13 21:41:01,999 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/eca-rers2012/Problem02_label15.c [2019-10-13 21:41:02,079 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/57773a954/359dcf44da994b3785cad408ce2451d9/FLAGb9b5a3f6e [2019-10-13 21:41:02,665 INFO L306 CDTParser]: Found 1 translation units. [2019-10-13 21:41:02,668 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/eca-rers2012/Problem02_label15.c [2019-10-13 21:41:02,685 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/57773a954/359dcf44da994b3785cad408ce2451d9/FLAGb9b5a3f6e [2019-10-13 21:41:02,908 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/57773a954/359dcf44da994b3785cad408ce2451d9 [2019-10-13 21:41:02,919 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-10-13 21:41:02,921 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-10-13 21:41:02,922 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-10-13 21:41:02,922 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-10-13 21:41:02,926 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-10-13 21:41:02,927 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 09:41:02" (1/1) ... [2019-10-13 21:41:02,930 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2d066b29 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:41:02, skipping insertion in model container [2019-10-13 21:41:02,931 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 09:41:02" (1/1) ... [2019-10-13 21:41:02,939 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-10-13 21:41:03,013 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-10-13 21:41:03,524 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-13 21:41:03,530 INFO L188 MainTranslator]: Completed pre-run [2019-10-13 21:41:03,779 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-13 21:41:03,798 INFO L192 MainTranslator]: Completed translation [2019-10-13 21:41:03,798 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:41:03 WrapperNode [2019-10-13 21:41:03,799 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-10-13 21:41:03,800 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-10-13 21:41:03,800 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-10-13 21:41:03,800 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-10-13 21:41:03,818 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:41:03" (1/1) ... [2019-10-13 21:41:03,819 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:41:03" (1/1) ... [2019-10-13 21:41:03,857 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:41:03" (1/1) ... [2019-10-13 21:41:03,857 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:41:03" (1/1) ... [2019-10-13 21:41:03,929 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:41:03" (1/1) ... [2019-10-13 21:41:03,952 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:41:03" (1/1) ... [2019-10-13 21:41:03,959 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:41:03" (1/1) ... [2019-10-13 21:41:03,967 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-10-13 21:41:03,968 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-10-13 21:41:03,968 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-10-13 21:41:03,968 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-10-13 21:41:03,969 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:41:03" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-13 21:41:04,057 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-10-13 21:41:04,058 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-10-13 21:41:04,058 INFO L138 BoogieDeclarations]: Found implementation of procedure calculate_output [2019-10-13 21:41:04,058 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-10-13 21:41:04,059 INFO L130 BoogieDeclarations]: Found specification of procedure calculate_output [2019-10-13 21:41:04,060 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-10-13 21:41:04,060 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-10-13 21:41:04,061 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2019-10-13 21:41:04,061 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-10-13 21:41:04,061 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-10-13 21:41:04,062 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-10-13 21:41:06,216 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-10-13 21:41:06,216 INFO L284 CfgBuilder]: Removed 1 assume(true) statements. [2019-10-13 21:41:06,218 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 09:41:06 BoogieIcfgContainer [2019-10-13 21:41:06,218 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-10-13 21:41:06,219 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-10-13 21:41:06,220 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-10-13 21:41:06,223 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-10-13 21:41:06,223 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.10 09:41:02" (1/3) ... [2019-10-13 21:41:06,224 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@631bb252 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 09:41:06, skipping insertion in model container [2019-10-13 21:41:06,225 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:41:03" (2/3) ... [2019-10-13 21:41:06,225 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@631bb252 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 09:41:06, skipping insertion in model container [2019-10-13 21:41:06,225 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 09:41:06" (3/3) ... [2019-10-13 21:41:06,227 INFO L109 eAbstractionObserver]: Analyzing ICFG Problem02_label15.c [2019-10-13 21:41:06,238 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-10-13 21:41:06,247 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-10-13 21:41:06,259 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-10-13 21:41:06,286 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-10-13 21:41:06,286 INFO L374 AbstractCegarLoop]: Hoare is true [2019-10-13 21:41:06,287 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-10-13 21:41:06,290 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-10-13 21:41:06,291 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-10-13 21:41:06,291 INFO L378 AbstractCegarLoop]: Difference is false [2019-10-13 21:41:06,291 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-10-13 21:41:06,292 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-10-13 21:41:06,330 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states. [2019-10-13 21:41:06,342 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2019-10-13 21:41:06,343 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:41:06,344 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 21:41:06,346 INFO L410 AbstractCegarLoop]: === Iteration 1 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:41:06,352 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:41:06,352 INFO L82 PathProgramCache]: Analyzing trace with hash -219357897, now seen corresponding path program 1 times [2019-10-13 21:41:06,362 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-13 21:41:06,362 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1715312137] [2019-10-13 21:41:06,362 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:41:06,363 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:41:06,363 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:41:06,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:41:06,861 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-13 21:41:06,862 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1715312137] [2019-10-13 21:41:06,863 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:41:06,863 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-13 21:41:06,864 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1346234959] [2019-10-13 21:41:06,869 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-13 21:41:06,869 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-13 21:41:06,884 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-13 21:41:06,885 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-13 21:41:06,887 INFO L87 Difference]: Start difference. First operand 95 states. Second operand 3 states. [2019-10-13 21:41:07,511 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:41:07,512 INFO L93 Difference]: Finished difference Result 273 states and 508 transitions. [2019-10-13 21:41:07,512 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-13 21:41:07,514 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 86 [2019-10-13 21:41:07,515 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:41:07,532 INFO L225 Difference]: With dead ends: 273 [2019-10-13 21:41:07,532 INFO L226 Difference]: Without dead ends: 175 [2019-10-13 21:41:07,537 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-13 21:41:07,560 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 175 states. [2019-10-13 21:41:07,605 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 175 to 175. [2019-10-13 21:41:07,606 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 175 states. [2019-10-13 21:41:07,613 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 175 states to 175 states and 317 transitions. [2019-10-13 21:41:07,615 INFO L78 Accepts]: Start accepts. Automaton has 175 states and 317 transitions. Word has length 86 [2019-10-13 21:41:07,616 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:41:07,616 INFO L462 AbstractCegarLoop]: Abstraction has 175 states and 317 transitions. [2019-10-13 21:41:07,617 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-13 21:41:07,617 INFO L276 IsEmpty]: Start isEmpty. Operand 175 states and 317 transitions. [2019-10-13 21:41:07,629 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2019-10-13 21:41:07,630 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:41:07,630 INFO L380 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 21:41:07,631 INFO L410 AbstractCegarLoop]: === Iteration 2 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:41:07,631 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:41:07,632 INFO L82 PathProgramCache]: Analyzing trace with hash 1078697538, now seen corresponding path program 1 times [2019-10-13 21:41:07,632 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-13 21:41:07,633 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [90723762] [2019-10-13 21:41:07,633 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:41:07,633 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:41:07,633 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:41:07,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:41:07,889 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-13 21:41:07,891 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [90723762] [2019-10-13 21:41:07,891 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:41:07,891 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-13 21:41:07,891 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [980547748] [2019-10-13 21:41:07,894 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-13 21:41:07,894 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-13 21:41:07,895 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-13 21:41:07,895 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-13 21:41:07,895 INFO L87 Difference]: Start difference. First operand 175 states and 317 transitions. Second operand 3 states. [2019-10-13 21:41:08,291 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:41:08,292 INFO L93 Difference]: Finished difference Result 513 states and 952 transitions. [2019-10-13 21:41:08,292 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-13 21:41:08,292 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 95 [2019-10-13 21:41:08,293 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:41:08,298 INFO L225 Difference]: With dead ends: 513 [2019-10-13 21:41:08,299 INFO L226 Difference]: Without dead ends: 343 [2019-10-13 21:41:08,301 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-13 21:41:08,302 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 343 states. [2019-10-13 21:41:08,339 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 343 to 343. [2019-10-13 21:41:08,340 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 343 states. [2019-10-13 21:41:08,342 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 343 states to 343 states and 605 transitions. [2019-10-13 21:41:08,342 INFO L78 Accepts]: Start accepts. Automaton has 343 states and 605 transitions. Word has length 95 [2019-10-13 21:41:08,343 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:41:08,343 INFO L462 AbstractCegarLoop]: Abstraction has 343 states and 605 transitions. [2019-10-13 21:41:08,343 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-13 21:41:08,344 INFO L276 IsEmpty]: Start isEmpty. Operand 343 states and 605 transitions. [2019-10-13 21:41:08,346 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2019-10-13 21:41:08,346 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:41:08,346 INFO L380 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 21:41:08,346 INFO L410 AbstractCegarLoop]: === Iteration 3 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:41:08,347 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:41:08,347 INFO L82 PathProgramCache]: Analyzing trace with hash -1307296353, now seen corresponding path program 1 times [2019-10-13 21:41:08,347 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-13 21:41:08,348 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [873351500] [2019-10-13 21:41:08,348 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:41:08,348 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:41:08,348 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:41:08,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:41:08,474 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-13 21:41:08,475 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [873351500] [2019-10-13 21:41:08,475 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:41:08,475 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-13 21:41:08,476 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1870288688] [2019-10-13 21:41:08,476 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-13 21:41:08,477 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-13 21:41:08,477 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-13 21:41:08,477 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-10-13 21:41:08,477 INFO L87 Difference]: Start difference. First operand 343 states and 605 transitions. Second operand 6 states. [2019-10-13 21:41:09,187 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:41:09,187 INFO L93 Difference]: Finished difference Result 1055 states and 1968 transitions. [2019-10-13 21:41:09,188 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-10-13 21:41:09,188 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 108 [2019-10-13 21:41:09,188 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:41:09,196 INFO L225 Difference]: With dead ends: 1055 [2019-10-13 21:41:09,196 INFO L226 Difference]: Without dead ends: 717 [2019-10-13 21:41:09,200 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2019-10-13 21:41:09,202 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 717 states. [2019-10-13 21:41:09,288 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 717 to 699. [2019-10-13 21:41:09,288 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 699 states. [2019-10-13 21:41:09,294 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 699 states to 699 states and 1218 transitions. [2019-10-13 21:41:09,294 INFO L78 Accepts]: Start accepts. Automaton has 699 states and 1218 transitions. Word has length 108 [2019-10-13 21:41:09,294 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:41:09,295 INFO L462 AbstractCegarLoop]: Abstraction has 699 states and 1218 transitions. [2019-10-13 21:41:09,295 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-13 21:41:09,295 INFO L276 IsEmpty]: Start isEmpty. Operand 699 states and 1218 transitions. [2019-10-13 21:41:09,299 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2019-10-13 21:41:09,299 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:41:09,299 INFO L380 BasicCegarLoop]: trace histogram [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] [2019-10-13 21:41:09,302 INFO L410 AbstractCegarLoop]: === Iteration 4 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:41:09,303 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:41:09,303 INFO L82 PathProgramCache]: Analyzing trace with hash -650182557, now seen corresponding path program 1 times [2019-10-13 21:41:09,303 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-13 21:41:09,304 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [505928041] [2019-10-13 21:41:09,304 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:41:09,304 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:41:09,306 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:41:09,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:41:09,489 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-10-13 21:41:09,490 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [505928041] [2019-10-13 21:41:09,491 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1138933440] [2019-10-13 21:41:09,491 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-13 21:41:09,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:41:09,580 INFO L256 TraceCheckSpWp]: Trace formula consists of 365 conjuncts, 4 conjunts are in the unsatisfiable core [2019-10-13 21:41:09,589 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-13 21:41:09,647 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 21 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-13 21:41:09,647 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-10-13 21:41:09,704 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 21 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-13 21:41:09,704 INFO L223 tionRefinementEngine]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2019-10-13 21:41:09,705 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [4] total 5 [2019-10-13 21:41:09,705 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1719426909] [2019-10-13 21:41:09,706 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-13 21:41:09,706 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-13 21:41:09,706 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-13 21:41:09,707 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-10-13 21:41:09,707 INFO L87 Difference]: Start difference. First operand 699 states and 1218 transitions. Second operand 3 states. [2019-10-13 21:41:10,178 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:41:10,178 INFO L93 Difference]: Finished difference Result 1039 states and 1835 transitions. [2019-10-13 21:41:10,186 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-13 21:41:10,186 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 110 [2019-10-13 21:41:10,187 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:41:10,187 INFO L225 Difference]: With dead ends: 1039 [2019-10-13 21:41:10,187 INFO L226 Difference]: Without dead ends: 0 [2019-10-13 21:41:10,191 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 226 GetRequests, 221 SyntacticMatches, 2 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-10-13 21:41:10,192 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-10-13 21:41:10,192 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-10-13 21:41:10,192 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-10-13 21:41:10,192 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-10-13 21:41:10,192 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 110 [2019-10-13 21:41:10,192 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:41:10,192 INFO L462 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-10-13 21:41:10,192 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-13 21:41:10,193 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-10-13 21:41:10,193 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-10-13 21:41:10,393 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-13 21:41:10,399 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-10-13 21:41:10,590 WARN L191 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 30 [2019-10-13 21:41:10,689 INFO L439 ceAbstractionStarter]: At program point ULTIMATE.initENTRY(line -1) the Hoare annotation is: (= ~a25~0 |old(~a25~0)|) [2019-10-13 21:41:10,689 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2019-10-13 21:41:10,689 INFO L443 ceAbstractionStarter]: For program point L234(lines 234 413) no Hoare annotation was computed. [2019-10-13 21:41:10,689 INFO L443 ceAbstractionStarter]: For program point L69(lines 69 413) no Hoare annotation was computed. [2019-10-13 21:41:10,689 INFO L443 ceAbstractionStarter]: For program point L202(lines 202 413) no Hoare annotation was computed. [2019-10-13 21:41:10,690 INFO L443 ceAbstractionStarter]: For program point L169(lines 169 413) no Hoare annotation was computed. [2019-10-13 21:41:10,690 INFO L443 ceAbstractionStarter]: For program point L368(lines 368 413) no Hoare annotation was computed. [2019-10-13 21:41:10,690 INFO L443 ceAbstractionStarter]: For program point L38(lines 38 413) no Hoare annotation was computed. [2019-10-13 21:41:10,690 INFO L443 ceAbstractionStarter]: For program point L402(lines 402 413) no Hoare annotation was computed. [2019-10-13 21:41:10,690 INFO L443 ceAbstractionStarter]: For program point L237(lines 237 413) no Hoare annotation was computed. [2019-10-13 21:41:10,690 INFO L443 ceAbstractionStarter]: For program point L337(lines 337 413) no Hoare annotation was computed. [2019-10-13 21:41:10,691 INFO L443 ceAbstractionStarter]: For program point L139(lines 139 413) no Hoare annotation was computed. [2019-10-13 21:41:10,691 INFO L443 ceAbstractionStarter]: For program point L106(lines 106 413) no Hoare annotation was computed. [2019-10-13 21:41:10,691 INFO L443 ceAbstractionStarter]: For program point L404(lines 404 413) no Hoare annotation was computed. [2019-10-13 21:41:10,691 INFO L443 ceAbstractionStarter]: For program point L74(lines 74 413) no Hoare annotation was computed. [2019-10-13 21:41:10,691 INFO L443 ceAbstractionStarter]: For program point L42(lines 42 413) no Hoare annotation was computed. [2019-10-13 21:41:10,691 INFO L443 ceAbstractionStarter]: For program point L175(lines 175 413) no Hoare annotation was computed. [2019-10-13 21:41:10,691 INFO L443 ceAbstractionStarter]: For program point L407(lines 407 413) no Hoare annotation was computed. [2019-10-13 21:41:10,692 INFO L443 ceAbstractionStarter]: For program point L143(lines 143 413) no Hoare annotation was computed. [2019-10-13 21:41:10,692 INFO L443 ceAbstractionStarter]: For program point L375(lines 375 413) no Hoare annotation was computed. [2019-10-13 21:41:10,692 INFO L443 ceAbstractionStarter]: For program point L309(lines 309 413) no Hoare annotation was computed. [2019-10-13 21:41:10,692 INFO L443 ceAbstractionStarter]: For program point L276(lines 276 413) no Hoare annotation was computed. [2019-10-13 21:41:10,692 INFO L443 ceAbstractionStarter]: For program point calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION(line 562) no Hoare annotation was computed. [2019-10-13 21:41:10,692 INFO L443 ceAbstractionStarter]: For program point L409(lines 409 413) no Hoare annotation was computed. [2019-10-13 21:41:10,692 INFO L443 ceAbstractionStarter]: For program point L212(lines 212 413) no Hoare annotation was computed. [2019-10-13 21:41:10,693 INFO L443 ceAbstractionStarter]: For program point L179(lines 179 413) no Hoare annotation was computed. [2019-10-13 21:41:10,693 INFO L443 ceAbstractionStarter]: For program point L113(lines 113 413) no Hoare annotation was computed. [2019-10-13 21:41:10,693 INFO L443 ceAbstractionStarter]: For program point L47(lines 47 413) no Hoare annotation was computed. [2019-10-13 21:41:10,693 INFO L443 ceAbstractionStarter]: For program point L378(lines 378 413) no Hoare annotation was computed. [2019-10-13 21:41:10,693 INFO L443 ceAbstractionStarter]: For program point L280(lines 280 413) no Hoare annotation was computed. [2019-10-13 21:41:10,693 INFO L443 ceAbstractionStarter]: For program point L148(lines 148 413) no Hoare annotation was computed. [2019-10-13 21:41:10,693 INFO L443 ceAbstractionStarter]: For program point L82(lines 82 413) no Hoare annotation was computed. [2019-10-13 21:41:10,694 INFO L443 ceAbstractionStarter]: For program point L380(lines 380 413) no Hoare annotation was computed. [2019-10-13 21:41:10,694 INFO L443 ceAbstractionStarter]: For program point L314(lines 314 413) no Hoare annotation was computed. [2019-10-13 21:41:10,694 INFO L443 ceAbstractionStarter]: For program point L248(lines 248 413) no Hoare annotation was computed. [2019-10-13 21:41:10,694 INFO L443 ceAbstractionStarter]: For program point L215(lines 215 413) no Hoare annotation was computed. [2019-10-13 21:41:10,694 INFO L443 ceAbstractionStarter]: For program point L50(lines 50 413) no Hoare annotation was computed. [2019-10-13 21:41:10,694 INFO L443 ceAbstractionStarter]: For program point calculate_outputFINAL(lines 29 598) no Hoare annotation was computed. [2019-10-13 21:41:10,694 INFO L443 ceAbstractionStarter]: For program point calculate_outputEXIT(lines 29 598) no Hoare annotation was computed. [2019-10-13 21:41:10,695 INFO L443 ceAbstractionStarter]: For program point L349(lines 349 413) no Hoare annotation was computed. [2019-10-13 21:41:10,695 INFO L443 ceAbstractionStarter]: For program point L283(lines 283 413) no Hoare annotation was computed. [2019-10-13 21:41:10,695 INFO L443 ceAbstractionStarter]: For program point L218(lines 218 413) no Hoare annotation was computed. [2019-10-13 21:41:10,695 INFO L443 ceAbstractionStarter]: For program point L185(lines 185 413) no Hoare annotation was computed. [2019-10-13 21:41:10,695 INFO L443 ceAbstractionStarter]: For program point L119(lines 119 413) no Hoare annotation was computed. [2019-10-13 21:41:10,695 INFO L443 ceAbstractionStarter]: For program point L54(lines 54 413) no Hoare annotation was computed. [2019-10-13 21:41:10,695 INFO L443 ceAbstractionStarter]: For program point L286(lines 286 413) no Hoare annotation was computed. [2019-10-13 21:41:10,696 INFO L443 ceAbstractionStarter]: For program point L253(lines 253 413) no Hoare annotation was computed. [2019-10-13 21:41:10,696 INFO L443 ceAbstractionStarter]: For program point L187(lines 187 413) no Hoare annotation was computed. [2019-10-13 21:41:10,696 INFO L443 ceAbstractionStarter]: For program point L154(lines 154 413) no Hoare annotation was computed. [2019-10-13 21:41:10,696 INFO L443 ceAbstractionStarter]: For program point L354(lines 354 413) no Hoare annotation was computed. [2019-10-13 21:41:10,696 INFO L443 ceAbstractionStarter]: For program point L189(lines 189 413) no Hoare annotation was computed. [2019-10-13 21:41:10,696 INFO L443 ceAbstractionStarter]: For program point L123(lines 123 413) no Hoare annotation was computed. [2019-10-13 21:41:10,696 INFO L443 ceAbstractionStarter]: For program point L223(lines 223 413) no Hoare annotation was computed. [2019-10-13 21:41:10,696 INFO L443 ceAbstractionStarter]: For program point L91(lines 91 413) no Hoare annotation was computed. [2019-10-13 21:41:10,697 INFO L443 ceAbstractionStarter]: For program point L389(lines 389 413) no Hoare annotation was computed. [2019-10-13 21:41:10,697 INFO L443 ceAbstractionStarter]: For program point L191(lines 191 413) no Hoare annotation was computed. [2019-10-13 21:41:10,697 INFO L443 ceAbstractionStarter]: For program point L59(lines 59 413) no Hoare annotation was computed. [2019-10-13 21:41:10,697 INFO L439 ceAbstractionStarter]: At program point calculate_outputENTRY(lines 29 598) the Hoare annotation is: (let ((.cse0 (not (<= 8 |old(~a17~0)|))) (.cse1 (= ~a25~0 |old(~a25~0)|)) (.cse2 (= 1 |old(~a11~0)|)) (.cse4 (= 10 |old(~a28~0)|)) (.cse3 (not (= ~a11~0 1)))) (and (or .cse0 (and (<= 8 ~a17~0) .cse1)) (or .cse2 .cse0 .cse3) (or .cse1 (= 1 |old(~a25~0)|)) (or .cse4 (and (not (= 10 ~a28~0)) .cse1)) (or .cse2 .cse4 .cse3))) [2019-10-13 21:41:10,697 INFO L443 ceAbstractionStarter]: For program point L291(lines 291 413) no Hoare annotation was computed. [2019-10-13 21:41:10,698 INFO L443 ceAbstractionStarter]: For program point L225(lines 225 413) no Hoare annotation was computed. [2019-10-13 21:41:10,698 INFO L443 ceAbstractionStarter]: For program point L159(lines 159 413) no Hoare annotation was computed. [2019-10-13 21:41:10,698 INFO L443 ceAbstractionStarter]: For program point L259(lines 259 413) no Hoare annotation was computed. [2019-10-13 21:41:10,698 INFO L443 ceAbstractionStarter]: For program point L293(lines 293 413) no Hoare annotation was computed. [2019-10-13 21:41:10,698 INFO L443 ceAbstractionStarter]: For program point L194(lines 194 413) no Hoare annotation was computed. [2019-10-13 21:41:10,698 INFO L443 ceAbstractionStarter]: For program point L95(lines 95 413) no Hoare annotation was computed. [2019-10-13 21:41:10,698 INFO L443 ceAbstractionStarter]: For program point L558-1(lines 29 598) no Hoare annotation was computed. [2019-10-13 21:41:10,699 INFO L443 ceAbstractionStarter]: For program point L261(lines 261 413) no Hoare annotation was computed. [2019-10-13 21:41:10,699 INFO L443 ceAbstractionStarter]: For program point L30(lines 30 413) no Hoare annotation was computed. [2019-10-13 21:41:10,699 INFO L443 ceAbstractionStarter]: For program point L394(lines 394 413) no Hoare annotation was computed. [2019-10-13 21:41:10,699 INFO L443 ceAbstractionStarter]: For program point L361(lines 361 413) no Hoare annotation was computed. [2019-10-13 21:41:10,699 INFO L443 ceAbstractionStarter]: For program point L328(lines 328 413) no Hoare annotation was computed. [2019-10-13 21:41:10,699 INFO L443 ceAbstractionStarter]: For program point L130(lines 130 413) no Hoare annotation was computed. [2019-10-13 21:41:10,699 INFO L443 ceAbstractionStarter]: For program point L65(lines 65 413) no Hoare annotation was computed. [2019-10-13 21:41:10,700 INFO L443 ceAbstractionStarter]: For program point L561-1(lines 29 598) no Hoare annotation was computed. [2019-10-13 21:41:10,700 INFO L443 ceAbstractionStarter]: For program point L297(lines 297 413) no Hoare annotation was computed. [2019-10-13 21:41:10,700 INFO L443 ceAbstractionStarter]: For program point L198(lines 198 413) no Hoare annotation was computed. [2019-10-13 21:41:10,700 INFO L443 ceAbstractionStarter]: For program point L165(lines 165 413) no Hoare annotation was computed. [2019-10-13 21:41:10,700 INFO L443 ceAbstractionStarter]: For program point L99(lines 99 413) no Hoare annotation was computed. [2019-10-13 21:41:10,700 INFO L443 ceAbstractionStarter]: For program point L562(line 562) no Hoare annotation was computed. [2019-10-13 21:41:10,700 INFO L443 ceAbstractionStarter]: For program point L331(lines 331 413) no Hoare annotation was computed. [2019-10-13 21:41:10,700 INFO L443 ceAbstractionStarter]: For program point L232(lines 232 413) no Hoare annotation was computed. [2019-10-13 21:41:10,701 INFO L443 ceAbstractionStarter]: For program point L398(lines 398 413) no Hoare annotation was computed. [2019-10-13 21:41:10,701 INFO L443 ceAbstractionStarter]: For program point L134(lines 134 413) no Hoare annotation was computed. [2019-10-13 21:41:10,701 INFO L443 ceAbstractionStarter]: For program point L35(lines 35 413) no Hoare annotation was computed. [2019-10-13 21:41:10,701 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2019-10-13 21:41:10,701 INFO L439 ceAbstractionStarter]: At program point L-1(line -1) the Hoare annotation is: (and (not (= 10 ~a28~0)) (<= 8 ~a17~0) (not (= ~a25~0 1)) (not (= ~a11~0 1))) [2019-10-13 21:41:10,701 INFO L446 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2019-10-13 21:41:10,701 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2019-10-13 21:41:10,702 INFO L439 ceAbstractionStarter]: At program point mainENTRY(lines 600 617) the Hoare annotation is: (or (= 1 |old(~a11~0)|) (not (<= 8 |old(~a17~0)|)) (= 10 |old(~a28~0)|) (and (not (= 10 ~a28~0)) (<= 8 ~a17~0) (not (= ~a11~0 1)) (= ~a25~0 |old(~a25~0)|)) (= 1 |old(~a25~0)|)) [2019-10-13 21:41:10,702 INFO L439 ceAbstractionStarter]: At program point L606-2(lines 606 616) the Hoare annotation is: (or (= 1 |old(~a11~0)|) (not (= 10 ~a28~0)) (not (<= 8 |old(~a17~0)|)) (<= 8 ~a17~0) (not (= ~a25~0 1)) (= 10 |old(~a28~0)|) (= 1 |old(~a25~0)|)) [2019-10-13 21:41:10,702 INFO L443 ceAbstractionStarter]: For program point L606-3(lines 600 617) no Hoare annotation was computed. [2019-10-13 21:41:10,702 INFO L443 ceAbstractionStarter]: For program point mainEXIT(lines 600 617) no Hoare annotation was computed. [2019-10-13 21:41:10,702 INFO L439 ceAbstractionStarter]: At program point L614(line 614) the Hoare annotation is: (or (= 1 |old(~a11~0)|) (not (= 10 ~a28~0)) (not (<= 8 |old(~a17~0)|)) (<= 8 ~a17~0) (not (= ~a25~0 1)) (= 10 |old(~a28~0)|) (= 1 |old(~a25~0)|)) [2019-10-13 21:41:10,702 INFO L443 ceAbstractionStarter]: For program point L614-1(line 614) no Hoare annotation was computed. [2019-10-13 21:41:10,703 INFO L443 ceAbstractionStarter]: For program point L611(line 611) no Hoare annotation was computed. [2019-10-13 21:41:10,733 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 13.10 09:41:10 BoogieIcfgContainer [2019-10-13 21:41:10,733 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-10-13 21:41:10,735 INFO L168 Benchmark]: Toolchain (without parser) took 7814.66 ms. Allocated memory was 136.8 MB in the beginning and 310.9 MB in the end (delta: 174.1 MB). Free memory was 98.9 MB in the beginning and 185.9 MB in the end (delta: -87.0 MB). Peak memory consumption was 87.1 MB. Max. memory is 7.1 GB. [2019-10-13 21:41:10,736 INFO L168 Benchmark]: CDTParser took 0.24 ms. Allocated memory is still 136.8 MB. Free memory was 120.1 MB in the beginning and 119.9 MB in the end (delta: 209.8 kB). Peak memory consumption was 209.8 kB. Max. memory is 7.1 GB. [2019-10-13 21:41:10,737 INFO L168 Benchmark]: CACSL2BoogieTranslator took 877.10 ms. Allocated memory was 136.8 MB in the beginning and 202.9 MB in the end (delta: 66.1 MB). Free memory was 98.7 MB in the beginning and 169.7 MB in the end (delta: -71.0 MB). Peak memory consumption was 34.8 MB. Max. memory is 7.1 GB. [2019-10-13 21:41:10,738 INFO L168 Benchmark]: Boogie Preprocessor took 168.00 ms. Allocated memory is still 202.9 MB. Free memory was 169.7 MB in the beginning and 164.7 MB in the end (delta: 5.0 MB). Peak memory consumption was 5.0 MB. Max. memory is 7.1 GB. [2019-10-13 21:41:10,739 INFO L168 Benchmark]: RCFGBuilder took 2250.31 ms. Allocated memory was 202.9 MB in the beginning and 255.3 MB in the end (delta: 52.4 MB). Free memory was 164.7 MB in the beginning and 208.2 MB in the end (delta: -43.6 MB). Peak memory consumption was 118.5 MB. Max. memory is 7.1 GB. [2019-10-13 21:41:10,740 INFO L168 Benchmark]: TraceAbstraction took 4514.11 ms. Allocated memory was 255.3 MB in the beginning and 310.9 MB in the end (delta: 55.6 MB). Free memory was 208.2 MB in the beginning and 185.9 MB in the end (delta: 22.3 MB). Peak memory consumption was 77.9 MB. Max. memory is 7.1 GB. [2019-10-13 21:41:10,750 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.24 ms. Allocated memory is still 136.8 MB. Free memory was 120.1 MB in the beginning and 119.9 MB in the end (delta: 209.8 kB). Peak memory consumption was 209.8 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 877.10 ms. Allocated memory was 136.8 MB in the beginning and 202.9 MB in the end (delta: 66.1 MB). Free memory was 98.7 MB in the beginning and 169.7 MB in the end (delta: -71.0 MB). Peak memory consumption was 34.8 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 168.00 ms. Allocated memory is still 202.9 MB. Free memory was 169.7 MB in the beginning and 164.7 MB in the end (delta: 5.0 MB). Peak memory consumption was 5.0 MB. Max. memory is 7.1 GB. * RCFGBuilder took 2250.31 ms. Allocated memory was 202.9 MB in the beginning and 255.3 MB in the end (delta: 52.4 MB). Free memory was 164.7 MB in the beginning and 208.2 MB in the end (delta: -43.6 MB). Peak memory consumption was 118.5 MB. Max. memory is 7.1 GB. * TraceAbstraction took 4514.11 ms. Allocated memory was 255.3 MB in the beginning and 310.9 MB in the end (delta: 55.6 MB). Free memory was 208.2 MB in the beginning and 185.9 MB in the end (delta: 22.3 MB). Peak memory consumption was 77.9 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 562]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 606]: Loop Invariant Derived loop invariant: (((((1 == \old(a11) || !(10 == a28)) || !(8 <= \old(a17))) || 8 <= a17) || !(a25 == 1)) || 10 == \old(a28)) || 1 == \old(a25) - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 95 locations, 1 error locations. Result: SAFE, OverallTime: 4.4s, OverallIterations: 4, TraceHistogramMax: 2, AutomataDifference: 2.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.2s, HoareTripleCheckerStatistics: 122 SDtfs, 432 SDslu, 91 SDs, 0 SdLazy, 1158 SolverSat, 356 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.5s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 245 GetRequests, 229 SyntacticMatches, 4 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=699occurred in iteration=3, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 4 MinimizatonAttempts, 18 StatesRemovedByMinimization, 1 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 7 LocationsWithAnnotation, 25 PreInvPairs, 49 NumberOfFragments, 154 HoareAnnotationTreeSize, 25 FomulaSimplifications, 346 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 7 FomulaSimplificationsInter, 199 FormulaSimplificationTreeSizeReductionInter, 0.2s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 0.7s InterpolantComputationTime, 509 NumberOfCodeBlocks, 509 NumberOfCodeBlocksAsserted, 5 NumberOfCheckSat, 613 ConstructedInterpolants, 0 QuantifiedInterpolants, 189989 SizeOfPredicates, 2 NumberOfNonLiveVariables, 365 ConjunctsInSsa, 4 ConjunctsInUnsatCore, 6 InterpolantComputations, 5 PerfectInterpolantSequences, 70/88 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...