./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/ldv-memsafety/ArraysOfVariableLength6.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version f470102c Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx12G -Xms1G -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i ../sv-benchmarks/c/ldv-memsafety/ArraysOfVariableLength6.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 07b05923cf5c1b39a35ab81b524575a0a488c268 .................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.25-f470102 [2019-11-28 20:10:17,054 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-28 20:10:17,057 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-28 20:10:17,076 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-28 20:10:17,076 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-28 20:10:17,079 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-28 20:10:17,081 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-28 20:10:17,090 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-28 20:10:17,096 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-28 20:10:17,099 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-28 20:10:17,101 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-28 20:10:17,103 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-28 20:10:17,103 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-28 20:10:17,106 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-28 20:10:17,108 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-28 20:10:17,109 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-28 20:10:17,111 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-28 20:10:17,112 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-28 20:10:17,115 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-28 20:10:17,119 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-28 20:10:17,124 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-28 20:10:17,129 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-28 20:10:17,130 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-28 20:10:17,132 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-28 20:10:17,136 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-28 20:10:17,137 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-28 20:10:17,137 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-28 20:10:17,139 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-28 20:10:17,140 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-28 20:10:17,141 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-28 20:10:17,141 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-28 20:10:17,142 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-28 20:10:17,143 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-28 20:10:17,144 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-28 20:10:17,146 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-28 20:10:17,147 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-28 20:10:17,148 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-28 20:10:17,148 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-28 20:10:17,149 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-28 20:10:17,150 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-28 20:10:17,151 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-28 20:10:17,152 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2019-11-28 20:10:17,182 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-28 20:10:17,183 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-28 20:10:17,187 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-28 20:10:17,188 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-28 20:10:17,189 INFO L138 SettingsManager]: * Use SBE=true [2019-11-28 20:10:17,189 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-28 20:10:17,189 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-28 20:10:17,190 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-11-28 20:10:17,190 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-28 20:10:17,190 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-28 20:10:17,191 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-28 20:10:17,192 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2019-11-28 20:10:17,192 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2019-11-28 20:10:17,192 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2019-11-28 20:10:17,193 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-28 20:10:17,193 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2019-11-28 20:10:17,193 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-28 20:10:17,193 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-28 20:10:17,194 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-28 20:10:17,194 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-28 20:10:17,194 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-28 20:10:17,195 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-28 20:10:17,195 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-28 20:10:17,195 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-28 20:10:17,195 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-28 20:10:17,196 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-28 20:10:17,196 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-28 20:10:17,196 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2019-11-28 20:10:17,196 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 07b05923cf5c1b39a35ab81b524575a0a488c268 [2019-11-28 20:10:17,514 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-28 20:10:17,531 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-28 20:10:17,534 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-28 20:10:17,536 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-28 20:10:17,536 INFO L275 PluginConnector]: CDTParser initialized [2019-11-28 20:10:17,538 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/ldv-memsafety/ArraysOfVariableLength6.c [2019-11-28 20:10:17,620 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/aa0fe732e/b6368b6bd3234d19b961e8535455cb89/FLAG1314345ba [2019-11-28 20:10:18,067 INFO L306 CDTParser]: Found 1 translation units. [2019-11-28 20:10:18,068 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-memsafety/ArraysOfVariableLength6.c [2019-11-28 20:10:18,074 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/aa0fe732e/b6368b6bd3234d19b961e8535455cb89/FLAG1314345ba [2019-11-28 20:10:18,445 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/aa0fe732e/b6368b6bd3234d19b961e8535455cb89 [2019-11-28 20:10:18,448 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-28 20:10:18,450 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-11-28 20:10:18,451 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-28 20:10:18,451 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-28 20:10:18,456 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-28 20:10:18,457 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 08:10:18" (1/1) ... [2019-11-28 20:10:18,460 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@9334ae0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:10:18, skipping insertion in model container [2019-11-28 20:10:18,461 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 08:10:18" (1/1) ... [2019-11-28 20:10:18,469 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-11-28 20:10:18,486 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-11-28 20:10:18,679 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-28 20:10:18,689 INFO L203 MainTranslator]: Completed pre-run [2019-11-28 20:10:18,704 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-28 20:10:18,717 INFO L208 MainTranslator]: Completed translation [2019-11-28 20:10:18,717 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:10:18 WrapperNode [2019-11-28 20:10:18,718 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-28 20:10:18,718 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-28 20:10:18,718 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-28 20:10:18,719 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-28 20:10:18,781 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:10:18" (1/1) ... [2019-11-28 20:10:18,782 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:10:18" (1/1) ... [2019-11-28 20:10:18,791 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:10:18" (1/1) ... [2019-11-28 20:10:18,791 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:10:18" (1/1) ... [2019-11-28 20:10:18,811 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:10:18" (1/1) ... [2019-11-28 20:10:18,821 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:10:18" (1/1) ... [2019-11-28 20:10:18,822 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:10:18" (1/1) ... [2019-11-28 20:10:18,824 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-28 20:10:18,825 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-28 20:10:18,825 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-28 20:10:18,825 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-28 20:10:18,826 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:10:18" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-28 20:10:18,877 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-11-28 20:10:18,878 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-28 20:10:18,878 INFO L138 BoogieDeclarations]: Found implementation of procedure foo [2019-11-28 20:10:18,878 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-11-28 20:10:18,878 INFO L130 BoogieDeclarations]: Found specification of procedure foo [2019-11-28 20:10:18,879 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-11-28 20:10:18,880 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-11-28 20:10:18,880 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-11-28 20:10:18,881 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-11-28 20:10:18,881 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-11-28 20:10:18,881 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-11-28 20:10:18,881 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-28 20:10:19,205 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-28 20:10:19,206 INFO L287 CfgBuilder]: Removed 3 assume(true) statements. [2019-11-28 20:10:19,207 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 08:10:19 BoogieIcfgContainer [2019-11-28 20:10:19,207 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-28 20:10:19,209 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-28 20:10:19,209 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-28 20:10:19,212 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-28 20:10:19,212 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.11 08:10:18" (1/3) ... [2019-11-28 20:10:19,213 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@687dc82b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.11 08:10:19, skipping insertion in model container [2019-11-28 20:10:19,213 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:10:18" (2/3) ... [2019-11-28 20:10:19,214 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@687dc82b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.11 08:10:19, skipping insertion in model container [2019-11-28 20:10:19,214 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 08:10:19" (3/3) ... [2019-11-28 20:10:19,216 INFO L109 eAbstractionObserver]: Analyzing ICFG ArraysOfVariableLength6.c [2019-11-28 20:10:19,225 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-28 20:10:19,232 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 8 error locations. [2019-11-28 20:10:19,244 INFO L249 AbstractCegarLoop]: Starting to check reachability of 8 error locations. [2019-11-28 20:10:19,263 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-28 20:10:19,263 INFO L374 AbstractCegarLoop]: Hoare is false [2019-11-28 20:10:19,264 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-28 20:10:19,264 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-28 20:10:19,264 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-28 20:10:19,264 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-28 20:10:19,264 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-28 20:10:19,264 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-28 20:10:19,280 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states. [2019-11-28 20:10:19,290 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2019-11-28 20:10:19,290 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 20:10:19,291 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 20:10:19,291 INFO L410 AbstractCegarLoop]: === Iteration 1 === [fooErr1REQUIRES_VIOLATION, fooErr0ASSERT_VIOLATIONARRAY_INDEX, fooErr2REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION]=== [2019-11-28 20:10:19,296 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 20:10:19,296 INFO L82 PathProgramCache]: Analyzing trace with hash 1909189377, now seen corresponding path program 1 times [2019-11-28 20:10:19,303 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 20:10:19,303 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [267489524] [2019-11-28 20:10:19,304 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 20:10:19,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:10:19,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:10:19,505 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 20:10:19,506 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [267489524] [2019-11-28 20:10:19,507 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 20:10:19,507 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-28 20:10:19,508 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [429278715] [2019-11-28 20:10:19,513 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-28 20:10:19,514 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 20:10:19,527 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-28 20:10:19,528 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-28 20:10:19,530 INFO L87 Difference]: Start difference. First operand 40 states. Second operand 4 states. [2019-11-28 20:10:19,753 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 20:10:19,753 INFO L93 Difference]: Finished difference Result 58 states and 63 transitions. [2019-11-28 20:10:19,754 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-28 20:10:19,755 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 10 [2019-11-28 20:10:19,756 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 20:10:19,767 INFO L225 Difference]: With dead ends: 58 [2019-11-28 20:10:19,767 INFO L226 Difference]: Without dead ends: 54 [2019-11-28 20:10:19,771 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-28 20:10:19,791 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2019-11-28 20:10:19,810 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 39. [2019-11-28 20:10:19,811 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2019-11-28 20:10:19,813 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 42 transitions. [2019-11-28 20:10:19,814 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 42 transitions. Word has length 10 [2019-11-28 20:10:19,814 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 20:10:19,815 INFO L462 AbstractCegarLoop]: Abstraction has 39 states and 42 transitions. [2019-11-28 20:10:19,815 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-28 20:10:19,815 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 42 transitions. [2019-11-28 20:10:19,815 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-11-28 20:10:19,816 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 20:10:19,816 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 20:10:19,817 INFO L410 AbstractCegarLoop]: === Iteration 2 === [fooErr1REQUIRES_VIOLATION, fooErr0ASSERT_VIOLATIONARRAY_INDEX, fooErr2REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION]=== [2019-11-28 20:10:19,817 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 20:10:19,817 INFO L82 PathProgramCache]: Analyzing trace with hash -941983064, now seen corresponding path program 1 times [2019-11-28 20:10:19,817 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 20:10:19,818 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [808200120] [2019-11-28 20:10:19,818 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 20:10:19,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:10:19,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:10:19,912 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 20:10:19,913 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [808200120] [2019-11-28 20:10:19,913 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 20:10:19,913 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-28 20:10:19,914 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [696944495] [2019-11-28 20:10:19,915 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-28 20:10:19,916 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 20:10:19,916 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-28 20:10:19,916 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-28 20:10:19,917 INFO L87 Difference]: Start difference. First operand 39 states and 42 transitions. Second operand 4 states. [2019-11-28 20:10:20,071 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 20:10:20,072 INFO L93 Difference]: Finished difference Result 49 states and 53 transitions. [2019-11-28 20:10:20,072 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-28 20:10:20,072 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 11 [2019-11-28 20:10:20,073 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 20:10:20,075 INFO L225 Difference]: With dead ends: 49 [2019-11-28 20:10:20,075 INFO L226 Difference]: Without dead ends: 49 [2019-11-28 20:10:20,076 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-28 20:10:20,077 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2019-11-28 20:10:20,082 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 41. [2019-11-28 20:10:20,082 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2019-11-28 20:10:20,083 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 45 transitions. [2019-11-28 20:10:20,083 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 45 transitions. Word has length 11 [2019-11-28 20:10:20,084 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 20:10:20,084 INFO L462 AbstractCegarLoop]: Abstraction has 41 states and 45 transitions. [2019-11-28 20:10:20,084 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-28 20:10:20,084 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 45 transitions. [2019-11-28 20:10:20,085 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2019-11-28 20:10:20,085 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 20:10:20,085 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 20:10:20,085 INFO L410 AbstractCegarLoop]: === Iteration 3 === [fooErr1REQUIRES_VIOLATION, fooErr0ASSERT_VIOLATIONARRAY_INDEX, fooErr2REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION]=== [2019-11-28 20:10:20,087 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 20:10:20,087 INFO L82 PathProgramCache]: Analyzing trace with hash 863296133, now seen corresponding path program 1 times [2019-11-28 20:10:20,087 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 20:10:20,088 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1728092266] [2019-11-28 20:10:20,089 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 20:10:20,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:10:20,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:10:20,226 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 20:10:20,226 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1728092266] [2019-11-28 20:10:20,226 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 20:10:20,227 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-11-28 20:10:20,229 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [31213045] [2019-11-28 20:10:20,230 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-11-28 20:10:20,230 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 20:10:20,230 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-11-28 20:10:20,231 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-11-28 20:10:20,231 INFO L87 Difference]: Start difference. First operand 41 states and 45 transitions. Second operand 7 states. [2019-11-28 20:10:20,409 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 20:10:20,409 INFO L93 Difference]: Finished difference Result 40 states and 44 transitions. [2019-11-28 20:10:20,410 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-11-28 20:10:20,410 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 12 [2019-11-28 20:10:20,411 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 20:10:20,411 INFO L225 Difference]: With dead ends: 40 [2019-11-28 20:10:20,412 INFO L226 Difference]: Without dead ends: 40 [2019-11-28 20:10:20,412 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2019-11-28 20:10:20,415 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2019-11-28 20:10:20,421 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 40. [2019-11-28 20:10:20,421 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2019-11-28 20:10:20,424 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 44 transitions. [2019-11-28 20:10:20,424 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 44 transitions. Word has length 12 [2019-11-28 20:10:20,424 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 20:10:20,426 INFO L462 AbstractCegarLoop]: Abstraction has 40 states and 44 transitions. [2019-11-28 20:10:20,426 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-11-28 20:10:20,426 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 44 transitions. [2019-11-28 20:10:20,427 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2019-11-28 20:10:20,427 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 20:10:20,427 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 20:10:20,427 INFO L410 AbstractCegarLoop]: === Iteration 4 === [fooErr1REQUIRES_VIOLATION, fooErr0ASSERT_VIOLATIONARRAY_INDEX, fooErr2REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION]=== [2019-11-28 20:10:20,428 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 20:10:20,428 INFO L82 PathProgramCache]: Analyzing trace with hash 863296134, now seen corresponding path program 1 times [2019-11-28 20:10:20,428 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 20:10:20,429 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [107584012] [2019-11-28 20:10:20,429 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 20:10:20,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:10:20,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:10:20,580 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 20:10:20,581 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [107584012] [2019-11-28 20:10:20,581 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 20:10:20,581 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-11-28 20:10:20,581 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1274029359] [2019-11-28 20:10:20,582 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-11-28 20:10:20,582 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 20:10:20,582 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-11-28 20:10:20,583 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2019-11-28 20:10:20,583 INFO L87 Difference]: Start difference. First operand 40 states and 44 transitions. Second operand 8 states. [2019-11-28 20:10:20,806 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 20:10:20,806 INFO L93 Difference]: Finished difference Result 42 states and 46 transitions. [2019-11-28 20:10:20,807 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-11-28 20:10:20,807 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 12 [2019-11-28 20:10:20,808 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 20:10:20,808 INFO L225 Difference]: With dead ends: 42 [2019-11-28 20:10:20,808 INFO L226 Difference]: Without dead ends: 42 [2019-11-28 20:10:20,809 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=36, Invalid=96, Unknown=0, NotChecked=0, Total=132 [2019-11-28 20:10:20,810 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2019-11-28 20:10:20,814 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 39. [2019-11-28 20:10:20,814 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2019-11-28 20:10:20,815 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 43 transitions. [2019-11-28 20:10:20,816 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 43 transitions. Word has length 12 [2019-11-28 20:10:20,816 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 20:10:20,816 INFO L462 AbstractCegarLoop]: Abstraction has 39 states and 43 transitions. [2019-11-28 20:10:20,816 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-11-28 20:10:20,817 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 43 transitions. [2019-11-28 20:10:20,817 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-11-28 20:10:20,818 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 20:10:20,818 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 20:10:20,818 INFO L410 AbstractCegarLoop]: === Iteration 5 === [fooErr1REQUIRES_VIOLATION, fooErr0ASSERT_VIOLATIONARRAY_INDEX, fooErr2REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION]=== [2019-11-28 20:10:20,819 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 20:10:20,819 INFO L82 PathProgramCache]: Analyzing trace with hash 143250926, now seen corresponding path program 1 times [2019-11-28 20:10:20,819 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 20:10:20,820 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [101043216] [2019-11-28 20:10:20,820 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 20:10:20,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:10:20,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:10:20,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:10:20,938 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 20:10:20,939 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [101043216] [2019-11-28 20:10:20,940 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 20:10:20,940 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-28 20:10:20,940 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [723301164] [2019-11-28 20:10:20,941 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-28 20:10:20,941 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 20:10:20,941 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-28 20:10:20,943 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-28 20:10:20,944 INFO L87 Difference]: Start difference. First operand 39 states and 43 transitions. Second operand 5 states. [2019-11-28 20:10:21,084 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 20:10:21,084 INFO L93 Difference]: Finished difference Result 45 states and 48 transitions. [2019-11-28 20:10:21,085 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-28 20:10:21,085 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 15 [2019-11-28 20:10:21,086 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 20:10:21,086 INFO L225 Difference]: With dead ends: 45 [2019-11-28 20:10:21,087 INFO L226 Difference]: Without dead ends: 42 [2019-11-28 20:10:21,088 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-11-28 20:10:21,089 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2019-11-28 20:10:21,096 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 39. [2019-11-28 20:10:21,097 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2019-11-28 20:10:21,099 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 42 transitions. [2019-11-28 20:10:21,101 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 42 transitions. Word has length 15 [2019-11-28 20:10:21,101 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 20:10:21,102 INFO L462 AbstractCegarLoop]: Abstraction has 39 states and 42 transitions. [2019-11-28 20:10:21,102 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-28 20:10:21,102 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 42 transitions. [2019-11-28 20:10:21,103 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-11-28 20:10:21,103 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 20:10:21,104 INFO L410 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 20:10:21,104 INFO L410 AbstractCegarLoop]: === Iteration 6 === [fooErr1REQUIRES_VIOLATION, fooErr0ASSERT_VIOLATIONARRAY_INDEX, fooErr2REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION]=== [2019-11-28 20:10:21,105 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 20:10:21,105 INFO L82 PathProgramCache]: Analyzing trace with hash 1623425863, now seen corresponding path program 1 times [2019-11-28 20:10:21,106 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 20:10:21,106 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [751181668] [2019-11-28 20:10:21,106 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 20:10:21,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:10:21,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:10:21,231 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 20:10:21,231 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [751181668] [2019-11-28 20:10:21,232 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [442646172] [2019-11-28 20:10:21,232 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-11-28 20:10:21,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:10:21,280 INFO L264 TraceCheckSpWp]: Trace formula consists of 79 conjuncts, 5 conjunts are in the unsatisfiable core [2019-11-28 20:10:21,287 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 20:10:21,330 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 20:10:21,331 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-28 20:10:21,331 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 3] total 9 [2019-11-28 20:10:21,332 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [30102969] [2019-11-28 20:10:21,333 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-11-28 20:10:21,333 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 20:10:21,333 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-11-28 20:10:21,333 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2019-11-28 20:10:21,334 INFO L87 Difference]: Start difference. First operand 39 states and 42 transitions. Second operand 10 states. [2019-11-28 20:10:21,564 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 20:10:21,565 INFO L93 Difference]: Finished difference Result 47 states and 50 transitions. [2019-11-28 20:10:21,565 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-11-28 20:10:21,565 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 16 [2019-11-28 20:10:21,566 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 20:10:21,566 INFO L225 Difference]: With dead ends: 47 [2019-11-28 20:10:21,567 INFO L226 Difference]: Without dead ends: 47 [2019-11-28 20:10:21,567 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=63, Invalid=147, Unknown=0, NotChecked=0, Total=210 [2019-11-28 20:10:21,568 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2019-11-28 20:10:21,571 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 47. [2019-11-28 20:10:21,571 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. [2019-11-28 20:10:21,572 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 50 transitions. [2019-11-28 20:10:21,572 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 50 transitions. Word has length 16 [2019-11-28 20:10:21,573 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 20:10:21,573 INFO L462 AbstractCegarLoop]: Abstraction has 47 states and 50 transitions. [2019-11-28 20:10:21,573 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-11-28 20:10:21,573 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 50 transitions. [2019-11-28 20:10:21,574 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2019-11-28 20:10:21,574 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 20:10:21,574 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 20:10:21,781 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 20:10:21,783 INFO L410 AbstractCegarLoop]: === Iteration 7 === [fooErr1REQUIRES_VIOLATION, fooErr0ASSERT_VIOLATIONARRAY_INDEX, fooErr2REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION]=== [2019-11-28 20:10:21,783 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 20:10:21,784 INFO L82 PathProgramCache]: Analyzing trace with hash -661735507, now seen corresponding path program 1 times [2019-11-28 20:10:21,784 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 20:10:21,785 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [421432995] [2019-11-28 20:10:21,785 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 20:10:21,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:10:21,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:10:21,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:10:21,876 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2019-11-28 20:10:21,877 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [421432995] [2019-11-28 20:10:21,877 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 20:10:21,878 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-28 20:10:21,878 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1319518522] [2019-11-28 20:10:21,879 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-28 20:10:21,879 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 20:10:21,880 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-28 20:10:21,881 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-28 20:10:21,881 INFO L87 Difference]: Start difference. First operand 47 states and 50 transitions. Second operand 4 states. [2019-11-28 20:10:21,960 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 20:10:21,961 INFO L93 Difference]: Finished difference Result 45 states and 48 transitions. [2019-11-28 20:10:21,961 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-28 20:10:21,961 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 30 [2019-11-28 20:10:21,962 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 20:10:21,962 INFO L225 Difference]: With dead ends: 45 [2019-11-28 20:10:21,963 INFO L226 Difference]: Without dead ends: 45 [2019-11-28 20:10:21,963 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-28 20:10:21,964 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2019-11-28 20:10:21,967 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 45. [2019-11-28 20:10:21,968 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2019-11-28 20:10:21,969 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 48 transitions. [2019-11-28 20:10:21,969 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 48 transitions. Word has length 30 [2019-11-28 20:10:21,969 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 20:10:21,969 INFO L462 AbstractCegarLoop]: Abstraction has 45 states and 48 transitions. [2019-11-28 20:10:21,969 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-28 20:10:21,970 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 48 transitions. [2019-11-28 20:10:21,970 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2019-11-28 20:10:21,970 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 20:10:21,970 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 20:10:21,971 INFO L410 AbstractCegarLoop]: === Iteration 8 === [fooErr1REQUIRES_VIOLATION, fooErr0ASSERT_VIOLATIONARRAY_INDEX, fooErr2REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION]=== [2019-11-28 20:10:21,971 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 20:10:21,971 INFO L82 PathProgramCache]: Analyzing trace with hash -661735506, now seen corresponding path program 1 times [2019-11-28 20:10:21,971 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 20:10:21,971 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1011853744] [2019-11-28 20:10:21,972 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 20:10:21,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:10:22,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:10:22,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:10:22,249 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 20:10:22,249 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1011853744] [2019-11-28 20:10:22,250 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1628315853] [2019-11-28 20:10:22,250 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 20:10:22,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:10:22,304 INFO L264 TraceCheckSpWp]: Trace formula consists of 110 conjuncts, 7 conjunts are in the unsatisfiable core [2019-11-28 20:10:22,306 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 20:10:22,404 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 20:10:22,405 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-28 20:10:22,405 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7] total 13 [2019-11-28 20:10:22,406 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1929552002] [2019-11-28 20:10:22,406 INFO L442 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-11-28 20:10:22,407 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 20:10:22,407 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-11-28 20:10:22,408 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=120, Unknown=0, NotChecked=0, Total=156 [2019-11-28 20:10:22,408 INFO L87 Difference]: Start difference. First operand 45 states and 48 transitions. Second operand 13 states. [2019-11-28 20:10:22,812 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 20:10:22,812 INFO L93 Difference]: Finished difference Result 57 states and 60 transitions. [2019-11-28 20:10:22,813 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-11-28 20:10:22,813 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 30 [2019-11-28 20:10:22,813 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 20:10:22,814 INFO L225 Difference]: With dead ends: 57 [2019-11-28 20:10:22,814 INFO L226 Difference]: Without dead ends: 54 [2019-11-28 20:10:22,815 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=85, Invalid=221, Unknown=0, NotChecked=0, Total=306 [2019-11-28 20:10:22,815 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2019-11-28 20:10:22,824 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 50. [2019-11-28 20:10:22,824 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50 states. [2019-11-28 20:10:22,825 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 53 transitions. [2019-11-28 20:10:22,825 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 53 transitions. Word has length 30 [2019-11-28 20:10:22,829 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 20:10:22,830 INFO L462 AbstractCegarLoop]: Abstraction has 50 states and 53 transitions. [2019-11-28 20:10:22,830 INFO L463 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-11-28 20:10:22,830 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 53 transitions. [2019-11-28 20:10:22,833 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2019-11-28 20:10:22,833 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 20:10:22,833 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 20:10:23,036 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 20:10:23,043 INFO L410 AbstractCegarLoop]: === Iteration 9 === [fooErr1REQUIRES_VIOLATION, fooErr0ASSERT_VIOLATIONARRAY_INDEX, fooErr2REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION]=== [2019-11-28 20:10:23,043 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 20:10:23,043 INFO L82 PathProgramCache]: Analyzing trace with hash 1228723375, now seen corresponding path program 2 times [2019-11-28 20:10:23,044 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 20:10:23,044 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [694989055] [2019-11-28 20:10:23,044 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 20:10:23,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:10:23,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:10:23,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:10:23,257 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 0 proven. 34 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 20:10:23,258 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [694989055] [2019-11-28 20:10:23,258 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [807051529] [2019-11-28 20:10:23,258 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 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 [2019-11-28 20:10:23,297 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2019-11-28 20:10:23,298 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-28 20:10:23,298 INFO L264 TraceCheckSpWp]: Trace formula consists of 74 conjuncts, 8 conjunts are in the unsatisfiable core [2019-11-28 20:10:23,301 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 20:10:23,331 INFO L430 ElimStorePlain]: Different costs {0=[|v_#length_12|], 1=[|v_#valid_24|]} [2019-11-28 20:10:23,347 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-28 20:10:23,358 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 11 [2019-11-28 20:10:23,359 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-28 20:10:23,369 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-28 20:10:23,372 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-28 20:10:23,375 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 5 treesize of output 3 [2019-11-28 20:10:23,375 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-28 20:10:23,388 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-28 20:10:23,389 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-28 20:10:23,390 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:24, output treesize:17 [2019-11-28 20:10:23,527 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2019-11-28 20:10:23,527 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-11-28 20:10:23,527 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [9] total 12 [2019-11-28 20:10:23,528 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [655301493] [2019-11-28 20:10:23,528 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-28 20:10:23,528 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 20:10:23,528 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-28 20:10:23,529 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=98, Unknown=0, NotChecked=0, Total=132 [2019-11-28 20:10:23,529 INFO L87 Difference]: Start difference. First operand 50 states and 53 transitions. Second operand 5 states. [2019-11-28 20:10:23,568 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 20:10:23,568 INFO L93 Difference]: Finished difference Result 48 states and 51 transitions. [2019-11-28 20:10:23,570 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-28 20:10:23,570 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 35 [2019-11-28 20:10:23,570 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 20:10:23,571 INFO L225 Difference]: With dead ends: 48 [2019-11-28 20:10:23,571 INFO L226 Difference]: Without dead ends: 48 [2019-11-28 20:10:23,572 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 34 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=34, Invalid=98, Unknown=0, NotChecked=0, Total=132 [2019-11-28 20:10:23,572 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2019-11-28 20:10:23,575 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 48. [2019-11-28 20:10:23,575 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2019-11-28 20:10:23,576 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 51 transitions. [2019-11-28 20:10:23,576 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 51 transitions. Word has length 35 [2019-11-28 20:10:23,576 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 20:10:23,576 INFO L462 AbstractCegarLoop]: Abstraction has 48 states and 51 transitions. [2019-11-28 20:10:23,576 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-28 20:10:23,577 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 51 transitions. [2019-11-28 20:10:23,578 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2019-11-28 20:10:23,578 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 20:10:23,578 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 20:10:23,780 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 20:10:23,781 INFO L410 AbstractCegarLoop]: === Iteration 10 === [fooErr1REQUIRES_VIOLATION, fooErr0ASSERT_VIOLATIONARRAY_INDEX, fooErr2REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION]=== [2019-11-28 20:10:23,782 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 20:10:23,782 INFO L82 PathProgramCache]: Analyzing trace with hash -1738652280, now seen corresponding path program 1 times [2019-11-28 20:10:23,782 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 20:10:23,783 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [827863772] [2019-11-28 20:10:23,783 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 20:10:23,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:10:23,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:10:23,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:10:23,854 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2019-11-28 20:10:23,855 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [827863772] [2019-11-28 20:10:23,855 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1761056974] [2019-11-28 20:10:23,855 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 20:10:23,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:10:23,903 INFO L264 TraceCheckSpWp]: Trace formula consists of 144 conjuncts, 8 conjunts are in the unsatisfiable core [2019-11-28 20:10:23,906 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 20:10:24,001 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 1 proven. 34 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 20:10:24,002 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-28 20:10:24,002 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 8] total 11 [2019-11-28 20:10:24,002 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [487432446] [2019-11-28 20:10:24,003 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-11-28 20:10:24,003 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 20:10:24,003 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-11-28 20:10:24,003 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110 [2019-11-28 20:10:24,003 INFO L87 Difference]: Start difference. First operand 48 states and 51 transitions. Second operand 11 states. [2019-11-28 20:10:24,261 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 20:10:24,262 INFO L93 Difference]: Finished difference Result 84 states and 89 transitions. [2019-11-28 20:10:24,262 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-11-28 20:10:24,262 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 44 [2019-11-28 20:10:24,262 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 20:10:24,263 INFO L225 Difference]: With dead ends: 84 [2019-11-28 20:10:24,263 INFO L226 Difference]: Without dead ends: 81 [2019-11-28 20:10:24,264 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 42 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=76, Invalid=196, Unknown=0, NotChecked=0, Total=272 [2019-11-28 20:10:24,264 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2019-11-28 20:10:24,271 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 63. [2019-11-28 20:10:24,271 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 63 states. [2019-11-28 20:10:24,274 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 68 transitions. [2019-11-28 20:10:24,274 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 68 transitions. Word has length 44 [2019-11-28 20:10:24,277 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 20:10:24,277 INFO L462 AbstractCegarLoop]: Abstraction has 63 states and 68 transitions. [2019-11-28 20:10:24,277 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-11-28 20:10:24,277 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 68 transitions. [2019-11-28 20:10:24,283 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2019-11-28 20:10:24,283 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 20:10:24,283 INFO L410 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 20:10:24,488 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 20:10:24,489 INFO L410 AbstractCegarLoop]: === Iteration 11 === [fooErr1REQUIRES_VIOLATION, fooErr0ASSERT_VIOLATIONARRAY_INDEX, fooErr2REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION]=== [2019-11-28 20:10:24,489 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 20:10:24,490 INFO L82 PathProgramCache]: Analyzing trace with hash -950238676, now seen corresponding path program 2 times [2019-11-28 20:10:24,490 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 20:10:24,491 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1703779505] [2019-11-28 20:10:24,491 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 20:10:24,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:10:24,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:10:24,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:10:24,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:10:24,628 INFO L134 CoverageAnalysis]: Checked inductivity of 258 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 250 trivial. 0 not checked. [2019-11-28 20:10:24,628 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1703779505] [2019-11-28 20:10:24,628 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [71587409] [2019-11-28 20:10:24,628 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 20:10:24,677 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2019-11-28 20:10:24,677 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-28 20:10:24,678 INFO L264 TraceCheckSpWp]: Trace formula consists of 59 conjuncts, 8 conjunts are in the unsatisfiable core [2019-11-28 20:10:24,693 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 20:10:24,794 INFO L343 Elim1Store]: treesize reduction 14, result has 50.0 percent of original size [2019-11-28 20:10:24,795 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 24 treesize of output 29 [2019-11-28 20:10:24,796 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-28 20:10:24,805 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-28 20:10:24,808 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-11-28 20:10:24,808 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:23, output treesize:15 [2019-11-28 20:10:24,982 INFO L343 Elim1Store]: treesize reduction 14, result has 50.0 percent of original size [2019-11-28 20:10:24,983 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 24 treesize of output 29 [2019-11-28 20:10:24,984 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-28 20:10:24,991 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-28 20:10:24,993 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-11-28 20:10:24,993 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:23, output treesize:15 [2019-11-28 20:10:25,192 INFO L134 CoverageAnalysis]: Checked inductivity of 258 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 258 trivial. 0 not checked. [2019-11-28 20:10:25,192 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-11-28 20:10:25,192 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [6] total 10 [2019-11-28 20:10:25,195 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1743975225] [2019-11-28 20:10:25,195 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-28 20:10:25,195 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 20:10:25,196 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-28 20:10:25,196 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2019-11-28 20:10:25,197 INFO L87 Difference]: Start difference. First operand 63 states and 68 transitions. Second operand 6 states. [2019-11-28 20:10:25,287 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 20:10:25,287 INFO L93 Difference]: Finished difference Result 62 states and 67 transitions. [2019-11-28 20:10:25,288 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-28 20:10:25,288 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 85 [2019-11-28 20:10:25,288 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 20:10:25,290 INFO L225 Difference]: With dead ends: 62 [2019-11-28 20:10:25,290 INFO L226 Difference]: Without dead ends: 0 [2019-11-28 20:10:25,291 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 96 GetRequests, 84 SyntacticMatches, 3 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2019-11-28 20:10:25,291 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-11-28 20:10:25,291 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-11-28 20:10:25,291 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-11-28 20:10:25,291 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-11-28 20:10:25,292 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 85 [2019-11-28 20:10:25,292 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 20:10:25,292 INFO L462 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-11-28 20:10:25,292 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-28 20:10:25,292 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-11-28 20:10:25,292 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-11-28 20:10:25,493 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 20:10:25,497 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 28.11 08:10:25 BoogieIcfgContainer [2019-11-28 20:10:25,497 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-11-28 20:10:25,498 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-11-28 20:10:25,498 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-11-28 20:10:25,498 INFO L275 PluginConnector]: Witness Printer initialized [2019-11-28 20:10:25,499 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 08:10:19" (3/4) ... [2019-11-28 20:10:25,503 INFO L137 WitnessPrinter]: Generating witness for correct program [2019-11-28 20:10:25,510 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ULTIMATE.init [2019-11-28 20:10:25,510 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure foo [2019-11-28 20:10:25,510 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure main [2019-11-28 20:10:25,517 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 17 nodes and edges [2019-11-28 20:10:25,517 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 10 nodes and edges [2019-11-28 20:10:25,517 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2019-11-28 20:10:25,518 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2019-11-28 20:10:25,560 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2019-11-28 20:10:25,560 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-11-28 20:10:25,562 INFO L168 Benchmark]: Toolchain (without parser) took 7112.50 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 174.1 MB). Free memory was 960.4 MB in the beginning and 851.0 MB in the end (delta: 109.3 MB). Peak memory consumption was 283.4 MB. Max. memory is 11.5 GB. [2019-11-28 20:10:25,563 INFO L168 Benchmark]: CDTParser took 0.36 ms. Allocated memory is still 1.0 GB. Free memory is still 987.2 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-28 20:10:25,563 INFO L168 Benchmark]: CACSL2BoogieTranslator took 267.16 ms. Allocated memory is still 1.0 GB. Free memory was 960.4 MB in the beginning and 949.6 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. [2019-11-28 20:10:25,564 INFO L168 Benchmark]: Boogie Preprocessor took 106.37 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 93.3 MB). Free memory was 949.6 MB in the beginning and 1.1 GB in the end (delta: -133.0 MB). Peak memory consumption was 9.7 MB. Max. memory is 11.5 GB. [2019-11-28 20:10:25,565 INFO L168 Benchmark]: RCFGBuilder took 382.31 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 20.9 MB). Peak memory consumption was 20.9 MB. Max. memory is 11.5 GB. [2019-11-28 20:10:25,565 INFO L168 Benchmark]: TraceAbstraction took 6288.58 ms. Allocated memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: 80.7 MB). Free memory was 1.1 GB in the beginning and 851.0 MB in the end (delta: 210.8 MB). Peak memory consumption was 291.5 MB. Max. memory is 11.5 GB. [2019-11-28 20:10:25,566 INFO L168 Benchmark]: Witness Printer took 62.73 ms. Allocated memory is still 1.2 GB. Free memory is still 851.0 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-28 20:10:25,569 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.36 ms. Allocated memory is still 1.0 GB. Free memory is still 987.2 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 267.16 ms. Allocated memory is still 1.0 GB. Free memory was 960.4 MB in the beginning and 949.6 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 106.37 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 93.3 MB). Free memory was 949.6 MB in the beginning and 1.1 GB in the end (delta: -133.0 MB). Peak memory consumption was 9.7 MB. Max. memory is 11.5 GB. * RCFGBuilder took 382.31 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 20.9 MB). Peak memory consumption was 20.9 MB. Max. memory is 11.5 GB. * TraceAbstraction took 6288.58 ms. Allocated memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: 80.7 MB). Free memory was 1.1 GB in the beginning and 851.0 MB in the end (delta: 210.8 MB). Peak memory consumption was 291.5 MB. Max. memory is 11.5 GB. * Witness Printer took 62.73 ms. Allocated memory is still 1.2 GB. Free memory is still 851.0 MB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 16]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 16]: array index is always in bounds For all program executions holds that array index is always in bounds at this location - PositiveResult [Line: 16]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 30]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 30]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 21]: all allocated memory was freed For all program executions holds that all allocated memory was freed at this location - PositiveResult [Line: 27]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 27]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - AllSpecificationsHoldResult: All specifications hold 8 specifications checked. All of them hold - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 40 locations, 8 error locations. Result: SAFE, OverallTime: 6.2s, OverallIterations: 11, TraceHistogramMax: 10, AutomataDifference: 2.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 277 SDtfs, 501 SDslu, 675 SDs, 0 SdLazy, 860 SolverSat, 94 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 318 GetRequests, 220 SyntacticMatches, 4 SemanticMatches, 94 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 136 ImplicationChecksByTransitivity, 1.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=63occurred in iteration=10, 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, 11 MinimizatonAttempts, 51 StatesRemovedByMinimization, 6 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 2.2s InterpolantComputationTime, 510 NumberOfCodeBlocks, 418 NumberOfCodeBlocksAsserted, 16 NumberOfCheckSat, 494 ConstructedInterpolants, 90 QuantifiedInterpolants, 182724 SizeOfPredicates, 5 NumberOfNonLiveVariables, 466 ConjunctsInSsa, 36 ConjunctsInUnsatCore, 16 InterpolantComputations, 8 PerfectInterpolantSequences, 596/712 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...