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/Problem01_label13.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-f4eb214f-m [2019-10-13 21:40:06,912 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-10-13 21:40:06,914 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-10-13 21:40:06,927 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-10-13 21:40:06,927 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-10-13 21:40:06,928 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-10-13 21:40:06,930 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-10-13 21:40:06,931 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-10-13 21:40:06,933 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-10-13 21:40:06,934 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-10-13 21:40:06,935 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-10-13 21:40:06,936 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-10-13 21:40:06,937 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-10-13 21:40:06,938 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-10-13 21:40:06,939 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-10-13 21:40:06,940 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-10-13 21:40:06,940 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-10-13 21:40:06,941 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-10-13 21:40:06,943 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-10-13 21:40:06,945 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-10-13 21:40:06,947 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-10-13 21:40:06,948 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-10-13 21:40:06,950 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-10-13 21:40:06,950 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-10-13 21:40:06,953 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-10-13 21:40:06,953 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-10-13 21:40:06,953 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-10-13 21:40:06,954 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-10-13 21:40:06,955 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-10-13 21:40:06,956 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-10-13 21:40:06,956 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-10-13 21:40:06,957 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-10-13 21:40:06,958 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-10-13 21:40:06,959 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-10-13 21:40:06,960 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-10-13 21:40:06,960 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-10-13 21:40:06,961 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-10-13 21:40:06,961 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-10-13 21:40:06,961 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-10-13 21:40:06,962 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-10-13 21:40:06,963 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-10-13 21:40:06,964 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:40:06,981 INFO L113 SettingsManager]: Loading preferences was successful [2019-10-13 21:40:06,983 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-10-13 21:40:06,984 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-10-13 21:40:06,985 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-10-13 21:40:06,985 INFO L138 SettingsManager]: * Use SBE=true [2019-10-13 21:40:06,985 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-10-13 21:40:06,985 INFO L138 SettingsManager]: * sizeof long=4 [2019-10-13 21:40:06,986 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-10-13 21:40:06,986 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-10-13 21:40:06,986 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-10-13 21:40:06,986 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-10-13 21:40:06,986 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-10-13 21:40:06,987 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-10-13 21:40:06,987 INFO L138 SettingsManager]: * sizeof long double=12 [2019-10-13 21:40:06,987 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-10-13 21:40:06,988 INFO L138 SettingsManager]: * Use constant arrays=true [2019-10-13 21:40:06,988 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-10-13 21:40:06,989 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-10-13 21:40:06,989 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-10-13 21:40:06,989 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-10-13 21:40:06,990 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-10-13 21:40:06,990 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-13 21:40:06,990 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-10-13 21:40:06,990 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-10-13 21:40:06,990 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-10-13 21:40:06,991 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-10-13 21:40:06,991 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-10-13 21:40:06,991 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-10-13 21:40:06,991 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:40:07,302 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-10-13 21:40:07,319 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-10-13 21:40:07,323 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-10-13 21:40:07,324 INFO L271 PluginConnector]: Initializing CDTParser... [2019-10-13 21:40:07,325 INFO L275 PluginConnector]: CDTParser initialized [2019-10-13 21:40:07,325 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/eca-rers2012/Problem01_label13.c [2019-10-13 21:40:07,398 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/232238746/16574ca8e9d74a5588140b67a26baf95/FLAG634c614cb [2019-10-13 21:40:07,970 INFO L306 CDTParser]: Found 1 translation units. [2019-10-13 21:40:07,971 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/eca-rers2012/Problem01_label13.c [2019-10-13 21:40:07,993 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/232238746/16574ca8e9d74a5588140b67a26baf95/FLAG634c614cb [2019-10-13 21:40:08,231 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/232238746/16574ca8e9d74a5588140b67a26baf95 [2019-10-13 21:40:08,243 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-10-13 21:40:08,245 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-10-13 21:40:08,246 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-10-13 21:40:08,246 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-10-13 21:40:08,250 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-10-13 21:40:08,251 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 09:40:08" (1/1) ... [2019-10-13 21:40:08,254 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@11574e77 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:40:08, skipping insertion in model container [2019-10-13 21:40:08,255 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 09:40:08" (1/1) ... [2019-10-13 21:40:08,262 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-10-13 21:40:08,320 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-10-13 21:40:08,888 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-13 21:40:08,899 INFO L188 MainTranslator]: Completed pre-run [2019-10-13 21:40:09,041 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-13 21:40:09,063 INFO L192 MainTranslator]: Completed translation [2019-10-13 21:40:09,064 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:40:09 WrapperNode [2019-10-13 21:40:09,064 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-10-13 21:40:09,065 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-10-13 21:40:09,065 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-10-13 21:40:09,065 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-10-13 21:40:09,085 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:40:09" (1/1) ... [2019-10-13 21:40:09,086 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:40:09" (1/1) ... [2019-10-13 21:40:09,133 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:40:09" (1/1) ... [2019-10-13 21:40:09,133 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:40:09" (1/1) ... [2019-10-13 21:40:09,190 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:40:09" (1/1) ... [2019-10-13 21:40:09,213 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:40:09" (1/1) ... [2019-10-13 21:40:09,224 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:40:09" (1/1) ... [2019-10-13 21:40:09,233 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-10-13 21:40:09,233 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-10-13 21:40:09,234 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-10-13 21:40:09,234 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-10-13 21:40:09,235 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:40:09" (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:40:09,294 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-10-13 21:40:09,295 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-10-13 21:40:09,295 INFO L138 BoogieDeclarations]: Found implementation of procedure calculate_output [2019-10-13 21:40:09,295 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-10-13 21:40:09,295 INFO L130 BoogieDeclarations]: Found specification of procedure calculate_output [2019-10-13 21:40:09,295 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-10-13 21:40:09,296 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-10-13 21:40:09,296 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2019-10-13 21:40:09,296 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-10-13 21:40:09,296 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-10-13 21:40:09,297 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-10-13 21:40:11,355 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-10-13 21:40:11,355 INFO L284 CfgBuilder]: Removed 1 assume(true) statements. [2019-10-13 21:40:11,357 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 09:40:11 BoogieIcfgContainer [2019-10-13 21:40:11,357 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-10-13 21:40:11,358 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-10-13 21:40:11,359 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-10-13 21:40:11,362 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-10-13 21:40:11,362 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.10 09:40:08" (1/3) ... [2019-10-13 21:40:11,363 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4b212421 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 09:40:11, skipping insertion in model container [2019-10-13 21:40:11,364 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:40:09" (2/3) ... [2019-10-13 21:40:11,364 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4b212421 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 09:40:11, skipping insertion in model container [2019-10-13 21:40:11,364 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 09:40:11" (3/3) ... [2019-10-13 21:40:11,366 INFO L109 eAbstractionObserver]: Analyzing ICFG Problem01_label13.c [2019-10-13 21:40:11,377 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-10-13 21:40:11,386 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-10-13 21:40:11,398 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-10-13 21:40:11,426 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-10-13 21:40:11,426 INFO L374 AbstractCegarLoop]: Hoare is true [2019-10-13 21:40:11,426 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-10-13 21:40:11,427 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-10-13 21:40:11,427 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-10-13 21:40:11,427 INFO L378 AbstractCegarLoop]: Difference is false [2019-10-13 21:40:11,427 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-10-13 21:40:11,428 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-10-13 21:40:11,450 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states. [2019-10-13 21:40:11,459 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2019-10-13 21:40:11,459 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:40:11,461 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] [2019-10-13 21:40:11,463 INFO L410 AbstractCegarLoop]: === Iteration 1 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:40:11,469 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:40:11,469 INFO L82 PathProgramCache]: Analyzing trace with hash 826824292, now seen corresponding path program 1 times [2019-10-13 21:40:11,479 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-13 21:40:11,480 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1023967187] [2019-10-13 21:40:11,480 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:40:11,480 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:40:11,481 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:40:11,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:40:11,926 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:40:11,927 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1023967187] [2019-10-13 21:40:11,928 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:40:11,928 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-13 21:40:11,929 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [404001315] [2019-10-13 21:40:11,934 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-13 21:40:11,934 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-13 21:40:11,949 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-13 21:40:11,950 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-13 21:40:11,952 INFO L87 Difference]: Start difference. First operand 86 states. Second operand 3 states. [2019-10-13 21:40:12,530 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:40:12,530 INFO L93 Difference]: Finished difference Result 246 states and 454 transitions. [2019-10-13 21:40:12,532 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-13 21:40:12,534 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 77 [2019-10-13 21:40:12,536 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:40:12,559 INFO L225 Difference]: With dead ends: 246 [2019-10-13 21:40:12,559 INFO L226 Difference]: Without dead ends: 157 [2019-10-13 21:40:12,565 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:40:12,585 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 157 states. [2019-10-13 21:40:12,657 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 157 to 157. [2019-10-13 21:40:12,659 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 157 states. [2019-10-13 21:40:12,673 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 157 states to 157 states and 285 transitions. [2019-10-13 21:40:12,675 INFO L78 Accepts]: Start accepts. Automaton has 157 states and 285 transitions. Word has length 77 [2019-10-13 21:40:12,676 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:40:12,676 INFO L462 AbstractCegarLoop]: Abstraction has 157 states and 285 transitions. [2019-10-13 21:40:12,677 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-13 21:40:12,677 INFO L276 IsEmpty]: Start isEmpty. Operand 157 states and 285 transitions. [2019-10-13 21:40:12,687 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2019-10-13 21:40:12,687 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:40:12,687 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] [2019-10-13 21:40:12,688 INFO L410 AbstractCegarLoop]: === Iteration 2 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:40:12,689 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:40:12,689 INFO L82 PathProgramCache]: Analyzing trace with hash -1022491941, now seen corresponding path program 1 times [2019-10-13 21:40:12,690 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-13 21:40:12,690 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1241462819] [2019-10-13 21:40:12,690 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:40:12,690 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:40:12,691 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:40:12,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:40:12,869 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:40:12,869 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1241462819] [2019-10-13 21:40:12,869 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:40:12,870 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-13 21:40:12,870 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1455001590] [2019-10-13 21:40:12,873 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-13 21:40:12,873 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-13 21:40:12,874 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-13 21:40:12,874 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-13 21:40:12,874 INFO L87 Difference]: Start difference. First operand 157 states and 285 transitions. Second operand 5 states. [2019-10-13 21:40:13,407 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:40:13,407 INFO L93 Difference]: Finished difference Result 479 states and 892 transitions. [2019-10-13 21:40:13,408 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-10-13 21:40:13,408 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 86 [2019-10-13 21:40:13,409 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:40:13,415 INFO L225 Difference]: With dead ends: 479 [2019-10-13 21:40:13,419 INFO L226 Difference]: Without dead ends: 327 [2019-10-13 21:40:13,421 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2019-10-13 21:40:13,424 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 327 states. [2019-10-13 21:40:13,479 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 327 to 317. [2019-10-13 21:40:13,480 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 317 states. [2019-10-13 21:40:13,485 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 317 states to 317 states and 547 transitions. [2019-10-13 21:40:13,485 INFO L78 Accepts]: Start accepts. Automaton has 317 states and 547 transitions. Word has length 86 [2019-10-13 21:40:13,486 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:40:13,486 INFO L462 AbstractCegarLoop]: Abstraction has 317 states and 547 transitions. [2019-10-13 21:40:13,486 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-13 21:40:13,486 INFO L276 IsEmpty]: Start isEmpty. Operand 317 states and 547 transitions. [2019-10-13 21:40:13,489 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2019-10-13 21:40:13,489 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:40:13,490 INFO L380 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 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:40:13,490 INFO L410 AbstractCegarLoop]: === Iteration 3 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:40:13,490 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:40:13,491 INFO L82 PathProgramCache]: Analyzing trace with hash -311198136, now seen corresponding path program 1 times [2019-10-13 21:40:13,491 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-13 21:40:13,491 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [359429372] [2019-10-13 21:40:13,491 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:40:13,491 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:40:13,492 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:40:13,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:40:13,602 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 21 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-13 21:40:13,603 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [359429372] [2019-10-13 21:40:13,604 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1259847281] [2019-10-13 21:40:13,604 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:40:13,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:40:13,744 INFO L256 TraceCheckSpWp]: Trace formula consists of 442 conjuncts, 4 conjunts are in the unsatisfiable core [2019-10-13 21:40:13,754 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-13 21:40:13,842 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 17 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-10-13 21:40:13,843 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-10-13 21:40:13,911 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 17 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-10-13 21:40:13,912 INFO L223 tionRefinementEngine]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2019-10-13 21:40:13,912 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [6] total 7 [2019-10-13 21:40:13,912 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [558927383] [2019-10-13 21:40:13,914 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-13 21:40:13,915 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-13 21:40:13,915 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-13 21:40:13,915 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2019-10-13 21:40:13,915 INFO L87 Difference]: Start difference. First operand 317 states and 547 transitions. Second operand 3 states. [2019-10-13 21:40:14,351 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:40:14,352 INFO L93 Difference]: Finished difference Result 860 states and 1512 transitions. [2019-10-13 21:40:14,352 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-13 21:40:14,352 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 97 [2019-10-13 21:40:14,353 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:40:14,358 INFO L225 Difference]: With dead ends: 860 [2019-10-13 21:40:14,358 INFO L226 Difference]: Without dead ends: 548 [2019-10-13 21:40:14,360 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 199 GetRequests, 192 SyntacticMatches, 2 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2019-10-13 21:40:14,362 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 548 states. [2019-10-13 21:40:14,394 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 548 to 548. [2019-10-13 21:40:14,394 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 548 states. [2019-10-13 21:40:14,398 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 548 states to 548 states and 908 transitions. [2019-10-13 21:40:14,398 INFO L78 Accepts]: Start accepts. Automaton has 548 states and 908 transitions. Word has length 97 [2019-10-13 21:40:14,399 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:40:14,399 INFO L462 AbstractCegarLoop]: Abstraction has 548 states and 908 transitions. [2019-10-13 21:40:14,399 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-13 21:40:14,399 INFO L276 IsEmpty]: Start isEmpty. Operand 548 states and 908 transitions. [2019-10-13 21:40:14,403 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2019-10-13 21:40:14,403 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:40:14,403 INFO L380 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 21:40:14,609 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-13 21:40:14,610 INFO L410 AbstractCegarLoop]: === Iteration 4 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:40:14,611 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:40:14,611 INFO L82 PathProgramCache]: Analyzing trace with hash 1630249543, now seen corresponding path program 1 times [2019-10-13 21:40:14,611 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-13 21:40:14,612 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1004584912] [2019-10-13 21:40:14,612 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:40:14,612 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:40:14,613 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:40:14,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:40:14,744 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-13 21:40:14,744 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1004584912] [2019-10-13 21:40:14,744 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:40:14,744 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-13 21:40:14,745 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [902521031] [2019-10-13 21:40:14,745 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-13 21:40:14,745 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-13 21:40:14,746 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-13 21:40:14,746 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-13 21:40:14,746 INFO L87 Difference]: Start difference. First operand 548 states and 908 transitions. Second operand 3 states. [2019-10-13 21:40:15,211 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:40:15,212 INFO L93 Difference]: Finished difference Result 1472 states and 2504 transitions. [2019-10-13 21:40:15,215 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-13 21:40:15,215 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 96 [2019-10-13 21:40:15,216 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:40:15,223 INFO L225 Difference]: With dead ends: 1472 [2019-10-13 21:40:15,223 INFO L226 Difference]: Without dead ends: 929 [2019-10-13 21:40:15,225 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:40:15,226 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 929 states. [2019-10-13 21:40:15,265 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 929 to 779. [2019-10-13 21:40:15,266 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 779 states. [2019-10-13 21:40:15,270 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 779 states to 779 states and 1284 transitions. [2019-10-13 21:40:15,270 INFO L78 Accepts]: Start accepts. Automaton has 779 states and 1284 transitions. Word has length 96 [2019-10-13 21:40:15,271 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:40:15,271 INFO L462 AbstractCegarLoop]: Abstraction has 779 states and 1284 transitions. [2019-10-13 21:40:15,271 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-13 21:40:15,271 INFO L276 IsEmpty]: Start isEmpty. Operand 779 states and 1284 transitions. [2019-10-13 21:40:15,276 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2019-10-13 21:40:15,276 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:40:15,277 INFO L380 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 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:40:15,278 INFO L410 AbstractCegarLoop]: === Iteration 5 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:40:15,278 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:40:15,279 INFO L82 PathProgramCache]: Analyzing trace with hash -498197012, now seen corresponding path program 1 times [2019-10-13 21:40:15,279 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-13 21:40:15,279 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [420656547] [2019-10-13 21:40:15,279 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:40:15,279 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:40:15,280 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:40:15,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:40:15,409 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 37 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-13 21:40:15,409 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [420656547] [2019-10-13 21:40:15,409 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1561365185] [2019-10-13 21:40:15,410 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-13 21:40:15,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:40:15,501 INFO L256 TraceCheckSpWp]: Trace formula consists of 448 conjuncts, 4 conjunts are in the unsatisfiable core [2019-10-13 21:40:15,506 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-13 21:40:15,532 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 31 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2019-10-13 21:40:15,533 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-10-13 21:40:15,574 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 31 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2019-10-13 21:40:15,574 INFO L223 tionRefinementEngine]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2019-10-13 21:40:15,574 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [6] total 7 [2019-10-13 21:40:15,575 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1760472878] [2019-10-13 21:40:15,575 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-13 21:40:15,576 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-13 21:40:15,576 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-13 21:40:15,576 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2019-10-13 21:40:15,576 INFO L87 Difference]: Start difference. First operand 779 states and 1284 transitions. Second operand 3 states. [2019-10-13 21:40:16,063 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:40:16,063 INFO L93 Difference]: Finished difference Result 2084 states and 3517 transitions. [2019-10-13 21:40:16,064 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-13 21:40:16,065 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 111 [2019-10-13 21:40:16,065 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:40:16,065 INFO L225 Difference]: With dead ends: 2084 [2019-10-13 21:40:16,066 INFO L226 Difference]: Without dead ends: 0 [2019-10-13 21:40:16,071 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 227 GetRequests, 220 SyntacticMatches, 2 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2019-10-13 21:40:16,071 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-10-13 21:40:16,072 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-10-13 21:40:16,072 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-10-13 21:40:16,072 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-10-13 21:40:16,072 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 111 [2019-10-13 21:40:16,073 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:40:16,073 INFO L462 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-10-13 21:40:16,073 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-13 21:40:16,073 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-10-13 21:40:16,073 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-10-13 21:40:16,278 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-13 21:40:16,284 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-10-13 21:40:16,502 WARN L191 SmtUtils]: Spent 132.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 37 [2019-10-13 21:40:16,529 INFO L439 ceAbstractionStarter]: At program point ULTIMATE.initENTRY(line -1) the Hoare annotation is: (= ~a8~0 |old(~a8~0)|) [2019-10-13 21:40:16,529 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2019-10-13 21:40:16,529 INFO L443 ceAbstractionStarter]: For program point L333(lines 333 390) no Hoare annotation was computed. [2019-10-13 21:40:16,530 INFO L443 ceAbstractionStarter]: For program point L102(lines 102 390) no Hoare annotation was computed. [2019-10-13 21:40:16,530 INFO L443 ceAbstractionStarter]: For program point L268(lines 268 390) no Hoare annotation was computed. [2019-10-13 21:40:16,530 INFO L443 ceAbstractionStarter]: For program point L136(lines 136 390) no Hoare annotation was computed. [2019-10-13 21:40:16,530 INFO L443 ceAbstractionStarter]: For program point L203(lines 203 390) no Hoare annotation was computed. [2019-10-13 21:40:16,530 INFO L443 ceAbstractionStarter]: For program point L72(lines 72 390) no Hoare annotation was computed. [2019-10-13 21:40:16,530 INFO L443 ceAbstractionStarter]: For program point L337(lines 337 390) no Hoare annotation was computed. [2019-10-13 21:40:16,530 INFO L443 ceAbstractionStarter]: For program point L238(lines 238 390) no Hoare annotation was computed. [2019-10-13 21:40:16,531 INFO L443 ceAbstractionStarter]: For program point L173(lines 173 390) no Hoare annotation was computed. [2019-10-13 21:40:16,531 INFO L443 ceAbstractionStarter]: For program point L140(lines 140 390) no Hoare annotation was computed. [2019-10-13 21:40:16,531 INFO L443 ceAbstractionStarter]: For program point L372(lines 372 390) no Hoare annotation was computed. [2019-10-13 21:40:16,531 INFO L443 ceAbstractionStarter]: For program point L306(lines 306 390) no Hoare annotation was computed. [2019-10-13 21:40:16,531 INFO L443 ceAbstractionStarter]: For program point L273(lines 273 390) no Hoare annotation was computed. [2019-10-13 21:40:16,531 INFO L443 ceAbstractionStarter]: For program point L108(lines 108 390) no Hoare annotation was computed. [2019-10-13 21:40:16,531 INFO L443 ceAbstractionStarter]: For program point L208(lines 208 390) no Hoare annotation was computed. [2019-10-13 21:40:16,532 INFO L443 ceAbstractionStarter]: For program point L43(lines 43 390) no Hoare annotation was computed. [2019-10-13 21:40:16,532 INFO L443 ceAbstractionStarter]: For program point L144(lines 144 390) no Hoare annotation was computed. [2019-10-13 21:40:16,532 INFO L443 ceAbstractionStarter]: For program point L541-1(lines 30 575) no Hoare annotation was computed. [2019-10-13 21:40:16,532 INFO L443 ceAbstractionStarter]: For program point L178(lines 178 390) no Hoare annotation was computed. [2019-10-13 21:40:16,532 INFO L443 ceAbstractionStarter]: For program point calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION(line 545) no Hoare annotation was computed. [2019-10-13 21:40:16,532 INFO L443 ceAbstractionStarter]: For program point L377(lines 377 390) no Hoare annotation was computed. [2019-10-13 21:40:16,532 INFO L443 ceAbstractionStarter]: For program point L278(lines 278 390) no Hoare annotation was computed. [2019-10-13 21:40:16,533 INFO L443 ceAbstractionStarter]: For program point L245(lines 245 390) no Hoare annotation was computed. [2019-10-13 21:40:16,533 INFO L443 ceAbstractionStarter]: For program point L80(lines 80 390) no Hoare annotation was computed. [2019-10-13 21:40:16,533 INFO L443 ceAbstractionStarter]: For program point L345(lines 345 390) no Hoare annotation was computed. [2019-10-13 21:40:16,533 INFO L443 ceAbstractionStarter]: For program point L312(lines 312 390) no Hoare annotation was computed. [2019-10-13 21:40:16,533 INFO L443 ceAbstractionStarter]: For program point L114(lines 114 390) no Hoare annotation was computed. [2019-10-13 21:40:16,533 INFO L443 ceAbstractionStarter]: For program point L544-1(lines 30 575) no Hoare annotation was computed. [2019-10-13 21:40:16,533 INFO L443 ceAbstractionStarter]: For program point L214(lines 214 390) no Hoare annotation was computed. [2019-10-13 21:40:16,534 INFO L443 ceAbstractionStarter]: For program point L148(lines 148 390) no Hoare annotation was computed. [2019-10-13 21:40:16,534 INFO L443 ceAbstractionStarter]: For program point L49(lines 49 390) no Hoare annotation was computed. [2019-10-13 21:40:16,534 INFO L443 ceAbstractionStarter]: For program point L545(line 545) no Hoare annotation was computed. [2019-10-13 21:40:16,534 INFO L443 ceAbstractionStarter]: For program point L84(lines 84 390) no Hoare annotation was computed. [2019-10-13 21:40:16,534 INFO L443 ceAbstractionStarter]: For program point calculate_outputFINAL(lines 30 575) no Hoare annotation was computed. [2019-10-13 21:40:16,534 INFO L443 ceAbstractionStarter]: For program point calculate_outputEXIT(lines 30 575) no Hoare annotation was computed. [2019-10-13 21:40:16,534 INFO L443 ceAbstractionStarter]: For program point L382(lines 382 390) no Hoare annotation was computed. [2019-10-13 21:40:16,535 INFO L443 ceAbstractionStarter]: For program point L316(lines 316 390) no Hoare annotation was computed. [2019-10-13 21:40:16,535 INFO L443 ceAbstractionStarter]: For program point L250(lines 250 390) no Hoare annotation was computed. [2019-10-13 21:40:16,535 INFO L443 ceAbstractionStarter]: For program point L218(lines 218 390) no Hoare annotation was computed. [2019-10-13 21:40:16,535 INFO L443 ceAbstractionStarter]: For program point L152(lines 152 390) no Hoare annotation was computed. [2019-10-13 21:40:16,535 INFO L443 ceAbstractionStarter]: For program point L119(lines 119 390) no Hoare annotation was computed. [2019-10-13 21:40:16,535 INFO L443 ceAbstractionStarter]: For program point L318(lines 318 390) no Hoare annotation was computed. [2019-10-13 21:40:16,535 INFO L443 ceAbstractionStarter]: For program point L186(lines 186 390) no Hoare annotation was computed. [2019-10-13 21:40:16,536 INFO L443 ceAbstractionStarter]: For program point L54(lines 54 390) no Hoare annotation was computed. [2019-10-13 21:40:16,536 INFO L443 ceAbstractionStarter]: For program point L286(lines 286 390) no Hoare annotation was computed. [2019-10-13 21:40:16,536 INFO L443 ceAbstractionStarter]: For program point L353(lines 353 390) no Hoare annotation was computed. [2019-10-13 21:40:16,536 INFO L443 ceAbstractionStarter]: For program point L189(lines 189 390) no Hoare annotation was computed. [2019-10-13 21:40:16,536 INFO L443 ceAbstractionStarter]: For program point L355(lines 355 390) no Hoare annotation was computed. [2019-10-13 21:40:16,536 INFO L443 ceAbstractionStarter]: For program point L256(lines 256 390) no Hoare annotation was computed. [2019-10-13 21:40:16,536 INFO L443 ceAbstractionStarter]: For program point L223(lines 223 390) no Hoare annotation was computed. [2019-10-13 21:40:16,536 INFO L443 ceAbstractionStarter]: For program point L124(lines 124 390) no Hoare annotation was computed. [2019-10-13 21:40:16,537 INFO L443 ceAbstractionStarter]: For program point L92(lines 92 390) no Hoare annotation was computed. [2019-10-13 21:40:16,537 INFO L439 ceAbstractionStarter]: At program point calculate_outputENTRY(lines 30 575) the Hoare annotation is: (let ((.cse1 (<= ~a20~0 0)) (.cse2 (not (<= |old(~a20~0)| 0))) (.cse3 (= 1 |old(~a7~0)|)) (.cse0 (= 6 |old(~a16~0)|)) (.cse4 (= ~a8~0 |old(~a8~0)|))) (and (or .cse0 .cse1 .cse2) (or .cse3 (= 13 |old(~a8~0)|) .cse1 .cse2) (or .cse3 (and .cse4 (not (= 1 ~a7~0)))) (or .cse0 (and .cse4 (not (= ~a16~0 6)))) (or (and .cse4 (<= ~a17~0 0)) (not (<= |old(~a17~0)| 0))))) [2019-10-13 21:40:16,537 INFO L443 ceAbstractionStarter]: For program point L324(lines 324 390) no Hoare annotation was computed. [2019-10-13 21:40:16,537 INFO L443 ceAbstractionStarter]: For program point L292(lines 292 390) no Hoare annotation was computed. [2019-10-13 21:40:16,537 INFO L443 ceAbstractionStarter]: For program point L160(lines 160 390) no Hoare annotation was computed. [2019-10-13 21:40:16,538 INFO L443 ceAbstractionStarter]: For program point L194(lines 194 390) no Hoare annotation was computed. [2019-10-13 21:40:16,538 INFO L443 ceAbstractionStarter]: For program point L62(lines 62 390) no Hoare annotation was computed. [2019-10-13 21:40:16,538 INFO L443 ceAbstractionStarter]: For program point L261(lines 261 390) no Hoare annotation was computed. [2019-10-13 21:40:16,538 INFO L443 ceAbstractionStarter]: For program point L129(lines 129 390) no Hoare annotation was computed. [2019-10-13 21:40:16,538 INFO L443 ceAbstractionStarter]: For program point L361(lines 361 390) no Hoare annotation was computed. [2019-10-13 21:40:16,538 INFO L443 ceAbstractionStarter]: For program point L97(lines 97 390) no Hoare annotation was computed. [2019-10-13 21:40:16,538 INFO L443 ceAbstractionStarter]: For program point L31(lines 31 390) no Hoare annotation was computed. [2019-10-13 21:40:16,539 INFO L443 ceAbstractionStarter]: For program point L329(lines 329 390) no Hoare annotation was computed. [2019-10-13 21:40:16,539 INFO L443 ceAbstractionStarter]: For program point L197(lines 197 390) no Hoare annotation was computed. [2019-10-13 21:40:16,539 INFO L443 ceAbstractionStarter]: For program point L65(lines 65 390) no Hoare annotation was computed. [2019-10-13 21:40:16,539 INFO L443 ceAbstractionStarter]: For program point L363(lines 363 390) no Hoare annotation was computed. [2019-10-13 21:40:16,539 INFO L443 ceAbstractionStarter]: For program point L231(lines 231 390) no Hoare annotation was computed. [2019-10-13 21:40:16,539 INFO L443 ceAbstractionStarter]: For program point L165(lines 165 390) no Hoare annotation was computed. [2019-10-13 21:40:16,539 INFO L443 ceAbstractionStarter]: For program point L265(lines 265 390) no Hoare annotation was computed. [2019-10-13 21:40:16,539 INFO L443 ceAbstractionStarter]: For program point L365(lines 365 390) no Hoare annotation was computed. [2019-10-13 21:40:16,540 INFO L443 ceAbstractionStarter]: For program point L299(lines 299 390) no Hoare annotation was computed. [2019-10-13 21:40:16,540 INFO L443 ceAbstractionStarter]: For program point L35(lines 35 390) no Hoare annotation was computed. [2019-10-13 21:40:16,540 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2019-10-13 21:40:16,540 INFO L439 ceAbstractionStarter]: At program point L-1(line -1) the Hoare annotation is: (and (not (= ~a16~0 6)) (not (= 1 ~a7~0)) (not (= ~a8~0 13))) [2019-10-13 21:40:16,540 INFO L446 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2019-10-13 21:40:16,540 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2019-10-13 21:40:16,541 INFO L439 ceAbstractionStarter]: At program point mainENTRY(lines 577 594) the Hoare annotation is: (or (= 6 |old(~a16~0)|) (= 1 |old(~a7~0)|) (= 13 |old(~a8~0)|) (and (= ~a8~0 |old(~a8~0)|) (not (= ~a16~0 6)) (not (= 1 ~a7~0)))) [2019-10-13 21:40:16,541 INFO L443 ceAbstractionStarter]: For program point mainEXIT(lines 577 594) no Hoare annotation was computed. [2019-10-13 21:40:16,541 INFO L439 ceAbstractionStarter]: At program point L591(line 591) the Hoare annotation is: (or (= 6 |old(~a16~0)|) (= 1 |old(~a7~0)|) (= 13 |old(~a8~0)|) (not (= ~a16~0 6)) (<= ~a17~0 0) (not (= 1 ~a7~0))) [2019-10-13 21:40:16,541 INFO L443 ceAbstractionStarter]: For program point L591-1(line 591) no Hoare annotation was computed. [2019-10-13 21:40:16,541 INFO L443 ceAbstractionStarter]: For program point L588(line 588) no Hoare annotation was computed. [2019-10-13 21:40:16,541 INFO L439 ceAbstractionStarter]: At program point L583-2(lines 583 593) the Hoare annotation is: (or (= 6 |old(~a16~0)|) (= 1 |old(~a7~0)|) (= 13 |old(~a8~0)|) (not (= ~a16~0 6)) (<= ~a17~0 0) (not (= 1 ~a7~0))) [2019-10-13 21:40:16,542 INFO L443 ceAbstractionStarter]: For program point L583-3(lines 577 594) no Hoare annotation was computed. [2019-10-13 21:40:16,561 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 13.10 09:40:16 BoogieIcfgContainer [2019-10-13 21:40:16,561 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-10-13 21:40:16,564 INFO L168 Benchmark]: Toolchain (without parser) took 8318.07 ms. Allocated memory was 145.8 MB in the beginning and 329.8 MB in the end (delta: 184.0 MB). Free memory was 102.1 MB in the beginning and 220.0 MB in the end (delta: -117.9 MB). Peak memory consumption was 66.1 MB. Max. memory is 7.1 GB. [2019-10-13 21:40:16,565 INFO L168 Benchmark]: CDTParser took 0.23 ms. Allocated memory is still 145.8 MB. Free memory was 122.1 MB in the beginning and 121.9 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:40:16,569 INFO L168 Benchmark]: CACSL2BoogieTranslator took 818.51 ms. Allocated memory was 145.8 MB in the beginning and 205.0 MB in the end (delta: 59.2 MB). Free memory was 101.8 MB in the beginning and 170.5 MB in the end (delta: -68.7 MB). Peak memory consumption was 31.9 MB. Max. memory is 7.1 GB. [2019-10-13 21:40:16,570 INFO L168 Benchmark]: Boogie Preprocessor took 168.16 ms. Allocated memory is still 205.0 MB. Free memory was 170.5 MB in the beginning and 165.6 MB in the end (delta: 4.9 MB). Peak memory consumption was 4.9 MB. Max. memory is 7.1 GB. [2019-10-13 21:40:16,571 INFO L168 Benchmark]: RCFGBuilder took 2123.82 ms. Allocated memory was 205.0 MB in the beginning and 251.1 MB in the end (delta: 46.1 MB). Free memory was 165.6 MB in the beginning and 212.1 MB in the end (delta: -46.5 MB). Peak memory consumption was 117.7 MB. Max. memory is 7.1 GB. [2019-10-13 21:40:16,578 INFO L168 Benchmark]: TraceAbstraction took 5202.78 ms. Allocated memory was 251.1 MB in the beginning and 329.8 MB in the end (delta: 78.6 MB). Free memory was 212.1 MB in the beginning and 220.0 MB in the end (delta: -7.9 MB). Peak memory consumption was 70.8 MB. Max. memory is 7.1 GB. [2019-10-13 21:40:16,584 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.23 ms. Allocated memory is still 145.8 MB. Free memory was 122.1 MB in the beginning and 121.9 MB in the end (delta: 209.7 kB). Peak memory consumption was 209.7 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 818.51 ms. Allocated memory was 145.8 MB in the beginning and 205.0 MB in the end (delta: 59.2 MB). Free memory was 101.8 MB in the beginning and 170.5 MB in the end (delta: -68.7 MB). Peak memory consumption was 31.9 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 168.16 ms. Allocated memory is still 205.0 MB. Free memory was 170.5 MB in the beginning and 165.6 MB in the end (delta: 4.9 MB). Peak memory consumption was 4.9 MB. Max. memory is 7.1 GB. * RCFGBuilder took 2123.82 ms. Allocated memory was 205.0 MB in the beginning and 251.1 MB in the end (delta: 46.1 MB). Free memory was 165.6 MB in the beginning and 212.1 MB in the end (delta: -46.5 MB). Peak memory consumption was 117.7 MB. Max. memory is 7.1 GB. * TraceAbstraction took 5202.78 ms. Allocated memory was 251.1 MB in the beginning and 329.8 MB in the end (delta: 78.6 MB). Free memory was 212.1 MB in the beginning and 220.0 MB in the end (delta: -7.9 MB). Peak memory consumption was 70.8 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 545]: 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: 583]: Loop Invariant Derived loop invariant: ((((6 == \old(a16) || 1 == \old(a7)) || 13 == \old(a8)) || !(a16 == 6)) || a17 <= 0) || !(1 == a7) - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 86 locations, 1 error locations. Result: SAFE, OverallTime: 5.1s, OverallIterations: 5, TraceHistogramMax: 3, AutomataDifference: 2.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.2s, HoareTripleCheckerStatistics: 382 SDtfs, 365 SDslu, 80 SDs, 0 SdLazy, 1332 SolverSat, 314 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.7s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 444 GetRequests, 421 SyntacticMatches, 5 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=779occurred in iteration=4, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 5 MinimizatonAttempts, 160 StatesRemovedByMinimization, 2 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 7 LocationsWithAnnotation, 47 PreInvPairs, 81 NumberOfFragments, 143 HoareAnnotationTreeSize, 47 FomulaSimplifications, 806 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 7 FomulaSimplificationsInter, 385 FormulaSimplificationTreeSizeReductionInter, 0.1s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 0.7s InterpolantComputationTime, 675 NumberOfCodeBlocks, 675 NumberOfCodeBlocksAsserted, 7 NumberOfCheckSat, 874 ConstructedInterpolants, 0 QuantifiedInterpolants, 202300 SizeOfPredicates, 4 NumberOfNonLiveVariables, 890 ConjunctsInSsa, 8 ConjunctsInUnsatCore, 9 InterpolantComputations, 7 PerfectInterpolantSequences, 204/208 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...