/usr/bin/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 -i ../../../trunk/examples/svcomp/verifythis/elimination_max_rec_onepoint.c -------------------------------------------------------------------------------- This is Ultimate 0.1.25-86f66a4 [2020-07-07 11:14:25,966 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-07-07 11:14:25,968 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-07-07 11:14:25,982 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-07-07 11:14:25,982 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-07-07 11:14:25,984 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-07-07 11:14:25,985 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-07-07 11:14:25,987 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-07-07 11:14:25,988 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-07-07 11:14:25,989 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-07-07 11:14:25,990 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-07-07 11:14:25,991 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-07-07 11:14:25,991 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-07-07 11:14:25,992 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-07-07 11:14:25,993 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-07-07 11:14:25,995 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-07-07 11:14:25,995 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-07-07 11:14:25,996 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-07-07 11:14:25,998 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-07-07 11:14:26,000 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-07-07 11:14:26,001 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-07-07 11:14:26,002 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-07-07 11:14:26,003 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-07-07 11:14:26,004 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-07-07 11:14:26,006 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-07-07 11:14:26,006 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-07-07 11:14:26,007 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-07-07 11:14:26,007 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-07-07 11:14:26,008 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-07-07 11:14:26,009 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-07-07 11:14:26,009 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-07-07 11:14:26,009 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-07-07 11:14:26,010 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-07-07 11:14:26,011 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-07-07 11:14:26,012 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-07-07 11:14:26,012 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-07-07 11:14:26,013 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-07-07 11:14:26,013 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-07-07 11:14:26,013 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-07-07 11:14:26,014 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-07-07 11:14:26,015 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-07-07 11:14:26,015 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 [2020-07-07 11:14:26,030 INFO L113 SettingsManager]: Loading preferences was successful [2020-07-07 11:14:26,030 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-07-07 11:14:26,031 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-07-07 11:14:26,032 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-07-07 11:14:26,032 INFO L138 SettingsManager]: * Use SBE=true [2020-07-07 11:14:26,032 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-07-07 11:14:26,032 INFO L138 SettingsManager]: * sizeof long=4 [2020-07-07 11:14:26,032 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-07-07 11:14:26,033 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-07-07 11:14:26,033 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-07-07 11:14:26,033 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-07-07 11:14:26,033 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-07-07 11:14:26,033 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-07-07 11:14:26,034 INFO L138 SettingsManager]: * sizeof long double=12 [2020-07-07 11:14:26,034 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-07-07 11:14:26,034 INFO L138 SettingsManager]: * Use constant arrays=true [2020-07-07 11:14:26,034 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-07-07 11:14:26,034 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-07-07 11:14:26,035 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-07-07 11:14:26,035 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-07-07 11:14:26,035 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-07-07 11:14:26,035 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-07-07 11:14:26,035 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-07-07 11:14:26,036 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-07-07 11:14:26,036 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-07-07 11:14:26,036 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-07-07 11:14:26,036 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-07 11:14:26,036 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-07-07 11:14:26,037 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-07-07 11:14:26,037 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2020-07-07 11:14:26,311 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2020-07-07 11:14:26,324 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-07-07 11:14:26,327 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-07-07 11:14:26,328 INFO L271 PluginConnector]: Initializing CDTParser... [2020-07-07 11:14:26,328 INFO L275 PluginConnector]: CDTParser initialized [2020-07-07 11:14:26,329 INFO L429 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/verifythis/elimination_max_rec_onepoint.c [2020-07-07 11:14:26,417 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c1be09255/c159c7dfe64648f8bc2c9bb79838ad5b/FLAGe777031b5 [2020-07-07 11:14:26,882 INFO L306 CDTParser]: Found 1 translation units. [2020-07-07 11:14:26,883 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/verifythis/elimination_max_rec_onepoint.c [2020-07-07 11:14:26,897 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c1be09255/c159c7dfe64648f8bc2c9bb79838ad5b/FLAGe777031b5 [2020-07-07 11:14:27,240 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c1be09255/c159c7dfe64648f8bc2c9bb79838ad5b [2020-07-07 11:14:27,249 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-07-07 11:14:27,251 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2020-07-07 11:14:27,253 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-07-07 11:14:27,253 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-07-07 11:14:27,257 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-07-07 11:14:27,258 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.07 11:14:27" (1/1) ... [2020-07-07 11:14:27,261 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4b0240cc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.07 11:14:27, skipping insertion in model container [2020-07-07 11:14:27,261 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.07 11:14:27" (1/1) ... [2020-07-07 11:14:27,267 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-07-07 11:14:27,284 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-07-07 11:14:27,486 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-07 11:14:27,501 INFO L203 MainTranslator]: Completed pre-run [2020-07-07 11:14:27,521 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-07 11:14:27,538 INFO L208 MainTranslator]: Completed translation [2020-07-07 11:14:27,539 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.07 11:14:27 WrapperNode [2020-07-07 11:14:27,539 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-07-07 11:14:27,540 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-07-07 11:14:27,540 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-07-07 11:14:27,540 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-07-07 11:14:27,634 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.07 11:14:27" (1/1) ... [2020-07-07 11:14:27,635 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.07 11:14:27" (1/1) ... [2020-07-07 11:14:27,644 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.07 11:14:27" (1/1) ... [2020-07-07 11:14:27,644 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.07 11:14:27" (1/1) ... [2020-07-07 11:14:27,653 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.07 11:14:27" (1/1) ... [2020-07-07 11:14:27,655 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.07 11:14:27" (1/1) ... [2020-07-07 11:14:27,657 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.07 11:14:27" (1/1) ... [2020-07-07 11:14:27,659 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-07-07 11:14:27,660 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-07-07 11:14:27,660 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-07-07 11:14:27,660 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-07-07 11:14:27,661 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.07 11:14:27" (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 [2020-07-07 11:14:27,724 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2020-07-07 11:14:27,724 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-07-07 11:14:27,724 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2020-07-07 11:14:27,724 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2020-07-07 11:14:27,724 INFO L138 BoogieDeclarations]: Found implementation of procedure check [2020-07-07 11:14:27,724 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2020-07-07 11:14:27,725 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.meminit [2020-07-07 11:14:27,725 INFO L130 BoogieDeclarations]: Found specification of procedure calloc [2020-07-07 11:14:27,725 INFO L130 BoogieDeclarations]: Found specification of procedure free [2020-07-07 11:14:27,725 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2020-07-07 11:14:27,725 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2020-07-07 11:14:27,725 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2020-07-07 11:14:27,726 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2020-07-07 11:14:27,726 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2020-07-07 11:14:27,726 INFO L130 BoogieDeclarations]: Found specification of procedure check [2020-07-07 11:14:27,726 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2020-07-07 11:14:27,726 INFO L130 BoogieDeclarations]: Found specification of procedure main [2020-07-07 11:14:27,727 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2020-07-07 11:14:27,727 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.meminit [2020-07-07 11:14:27,727 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-07-07 11:14:27,727 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2020-07-07 11:14:27,727 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-07-07 11:14:27,727 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2020-07-07 11:14:28,052 INFO L290 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-07-07 11:14:28,053 INFO L295 CfgBuilder]: Removed 0 assume(true) statements. [2020-07-07 11:14:28,057 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.07 11:14:28 BoogieIcfgContainer [2020-07-07 11:14:28,057 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-07-07 11:14:28,058 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-07-07 11:14:28,058 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-07-07 11:14:28,061 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-07-07 11:14:28,061 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.07 11:14:27" (1/3) ... [2020-07-07 11:14:28,062 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5eec59e8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.07 11:14:28, skipping insertion in model container [2020-07-07 11:14:28,062 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.07 11:14:27" (2/3) ... [2020-07-07 11:14:28,062 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5eec59e8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.07 11:14:28, skipping insertion in model container [2020-07-07 11:14:28,063 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.07 11:14:28" (3/3) ... [2020-07-07 11:14:28,064 INFO L109 eAbstractionObserver]: Analyzing ICFG elimination_max_rec_onepoint.c [2020-07-07 11:14:28,072 INFO L157 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2020-07-07 11:14:28,078 INFO L169 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2020-07-07 11:14:28,092 INFO L251 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2020-07-07 11:14:28,114 INFO L375 AbstractCegarLoop]: Interprodecural is true [2020-07-07 11:14:28,114 INFO L376 AbstractCegarLoop]: Hoare is true [2020-07-07 11:14:28,115 INFO L377 AbstractCegarLoop]: Compute interpolants for FPandBP [2020-07-07 11:14:28,115 INFO L378 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-07-07 11:14:28,115 INFO L379 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-07-07 11:14:28,115 INFO L380 AbstractCegarLoop]: Difference is false [2020-07-07 11:14:28,115 INFO L381 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-07-07 11:14:28,115 INFO L385 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-07-07 11:14:28,132 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states. [2020-07-07 11:14:28,137 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2020-07-07 11:14:28,137 INFO L414 BasicCegarLoop]: Found error trace [2020-07-07 11:14:28,138 INFO L422 BasicCegarLoop]: trace histogram [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] [2020-07-07 11:14:28,139 INFO L427 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-07 11:14:28,143 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-07 11:14:28,144 INFO L82 PathProgramCache]: Analyzing trace with hash -640327596, now seen corresponding path program 1 times [2020-07-07 11:14:28,153 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-07 11:14:28,153 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1434212956] [2020-07-07 11:14:28,154 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-07 11:14:28,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:14:28,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:14:28,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:14:28,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:14:28,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:14:28,379 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2020-07-07 11:14:28,379 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1434212956] [2020-07-07 11:14:28,380 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-07 11:14:28,381 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-07-07 11:14:28,382 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1425290676] [2020-07-07 11:14:28,386 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-07-07 11:14:28,386 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-07 11:14:28,396 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-07-07 11:14:28,397 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-07-07 11:14:28,398 INFO L87 Difference]: Start difference. First operand 45 states. Second operand 4 states. [2020-07-07 11:14:28,587 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-07 11:14:28,588 INFO L93 Difference]: Finished difference Result 83 states and 106 transitions. [2020-07-07 11:14:28,589 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-07-07 11:14:28,590 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 30 [2020-07-07 11:14:28,591 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-07 11:14:28,601 INFO L225 Difference]: With dead ends: 83 [2020-07-07 11:14:28,601 INFO L226 Difference]: Without dead ends: 40 [2020-07-07 11:14:28,606 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-07-07 11:14:28,626 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2020-07-07 11:14:28,653 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 40. [2020-07-07 11:14:28,655 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2020-07-07 11:14:28,657 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 46 transitions. [2020-07-07 11:14:28,659 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 46 transitions. Word has length 30 [2020-07-07 11:14:28,659 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-07 11:14:28,659 INFO L479 AbstractCegarLoop]: Abstraction has 40 states and 46 transitions. [2020-07-07 11:14:28,660 INFO L480 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-07-07 11:14:28,660 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 46 transitions. [2020-07-07 11:14:28,662 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2020-07-07 11:14:28,662 INFO L414 BasicCegarLoop]: Found error trace [2020-07-07 11:14:28,663 INFO L422 BasicCegarLoop]: trace histogram [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] [2020-07-07 11:14:28,663 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-07-07 11:14:28,663 INFO L427 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-07 11:14:28,664 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-07 11:14:28,664 INFO L82 PathProgramCache]: Analyzing trace with hash -1442541232, now seen corresponding path program 1 times [2020-07-07 11:14:28,664 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-07 11:14:28,665 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [73850861] [2020-07-07 11:14:28,665 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-07 11:14:28,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:14:28,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:14:28,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:14:28,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:14:28,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:14:28,907 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2020-07-07 11:14:28,908 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [73850861] [2020-07-07 11:14:28,908 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-07 11:14:28,909 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-07-07 11:14:28,909 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1494874029] [2020-07-07 11:14:28,912 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-07-07 11:14:28,912 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-07 11:14:28,913 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-07-07 11:14:28,913 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2020-07-07 11:14:28,913 INFO L87 Difference]: Start difference. First operand 40 states and 46 transitions. Second operand 8 states. [2020-07-07 11:14:29,381 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-07 11:14:29,381 INFO L93 Difference]: Finished difference Result 64 states and 77 transitions. [2020-07-07 11:14:29,382 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-07-07 11:14:29,382 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 30 [2020-07-07 11:14:29,382 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-07 11:14:29,386 INFO L225 Difference]: With dead ends: 64 [2020-07-07 11:14:29,386 INFO L226 Difference]: Without dead ends: 62 [2020-07-07 11:14:29,387 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=52, Invalid=130, Unknown=0, NotChecked=0, Total=182 [2020-07-07 11:14:29,388 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2020-07-07 11:14:29,404 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 57. [2020-07-07 11:14:29,404 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 57 states. [2020-07-07 11:14:29,407 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 68 transitions. [2020-07-07 11:14:29,407 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 68 transitions. Word has length 30 [2020-07-07 11:14:29,408 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-07 11:14:29,408 INFO L479 AbstractCegarLoop]: Abstraction has 57 states and 68 transitions. [2020-07-07 11:14:29,408 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-07-07 11:14:29,408 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 68 transitions. [2020-07-07 11:14:29,409 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2020-07-07 11:14:29,409 INFO L414 BasicCegarLoop]: Found error trace [2020-07-07 11:14:29,410 INFO L422 BasicCegarLoop]: trace histogram [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] [2020-07-07 11:14:29,410 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-07-07 11:14:29,410 INFO L427 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-07 11:14:29,410 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-07 11:14:29,411 INFO L82 PathProgramCache]: Analyzing trace with hash 389656800, now seen corresponding path program 1 times [2020-07-07 11:14:29,411 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-07 11:14:29,411 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [305957346] [2020-07-07 11:14:29,412 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-07 11:14:29,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:14:29,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:14:29,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:14:29,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:14:29,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:14:29,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:14:29,609 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2020-07-07 11:14:29,610 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [305957346] [2020-07-07 11:14:29,610 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-07 11:14:29,611 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-07-07 11:14:29,611 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1373327480] [2020-07-07 11:14:29,612 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-07-07 11:14:29,612 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-07 11:14:29,612 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-07-07 11:14:29,612 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2020-07-07 11:14:29,613 INFO L87 Difference]: Start difference. First operand 57 states and 68 transitions. Second operand 10 states. [2020-07-07 11:14:29,992 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-07 11:14:29,992 INFO L93 Difference]: Finished difference Result 63 states and 73 transitions. [2020-07-07 11:14:29,993 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-07-07 11:14:29,993 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 33 [2020-07-07 11:14:29,993 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-07 11:14:29,995 INFO L225 Difference]: With dead ends: 63 [2020-07-07 11:14:29,995 INFO L226 Difference]: Without dead ends: 55 [2020-07-07 11:14:29,996 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=56, Invalid=216, Unknown=0, NotChecked=0, Total=272 [2020-07-07 11:14:29,996 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2020-07-07 11:14:30,007 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 55. [2020-07-07 11:14:30,007 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55 states. [2020-07-07 11:14:30,009 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 65 transitions. [2020-07-07 11:14:30,009 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 65 transitions. Word has length 33 [2020-07-07 11:14:30,010 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-07 11:14:30,010 INFO L479 AbstractCegarLoop]: Abstraction has 55 states and 65 transitions. [2020-07-07 11:14:30,010 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-07-07 11:14:30,010 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 65 transitions. [2020-07-07 11:14:30,012 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2020-07-07 11:14:30,012 INFO L414 BasicCegarLoop]: Found error trace [2020-07-07 11:14:30,012 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 3, 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] [2020-07-07 11:14:30,013 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-07-07 11:14:30,013 INFO L427 AbstractCegarLoop]: === Iteration 4 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-07 11:14:30,013 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-07 11:14:30,013 INFO L82 PathProgramCache]: Analyzing trace with hash 1379492317, now seen corresponding path program 1 times [2020-07-07 11:14:30,014 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-07 11:14:30,014 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1291302285] [2020-07-07 11:14:30,014 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-07 11:14:30,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:14:30,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:14:30,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:14:30,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:14:30,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:14:30,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:14:30,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:14:30,215 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 2 proven. 3 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2020-07-07 11:14:30,215 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1291302285] [2020-07-07 11:14:30,216 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [160815206] [2020-07-07 11:14:30,216 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 [2020-07-07 11:14:30,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:14:30,285 INFO L264 TraceCheckSpWp]: Trace formula consists of 173 conjuncts, 16 conjunts are in the unsatisfiable core [2020-07-07 11:14:30,294 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-07 11:14:30,374 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-07 11:14:30,375 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-07 11:14:30,380 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-07 11:14:30,412 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2020-07-07 11:14:30,412 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2020-07-07 11:14:30,413 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [10] total 14 [2020-07-07 11:14:30,413 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [766389859] [2020-07-07 11:14:30,414 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-07-07 11:14:30,414 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-07 11:14:30,414 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-07-07 11:14:30,415 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=151, Unknown=0, NotChecked=0, Total=182 [2020-07-07 11:14:30,415 INFO L87 Difference]: Start difference. First operand 55 states and 65 transitions. Second operand 8 states. [2020-07-07 11:14:30,607 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-07 11:14:30,607 INFO L93 Difference]: Finished difference Result 66 states and 76 transitions. [2020-07-07 11:14:30,608 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-07-07 11:14:30,608 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 45 [2020-07-07 11:14:30,609 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-07 11:14:30,610 INFO L225 Difference]: With dead ends: 66 [2020-07-07 11:14:30,610 INFO L226 Difference]: Without dead ends: 64 [2020-07-07 11:14:30,611 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 53 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=55, Invalid=251, Unknown=0, NotChecked=0, Total=306 [2020-07-07 11:14:30,611 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2020-07-07 11:14:30,619 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 42. [2020-07-07 11:14:30,619 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2020-07-07 11:14:30,620 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 46 transitions. [2020-07-07 11:14:30,620 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 46 transitions. Word has length 45 [2020-07-07 11:14:30,621 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-07 11:14:30,621 INFO L479 AbstractCegarLoop]: Abstraction has 42 states and 46 transitions. [2020-07-07 11:14:30,621 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-07-07 11:14:30,621 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 46 transitions. [2020-07-07 11:14:30,622 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2020-07-07 11:14:30,622 INFO L414 BasicCegarLoop]: Found error trace [2020-07-07 11:14:30,623 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 3, 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] [2020-07-07 11:14:30,836 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-07 11:14:30,837 INFO L427 AbstractCegarLoop]: === Iteration 5 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-07 11:14:30,838 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-07 11:14:30,838 INFO L82 PathProgramCache]: Analyzing trace with hash -1445821128, now seen corresponding path program 1 times [2020-07-07 11:14:30,838 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-07 11:14:30,839 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [4699540] [2020-07-07 11:14:30,839 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-07 11:14:30,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:14:30,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:14:30,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:14:30,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:14:30,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:14:30,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:14:30,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:14:30,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:14:30,992 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2020-07-07 11:14:30,993 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [4699540] [2020-07-07 11:14:30,993 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2061194788] [2020-07-07 11:14:30,993 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 [2020-07-07 11:14:31,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:14:31,047 INFO L264 TraceCheckSpWp]: Trace formula consists of 186 conjuncts, 12 conjunts are in the unsatisfiable core [2020-07-07 11:14:31,050 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-07 11:14:31,089 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 6 [2020-07-07 11:14:31,090 INFO L544 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-07-07 11:14:31,093 INFO L624 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-07-07 11:14:31,094 INFO L544 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-07-07 11:14:31,094 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:7, output treesize:6 [2020-07-07 11:14:33,124 WARN L860 $PredicateComparison]: unable to prove that (exists ((v_check_~a.base_BEFORE_CALL_1 Int)) (= ((as const (Array Int Int)) 0) (select |c_#memory_int| v_check_~a.base_BEFORE_CALL_1))) is different from true [2020-07-07 11:14:35,163 WARN L860 $PredicateComparison]: unable to prove that (exists ((v_check_~a.base_BEFORE_CALL_2 Int)) (= ((as const (Array Int Int)) 0) (select |c_#memory_int| v_check_~a.base_BEFORE_CALL_2))) is different from true [2020-07-07 11:14:35,210 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 23 [2020-07-07 11:14:35,211 INFO L544 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-07-07 11:14:35,224 INFO L624 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-07-07 11:14:35,226 INFO L544 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2020-07-07 11:14:35,226 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:29, output treesize:21 [2020-07-07 11:14:35,268 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2020-07-07 11:14:35,268 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2020-07-07 11:14:35,268 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [10] total 14 [2020-07-07 11:14:35,269 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1157728733] [2020-07-07 11:14:35,269 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-07-07 11:14:35,269 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-07 11:14:35,270 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-07-07 11:14:35,270 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=111, Unknown=2, NotChecked=42, Total=182 [2020-07-07 11:14:35,270 INFO L87 Difference]: Start difference. First operand 42 states and 46 transitions. Second operand 10 states. [2020-07-07 11:14:35,386 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-07 11:14:35,386 INFO L93 Difference]: Finished difference Result 74 states and 80 transitions. [2020-07-07 11:14:35,388 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-07-07 11:14:35,388 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 48 [2020-07-07 11:14:35,389 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-07 11:14:35,389 INFO L225 Difference]: With dead ends: 74 [2020-07-07 11:14:35,389 INFO L226 Difference]: Without dead ends: 48 [2020-07-07 11:14:35,393 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 55 SyntacticMatches, 2 SemanticMatches, 15 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 4.2s TimeCoverageRelationStatistics Valid=41, Invalid=175, Unknown=2, NotChecked=54, Total=272 [2020-07-07 11:14:35,393 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2020-07-07 11:14:35,402 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 46. [2020-07-07 11:14:35,403 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46 states. [2020-07-07 11:14:35,405 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 48 transitions. [2020-07-07 11:14:35,405 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 48 transitions. Word has length 48 [2020-07-07 11:14:35,406 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-07 11:14:35,406 INFO L479 AbstractCegarLoop]: Abstraction has 46 states and 48 transitions. [2020-07-07 11:14:35,406 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-07-07 11:14:35,406 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 48 transitions. [2020-07-07 11:14:35,409 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2020-07-07 11:14:35,409 INFO L414 BasicCegarLoop]: Found error trace [2020-07-07 11:14:35,409 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 3, 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] [2020-07-07 11:14:35,610 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-07 11:14:35,611 INFO L427 AbstractCegarLoop]: === Iteration 6 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-07 11:14:35,611 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-07 11:14:35,611 INFO L82 PathProgramCache]: Analyzing trace with hash -2146885706, now seen corresponding path program 1 times [2020-07-07 11:14:35,612 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-07 11:14:35,612 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1804975790] [2020-07-07 11:14:35,613 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-07 11:14:35,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:14:35,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:14:35,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:14:35,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:14:35,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:14:35,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:14:35,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:14:35,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:14:35,850 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2020-07-07 11:14:35,850 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1804975790] [2020-07-07 11:14:35,851 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1035525623] [2020-07-07 11:14:35,851 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-07 11:14:35,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:14:35,906 INFO L264 TraceCheckSpWp]: Trace formula consists of 186 conjuncts, 14 conjunts are in the unsatisfiable core [2020-07-07 11:14:35,920 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-07 11:14:35,927 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 6 [2020-07-07 11:14:35,928 INFO L544 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-07-07 11:14:35,931 INFO L624 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-07-07 11:14:35,931 INFO L544 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-07-07 11:14:35,932 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:7, output treesize:6 [2020-07-07 11:14:37,951 WARN L860 $PredicateComparison]: unable to prove that (exists ((v_check_~a.base_BEFORE_CALL_3 Int)) (= ((as const (Array Int Int)) 0) (select |c_#memory_int| v_check_~a.base_BEFORE_CALL_3))) is different from true [2020-07-07 11:14:39,973 WARN L860 $PredicateComparison]: unable to prove that (exists ((v_check_~a.base_BEFORE_CALL_4 Int)) (= ((as const (Array Int Int)) 0) (select |c_#memory_int| v_check_~a.base_BEFORE_CALL_4))) is different from true [2020-07-07 11:14:41,993 WARN L860 $PredicateComparison]: unable to prove that (exists ((v_check_~a.base_BEFORE_CALL_5 Int)) (= ((as const (Array Int Int)) 0) (select |c_#memory_int| v_check_~a.base_BEFORE_CALL_5))) is different from true [2020-07-07 11:14:42,022 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 23 [2020-07-07 11:14:42,023 INFO L544 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-07-07 11:14:42,027 INFO L624 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-07-07 11:14:42,029 INFO L544 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2020-07-07 11:14:42,029 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:29, output treesize:21 [2020-07-07 11:14:42,052 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-07 11:14:42,100 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 4 not checked. [2020-07-07 11:14:42,101 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-07-07 11:14:42,101 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 13] total 18 [2020-07-07 11:14:42,101 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [788449154] [2020-07-07 11:14:42,102 INFO L459 AbstractCegarLoop]: Interpolant automaton has 18 states [2020-07-07 11:14:42,102 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-07 11:14:42,102 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2020-07-07 11:14:42,103 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=183, Unknown=3, NotChecked=84, Total=306 [2020-07-07 11:14:42,103 INFO L87 Difference]: Start difference. First operand 46 states and 48 transitions. Second operand 18 states. [2020-07-07 11:14:46,440 WARN L193 SmtUtils]: Spent 2.02 s on a formula simplification that was a NOOP. DAG size: 19 [2020-07-07 11:14:48,481 WARN L193 SmtUtils]: Spent 2.01 s on a formula simplification that was a NOOP. DAG size: 22 [2020-07-07 11:14:56,808 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-07 11:14:56,808 INFO L93 Difference]: Finished difference Result 48 states and 50 transitions. [2020-07-07 11:14:56,808 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2020-07-07 11:14:56,809 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 48 [2020-07-07 11:14:56,809 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-07 11:14:56,810 INFO L225 Difference]: With dead ends: 48 [2020-07-07 11:14:56,810 INFO L226 Difference]: Without dead ends: 0 [2020-07-07 11:14:56,811 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 84 GetRequests, 53 SyntacticMatches, 5 SemanticMatches, 26 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 67 ImplicationChecksByTransitivity, 20.5s TimeCoverageRelationStatistics Valid=105, Invalid=500, Unknown=7, NotChecked=144, Total=756 [2020-07-07 11:14:56,813 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2020-07-07 11:14:56,813 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2020-07-07 11:14:56,814 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2020-07-07 11:14:56,814 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2020-07-07 11:14:56,814 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 48 [2020-07-07 11:14:56,814 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-07 11:14:56,814 INFO L479 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-07-07 11:14:56,814 INFO L480 AbstractCegarLoop]: Interpolant automaton has 18 states. [2020-07-07 11:14:56,815 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2020-07-07 11:14:56,815 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-07 11:14:57,024 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-07 11:14:57,029 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2020-07-07 11:14:57,389 WARN L193 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 46 DAG size of output: 36 [2020-07-07 11:14:57,647 INFO L268 CegarLoopResult]: For program point ULTIMATE.initFINAL(line -1) no Hoare annotation was computed. [2020-07-07 11:14:57,648 INFO L264 CegarLoopResult]: At program point ULTIMATE.initENTRY(line -1) the Hoare annotation is: (and (= |#valid| |old(#valid)|) (= |old(#NULL.base)| |#NULL.base|) (= |#NULL.offset| |old(#NULL.offset)|)) [2020-07-07 11:14:57,648 INFO L268 CegarLoopResult]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2020-07-07 11:14:57,648 INFO L268 CegarLoopResult]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2020-07-07 11:14:57,648 INFO L271 CegarLoopResult]: At program point L-1(line -1) the Hoare annotation is: true [2020-07-07 11:14:57,648 INFO L271 CegarLoopResult]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2020-07-07 11:14:57,648 INFO L268 CegarLoopResult]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2020-07-07 11:14:57,648 INFO L271 CegarLoopResult]: At program point assume_abort_if_notENTRY(lines 5 7) the Hoare annotation is: true [2020-07-07 11:14:57,649 INFO L268 CegarLoopResult]: For program point L6(line 6) no Hoare annotation was computed. [2020-07-07 11:14:57,649 INFO L268 CegarLoopResult]: For program point L6-2(lines 5 7) no Hoare annotation was computed. [2020-07-07 11:14:57,649 INFO L268 CegarLoopResult]: For program point assume_abort_if_notEXIT(lines 5 7) no Hoare annotation was computed. [2020-07-07 11:14:57,649 INFO L264 CegarLoopResult]: At program point mainENTRY(lines 38 52) the Hoare annotation is: (and (= |#valid| |old(#valid)|) (= |#memory_int| |old(#memory_int)|)) [2020-07-07 11:14:57,649 INFO L268 CegarLoopResult]: For program point mainEXIT(lines 38 52) no Hoare annotation was computed. [2020-07-07 11:14:57,649 INFO L264 CegarLoopResult]: At program point L48(line 48) the Hoare annotation is: (let ((.cse0 ((as const (Array Int Int)) 0))) (and (= .cse0 (select |#memory_int| |main_#t~malloc10.base|)) (= 0 main_~ai~1) (= 0 main_~ax~1) (= .cse0 (select |#memory_int| main_~a~0.base)))) [2020-07-07 11:14:57,650 INFO L268 CegarLoopResult]: For program point L48-1(line 48) no Hoare annotation was computed. [2020-07-07 11:14:57,650 INFO L264 CegarLoopResult]: At program point L45(line 45) the Hoare annotation is: (let ((.cse0 ((as const (Array Int Int)) 0))) (and (= .cse0 (select |#memory_int| |main_#t~malloc10.base|)) (= .cse0 (select |#memory_int| main_~a~0.base)))) [2020-07-07 11:14:57,650 INFO L268 CegarLoopResult]: For program point mainFINAL(lines 38 52) no Hoare annotation was computed. [2020-07-07 11:14:57,650 INFO L264 CegarLoopResult]: At program point L44(line 44) the Hoare annotation is: (= |#memory_int| |old(#memory_int)|) [2020-07-07 11:14:57,650 INFO L268 CegarLoopResult]: For program point L45-1(line 45) no Hoare annotation was computed. [2020-07-07 11:14:57,650 INFO L264 CegarLoopResult]: At program point L43(line 43) the Hoare annotation is: (and (= |#valid| |old(#valid)|) (= |#memory_int| |old(#memory_int)|)) [2020-07-07 11:14:57,650 INFO L268 CegarLoopResult]: For program point L44-1(line 44) no Hoare annotation was computed. [2020-07-07 11:14:57,651 INFO L268 CegarLoopResult]: For program point L43-1(line 43) no Hoare annotation was computed. [2020-07-07 11:14:57,651 INFO L264 CegarLoopResult]: At program point L40(line 40) the Hoare annotation is: (and (= |#valid| |old(#valid)|) (= |#memory_int| |old(#memory_int)|)) [2020-07-07 11:14:57,651 INFO L268 CegarLoopResult]: For program point L40-1(line 40) no Hoare annotation was computed. [2020-07-07 11:14:57,651 INFO L264 CegarLoopResult]: At program point L33(line 33) the Hoare annotation is: (let ((.cse1 (= 0 |check_#in~x|)) (.cse2 ((as const (Array Int Int)) 0))) (or (and (= 0 check_~ax~0) (let ((.cse0 (<= (+ check_~y 1) check_~n))) (or (and .cse0 (<= 1 check_~x)) (and (<= 0 check_~x) .cse0 .cse1))) (= 0 check_~ai~0) (= .cse2 (select |#memory_int| check_~a.base))) (let ((.cse3 (not (<= (+ |check_#in~y| 1) |check_#in~n|)))) (and (or (not (<= 1 |check_#in~x|)) .cse3) (or .cse3 (not .cse1)))) (not (= .cse2 (select |#memory_int| |check_#in~a.base|))))) [2020-07-07 11:14:57,651 INFO L268 CegarLoopResult]: For program point L33-1(line 33) no Hoare annotation was computed. [2020-07-07 11:14:57,651 INFO L271 CegarLoopResult]: At program point checkENTRY(lines 14 36) the Hoare annotation is: true [2020-07-07 11:14:57,652 INFO L268 CegarLoopResult]: For program point L27(line 27) no Hoare annotation was computed. [2020-07-07 11:14:57,652 INFO L268 CegarLoopResult]: For program point L24(lines 24 25) no Hoare annotation was computed. [2020-07-07 11:14:57,652 INFO L264 CegarLoopResult]: At program point L24-2(lines 24 25) the Hoare annotation is: (let ((.cse1 (= 0 |check_#in~x|)) (.cse2 ((as const (Array Int Int)) 0))) (or (let ((.cse0 (not (<= (+ |check_#in~y| 1) |check_#in~n|)))) (and (or (not (<= 1 |check_#in~x|)) .cse0) (or .cse0 (not .cse1)))) (not (= .cse2 (select |#memory_int| |check_#in~a.base|))) (and (let ((.cse3 (<= (+ check_~y 1) check_~n))) (or (and .cse3 (<= 1 check_~x)) (and (<= 0 check_~x) .cse3 .cse1))) (= .cse2 (select |#memory_int| check_~a.base))))) [2020-07-07 11:14:57,652 INFO L268 CegarLoopResult]: For program point L19(line 19) no Hoare annotation was computed. [2020-07-07 11:14:57,652 INFO L268 CegarLoopResult]: For program point checkEXIT(lines 14 36) no Hoare annotation was computed. [2020-07-07 11:14:57,652 INFO L264 CegarLoopResult]: At program point L18(line 18) the Hoare annotation is: (let ((.cse0 (<= 1 |check_#in~x|)) (.cse2 (= 0 |check_#in~x|)) (.cse3 ((as const (Array Int Int)) 0))) (or (let ((.cse1 (not (<= (+ |check_#in~y| 1) |check_#in~n|)))) (and (or (not .cse0) .cse1) (or .cse1 (not .cse2)))) (not (= .cse3 (select |#memory_int| |check_#in~a.base|))) (and (let ((.cse4 (<= (+ check_~y 1) check_~n))) (or (and .cse0 .cse4 (<= 1 check_~x)) (and (= 0 check_~x) .cse4 .cse2))) (= .cse3 (select |#memory_int| check_~a.base))))) [2020-07-07 11:14:57,653 INFO L264 CegarLoopResult]: At program point L18-1(line 18) the Hoare annotation is: (let ((.cse0 (<= 1 |check_#in~x|)) (.cse2 (= 0 |check_#in~x|)) (.cse3 ((as const (Array Int Int)) 0))) (or (let ((.cse1 (not (<= (+ |check_#in~y| 1) |check_#in~n|)))) (and (or (not .cse0) .cse1) (or .cse1 (not .cse2)))) (not (= .cse3 (select |#memory_int| |check_#in~a.base|))) (and (let ((.cse4 (<= (+ check_~y 1) check_~n))) (or (and .cse0 .cse4 (<= 1 check_~x)) (and (= 0 check_~x) .cse4 .cse2))) (= .cse3 (select |#memory_int| check_~a.base))))) [2020-07-07 11:14:57,653 INFO L268 CegarLoopResult]: For program point L15(line 15) no Hoare annotation was computed. [2020-07-07 11:14:57,653 INFO L268 CegarLoopResult]: For program point checkFINAL(lines 14 36) no Hoare annotation was computed. [2020-07-07 11:14:57,653 INFO L271 CegarLoopResult]: At program point __VERIFIER_assertENTRY(lines 8 10) the Hoare annotation is: true [2020-07-07 11:14:57,653 INFO L268 CegarLoopResult]: For program point __VERIFIER_assertEXIT(lines 8 10) no Hoare annotation was computed. [2020-07-07 11:14:57,653 INFO L268 CegarLoopResult]: For program point L9(line 9) no Hoare annotation was computed. [2020-07-07 11:14:57,654 INFO L268 CegarLoopResult]: For program point L9-1(line 9) no Hoare annotation was computed. [2020-07-07 11:14:57,654 INFO L268 CegarLoopResult]: For program point L9-3(lines 8 10) no Hoare annotation was computed. [2020-07-07 11:14:57,654 INFO L268 CegarLoopResult]: For program point __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION(line 9) no Hoare annotation was computed. [2020-07-07 11:14:57,654 INFO L264 CegarLoopResult]: At program point #Ultimate.meminitENTRY(line -1) the Hoare annotation is: (= |#memory_int| |old(#memory_int)|) [2020-07-07 11:14:57,654 INFO L268 CegarLoopResult]: For program point #Ultimate.meminitEXIT(line -1) no Hoare annotation was computed. [2020-07-07 11:14:57,654 INFO L268 CegarLoopResult]: For program point #Ultimate.meminitFINAL(line -1) no Hoare annotation was computed. [2020-07-07 11:14:57,661 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.07 11:14:57 BoogieIcfgContainer [2020-07-07 11:14:57,661 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-07-07 11:14:57,663 INFO L168 Benchmark]: Toolchain (without parser) took 30412.03 ms. Allocated memory was 137.4 MB in the beginning and 278.4 MB in the end (delta: 141.0 MB). Free memory was 100.4 MB in the beginning and 136.3 MB in the end (delta: -35.9 MB). Peak memory consumption was 105.1 MB. Max. memory is 7.1 GB. [2020-07-07 11:14:57,663 INFO L168 Benchmark]: CDTParser took 0.21 ms. Allocated memory is still 137.4 MB. Free memory is still 118.8 MB. There was no memory consumed. Max. memory is 7.1 GB. [2020-07-07 11:14:57,664 INFO L168 Benchmark]: CACSL2BoogieTranslator took 286.86 ms. Allocated memory is still 137.4 MB. Free memory was 100.0 MB in the beginning and 89.5 MB in the end (delta: 10.5 MB). Peak memory consumption was 10.5 MB. Max. memory is 7.1 GB. [2020-07-07 11:14:57,665 INFO L168 Benchmark]: Boogie Preprocessor took 119.64 ms. Allocated memory was 137.4 MB in the beginning and 200.8 MB in the end (delta: 63.4 MB). Free memory was 89.5 MB in the beginning and 178.2 MB in the end (delta: -88.7 MB). Peak memory consumption was 14.1 MB. Max. memory is 7.1 GB. [2020-07-07 11:14:57,665 INFO L168 Benchmark]: RCFGBuilder took 397.30 ms. Allocated memory is still 200.8 MB. Free memory was 178.2 MB in the beginning and 159.1 MB in the end (delta: 19.1 MB). Peak memory consumption was 19.1 MB. Max. memory is 7.1 GB. [2020-07-07 11:14:57,666 INFO L168 Benchmark]: TraceAbstraction took 29603.07 ms. Allocated memory was 200.8 MB in the beginning and 278.4 MB in the end (delta: 77.6 MB). Free memory was 158.2 MB in the beginning and 136.3 MB in the end (delta: 21.9 MB). Peak memory consumption was 99.5 MB. Max. memory is 7.1 GB. [2020-07-07 11:14:57,675 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.21 ms. Allocated memory is still 137.4 MB. Free memory is still 118.8 MB. There was no memory consumed. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 286.86 ms. Allocated memory is still 137.4 MB. Free memory was 100.0 MB in the beginning and 89.5 MB in the end (delta: 10.5 MB). Peak memory consumption was 10.5 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 119.64 ms. Allocated memory was 137.4 MB in the beginning and 200.8 MB in the end (delta: 63.4 MB). Free memory was 89.5 MB in the beginning and 178.2 MB in the end (delta: -88.7 MB). Peak memory consumption was 14.1 MB. Max. memory is 7.1 GB. * RCFGBuilder took 397.30 ms. Allocated memory is still 200.8 MB. Free memory was 178.2 MB in the beginning and 159.1 MB in the end (delta: 19.1 MB). Peak memory consumption was 19.1 MB. Max. memory is 7.1 GB. * TraceAbstraction took 29603.07 ms. Allocated memory was 200.8 MB in the beginning and 278.4 MB in the end (delta: 77.6 MB). Free memory was 158.2 MB in the beginning and 136.3 MB in the end (delta: 21.9 MB). Peak memory consumption was 99.5 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 9]: 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 - StatisticsResult: Ultimate Automizer benchmark data CFG has 7 procedures, 45 locations, 1 error locations. Started 1 CEGAR loops. VerificationResult: SAFE, OverallTime: 28.9s, OverallIterations: 6, TraceHistogramMax: 3, AutomataDifference: 16.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.6s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 212 SDtfs, 269 SDslu, 500 SDs, 0 SdLazy, 1090 SolverSat, 227 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 285 GetRequests, 191 SyntacticMatches, 7 SemanticMatches, 87 ConstructedPredicates, 5 IntricatePredicates, 0 DeprecatedPredicates, 110 ImplicationChecksByTransitivity, 25.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=57occurred in iteration=2, 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, 6 MinimizatonAttempts, 29 StatesRemovedByMinimization, 3 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 17 LocationsWithAnnotation, 50 PreInvPairs, 60 NumberOfFragments, 326 HoareAnnotationTreeSize, 50 FomulaSimplifications, 382 FormulaSimplificationTreeSizeReduction, 0.1s HoareSimplificationTime, 17 FomulaSimplificationsInter, 525 FormulaSimplificationTreeSizeReductionInter, 0.4s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 11.5s InterpolantComputationTime, 375 NumberOfCodeBlocks, 375 NumberOfCodeBlocksAsserted, 9 NumberOfCheckSat, 366 ConstructedInterpolants, 22 QuantifiedInterpolants, 49170 SizeOfPredicates, 24 NumberOfNonLiveVariables, 545 ConjunctsInSsa, 42 ConjunctsInUnsatCore, 9 InterpolantComputations, 5 PerfectInterpolantSequences, 99/110 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...