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/loops/ludcmp.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-f4eb214f-m [2019-10-13 22:59:53,297 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-10-13 22:59:53,299 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-10-13 22:59:53,310 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-10-13 22:59:53,310 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-10-13 22:59:53,311 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-10-13 22:59:53,313 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-10-13 22:59:53,315 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-10-13 22:59:53,317 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-10-13 22:59:53,318 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-10-13 22:59:53,319 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-10-13 22:59:53,320 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-10-13 22:59:53,320 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-10-13 22:59:53,321 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-10-13 22:59:53,322 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-10-13 22:59:53,324 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-10-13 22:59:53,324 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-10-13 22:59:53,325 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-10-13 22:59:53,327 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-10-13 22:59:53,329 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-10-13 22:59:53,331 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-10-13 22:59:53,332 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-10-13 22:59:53,333 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-10-13 22:59:53,334 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-10-13 22:59:53,337 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-10-13 22:59:53,338 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-10-13 22:59:53,338 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-10-13 22:59:53,339 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-10-13 22:59:53,340 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-10-13 22:59:53,341 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-10-13 22:59:53,342 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-10-13 22:59:53,345 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-10-13 22:59:53,346 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-10-13 22:59:53,349 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-10-13 22:59:53,351 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-10-13 22:59:53,351 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-10-13 22:59:53,352 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-10-13 22:59:53,352 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-10-13 22:59:53,352 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-10-13 22:59:53,353 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-10-13 22:59:53,354 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-10-13 22:59:53,358 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 22:59:53,380 INFO L113 SettingsManager]: Loading preferences was successful [2019-10-13 22:59:53,381 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-10-13 22:59:53,382 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-10-13 22:59:53,382 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-10-13 22:59:53,382 INFO L138 SettingsManager]: * Use SBE=true [2019-10-13 22:59:53,382 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-10-13 22:59:53,383 INFO L138 SettingsManager]: * sizeof long=4 [2019-10-13 22:59:53,383 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-10-13 22:59:53,383 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-10-13 22:59:53,383 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-10-13 22:59:53,383 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-10-13 22:59:53,384 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-10-13 22:59:53,384 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-10-13 22:59:53,384 INFO L138 SettingsManager]: * sizeof long double=12 [2019-10-13 22:59:53,384 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-10-13 22:59:53,385 INFO L138 SettingsManager]: * Use constant arrays=true [2019-10-13 22:59:53,385 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-10-13 22:59:53,385 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-10-13 22:59:53,385 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-10-13 22:59:53,385 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-10-13 22:59:53,386 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-10-13 22:59:53,386 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-13 22:59:53,386 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-10-13 22:59:53,386 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-10-13 22:59:53,387 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-10-13 22:59:53,387 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-10-13 22:59:53,387 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-10-13 22:59:53,387 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-10-13 22:59:53,387 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 22:59:53,649 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-10-13 22:59:53,661 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-10-13 22:59:53,665 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-10-13 22:59:53,666 INFO L271 PluginConnector]: Initializing CDTParser... [2019-10-13 22:59:53,667 INFO L275 PluginConnector]: CDTParser initialized [2019-10-13 22:59:53,667 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loops/ludcmp.c [2019-10-13 22:59:53,726 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b4a5b29fd/b44d7b1a16ef4bfd9bef4744cdd7cf2d/FLAG8f152f430 [2019-10-13 22:59:54,182 INFO L306 CDTParser]: Found 1 translation units. [2019-10-13 22:59:54,184 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loops/ludcmp.c [2019-10-13 22:59:54,193 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b4a5b29fd/b44d7b1a16ef4bfd9bef4744cdd7cf2d/FLAG8f152f430 [2019-10-13 22:59:54,499 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b4a5b29fd/b44d7b1a16ef4bfd9bef4744cdd7cf2d [2019-10-13 22:59:54,510 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-10-13 22:59:54,511 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-10-13 22:59:54,512 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-10-13 22:59:54,513 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-10-13 22:59:54,516 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-10-13 22:59:54,517 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 10:59:54" (1/1) ... [2019-10-13 22:59:54,520 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6063a733 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 10:59:54, skipping insertion in model container [2019-10-13 22:59:54,520 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 10:59:54" (1/1) ... [2019-10-13 22:59:54,528 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-10-13 22:59:54,553 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-10-13 22:59:54,817 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-13 22:59:54,824 INFO L188 MainTranslator]: Completed pre-run [2019-10-13 22:59:54,946 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-13 22:59:54,968 INFO L192 MainTranslator]: Completed translation [2019-10-13 22:59:54,968 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 10:59:54 WrapperNode [2019-10-13 22:59:54,969 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-10-13 22:59:54,969 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-10-13 22:59:54,970 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-10-13 22:59:54,970 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-10-13 22:59:54,980 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 10:59:54" (1/1) ... [2019-10-13 22:59:54,980 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 10:59:54" (1/1) ... [2019-10-13 22:59:54,992 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 10:59:54" (1/1) ... [2019-10-13 22:59:54,992 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 10:59:54" (1/1) ... [2019-10-13 22:59:55,008 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 10:59:54" (1/1) ... [2019-10-13 22:59:55,017 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 10:59:54" (1/1) ... [2019-10-13 22:59:55,020 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 10:59:54" (1/1) ... [2019-10-13 22:59:55,023 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-10-13 22:59:55,024 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-10-13 22:59:55,024 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-10-13 22:59:55,024 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-10-13 22:59:55,025 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 10:59:54" (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 22:59:55,089 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-10-13 22:59:55,089 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-10-13 22:59:55,089 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2019-10-13 22:59:55,089 INFO L138 BoogieDeclarations]: Found implementation of procedure fabs [2019-10-13 22:59:55,089 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-10-13 22:59:55,090 INFO L138 BoogieDeclarations]: Found implementation of procedure ludcmp [2019-10-13 22:59:55,090 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-10-13 22:59:55,090 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2019-10-13 22:59:55,090 INFO L130 BoogieDeclarations]: Found specification of procedure ludcmp [2019-10-13 22:59:55,090 INFO L130 BoogieDeclarations]: Found specification of procedure fabs [2019-10-13 22:59:55,091 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-10-13 22:59:55,091 INFO L130 BoogieDeclarations]: Found specification of procedure write~real [2019-10-13 22:59:55,091 INFO L130 BoogieDeclarations]: Found specification of procedure read~real [2019-10-13 22:59:55,091 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-10-13 22:59:55,091 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-10-13 22:59:55,091 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-10-13 22:59:55,092 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-10-13 22:59:55,754 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-10-13 22:59:55,754 INFO L284 CfgBuilder]: Removed 11 assume(true) statements. [2019-10-13 22:59:55,756 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 10:59:55 BoogieIcfgContainer [2019-10-13 22:59:55,756 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-10-13 22:59:55,757 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-10-13 22:59:55,758 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-10-13 22:59:55,761 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-10-13 22:59:55,761 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.10 10:59:54" (1/3) ... [2019-10-13 22:59:55,762 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@18ee8758 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 10:59:55, skipping insertion in model container [2019-10-13 22:59:55,762 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 10:59:54" (2/3) ... [2019-10-13 22:59:55,763 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@18ee8758 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 10:59:55, skipping insertion in model container [2019-10-13 22:59:55,763 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 10:59:55" (3/3) ... [2019-10-13 22:59:55,765 INFO L109 eAbstractionObserver]: Analyzing ICFG ludcmp.c [2019-10-13 22:59:55,775 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-10-13 22:59:55,788 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-10-13 22:59:55,800 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-10-13 22:59:55,838 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-10-13 22:59:55,838 INFO L374 AbstractCegarLoop]: Hoare is true [2019-10-13 22:59:55,839 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-10-13 22:59:55,839 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-10-13 22:59:55,839 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-10-13 22:59:55,839 INFO L378 AbstractCegarLoop]: Difference is false [2019-10-13 22:59:55,840 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-10-13 22:59:55,840 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-10-13 22:59:55,863 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states. [2019-10-13 22:59:55,869 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-10-13 22:59:55,869 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 22:59:55,870 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 22:59:55,872 INFO L410 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 22:59:55,878 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 22:59:55,878 INFO L82 PathProgramCache]: Analyzing trace with hash 133090448, now seen corresponding path program 1 times [2019-10-13 22:59:55,888 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-13 22:59:55,888 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [304678572] [2019-10-13 22:59:55,888 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 22:59:55,889 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 22:59:55,889 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 22:59:56,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 22:59:56,104 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 22:59:56,104 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [304678572] [2019-10-13 22:59:56,105 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 22:59:56,106 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-13 22:59:56,106 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1762755471] [2019-10-13 22:59:56,110 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-13 22:59:56,111 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-13 22:59:56,125 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-13 22:59:56,125 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-10-13 22:59:56,128 INFO L87 Difference]: Start difference. First operand 39 states. Second operand 4 states. [2019-10-13 22:59:56,186 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 22:59:56,187 INFO L93 Difference]: Finished difference Result 74 states and 104 transitions. [2019-10-13 22:59:56,188 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-13 22:59:56,189 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 11 [2019-10-13 22:59:56,189 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 22:59:56,197 INFO L225 Difference]: With dead ends: 74 [2019-10-13 22:59:56,198 INFO L226 Difference]: Without dead ends: 16 [2019-10-13 22:59:56,202 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-10-13 22:59:56,218 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states. [2019-10-13 22:59:56,234 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 16. [2019-10-13 22:59:56,235 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2019-10-13 22:59:56,236 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 17 transitions. [2019-10-13 22:59:56,238 INFO L78 Accepts]: Start accepts. Automaton has 16 states and 17 transitions. Word has length 11 [2019-10-13 22:59:56,239 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 22:59:56,239 INFO L462 AbstractCegarLoop]: Abstraction has 16 states and 17 transitions. [2019-10-13 22:59:56,239 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-13 22:59:56,239 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 17 transitions. [2019-10-13 22:59:56,240 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2019-10-13 22:59:56,240 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 22:59:56,240 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 22:59:56,241 INFO L410 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 22:59:56,241 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 22:59:56,241 INFO L82 PathProgramCache]: Analyzing trace with hash -455874738, now seen corresponding path program 1 times [2019-10-13 22:59:56,242 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-13 22:59:56,242 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [730070174] [2019-10-13 22:59:56,242 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 22:59:56,243 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 22:59:56,243 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 22:59:56,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 22:59:56,345 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-13 22:59:56,346 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [730070174] [2019-10-13 22:59:56,346 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [934465189] [2019-10-13 22:59:56,346 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 22:59:56,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 22:59:56,434 INFO L256 TraceCheckSpWp]: Trace formula consists of 101 conjuncts, 4 conjunts are in the unsatisfiable core [2019-10-13 22:59:56,440 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-13 22:59:56,509 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-13 22:59:56,510 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-10-13 22:59:56,548 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-13 22:59:56,549 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [891600630] [2019-10-13 22:59:56,574 INFO L162 IcfgInterpreter]: Started Sifa with 12 locations of interest [2019-10-13 22:59:56,575 INFO L169 IcfgInterpreter]: Building call graph [2019-10-13 22:59:56,583 INFO L174 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-10-13 22:59:56,593 INFO L179 IcfgInterpreter]: Starting interpretation [2019-10-13 22:59:56,595 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2019-10-13 22:59:57,113 INFO L199 IcfgInterpreter]: Interpreting procedure main with input of size 71 for LOIs [2019-10-13 22:59:57,460 INFO L199 IcfgInterpreter]: Interpreting procedure __VERIFIER_assert with input of size 6 for LOIs [2019-10-13 22:59:57,509 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.init with input of size 34 for LOIs [2019-10-13 22:59:57,533 INFO L183 IcfgInterpreter]: Interpretation finished [2019-10-13 22:59:57,534 INFO L191 IcfgInterpreter]: Final predicates for locations of interest are: [2019-10-13 22:59:57,534 INFO L193 IcfgInterpreter]: Reachable states at location L-1 satisfy 23#(and (= ((as const (Array Int Real)) 0.0) (select |#memory_real| |~#a~0.base|)) (= 0 |#NULL.base|) (<= 0 |~#x~0.offset|) (< |~#b~0.base| |#StackHeapBarrier|) (<= 0 |#NULL.base|) (not (= |~#x~0.base| 0)) (= 400 (select |#length| |~#x~0.base|)) (= (select |#valid| |~#b~0.base|) 1) (<= 0 |#NULL.offset|) (= 20000 (select |#length| |~#a~0.base|)) (not (= |~#b~0.base| 0)) (<= 0 |~#b~0.offset|) (= 0 |~#b~0.offset|) (not (= 0 |~#a~0.base|)) (= ((as const (Array Int Real)) 0.0) (select |#memory_real| |~#x~0.base|)) (= 400 (select |#length| |~#b~0.base|)) (<= |~#a~0.offset| 0) (< |~#a~0.base| |#StackHeapBarrier|) (= (select |#memory_real| |~#b~0.base|) ((as const (Array Int Real)) 0.0)) (<= |~#b~0.offset| 0) (= 1 (select |#valid| |~#a~0.base|)) (<= |#NULL.base| 0) (<= |~#x~0.offset| 0) (<= |#NULL.offset| 0) (< |~#x~0.base| |#StackHeapBarrier|) (<= 0 |~#a~0.offset|) (= 0 |~#a~0.offset|) (not (= |~#x~0.base| |~#b~0.base|)) (= 0 (select |#valid| 0)) (= 0 |~#x~0.offset|) (= |#NULL.offset| 0) (= 1 (select |#valid| |~#x~0.base|))) [2019-10-13 22:59:57,535 INFO L193 IcfgInterpreter]: Reachable states at location mainENTRY satisfy 33#(and (= 0 |#NULL.base|) (<= 0 |~#x~0.offset|) (< |~#b~0.base| |#StackHeapBarrier|) (<= 0 |#NULL.base|) (= (select |old(#valid)| |~#x~0.base|) 1) (not (= |~#x~0.base| 0)) (<= 0 |#NULL.offset|) (= ((as const (Array Int Real)) 0.0) (select |old(#memory_real)| |~#x~0.base|)) (not (= |~#b~0.base| 0)) (<= 0 |~#b~0.offset|) (= 0 |~#b~0.offset|) (not (= 0 |~#a~0.base|)) (= 400 (select |old(#length)| |~#x~0.base|)) (<= |~#a~0.offset| 0) (= (select |old(#length)| |~#b~0.base|) 400) (< |~#a~0.base| |#StackHeapBarrier|) (= |old(#length)| |#length|) (= (select |old(#length)| |~#a~0.base|) 20000) (= (select |old(#valid)| |~#b~0.base|) 1) (<= |~#b~0.offset| 0) (= ((as const (Array Int Real)) 0.0) (select |old(#memory_real)| |~#b~0.base|)) (= (select |old(#valid)| |~#a~0.base|) 1) (= |#memory_real| |old(#memory_real)|) (<= |#NULL.base| 0) (<= |~#x~0.offset| 0) (= 0 (select |old(#valid)| 0)) (<= |#NULL.offset| 0) (< |~#x~0.base| |#StackHeapBarrier|) (<= 0 |~#a~0.offset|) (= 0 |~#a~0.offset|) (= |#valid| |old(#valid)|) (not (= |~#x~0.base| |~#b~0.base|)) (= 0 |~#x~0.offset|) (= |#NULL.offset| 0) (= (select |old(#memory_real)| |~#a~0.base|) ((as const (Array Int Real)) 0.0))) [2019-10-13 22:59:57,535 INFO L193 IcfgInterpreter]: Reachable states at location L94-3 satisfy 73#true [2019-10-13 22:59:57,536 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initEXIT satisfy 107#(and (= (select (store (store (store |old(#valid)| 0 0) |~#a~0.base| 1) |~#b~0.base| 1) |~#x~0.base|) 0) (= 0 |#NULL.base|) (= (store (store (store |old(#memory_real)| |~#a~0.base| ((as const (Array Int Real)) 0.0)) |~#b~0.base| ((as const (Array Int Real)) 0.0)) |~#x~0.base| ((as const (Array Int Real)) 0.0)) |#memory_real|) (<= 0 |~#x~0.offset|) (< |~#b~0.base| |#StackHeapBarrier|) (<= 0 |#NULL.base|) (not (= |~#x~0.base| 0)) (= 0 (select (store (store |old(#valid)| 0 0) |~#a~0.base| 1) |~#b~0.base|)) (<= 0 |#NULL.offset|) (not (= |~#b~0.base| 0)) (<= 0 |~#b~0.offset|) (= 0 |~#b~0.offset|) (not (= 0 |~#a~0.base|)) (<= |~#a~0.offset| 0) (< |~#a~0.base| |#StackHeapBarrier|) (<= |~#b~0.offset| 0) (= |#length| (store (store (store |old(#length)| |~#a~0.base| 20000) |~#b~0.base| 400) |~#x~0.base| 400)) (<= |#NULL.base| 0) (= 0 (select (store |old(#valid)| 0 0) |~#a~0.base|)) (= |#valid| (store (store (store (store |old(#valid)| 0 0) |~#a~0.base| 1) |~#b~0.base| 1) |~#x~0.base| 1)) (<= |~#x~0.offset| 0) (<= |#NULL.offset| 0) (< |~#x~0.base| |#StackHeapBarrier|) (<= 0 |~#a~0.offset|) (= 0 |~#a~0.offset|) (= 0 |~#x~0.offset|) (= |#NULL.offset| 0)) [2019-10-13 22:59:57,536 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.startENTRY satisfy 6#true [2019-10-13 22:59:57,536 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initENTRY satisfy 102#(and (= |old(~#a~0.base)| |~#a~0.base|) (= |~#b~0.base| |old(~#b~0.base)|) (= |#memory_real| |old(#memory_real)|) (= |~#x~0.base| |old(~#x~0.base)|) (= |old(#NULL.base)| |#NULL.base|) (= |#valid| |old(#valid)|) (= |old(~#b~0.offset)| |~#b~0.offset|) (= |old(~#x~0.offset)| |~#x~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(~#a~0.offset)| |~#a~0.offset|) (= |old(#length)| |#length|)) [2019-10-13 22:59:57,537 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION satisfy 98#(and (or (and (= |__VERIFIER_assert_#in~cond| 0) (= 0 __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) (and (= |__VERIFIER_assert_#in~cond| 1) (= 0 __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond))) (<= __VERIFIER_assert_~cond 0) (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0) (<= 0 __VERIFIER_assert_~cond)) [2019-10-13 22:59:57,538 INFO L193 IcfgInterpreter]: Reachable states at location L91-3 satisfy 38#(and (<= 0 main_~i~0) (= 0 |#NULL.base|) (<= main_~n~0 5) (<= 0 |~#x~0.offset|) (< |~#b~0.base| |#StackHeapBarrier|) (<= 0 |#NULL.base|) (= (select |old(#valid)| |~#x~0.base|) 1) (not (= |~#x~0.base| 0)) (<= 5 main_~n~0) (<= 0 |#NULL.offset|) (= ((as const (Array Int Real)) 0.0) (select |old(#memory_real)| |~#x~0.base|)) (not (= |~#b~0.base| 0)) (= main_~eps~0 (/ 1.0 1000000.0)) (<= 0 |~#b~0.offset|) (= 0 |~#b~0.offset|) (not (= 0 |~#a~0.base|)) (= 400 (select |old(#length)| |~#x~0.base|)) (<= |~#a~0.offset| 0) (<= main_~eps~0 (/ 1.0 1000000.0)) (= (select |old(#length)| |~#b~0.base|) 400) (< |~#a~0.base| |#StackHeapBarrier|) (= |old(#length)| |#length|) (= main_~nmax~0 50) (= (select |old(#length)| |~#a~0.base|) 20000) (= (select |old(#valid)| |~#b~0.base|) 1) (<= |~#b~0.offset| 0) (<= 50 main_~nmax~0) (= ((as const (Array Int Real)) 0.0) (select |old(#memory_real)| |~#b~0.base|)) (= (select |old(#valid)| |~#a~0.base|) 1) (= |#memory_real| |old(#memory_real)|) (<= |#NULL.base| 0) (<= main_~nmax~0 50) (<= |~#x~0.offset| 0) (<= main_~i~0 0) (= 0 (select |old(#valid)| 0)) (<= |#NULL.offset| 0) (< |~#x~0.base| |#StackHeapBarrier|) (<= 0 |~#a~0.offset|) (= 0 |~#a~0.offset|) (<= (/ 1.0 1000000.0) main_~eps~0) (= |#valid| |old(#valid)|) (not (= |~#x~0.base| |~#b~0.base|)) (= 0 |~#x~0.offset|) (= |#NULL.offset| 0) (= main_~n~0 5) (= (select |old(#memory_real)| |~#a~0.base|) ((as const (Array Int Real)) 0.0)) (= main_~i~0 0)) [2019-10-13 22:59:57,539 INFO L193 IcfgInterpreter]: Reachable states at location L5 satisfy 93#(and (or (and (= |__VERIFIER_assert_#in~cond| 0) (= 0 __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) (and (= |__VERIFIER_assert_#in~cond| 1) (= 0 __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond))) (<= __VERIFIER_assert_~cond 0) (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0) (<= 0 __VERIFIER_assert_~cond)) [2019-10-13 22:59:57,539 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertENTRY satisfy 83#(and (or (and (<= 1 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 1)) (and (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0))) (or (= |__VERIFIER_assert_#in~cond| 0) (= |__VERIFIER_assert_#in~cond| 1))) [2019-10-13 22:59:57,540 INFO L193 IcfgInterpreter]: Reachable states at location L4 satisfy 88#(and (or (and (<= __VERIFIER_assert_~cond 0) (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0) (<= 0 __VERIFIER_assert_~cond)) (and (<= 1 __VERIFIER_assert_~cond) (<= 1 |__VERIFIER_assert_#in~cond|) (<= __VERIFIER_assert_~cond 1) (<= |__VERIFIER_assert_#in~cond| 1))) (or (and (= |__VERIFIER_assert_#in~cond| 0) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) (and (= |__VERIFIER_assert_#in~cond| 1) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)))) [2019-10-13 22:59:57,541 INFO L193 IcfgInterpreter]: Reachable states at location L94-4 satisfy 78#(not (<= main_~j~0 main_~n~0)) [2019-10-13 22:59:57,853 WARN L191 SmtUtils]: Spent 192.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 56 [2019-10-13 22:59:58,045 WARN L191 SmtUtils]: Spent 159.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 50 [2019-10-13 22:59:58,250 WARN L191 SmtUtils]: Spent 166.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 56 [2019-10-13 22:59:58,552 WARN L191 SmtUtils]: Spent 258.00 ms on a formula simplification. DAG size of input: 90 DAG size of output: 69 [2019-10-13 22:59:58,688 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 4 imperfect interpolant sequences. [2019-10-13 22:59:58,688 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5, 10] total 19 [2019-10-13 22:59:58,689 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [287326227] [2019-10-13 22:59:58,697 INFO L442 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-10-13 22:59:58,698 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-13 22:59:58,698 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-10-13 22:59:58,699 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=276, Unknown=0, NotChecked=0, Total=342 [2019-10-13 22:59:58,699 INFO L87 Difference]: Start difference. First operand 16 states and 17 transitions. Second operand 19 states. [2019-10-13 22:59:58,878 WARN L191 SmtUtils]: Spent 102.00 ms on a formula simplification that was a NOOP. DAG size: 72 [2019-10-13 22:59:59,029 WARN L191 SmtUtils]: Spent 119.00 ms on a formula simplification that was a NOOP. DAG size: 85 [2019-10-13 22:59:59,317 WARN L191 SmtUtils]: Spent 248.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 87 [2019-10-13 22:59:59,650 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 22:59:59,650 INFO L93 Difference]: Finished difference Result 32 states and 37 transitions. [2019-10-13 22:59:59,651 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-10-13 22:59:59,651 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 12 [2019-10-13 22:59:59,652 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 22:59:59,653 INFO L225 Difference]: With dead ends: 32 [2019-10-13 22:59:59,653 INFO L226 Difference]: Without dead ends: 21 [2019-10-13 22:59:59,654 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 198 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=139, Invalid=617, Unknown=0, NotChecked=0, Total=756 [2019-10-13 22:59:59,655 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2019-10-13 22:59:59,660 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 19. [2019-10-13 22:59:59,660 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2019-10-13 22:59:59,661 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 20 transitions. [2019-10-13 22:59:59,661 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 20 transitions. Word has length 12 [2019-10-13 22:59:59,661 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 22:59:59,661 INFO L462 AbstractCegarLoop]: Abstraction has 19 states and 20 transitions. [2019-10-13 22:59:59,661 INFO L463 AbstractCegarLoop]: Interpolant automaton has 19 states. [2019-10-13 22:59:59,662 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 20 transitions. [2019-10-13 22:59:59,662 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-10-13 22:59:59,662 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 22:59:59,662 INFO L380 BasicCegarLoop]: trace histogram [4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 22:59:59,874 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-13 22:59:59,874 INFO L410 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 22:59:59,875 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 22:59:59,876 INFO L82 PathProgramCache]: Analyzing trace with hash -1514238960, now seen corresponding path program 2 times [2019-10-13 22:59:59,876 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-13 22:59:59,877 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [642294451] [2019-10-13 22:59:59,877 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 22:59:59,877 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 22:59:59,877 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 22:59:59,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 23:00:00,022 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-13 23:00:00,022 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [642294451] [2019-10-13 23:00:00,022 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [771465802] [2019-10-13 23:00:00,023 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 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 23:00:00,097 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2019-10-13 23:00:00,097 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-13 23:00:00,098 INFO L256 TraceCheckSpWp]: Trace formula consists of 113 conjuncts, 7 conjunts are in the unsatisfiable core [2019-10-13 23:00:00,101 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-13 23:00:00,177 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-13 23:00:00,178 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-10-13 23:00:00,225 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-13 23:00:00,226 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1602478745] [2019-10-13 23:00:00,227 INFO L162 IcfgInterpreter]: Started Sifa with 12 locations of interest [2019-10-13 23:00:00,228 INFO L169 IcfgInterpreter]: Building call graph [2019-10-13 23:00:00,229 INFO L174 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-10-13 23:00:00,229 INFO L179 IcfgInterpreter]: Starting interpretation [2019-10-13 23:00:00,229 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2019-10-13 23:00:00,461 INFO L199 IcfgInterpreter]: Interpreting procedure main with input of size 71 for LOIs [2019-10-13 23:00:00,688 INFO L199 IcfgInterpreter]: Interpreting procedure __VERIFIER_assert with input of size 6 for LOIs [2019-10-13 23:00:00,714 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.init with input of size 34 for LOIs [2019-10-13 23:00:00,755 INFO L183 IcfgInterpreter]: Interpretation finished [2019-10-13 23:00:00,755 INFO L191 IcfgInterpreter]: Final predicates for locations of interest are: [2019-10-13 23:00:00,756 INFO L193 IcfgInterpreter]: Reachable states at location L-1 satisfy 23#(and (= ((as const (Array Int Real)) 0.0) (select |#memory_real| |~#a~0.base|)) (= 0 |#NULL.base|) (<= 0 |~#x~0.offset|) (< |~#b~0.base| |#StackHeapBarrier|) (<= 0 |#NULL.base|) (not (= |~#x~0.base| 0)) (= 400 (select |#length| |~#x~0.base|)) (= (select |#valid| |~#b~0.base|) 1) (<= 0 |#NULL.offset|) (= 20000 (select |#length| |~#a~0.base|)) (not (= |~#b~0.base| 0)) (<= 0 |~#b~0.offset|) (= 0 |~#b~0.offset|) (not (= 0 |~#a~0.base|)) (= ((as const (Array Int Real)) 0.0) (select |#memory_real| |~#x~0.base|)) (= 400 (select |#length| |~#b~0.base|)) (<= |~#a~0.offset| 0) (< |~#a~0.base| |#StackHeapBarrier|) (= (select |#memory_real| |~#b~0.base|) ((as const (Array Int Real)) 0.0)) (<= |~#b~0.offset| 0) (= 1 (select |#valid| |~#a~0.base|)) (<= |#NULL.base| 0) (<= |~#x~0.offset| 0) (<= |#NULL.offset| 0) (< |~#x~0.base| |#StackHeapBarrier|) (<= 0 |~#a~0.offset|) (= 0 |~#a~0.offset|) (not (= |~#x~0.base| |~#b~0.base|)) (= 0 (select |#valid| 0)) (= 0 |~#x~0.offset|) (= |#NULL.offset| 0) (= 1 (select |#valid| |~#x~0.base|))) [2019-10-13 23:00:00,757 INFO L193 IcfgInterpreter]: Reachable states at location mainENTRY satisfy 33#(and (= 0 |#NULL.base|) (<= 0 |~#x~0.offset|) (= (select |old(#valid)| |~#x~0.base|) 1) (< |~#b~0.base| |#StackHeapBarrier|) (<= 0 |#NULL.base|) (not (= |~#x~0.base| 0)) (<= 0 |#NULL.offset|) (= ((as const (Array Int Real)) 0.0) (select |old(#memory_real)| |~#x~0.base|)) (not (= |~#b~0.base| 0)) (<= 0 |~#b~0.offset|) (= 0 |~#b~0.offset|) (not (= 0 |~#a~0.base|)) (= 400 (select |old(#length)| |~#x~0.base|)) (<= |~#a~0.offset| 0) (= (select |old(#length)| |~#b~0.base|) 400) (< |~#a~0.base| |#StackHeapBarrier|) (= |old(#length)| |#length|) (= (select |old(#valid)| |~#b~0.base|) 1) (= (select |old(#length)| |~#a~0.base|) 20000) (<= |~#b~0.offset| 0) (= ((as const (Array Int Real)) 0.0) (select |old(#memory_real)| |~#b~0.base|)) (= (select |old(#valid)| |~#a~0.base|) 1) (= |#memory_real| |old(#memory_real)|) (<= |#NULL.base| 0) (<= |~#x~0.offset| 0) (= 0 (select |old(#valid)| 0)) (<= |#NULL.offset| 0) (< |~#x~0.base| |#StackHeapBarrier|) (<= 0 |~#a~0.offset|) (= 0 |~#a~0.offset|) (= |#valid| |old(#valid)|) (not (= |~#x~0.base| |~#b~0.base|)) (= 0 |~#x~0.offset|) (= |#NULL.offset| 0) (= (select |old(#memory_real)| |~#a~0.base|) ((as const (Array Int Real)) 0.0))) [2019-10-13 23:00:00,757 INFO L193 IcfgInterpreter]: Reachable states at location L94-3 satisfy 73#true [2019-10-13 23:00:00,757 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initEXIT satisfy 107#(and (= (select (store (store (store |old(#valid)| 0 0) |~#a~0.base| 1) |~#b~0.base| 1) |~#x~0.base|) 0) (= 0 |#NULL.base|) (= (store (store (store |old(#memory_real)| |~#a~0.base| ((as const (Array Int Real)) 0.0)) |~#b~0.base| ((as const (Array Int Real)) 0.0)) |~#x~0.base| ((as const (Array Int Real)) 0.0)) |#memory_real|) (<= 0 |~#x~0.offset|) (< |~#b~0.base| |#StackHeapBarrier|) (<= 0 |#NULL.base|) (not (= |~#x~0.base| 0)) (= 0 (select (store (store |old(#valid)| 0 0) |~#a~0.base| 1) |~#b~0.base|)) (<= 0 |#NULL.offset|) (not (= |~#b~0.base| 0)) (<= 0 |~#b~0.offset|) (= 0 |~#b~0.offset|) (not (= 0 |~#a~0.base|)) (<= |~#a~0.offset| 0) (< |~#a~0.base| |#StackHeapBarrier|) (<= |~#b~0.offset| 0) (= |#length| (store (store (store |old(#length)| |~#a~0.base| 20000) |~#b~0.base| 400) |~#x~0.base| 400)) (<= |#NULL.base| 0) (= 0 (select (store |old(#valid)| 0 0) |~#a~0.base|)) (= |#valid| (store (store (store (store |old(#valid)| 0 0) |~#a~0.base| 1) |~#b~0.base| 1) |~#x~0.base| 1)) (<= |~#x~0.offset| 0) (<= |#NULL.offset| 0) (< |~#x~0.base| |#StackHeapBarrier|) (<= 0 |~#a~0.offset|) (= 0 |~#a~0.offset|) (= 0 |~#x~0.offset|) (= |#NULL.offset| 0)) [2019-10-13 23:00:00,758 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.startENTRY satisfy 6#true [2019-10-13 23:00:00,758 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initENTRY satisfy 102#(and (= |old(~#a~0.base)| |~#a~0.base|) (= |~#b~0.base| |old(~#b~0.base)|) (= |#memory_real| |old(#memory_real)|) (= |~#x~0.base| |old(~#x~0.base)|) (= |old(#NULL.base)| |#NULL.base|) (= |#valid| |old(#valid)|) (= |old(~#b~0.offset)| |~#b~0.offset|) (= |old(~#x~0.offset)| |~#x~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(~#a~0.offset)| |~#a~0.offset|) (= |old(#length)| |#length|)) [2019-10-13 23:00:00,758 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION satisfy 98#(and (or (and (= |__VERIFIER_assert_#in~cond| 0) (= 0 __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) (and (= |__VERIFIER_assert_#in~cond| 1) (= 0 __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond))) (<= __VERIFIER_assert_~cond 0) (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0) (<= 0 __VERIFIER_assert_~cond)) [2019-10-13 23:00:00,759 INFO L193 IcfgInterpreter]: Reachable states at location L91-3 satisfy 38#(and (<= 0 main_~i~0) (= 0 |#NULL.base|) (<= main_~n~0 5) (<= 0 |~#x~0.offset|) (= (select |old(#valid)| |~#x~0.base|) 1) (< |~#b~0.base| |#StackHeapBarrier|) (<= 0 |#NULL.base|) (not (= |~#x~0.base| 0)) (<= 5 main_~n~0) (<= 0 |#NULL.offset|) (= ((as const (Array Int Real)) 0.0) (select |old(#memory_real)| |~#x~0.base|)) (not (= |~#b~0.base| 0)) (= main_~eps~0 (/ 1.0 1000000.0)) (<= 0 |~#b~0.offset|) (= 0 |~#b~0.offset|) (not (= 0 |~#a~0.base|)) (= 400 (select |old(#length)| |~#x~0.base|)) (<= |~#a~0.offset| 0) (<= main_~eps~0 (/ 1.0 1000000.0)) (= (select |old(#length)| |~#b~0.base|) 400) (< |~#a~0.base| |#StackHeapBarrier|) (= |old(#length)| |#length|) (= main_~nmax~0 50) (= (select |old(#valid)| |~#b~0.base|) 1) (= (select |old(#length)| |~#a~0.base|) 20000) (<= |~#b~0.offset| 0) (<= 50 main_~nmax~0) (= ((as const (Array Int Real)) 0.0) (select |old(#memory_real)| |~#b~0.base|)) (= (select |old(#valid)| |~#a~0.base|) 1) (= |#memory_real| |old(#memory_real)|) (<= |#NULL.base| 0) (<= main_~nmax~0 50) (<= |~#x~0.offset| 0) (<= main_~i~0 0) (= 0 (select |old(#valid)| 0)) (<= |#NULL.offset| 0) (< |~#x~0.base| |#StackHeapBarrier|) (<= 0 |~#a~0.offset|) (= 0 |~#a~0.offset|) (<= (/ 1.0 1000000.0) main_~eps~0) (= |#valid| |old(#valid)|) (not (= |~#x~0.base| |~#b~0.base|)) (= 0 |~#x~0.offset|) (= |#NULL.offset| 0) (= main_~n~0 5) (= (select |old(#memory_real)| |~#a~0.base|) ((as const (Array Int Real)) 0.0)) (= main_~i~0 0)) [2019-10-13 23:00:00,759 INFO L193 IcfgInterpreter]: Reachable states at location L5 satisfy 93#(and (or (and (= |__VERIFIER_assert_#in~cond| 0) (= 0 __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) (and (= |__VERIFIER_assert_#in~cond| 1) (= 0 __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond))) (<= __VERIFIER_assert_~cond 0) (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0) (<= 0 __VERIFIER_assert_~cond)) [2019-10-13 23:00:00,759 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertENTRY satisfy 83#(and (or (and (<= 1 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 1)) (and (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0))) (or (= |__VERIFIER_assert_#in~cond| 1) (= |__VERIFIER_assert_#in~cond| 0))) [2019-10-13 23:00:00,759 INFO L193 IcfgInterpreter]: Reachable states at location L4 satisfy 88#(and (or (and (<= __VERIFIER_assert_~cond 0) (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0) (<= 0 __VERIFIER_assert_~cond)) (and (<= 1 __VERIFIER_assert_~cond) (<= 1 |__VERIFIER_assert_#in~cond|) (<= __VERIFIER_assert_~cond 1) (<= |__VERIFIER_assert_#in~cond| 1))) (or (and (= |__VERIFIER_assert_#in~cond| 0) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) (and (= |__VERIFIER_assert_#in~cond| 1) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)))) [2019-10-13 23:00:00,760 INFO L193 IcfgInterpreter]: Reachable states at location L94-4 satisfy 78#(not (<= main_~j~0 main_~n~0)) [2019-10-13 23:00:01,026 WARN L191 SmtUtils]: Spent 162.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 56 [2019-10-13 23:00:01,183 WARN L191 SmtUtils]: Spent 122.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 50 [2019-10-13 23:00:01,363 WARN L191 SmtUtils]: Spent 148.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 56 [2019-10-13 23:00:01,674 WARN L191 SmtUtils]: Spent 274.00 ms on a formula simplification. DAG size of input: 90 DAG size of output: 69 [2019-10-13 23:00:01,800 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 4 imperfect interpolant sequences. [2019-10-13 23:00:01,801 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8, 10] total 24 [2019-10-13 23:00:01,801 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [539076521] [2019-10-13 23:00:01,802 INFO L442 AbstractCegarLoop]: Interpolant automaton has 24 states [2019-10-13 23:00:01,802 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-13 23:00:01,802 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2019-10-13 23:00:01,803 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=116, Invalid=436, Unknown=0, NotChecked=0, Total=552 [2019-10-13 23:00:01,803 INFO L87 Difference]: Start difference. First operand 19 states and 20 transitions. Second operand 24 states. [2019-10-13 23:00:02,003 WARN L191 SmtUtils]: Spent 116.00 ms on a formula simplification that was a NOOP. DAG size: 72 [2019-10-13 23:00:02,181 WARN L191 SmtUtils]: Spent 125.00 ms on a formula simplification that was a NOOP. DAG size: 85 [2019-10-13 23:00:02,483 WARN L191 SmtUtils]: Spent 259.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 87 [2019-10-13 23:00:02,856 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 23:00:02,856 INFO L93 Difference]: Finished difference Result 37 states and 41 transitions. [2019-10-13 23:00:02,862 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-10-13 23:00:02,863 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 15 [2019-10-13 23:00:02,863 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 23:00:02,864 INFO L225 Difference]: With dead ends: 37 [2019-10-13 23:00:02,864 INFO L226 Difference]: Without dead ends: 23 [2019-10-13 23:00:02,865 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 26 SyntacticMatches, 4 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 354 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=186, Invalid=806, Unknown=0, NotChecked=0, Total=992 [2019-10-13 23:00:02,865 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2019-10-13 23:00:02,872 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 21. [2019-10-13 23:00:02,872 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2019-10-13 23:00:02,873 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 22 transitions. [2019-10-13 23:00:02,873 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 22 transitions. Word has length 15 [2019-10-13 23:00:02,874 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 23:00:02,874 INFO L462 AbstractCegarLoop]: Abstraction has 21 states and 22 transitions. [2019-10-13 23:00:02,874 INFO L463 AbstractCegarLoop]: Interpolant automaton has 24 states. [2019-10-13 23:00:02,874 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 22 transitions. [2019-10-13 23:00:02,875 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-10-13 23:00:02,876 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 23:00:02,876 INFO L380 BasicCegarLoop]: trace histogram [6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 23:00:03,080 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-13 23:00:03,081 INFO L410 AbstractCegarLoop]: === Iteration 4 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 23:00:03,081 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 23:00:03,082 INFO L82 PathProgramCache]: Analyzing trace with hash 225444816, now seen corresponding path program 3 times [2019-10-13 23:00:03,082 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-13 23:00:03,083 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [854665253] [2019-10-13 23:00:03,083 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 23:00:03,083 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 23:00:03,083 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 23:00:03,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-13 23:00:03,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-13 23:00:03,245 INFO L168 tionRefinementEngine]: Strategy SIFA_TAIPAN found a feasible trace [2019-10-13 23:00:03,245 INFO L445 BasicCegarLoop]: Counterexample might be feasible [2019-10-13 23:00:03,304 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 13.10 11:00:03 BoogieIcfgContainer [2019-10-13 23:00:03,304 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-10-13 23:00:03,306 INFO L168 Benchmark]: Toolchain (without parser) took 8795.09 ms. Allocated memory was 138.4 MB in the beginning and 312.0 MB in the end (delta: 173.5 MB). Free memory was 103.3 MB in the beginning and 124.9 MB in the end (delta: -21.6 MB). Peak memory consumption was 151.9 MB. Max. memory is 7.1 GB. [2019-10-13 23:00:03,307 INFO L168 Benchmark]: CDTParser took 0.20 ms. Allocated memory is still 138.4 MB. Free memory was 121.7 MB in the beginning and 121.5 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. [2019-10-13 23:00:03,308 INFO L168 Benchmark]: CACSL2BoogieTranslator took 456.69 ms. Allocated memory was 138.4 MB in the beginning and 201.9 MB in the end (delta: 63.4 MB). Free memory was 103.1 MB in the beginning and 178.9 MB in the end (delta: -75.8 MB). Peak memory consumption was 23.7 MB. Max. memory is 7.1 GB. [2019-10-13 23:00:03,309 INFO L168 Benchmark]: Boogie Preprocessor took 54.25 ms. Allocated memory is still 201.9 MB. Free memory was 178.9 MB in the beginning and 176.1 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 7.1 GB. [2019-10-13 23:00:03,309 INFO L168 Benchmark]: RCFGBuilder took 732.30 ms. Allocated memory is still 201.9 MB. Free memory was 176.1 MB in the beginning and 131.7 MB in the end (delta: 44.4 MB). Peak memory consumption was 44.4 MB. Max. memory is 7.1 GB. [2019-10-13 23:00:03,310 INFO L168 Benchmark]: TraceAbstraction took 7546.97 ms. Allocated memory was 201.9 MB in the beginning and 312.0 MB in the end (delta: 110.1 MB). Free memory was 131.0 MB in the beginning and 124.9 MB in the end (delta: 6.1 MB). Peak memory consumption was 116.2 MB. Max. memory is 7.1 GB. [2019-10-13 23:00:03,314 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.20 ms. Allocated memory is still 138.4 MB. Free memory was 121.7 MB in the beginning and 121.5 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 456.69 ms. Allocated memory was 138.4 MB in the beginning and 201.9 MB in the end (delta: 63.4 MB). Free memory was 103.1 MB in the beginning and 178.9 MB in the end (delta: -75.8 MB). Peak memory consumption was 23.7 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 54.25 ms. Allocated memory is still 201.9 MB. Free memory was 178.9 MB in the beginning and 176.1 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 7.1 GB. * RCFGBuilder took 732.30 ms. Allocated memory is still 201.9 MB. Free memory was 176.1 MB in the beginning and 131.7 MB in the end (delta: 44.4 MB). Peak memory consumption was 44.4 MB. Max. memory is 7.1 GB. * TraceAbstraction took 7546.97 ms. Allocated memory was 201.9 MB in the beginning and 312.0 MB in the end (delta: 110.1 MB). Free memory was 131.0 MB in the beginning and 124.9 MB in the end (delta: 6.1 MB). Peak memory consumption was 116.2 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - UnprovableResult [Line: 5]: Unable to prove that call of __VERIFIER_error() unreachable Unable to prove that call of __VERIFIER_error() unreachable Reason: overapproximation of to_real at line 96, overapproximation of someBinaryArithmeticDOUBLEoperation at line 97. Possible FailurePath: [L69] double a[50][50], b[50], x[50]; [L86] int i, j, nmax = 50, n = 5, chkerr; [L87] double eps, w; [L89] eps = 1.0e-6 [L91] i = 0 VAL [a={-1:0}, b={2:0}, eps=1/1000000, i=0, n=5, nmax=50, x={1:0}] [L91] COND TRUE i <= n [L93] w = 0.0 [L94] j = 0 VAL [a={-1:0}, b={2:0}, eps=1/1000000, i=0, j=0, n=5, nmax=50, w=0, x={1:0}] [L94] COND TRUE j <= n [L96] a[i][j] = (i + 1) + (j + 1) [L97] COND TRUE i == j [L97] EXPR a[i][j] [L97] a[i][j] *= 10.0 [L98] EXPR a[i][j] [L98] w += a[i][j] [L94] j++ VAL [a={-1:0}, a[i][j]=20014, b={2:0}, eps=1/1000000, i=0, j=1, n=5, nmax=50, x={1:0}] [L94] COND TRUE j <= n [L96] a[i][j] = (i + 1) + (j + 1) [L97] COND FALSE !(i == j) [L98] EXPR a[i][j] [L98] w += a[i][j] [L94] j++ VAL [a={-1:0}, a[i][j]=20014, b={2:0}, eps=1/1000000, i=0, j=2, n=5, nmax=50, x={1:0}] [L94] COND TRUE j <= n [L96] a[i][j] = (i + 1) + (j + 1) [L97] COND FALSE !(i == j) [L98] EXPR a[i][j] [L98] w += a[i][j] [L94] j++ VAL [a={-1:0}, a[i][j]=20014, b={2:0}, eps=1/1000000, i=0, j=3, n=5, nmax=50, x={1:0}] [L94] COND TRUE j <= n [L96] a[i][j] = (i + 1) + (j + 1) [L97] COND FALSE !(i == j) [L98] EXPR a[i][j] [L98] w += a[i][j] [L94] j++ VAL [a={-1:0}, a[i][j]=20014, b={2:0}, eps=1/1000000, i=0, j=4, n=5, nmax=50, x={1:0}] [L94] COND TRUE j <= n [L96] a[i][j] = (i + 1) + (j + 1) [L97] COND FALSE !(i == j) [L98] EXPR a[i][j] [L98] w += a[i][j] [L94] j++ VAL [a={-1:0}, a[i][j]=20014, b={2:0}, eps=1/1000000, i=0, j=5, n=5, nmax=50, x={1:0}] [L94] COND TRUE j <= n [L96] a[i][j] = (i + 1) + (j + 1) [L97] COND FALSE !(i == j) [L98] EXPR a[i][j] [L98] w += a[i][j] [L94] j++ VAL [a={-1:0}, a[i][j]=20014, b={2:0}, eps=1/1000000, i=0, j=6, n=5, nmax=50, x={1:0}] [L94] COND FALSE !(j <= n) VAL [a={-1:0}, a[i][j]=20014, b={2:0}, eps=1/1000000, i=0, j=6, n=5, nmax=50, x={1:0}] [L100] CALL __VERIFIER_assert(i==2) VAL [\old(cond)=0, a={-1:0}, b={2:0}, x={1:0}] [L4] COND TRUE !(cond) VAL [\old(cond)=0, a={-1:0}, b={2:0}, cond=0, x={1:0}] [L5] __VERIFIER_error() VAL [\old(cond)=0, a={-1:0}, b={2:0}, cond=0, x={1:0}] - StatisticsResult: Ultimate Automizer benchmark data CFG has 6 procedures, 39 locations, 1 error locations. Result: UNSAFE, OverallTime: 7.4s, OverallIterations: 4, TraceHistogramMax: 6, AutomataDifference: 2.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 64 SDtfs, 65 SDslu, 110 SDs, 0 SdLazy, 237 SolverSat, 42 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.4s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 113 GetRequests, 51 SyntacticMatches, 4 SemanticMatches, 58 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 552 ImplicationChecksByTransitivity, 3.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=39occurred in iteration=0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 3 MinimizatonAttempts, 4 StatesRemovedByMinimization, 2 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 0.5s InterpolantComputationTime, 82 NumberOfCodeBlocks, 82 NumberOfCodeBlocksAsserted, 8 NumberOfCheckSat, 85 ConstructedInterpolants, 0 QuantifiedInterpolants, 2547 SizeOfPredicates, 4 NumberOfNonLiveVariables, 214 ConjunctsInSsa, 11 ConjunctsInUnsatCore, 7 InterpolantComputations, 1 PerfectInterpolantSequences, 0/33 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, SIFA: OVERALL_TIME[ms]: 1500, ICFG_INTERPRETER_ENTERED_PROCEDURES: 8, DAG_INTERPRETER_EARLY_EXIT_QUERIES: 44, DAG_INTERPRETER_EARLY_EXITS: 0, TOOLS_POST_APPLICATIONS: 22, TOOLS_POST_TIME[ms]: 493, TOOLS_POST_CALL_APPLICATIONS: 10, TOOLS_POST_CALL_TIME[ms]: 39, TOOLS_POST_RETURN_APPLICATIONS: 4, TOOLS_POST_RETURN_TIME[ms]: 18, TOOLS_QUANTIFIERELIM_APPLICATIONS: 36, TOOLS_QUANTIFIERELIM_TIME[ms]: 522, TOOLS_QUANTIFIERELIM_MAX_TIME[ms]: 235, FLUID_QUERY_TIME[ms]: 5, FLUID_QUERIES: 50, FLUID_YES_ANSWERS: 0, DOMAIN_JOIN_APPLICATIONS: 38, DOMAIN_JOIN_TIME[ms]: 664, DOMAIN_ALPHA_APPLICATIONS: 0, DOMAIN_ALPHA_TIME[ms]: 0, DOMAIN_WIDEN_APPLICATIONS: 4, DOMAIN_WIDEN_TIME[ms]: 106, DOMAIN_ISSUBSETEQ_APPLICATIONS: 6, DOMAIN_ISSUBSETEQ_TIME[ms]: 48, DOMAIN_ISBOTTOM_APPLICATIONS: 2, DOMAIN_ISBOTTOM_TIME[ms]: 2, LOOP_SUMMARIZER_APPLICATIONS: 2, LOOP_SUMMARIZER_CACHE_MISSES: 2, LOOP_SUMMARIZER_OVERALL_TIME[ms]: 334, LOOP_SUMMARIZER_NEW_COMPUTATION_TIME[ms]: 334, LOOP_SUMMARIZER_FIXPOINT_ITERATIONS: 6, CALL_SUMMARIZER_APPLICATIONS: 4, CALL_SUMMARIZER_CACHE_MISSES: 2, CALL_SUMMARIZER_OVERALL_TIME[ms]: 414, CALL_SUMMARIZER_NEW_COMPUTATION_TIME[ms]: 414, PROCEDURE_GRAPH_BUILDER_TIME[ms]: 6, PATH_EXPR_TIME[ms]: 6, REGEX_TO_DAG_TIME[ms]: 4, DAG_COMPRESSION_TIME[ms]: 27, DAG_COMPRESSION_PROCESSED_NODES: 124, DAG_COMPRESSION_RETAINED_NODES: 86, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces Received shutdown request...