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_label33.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-f4eb214f-m [2019-10-13 21:41:16,879 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-10-13 21:41:16,882 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-10-13 21:41:16,900 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-10-13 21:41:16,901 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-10-13 21:41:16,903 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-10-13 21:41:16,905 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-10-13 21:41:16,914 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-10-13 21:41:16,920 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-10-13 21:41:16,923 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-10-13 21:41:16,924 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-10-13 21:41:16,926 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-10-13 21:41:16,926 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-10-13 21:41:16,928 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-10-13 21:41:16,930 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-10-13 21:41:16,931 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-10-13 21:41:16,933 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-10-13 21:41:16,934 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-10-13 21:41:16,935 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-10-13 21:41:16,940 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-10-13 21:41:16,944 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-10-13 21:41:16,947 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-10-13 21:41:16,950 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-10-13 21:41:16,951 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-10-13 21:41:16,953 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-10-13 21:41:16,953 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-10-13 21:41:16,953 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-10-13 21:41:16,955 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-10-13 21:41:16,956 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-10-13 21:41:16,957 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-10-13 21:41:16,957 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-10-13 21:41:16,959 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-10-13 21:41:16,960 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-10-13 21:41:16,961 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-10-13 21:41:16,962 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-10-13 21:41:16,962 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-10-13 21:41:16,963 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-10-13 21:41:16,963 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-10-13 21:41:16,964 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-10-13 21:41:16,964 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-10-13 21:41:16,966 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-10-13 21:41:16,966 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:16,994 INFO L113 SettingsManager]: Loading preferences was successful [2019-10-13 21:41:16,995 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-10-13 21:41:16,996 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-10-13 21:41:16,996 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-10-13 21:41:16,996 INFO L138 SettingsManager]: * Use SBE=true [2019-10-13 21:41:16,996 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-10-13 21:41:16,997 INFO L138 SettingsManager]: * sizeof long=4 [2019-10-13 21:41:16,997 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-10-13 21:41:16,997 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-10-13 21:41:16,997 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-10-13 21:41:16,997 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-10-13 21:41:16,997 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-10-13 21:41:16,998 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-10-13 21:41:16,998 INFO L138 SettingsManager]: * sizeof long double=12 [2019-10-13 21:41:16,998 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-10-13 21:41:16,998 INFO L138 SettingsManager]: * Use constant arrays=true [2019-10-13 21:41:16,998 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-10-13 21:41:16,999 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-10-13 21:41:16,999 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-10-13 21:41:16,999 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-10-13 21:41:16,999 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-10-13 21:41:16,999 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-13 21:41:17,000 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-10-13 21:41:17,000 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-10-13 21:41:17,000 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-10-13 21:41:17,000 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-10-13 21:41:17,000 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-10-13 21:41:17,001 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-10-13 21:41:17,001 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:17,276 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-10-13 21:41:17,288 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-10-13 21:41:17,291 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-10-13 21:41:17,293 INFO L271 PluginConnector]: Initializing CDTParser... [2019-10-13 21:41:17,293 INFO L275 PluginConnector]: CDTParser initialized [2019-10-13 21:41:17,294 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/eca-rers2012/Problem02_label33.c [2019-10-13 21:41:17,371 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/344c863b0/3309167ad15041299f9c4389bc1853e8/FLAG7e9bf5eb7 [2019-10-13 21:41:17,936 INFO L306 CDTParser]: Found 1 translation units. [2019-10-13 21:41:17,937 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/eca-rers2012/Problem02_label33.c [2019-10-13 21:41:17,953 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/344c863b0/3309167ad15041299f9c4389bc1853e8/FLAG7e9bf5eb7 [2019-10-13 21:41:18,202 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/344c863b0/3309167ad15041299f9c4389bc1853e8 [2019-10-13 21:41:18,210 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-10-13 21:41:18,212 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-10-13 21:41:18,213 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-10-13 21:41:18,213 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-10-13 21:41:18,217 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-10-13 21:41:18,218 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 09:41:18" (1/1) ... [2019-10-13 21:41:18,220 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@14f2c9b2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:41:18, skipping insertion in model container [2019-10-13 21:41:18,221 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 09:41:18" (1/1) ... [2019-10-13 21:41:18,228 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-10-13 21:41:18,291 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-10-13 21:41:18,803 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-13 21:41:18,816 INFO L188 MainTranslator]: Completed pre-run [2019-10-13 21:41:18,953 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-13 21:41:18,969 INFO L192 MainTranslator]: Completed translation [2019-10-13 21:41:18,970 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:41:18 WrapperNode [2019-10-13 21:41:18,970 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-10-13 21:41:18,971 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-10-13 21:41:18,971 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-10-13 21:41:18,971 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-10-13 21:41:18,986 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:18" (1/1) ... [2019-10-13 21:41:18,986 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:18" (1/1) ... [2019-10-13 21:41:19,004 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:18" (1/1) ... [2019-10-13 21:41:19,005 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:18" (1/1) ... [2019-10-13 21:41:19,045 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:18" (1/1) ... [2019-10-13 21:41:19,070 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:18" (1/1) ... [2019-10-13 21:41:19,081 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:18" (1/1) ... [2019-10-13 21:41:19,088 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-10-13 21:41:19,089 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-10-13 21:41:19,089 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-10-13 21:41:19,089 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-10-13 21:41:19,090 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:41:18" (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:19,170 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-10-13 21:41:19,170 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-10-13 21:41:19,170 INFO L138 BoogieDeclarations]: Found implementation of procedure calculate_output [2019-10-13 21:41:19,171 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-10-13 21:41:19,171 INFO L130 BoogieDeclarations]: Found specification of procedure calculate_output [2019-10-13 21:41:19,171 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-10-13 21:41:19,171 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-10-13 21:41:19,172 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2019-10-13 21:41:19,172 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-10-13 21:41:19,172 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-10-13 21:41:19,172 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-10-13 21:41:21,180 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-10-13 21:41:21,182 INFO L284 CfgBuilder]: Removed 1 assume(true) statements. [2019-10-13 21:41:21,183 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 09:41:21 BoogieIcfgContainer [2019-10-13 21:41:21,183 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-10-13 21:41:21,185 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-10-13 21:41:21,185 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-10-13 21:41:21,190 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-10-13 21:41:21,191 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.10 09:41:18" (1/3) ... [2019-10-13 21:41:21,192 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5c1aad45 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 09:41:21, skipping insertion in model container [2019-10-13 21:41:21,192 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:41:18" (2/3) ... [2019-10-13 21:41:21,193 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5c1aad45 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 09:41:21, skipping insertion in model container [2019-10-13 21:41:21,193 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 09:41:21" (3/3) ... [2019-10-13 21:41:21,203 INFO L109 eAbstractionObserver]: Analyzing ICFG Problem02_label33.c [2019-10-13 21:41:21,215 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-10-13 21:41:21,225 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-10-13 21:41:21,237 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-10-13 21:41:21,275 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-10-13 21:41:21,276 INFO L374 AbstractCegarLoop]: Hoare is true [2019-10-13 21:41:21,277 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-10-13 21:41:21,278 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-10-13 21:41:21,278 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-10-13 21:41:21,278 INFO L378 AbstractCegarLoop]: Difference is false [2019-10-13 21:41:21,278 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-10-13 21:41:21,278 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-10-13 21:41:21,314 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states. [2019-10-13 21:41:21,328 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2019-10-13 21:41:21,329 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:41:21,330 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:21,332 INFO L410 AbstractCegarLoop]: === Iteration 1 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:41:21,339 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:41:21,340 INFO L82 PathProgramCache]: Analyzing trace with hash -219355081, now seen corresponding path program 1 times [2019-10-13 21:41:21,351 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-13 21:41:21,352 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1463951312] [2019-10-13 21:41:21,352 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:41:21,352 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:41:21,353 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:41:21,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:41:21,893 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:21,894 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1463951312] [2019-10-13 21:41:21,895 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:41:21,896 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-13 21:41:21,897 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2041960677] [2019-10-13 21:41:21,905 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-13 21:41:21,905 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-13 21:41:21,923 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-13 21:41:21,924 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-13 21:41:21,927 INFO L87 Difference]: Start difference. First operand 95 states. Second operand 3 states. [2019-10-13 21:41:22,507 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:41:22,508 INFO L93 Difference]: Finished difference Result 273 states and 508 transitions. [2019-10-13 21:41:22,509 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-13 21:41:22,510 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 86 [2019-10-13 21:41:22,512 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:41:22,527 INFO L225 Difference]: With dead ends: 273 [2019-10-13 21:41:22,528 INFO L226 Difference]: Without dead ends: 175 [2019-10-13 21:41:22,536 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-13 21:41:22,558 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 175 states. [2019-10-13 21:41:22,646 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 175 to 175. [2019-10-13 21:41:22,648 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 175 states. [2019-10-13 21:41:22,654 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 175 states to 175 states and 312 transitions. [2019-10-13 21:41:22,660 INFO L78 Accepts]: Start accepts. Automaton has 175 states and 312 transitions. Word has length 86 [2019-10-13 21:41:22,661 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:41:22,662 INFO L462 AbstractCegarLoop]: Abstraction has 175 states and 312 transitions. [2019-10-13 21:41:22,662 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-13 21:41:22,662 INFO L276 IsEmpty]: Start isEmpty. Operand 175 states and 312 transitions. [2019-10-13 21:41:22,674 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2019-10-13 21:41:22,675 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:41:22,675 INFO L380 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 21:41:22,676 INFO L410 AbstractCegarLoop]: === Iteration 2 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:41:22,676 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:41:22,678 INFO L82 PathProgramCache]: Analyzing trace with hash -701889860, now seen corresponding path program 1 times [2019-10-13 21:41:22,678 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-13 21:41:22,678 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1835781990] [2019-10-13 21:41:22,679 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:41:22,679 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:41:22,679 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:41:22,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:41:22,855 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-13 21:41:22,856 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1835781990] [2019-10-13 21:41:22,856 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:41:22,856 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-13 21:41:22,856 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [808070034] [2019-10-13 21:41:22,858 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-13 21:41:22,859 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-13 21:41:22,859 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-13 21:41:22,859 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-13 21:41:22,860 INFO L87 Difference]: Start difference. First operand 175 states and 312 transitions. Second operand 3 states. [2019-10-13 21:41:23,303 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:41:23,303 INFO L93 Difference]: Finished difference Result 513 states and 937 transitions. [2019-10-13 21:41:23,304 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-13 21:41:23,304 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 94 [2019-10-13 21:41:23,305 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:41:23,311 INFO L225 Difference]: With dead ends: 513 [2019-10-13 21:41:23,311 INFO L226 Difference]: Without dead ends: 343 [2019-10-13 21:41:23,313 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-13 21:41:23,314 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 343 states. [2019-10-13 21:41:23,338 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 343 to 343. [2019-10-13 21:41:23,338 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 343 states. [2019-10-13 21:41:23,340 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 343 states to 343 states and 515 transitions. [2019-10-13 21:41:23,340 INFO L78 Accepts]: Start accepts. Automaton has 343 states and 515 transitions. Word has length 94 [2019-10-13 21:41:23,341 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:41:23,341 INFO L462 AbstractCegarLoop]: Abstraction has 343 states and 515 transitions. [2019-10-13 21:41:23,341 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-13 21:41:23,342 INFO L276 IsEmpty]: Start isEmpty. Operand 343 states and 515 transitions. [2019-10-13 21:41:23,345 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2019-10-13 21:41:23,345 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:41:23,345 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 21:41:23,346 INFO L410 AbstractCegarLoop]: === Iteration 3 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:41:23,346 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:41:23,346 INFO L82 PathProgramCache]: Analyzing trace with hash 1298856247, now seen corresponding path program 1 times [2019-10-13 21:41:23,346 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-13 21:41:23,347 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2133136736] [2019-10-13 21:41:23,347 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:41:23,347 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:41:23,347 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:41:23,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:41:23,637 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 31 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-13 21:41:23,638 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2133136736] [2019-10-13 21:41:23,638 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:41:23,638 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-13 21:41:23,638 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [614568520] [2019-10-13 21:41:23,639 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-13 21:41:23,639 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-13 21:41:23,640 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-13 21:41:23,640 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-10-13 21:41:23,640 INFO L87 Difference]: Start difference. First operand 343 states and 515 transitions. Second operand 6 states. [2019-10-13 21:41:24,535 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:41:24,535 INFO L93 Difference]: Finished difference Result 1101 states and 1729 transitions. [2019-10-13 21:41:24,536 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-13 21:41:24,536 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 120 [2019-10-13 21:41:24,537 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:41:24,543 INFO L225 Difference]: With dead ends: 1101 [2019-10-13 21:41:24,544 INFO L226 Difference]: Without dead ends: 763 [2019-10-13 21:41:24,547 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2019-10-13 21:41:24,549 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 763 states. [2019-10-13 21:41:24,597 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 763 to 679. [2019-10-13 21:41:24,597 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 679 states. [2019-10-13 21:41:24,602 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 679 states to 679 states and 1038 transitions. [2019-10-13 21:41:24,602 INFO L78 Accepts]: Start accepts. Automaton has 679 states and 1038 transitions. Word has length 120 [2019-10-13 21:41:24,603 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:41:24,603 INFO L462 AbstractCegarLoop]: Abstraction has 679 states and 1038 transitions. [2019-10-13 21:41:24,603 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-13 21:41:24,603 INFO L276 IsEmpty]: Start isEmpty. Operand 679 states and 1038 transitions. [2019-10-13 21:41:24,609 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2019-10-13 21:41:24,609 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:41:24,609 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, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2019-10-13 21:41:24,610 INFO L410 AbstractCegarLoop]: === Iteration 4 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:41:24,610 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:41:24,610 INFO L82 PathProgramCache]: Analyzing trace with hash 1126482717, now seen corresponding path program 1 times [2019-10-13 21:41:24,611 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-13 21:41:24,611 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [527409071] [2019-10-13 21:41:24,611 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:41:24,611 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:41:24,612 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:41:24,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:41:24,838 INFO L134 CoverageAnalysis]: Checked inductivity of 53 backedges. 53 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-13 21:41:24,838 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [527409071] [2019-10-13 21:41:24,838 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:41:24,839 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-13 21:41:24,839 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2045426368] [2019-10-13 21:41:24,840 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-13 21:41:24,840 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-13 21:41:24,840 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-13 21:41:24,840 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-10-13 21:41:24,841 INFO L87 Difference]: Start difference. First operand 679 states and 1038 transitions. Second operand 6 states. [2019-10-13 21:41:25,195 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:41:25,196 INFO L93 Difference]: Finished difference Result 1191 states and 1774 transitions. [2019-10-13 21:41:25,197 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-13 21:41:25,197 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 142 [2019-10-13 21:41:25,198 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:41:25,198 INFO L225 Difference]: With dead ends: 1191 [2019-10-13 21:41:25,198 INFO L226 Difference]: Without dead ends: 0 [2019-10-13 21:41:25,200 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-10-13 21:41:25,200 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-10-13 21:41:25,201 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-10-13 21:41:25,201 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-10-13 21:41:25,201 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-10-13 21:41:25,201 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 142 [2019-10-13 21:41:25,201 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:41:25,201 INFO L462 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-10-13 21:41:25,201 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-13 21:41:25,201 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-10-13 21:41:25,202 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-10-13 21:41:25,208 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-10-13 21:41:25,475 WARN L191 SmtUtils]: Spent 162.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 42 [2019-10-13 21:41:25,553 INFO L439 ceAbstractionStarter]: At program point ULTIMATE.initENTRY(line -1) the Hoare annotation is: (= ~a17~0 |old(~a17~0)|) [2019-10-13 21:41:25,553 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2019-10-13 21:41:25,553 INFO L443 ceAbstractionStarter]: For program point L234(lines 234 413) no Hoare annotation was computed. [2019-10-13 21:41:25,554 INFO L443 ceAbstractionStarter]: For program point L69(lines 69 413) no Hoare annotation was computed. [2019-10-13 21:41:25,554 INFO L443 ceAbstractionStarter]: For program point L202(lines 202 413) no Hoare annotation was computed. [2019-10-13 21:41:25,554 INFO L443 ceAbstractionStarter]: For program point L169(lines 169 413) no Hoare annotation was computed. [2019-10-13 21:41:25,554 INFO L443 ceAbstractionStarter]: For program point L368(lines 368 413) no Hoare annotation was computed. [2019-10-13 21:41:25,554 INFO L443 ceAbstractionStarter]: For program point L38(lines 38 413) no Hoare annotation was computed. [2019-10-13 21:41:25,554 INFO L443 ceAbstractionStarter]: For program point L402(lines 402 413) no Hoare annotation was computed. [2019-10-13 21:41:25,554 INFO L443 ceAbstractionStarter]: For program point L237(lines 237 413) no Hoare annotation was computed. [2019-10-13 21:41:25,554 INFO L443 ceAbstractionStarter]: For program point L337(lines 337 413) no Hoare annotation was computed. [2019-10-13 21:41:25,555 INFO L443 ceAbstractionStarter]: For program point L139(lines 139 413) no Hoare annotation was computed. [2019-10-13 21:41:25,555 INFO L443 ceAbstractionStarter]: For program point L106(lines 106 413) no Hoare annotation was computed. [2019-10-13 21:41:25,555 INFO L443 ceAbstractionStarter]: For program point L404(lines 404 413) no Hoare annotation was computed. [2019-10-13 21:41:25,555 INFO L443 ceAbstractionStarter]: For program point L74(lines 74 413) no Hoare annotation was computed. [2019-10-13 21:41:25,555 INFO L443 ceAbstractionStarter]: For program point L42(lines 42 413) no Hoare annotation was computed. [2019-10-13 21:41:25,555 INFO L443 ceAbstractionStarter]: For program point L175(lines 175 413) no Hoare annotation was computed. [2019-10-13 21:41:25,556 INFO L443 ceAbstractionStarter]: For program point L407(lines 407 413) no Hoare annotation was computed. [2019-10-13 21:41:25,556 INFO L443 ceAbstractionStarter]: For program point L143(lines 143 413) no Hoare annotation was computed. [2019-10-13 21:41:25,556 INFO L443 ceAbstractionStarter]: For program point L375(lines 375 413) no Hoare annotation was computed. [2019-10-13 21:41:25,556 INFO L443 ceAbstractionStarter]: For program point L309(lines 309 413) no Hoare annotation was computed. [2019-10-13 21:41:25,556 INFO L443 ceAbstractionStarter]: For program point L276(lines 276 413) no Hoare annotation was computed. [2019-10-13 21:41:25,556 INFO L443 ceAbstractionStarter]: For program point calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION(line 595) no Hoare annotation was computed. [2019-10-13 21:41:25,557 INFO L443 ceAbstractionStarter]: For program point L409(lines 409 413) no Hoare annotation was computed. [2019-10-13 21:41:25,557 INFO L443 ceAbstractionStarter]: For program point L212(lines 212 413) no Hoare annotation was computed. [2019-10-13 21:41:25,557 INFO L443 ceAbstractionStarter]: For program point L179(lines 179 413) no Hoare annotation was computed. [2019-10-13 21:41:25,557 INFO L443 ceAbstractionStarter]: For program point L113(lines 113 413) no Hoare annotation was computed. [2019-10-13 21:41:25,557 INFO L443 ceAbstractionStarter]: For program point L47(lines 47 413) no Hoare annotation was computed. [2019-10-13 21:41:25,557 INFO L443 ceAbstractionStarter]: For program point L378(lines 378 413) no Hoare annotation was computed. [2019-10-13 21:41:25,558 INFO L443 ceAbstractionStarter]: For program point L280(lines 280 413) no Hoare annotation was computed. [2019-10-13 21:41:25,558 INFO L443 ceAbstractionStarter]: For program point L148(lines 148 413) no Hoare annotation was computed. [2019-10-13 21:41:25,558 INFO L443 ceAbstractionStarter]: For program point L82(lines 82 413) no Hoare annotation was computed. [2019-10-13 21:41:25,558 INFO L443 ceAbstractionStarter]: For program point L380(lines 380 413) no Hoare annotation was computed. [2019-10-13 21:41:25,558 INFO L443 ceAbstractionStarter]: For program point L314(lines 314 413) no Hoare annotation was computed. [2019-10-13 21:41:25,558 INFO L443 ceAbstractionStarter]: For program point L248(lines 248 413) no Hoare annotation was computed. [2019-10-13 21:41:25,559 INFO L443 ceAbstractionStarter]: For program point L215(lines 215 413) no Hoare annotation was computed. [2019-10-13 21:41:25,559 INFO L443 ceAbstractionStarter]: For program point L50(lines 50 413) no Hoare annotation was computed. [2019-10-13 21:41:25,559 INFO L443 ceAbstractionStarter]: For program point calculate_outputFINAL(lines 29 598) no Hoare annotation was computed. [2019-10-13 21:41:25,559 INFO L443 ceAbstractionStarter]: For program point calculate_outputEXIT(lines 29 598) no Hoare annotation was computed. [2019-10-13 21:41:25,559 INFO L443 ceAbstractionStarter]: For program point L349(lines 349 413) no Hoare annotation was computed. [2019-10-13 21:41:25,559 INFO L443 ceAbstractionStarter]: For program point L283(lines 283 413) no Hoare annotation was computed. [2019-10-13 21:41:25,559 INFO L443 ceAbstractionStarter]: For program point L218(lines 218 413) no Hoare annotation was computed. [2019-10-13 21:41:25,560 INFO L443 ceAbstractionStarter]: For program point L185(lines 185 413) no Hoare annotation was computed. [2019-10-13 21:41:25,560 INFO L443 ceAbstractionStarter]: For program point L119(lines 119 413) no Hoare annotation was computed. [2019-10-13 21:41:25,560 INFO L443 ceAbstractionStarter]: For program point L54(lines 54 413) no Hoare annotation was computed. [2019-10-13 21:41:25,560 INFO L443 ceAbstractionStarter]: For program point L286(lines 286 413) no Hoare annotation was computed. [2019-10-13 21:41:25,560 INFO L443 ceAbstractionStarter]: For program point L253(lines 253 413) no Hoare annotation was computed. [2019-10-13 21:41:25,560 INFO L443 ceAbstractionStarter]: For program point L187(lines 187 413) no Hoare annotation was computed. [2019-10-13 21:41:25,561 INFO L443 ceAbstractionStarter]: For program point L154(lines 154 413) no Hoare annotation was computed. [2019-10-13 21:41:25,561 INFO L443 ceAbstractionStarter]: For program point L354(lines 354 413) no Hoare annotation was computed. [2019-10-13 21:41:25,561 INFO L443 ceAbstractionStarter]: For program point L189(lines 189 413) no Hoare annotation was computed. [2019-10-13 21:41:25,561 INFO L443 ceAbstractionStarter]: For program point L123(lines 123 413) no Hoare annotation was computed. [2019-10-13 21:41:25,561 INFO L443 ceAbstractionStarter]: For program point L223(lines 223 413) no Hoare annotation was computed. [2019-10-13 21:41:25,561 INFO L443 ceAbstractionStarter]: For program point L91(lines 91 413) no Hoare annotation was computed. [2019-10-13 21:41:25,561 INFO L443 ceAbstractionStarter]: For program point L389(lines 389 413) no Hoare annotation was computed. [2019-10-13 21:41:25,562 INFO L443 ceAbstractionStarter]: For program point L191(lines 191 413) no Hoare annotation was computed. [2019-10-13 21:41:25,562 INFO L443 ceAbstractionStarter]: For program point L59(lines 59 413) no Hoare annotation was computed. [2019-10-13 21:41:25,562 INFO L439 ceAbstractionStarter]: At program point calculate_outputENTRY(lines 29 598) the Hoare annotation is: (let ((.cse9 (= ~a28~0 9)) (.cse8 (= 1 |old(~a11~0)|))) (let ((.cse2 (not .cse8)) (.cse5 (= ~a17~0 |old(~a17~0)|)) (.cse4 (not .cse9)) (.cse0 (not (= 1 ~a21~0))) (.cse7 (= 7 |old(~a17~0)|)) (.cse6 (= ~a11~0 1)) (.cse1 (= 9 |old(~a28~0)|)) (.cse3 (= 9 |old(~a17~0)|))) (and (or (or .cse0 .cse1 .cse2) .cse3 .cse4) (or .cse0 .cse2 .cse3 (and .cse5 .cse6)) (or .cse0 .cse5 .cse7 .cse3) (or .cse0 .cse4 .cse7 .cse1 .cse3) (or .cse0 .cse8 (not (= 1 |old(~a25~0)|)) (not (= 1 |old(~a19~0)|)) .cse7 (and .cse9 (= ~a19~0 1) (= ~a25~0 1) (not .cse6)) (not .cse1) .cse3)))) [2019-10-13 21:41:25,562 INFO L443 ceAbstractionStarter]: For program point L291(lines 291 413) no Hoare annotation was computed. [2019-10-13 21:41:25,563 INFO L443 ceAbstractionStarter]: For program point L225(lines 225 413) no Hoare annotation was computed. [2019-10-13 21:41:25,563 INFO L443 ceAbstractionStarter]: For program point L159(lines 159 413) no Hoare annotation was computed. [2019-10-13 21:41:25,563 INFO L443 ceAbstractionStarter]: For program point L259(lines 259 413) no Hoare annotation was computed. [2019-10-13 21:41:25,563 INFO L443 ceAbstractionStarter]: For program point L293(lines 293 413) no Hoare annotation was computed. [2019-10-13 21:41:25,563 INFO L443 ceAbstractionStarter]: For program point L194(lines 194 413) no Hoare annotation was computed. [2019-10-13 21:41:25,563 INFO L443 ceAbstractionStarter]: For program point L95(lines 95 413) no Hoare annotation was computed. [2019-10-13 21:41:25,563 INFO L443 ceAbstractionStarter]: For program point L591-1(lines 29 598) no Hoare annotation was computed. [2019-10-13 21:41:25,564 INFO L443 ceAbstractionStarter]: For program point L261(lines 261 413) no Hoare annotation was computed. [2019-10-13 21:41:25,564 INFO L443 ceAbstractionStarter]: For program point L30(lines 30 413) no Hoare annotation was computed. [2019-10-13 21:41:25,564 INFO L443 ceAbstractionStarter]: For program point L394(lines 394 413) no Hoare annotation was computed. [2019-10-13 21:41:25,564 INFO L443 ceAbstractionStarter]: For program point L361(lines 361 413) no Hoare annotation was computed. [2019-10-13 21:41:25,564 INFO L443 ceAbstractionStarter]: For program point L328(lines 328 413) no Hoare annotation was computed. [2019-10-13 21:41:25,564 INFO L443 ceAbstractionStarter]: For program point L130(lines 130 413) no Hoare annotation was computed. [2019-10-13 21:41:25,564 INFO L443 ceAbstractionStarter]: For program point L65(lines 65 413) no Hoare annotation was computed. [2019-10-13 21:41:25,565 INFO L443 ceAbstractionStarter]: For program point L594-1(lines 594 596) no Hoare annotation was computed. [2019-10-13 21:41:25,565 INFO L443 ceAbstractionStarter]: For program point L297(lines 297 413) no Hoare annotation was computed. [2019-10-13 21:41:25,565 INFO L443 ceAbstractionStarter]: For program point L198(lines 198 413) no Hoare annotation was computed. [2019-10-13 21:41:25,565 INFO L443 ceAbstractionStarter]: For program point L165(lines 165 413) no Hoare annotation was computed. [2019-10-13 21:41:25,565 INFO L443 ceAbstractionStarter]: For program point L99(lines 99 413) no Hoare annotation was computed. [2019-10-13 21:41:25,565 INFO L443 ceAbstractionStarter]: For program point L595(line 595) no Hoare annotation was computed. [2019-10-13 21:41:25,565 INFO L443 ceAbstractionStarter]: For program point L331(lines 331 413) no Hoare annotation was computed. [2019-10-13 21:41:25,566 INFO L443 ceAbstractionStarter]: For program point L232(lines 232 413) no Hoare annotation was computed. [2019-10-13 21:41:25,566 INFO L443 ceAbstractionStarter]: For program point L398(lines 398 413) no Hoare annotation was computed. [2019-10-13 21:41:25,566 INFO L443 ceAbstractionStarter]: For program point L134(lines 134 413) no Hoare annotation was computed. [2019-10-13 21:41:25,566 INFO L443 ceAbstractionStarter]: For program point L35(lines 35 413) no Hoare annotation was computed. [2019-10-13 21:41:25,566 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2019-10-13 21:41:25,567 INFO L439 ceAbstractionStarter]: At program point L-1(line -1) the Hoare annotation is: (and (not (= ~a17~0 7)) (= ~a21~0 1) (not (= ~a28~0 9)) (not (= ~a17~0 9))) [2019-10-13 21:41:25,567 INFO L446 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2019-10-13 21:41:25,567 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2019-10-13 21:41:25,567 INFO L439 ceAbstractionStarter]: At program point mainENTRY(lines 600 617) the Hoare annotation is: (or (not (= 1 ~a21~0)) (and (= ~a17~0 |old(~a17~0)|) (not (= ~a28~0 9))) (= 7 |old(~a17~0)|) (= 9 |old(~a28~0)|) (= 9 |old(~a17~0)|)) [2019-10-13 21:41:25,567 INFO L439 ceAbstractionStarter]: At program point L606-2(lines 606 616) the Hoare annotation is: (or (not (= 1 ~a21~0)) (= ~a17~0 |old(~a17~0)|) (and (= ~a11~0 1) (not (= ~a17~0 9))) (= 7 |old(~a17~0)|) (= 9 |old(~a28~0)|) (= 9 |old(~a17~0)|)) [2019-10-13 21:41:25,567 INFO L443 ceAbstractionStarter]: For program point L606-3(lines 600 617) no Hoare annotation was computed. [2019-10-13 21:41:25,568 INFO L443 ceAbstractionStarter]: For program point mainEXIT(lines 600 617) no Hoare annotation was computed. [2019-10-13 21:41:25,568 INFO L439 ceAbstractionStarter]: At program point L614(line 614) the Hoare annotation is: (or (not (= 1 ~a21~0)) (= ~a17~0 |old(~a17~0)|) (and (= ~a11~0 1) (not (= ~a17~0 9))) (= 7 |old(~a17~0)|) (= 9 |old(~a28~0)|) (= 9 |old(~a17~0)|)) [2019-10-13 21:41:25,568 INFO L443 ceAbstractionStarter]: For program point L614-1(line 614) no Hoare annotation was computed. [2019-10-13 21:41:25,568 INFO L443 ceAbstractionStarter]: For program point L611(line 611) no Hoare annotation was computed. [2019-10-13 21:41:25,585 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 13.10 09:41:25 BoogieIcfgContainer [2019-10-13 21:41:25,585 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-10-13 21:41:25,587 INFO L168 Benchmark]: Toolchain (without parser) took 7375.20 ms. Allocated memory was 137.4 MB in the beginning and 299.9 MB in the end (delta: 162.5 MB). Free memory was 99.9 MB in the beginning and 116.5 MB in the end (delta: -16.6 MB). Peak memory consumption was 145.9 MB. Max. memory is 7.1 GB. [2019-10-13 21:41:25,588 INFO L168 Benchmark]: CDTParser took 0.22 ms. Allocated memory is still 137.4 MB. Free memory was 120.6 MB in the beginning and 120.4 MB in the end (delta: 209.7 kB). Peak memory consumption was 209.7 kB. Max. memory is 7.1 GB. [2019-10-13 21:41:25,589 INFO L168 Benchmark]: CACSL2BoogieTranslator took 757.54 ms. Allocated memory was 137.4 MB in the beginning and 203.9 MB in the end (delta: 66.6 MB). Free memory was 99.7 MB in the beginning and 168.4 MB in the end (delta: -68.7 MB). Peak memory consumption was 33.6 MB. Max. memory is 7.1 GB. [2019-10-13 21:41:25,590 INFO L168 Benchmark]: Boogie Preprocessor took 117.73 ms. Allocated memory is still 203.9 MB. Free memory was 168.4 MB in the beginning and 164.1 MB in the end (delta: 4.2 MB). Peak memory consumption was 4.2 MB. Max. memory is 7.1 GB. [2019-10-13 21:41:25,591 INFO L168 Benchmark]: RCFGBuilder took 2094.68 ms. Allocated memory was 203.9 MB in the beginning and 252.7 MB in the end (delta: 48.8 MB). Free memory was 163.4 MB in the beginning and 196.7 MB in the end (delta: -33.2 MB). Peak memory consumption was 116.1 MB. Max. memory is 7.1 GB. [2019-10-13 21:41:25,593 INFO L168 Benchmark]: TraceAbstraction took 4400.63 ms. Allocated memory was 252.7 MB in the beginning and 299.9 MB in the end (delta: 47.2 MB). Free memory was 196.7 MB in the beginning and 116.5 MB in the end (delta: 80.1 MB). Peak memory consumption was 127.3 MB. Max. memory is 7.1 GB. [2019-10-13 21:41:25,597 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.22 ms. Allocated memory is still 137.4 MB. Free memory was 120.6 MB in the beginning and 120.4 MB in the end (delta: 209.7 kB). Peak memory consumption was 209.7 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 757.54 ms. Allocated memory was 137.4 MB in the beginning and 203.9 MB in the end (delta: 66.6 MB). Free memory was 99.7 MB in the beginning and 168.4 MB in the end (delta: -68.7 MB). Peak memory consumption was 33.6 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 117.73 ms. Allocated memory is still 203.9 MB. Free memory was 168.4 MB in the beginning and 164.1 MB in the end (delta: 4.2 MB). Peak memory consumption was 4.2 MB. Max. memory is 7.1 GB. * RCFGBuilder took 2094.68 ms. Allocated memory was 203.9 MB in the beginning and 252.7 MB in the end (delta: 48.8 MB). Free memory was 163.4 MB in the beginning and 196.7 MB in the end (delta: -33.2 MB). Peak memory consumption was 116.1 MB. Max. memory is 7.1 GB. * TraceAbstraction took 4400.63 ms. Allocated memory was 252.7 MB in the beginning and 299.9 MB in the end (delta: 47.2 MB). Free memory was 196.7 MB in the beginning and 116.5 MB in the end (delta: 80.1 MB). Peak memory consumption was 127.3 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 595]: 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 == a21) || a17 == \old(a17)) || (a11 == 1 && !(a17 == 9))) || 7 == \old(a17)) || 9 == \old(a28)) || 9 == \old(a17) - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 95 locations, 1 error locations. Result: SAFE, OverallTime: 4.2s, OverallIterations: 4, TraceHistogramMax: 2, AutomataDifference: 2.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.3s, HoareTripleCheckerStatistics: 243 SDtfs, 809 SDslu, 63 SDs, 0 SdLazy, 1237 SolverSat, 408 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.6s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 30 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=679occurred 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, 84 StatesRemovedByMinimization, 1 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 7 LocationsWithAnnotation, 28 PreInvPairs, 42 NumberOfFragments, 204 HoareAnnotationTreeSize, 28 FomulaSimplifications, 296 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 7 FomulaSimplificationsInter, 152 FormulaSimplificationTreeSizeReductionInter, 0.2s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 0.6s InterpolantComputationTime, 442 NumberOfCodeBlocks, 442 NumberOfCodeBlocksAsserted, 4 NumberOfCheckSat, 438 ConstructedInterpolants, 0 QuantifiedInterpolants, 294540 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 4 InterpolantComputations, 4 PerfectInterpolantSequences, 89/89 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...