./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/termination-crafted/Arrays01-EquivalentConstantIndices-1.c --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 30f4e4ab 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/termination-crafted/Arrays01-EquivalentConstantIndices-1.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-64bit-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 64bit --witnessprinter.graph.data.programhash cf39454d83b4ec00341bd0b620b0fa6b2321ce21 ...................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.24-30f4e4a [2019-11-28 02:46:52,964 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-28 02:46:52,967 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-28 02:46:52,979 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-28 02:46:52,980 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-28 02:46:52,981 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-28 02:46:52,982 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-28 02:46:52,985 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-28 02:46:52,986 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-28 02:46:52,988 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-28 02:46:52,989 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-28 02:46:52,990 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-28 02:46:52,990 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-28 02:46:52,992 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-28 02:46:52,993 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-28 02:46:52,994 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-28 02:46:52,995 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-28 02:46:52,996 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-28 02:46:52,998 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-28 02:46:53,000 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-28 02:46:53,002 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-28 02:46:53,003 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-28 02:46:53,004 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-28 02:46:53,005 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-28 02:46:53,008 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-28 02:46:53,009 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-28 02:46:53,009 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-28 02:46:53,010 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-28 02:46:53,012 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-28 02:46:53,013 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-28 02:46:53,014 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-28 02:46:53,015 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-28 02:46:53,015 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-28 02:46:53,016 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-28 02:46:53,019 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-28 02:46:53,020 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-28 02:46:53,021 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-28 02:46:53,021 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-28 02:46:53,022 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-28 02:46:53,025 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-28 02:46:53,026 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-28 02:46:53,028 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-64bit-Automizer_Default.epf [2019-11-28 02:46:53,048 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-28 02:46:53,049 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-28 02:46:53,051 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-28 02:46:53,051 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-28 02:46:53,052 INFO L138 SettingsManager]: * Use SBE=true [2019-11-28 02:46:53,052 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-28 02:46:53,052 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-11-28 02:46:53,052 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-28 02:46:53,053 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-28 02:46:53,053 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2019-11-28 02:46:53,054 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2019-11-28 02:46:53,054 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2019-11-28 02:46:53,055 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-28 02:46:53,055 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2019-11-28 02:46:53,055 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-28 02:46:53,056 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-28 02:46:53,056 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-28 02:46:53,056 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-28 02:46:53,056 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-28 02:46:53,057 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-28 02:46:53,057 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-28 02:46:53,058 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-28 02:46:53,058 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-28 02:46:53,058 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-28 02:46:53,058 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 -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> cf39454d83b4ec00341bd0b620b0fa6b2321ce21 [2019-11-28 02:46:53,403 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-28 02:46:53,420 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-28 02:46:53,423 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-28 02:46:53,425 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-28 02:46:53,425 INFO L275 PluginConnector]: CDTParser initialized [2019-11-28 02:46:53,426 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/termination-crafted/Arrays01-EquivalentConstantIndices-1.c [2019-11-28 02:46:53,498 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f11a50cc2/1a30720a1fa6411eb167c8f5c84bfeb1/FLAG3bd79d702 [2019-11-28 02:46:53,969 INFO L306 CDTParser]: Found 1 translation units. [2019-11-28 02:46:53,970 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/termination-crafted/Arrays01-EquivalentConstantIndices-1.c [2019-11-28 02:46:53,978 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f11a50cc2/1a30720a1fa6411eb167c8f5c84bfeb1/FLAG3bd79d702 [2019-11-28 02:46:54,345 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f11a50cc2/1a30720a1fa6411eb167c8f5c84bfeb1 [2019-11-28 02:46:54,348 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-28 02:46:54,350 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-11-28 02:46:54,354 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-28 02:46:54,354 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-28 02:46:54,358 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-28 02:46:54,359 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 02:46:54" (1/1) ... [2019-11-28 02:46:54,362 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@61bd84bf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 02:46:54, skipping insertion in model container [2019-11-28 02:46:54,362 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 02:46:54" (1/1) ... [2019-11-28 02:46:54,372 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-11-28 02:46:54,395 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-11-28 02:46:54,589 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-28 02:46:54,593 INFO L203 MainTranslator]: Completed pre-run [2019-11-28 02:46:54,613 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-28 02:46:54,632 INFO L208 MainTranslator]: Completed translation [2019-11-28 02:46:54,633 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 02:46:54 WrapperNode [2019-11-28 02:46:54,633 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-28 02:46:54,634 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-28 02:46:54,634 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-28 02:46:54,634 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-28 02:46:54,704 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 02:46:54" (1/1) ... [2019-11-28 02:46:54,704 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 02:46:54" (1/1) ... [2019-11-28 02:46:54,713 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 02:46:54" (1/1) ... [2019-11-28 02:46:54,714 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 02:46:54" (1/1) ... [2019-11-28 02:46:54,730 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 02:46:54" (1/1) ... [2019-11-28 02:46:54,737 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 02:46:54" (1/1) ... [2019-11-28 02:46:54,744 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 02:46:54" (1/1) ... [2019-11-28 02:46:54,747 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-28 02:46:54,748 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-28 02:46:54,748 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-28 02:46:54,748 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-28 02:46:54,750 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 02:46:54" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-28 02:46:54,805 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-11-28 02:46:54,805 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-28 02:46:54,805 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-11-28 02:46:54,805 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-11-28 02:46:54,806 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-11-28 02:46:54,806 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-11-28 02:46:54,806 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-11-28 02:46:54,806 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-11-28 02:46:54,807 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-11-28 02:46:54,807 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-11-28 02:46:54,807 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-28 02:46:55,077 INFO L292 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-28 02:46:55,077 INFO L297 CfgBuilder]: Removed 2 assume(true) statements. [2019-11-28 02:46:55,079 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 02:46:55 BoogieIcfgContainer [2019-11-28 02:46:55,079 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-28 02:46:55,083 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-28 02:46:55,083 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-28 02:46:55,087 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-28 02:46:55,087 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.11 02:46:54" (1/3) ... [2019-11-28 02:46:55,089 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7d3fc578 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.11 02:46:55, skipping insertion in model container [2019-11-28 02:46:55,089 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 02:46:54" (2/3) ... [2019-11-28 02:46:55,101 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7d3fc578 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.11 02:46:55, skipping insertion in model container [2019-11-28 02:46:55,104 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 02:46:55" (3/3) ... [2019-11-28 02:46:55,106 INFO L109 eAbstractionObserver]: Analyzing ICFG Arrays01-EquivalentConstantIndices-1.c [2019-11-28 02:46:55,124 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-28 02:46:55,131 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 9 error locations. [2019-11-28 02:46:55,143 INFO L249 AbstractCegarLoop]: Starting to check reachability of 9 error locations. [2019-11-28 02:46:55,159 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-28 02:46:55,160 INFO L374 AbstractCegarLoop]: Hoare is false [2019-11-28 02:46:55,160 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-28 02:46:55,160 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-28 02:46:55,160 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-28 02:46:55,160 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-28 02:46:55,161 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-28 02:46:55,161 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-28 02:46:55,174 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states. [2019-11-28 02:46:55,182 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2019-11-28 02:46:55,183 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 02:46:55,184 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 02:46:55,184 INFO L410 AbstractCegarLoop]: === Iteration 1 === [mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr8ENSURES_VIOLATIONMEMORY_LEAK]=== [2019-11-28 02:46:55,190 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 02:46:55,191 INFO L82 PathProgramCache]: Analyzing trace with hash -1425323941, now seen corresponding path program 1 times [2019-11-28 02:46:55,198 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 02:46:55,198 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1181696484] [2019-11-28 02:46:55,198 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 02:46:55,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:46:55,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:46:55,367 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 02:46:55,368 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1181696484] [2019-11-28 02:46:55,369 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 02:46:55,369 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-28 02:46:55,370 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [846886835] [2019-11-28 02:46:55,376 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-28 02:46:55,376 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 02:46:55,392 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 02:46:55,393 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 02:46:55,395 INFO L87 Difference]: Start difference. First operand 29 states. Second operand 3 states. [2019-11-28 02:46:55,490 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 02:46:55,491 INFO L93 Difference]: Finished difference Result 29 states and 30 transitions. [2019-11-28 02:46:55,491 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 02:46:55,493 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 8 [2019-11-28 02:46:55,493 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 02:46:55,500 INFO L225 Difference]: With dead ends: 29 [2019-11-28 02:46:55,501 INFO L226 Difference]: Without dead ends: 26 [2019-11-28 02:46:55,502 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 02:46:55,519 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2019-11-28 02:46:55,531 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 26. [2019-11-28 02:46:55,532 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2019-11-28 02:46:55,533 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 27 transitions. [2019-11-28 02:46:55,534 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 27 transitions. Word has length 8 [2019-11-28 02:46:55,534 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 02:46:55,535 INFO L462 AbstractCegarLoop]: Abstraction has 26 states and 27 transitions. [2019-11-28 02:46:55,535 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-28 02:46:55,535 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 27 transitions. [2019-11-28 02:46:55,535 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2019-11-28 02:46:55,536 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 02:46:55,536 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 02:46:55,536 INFO L410 AbstractCegarLoop]: === Iteration 2 === [mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr8ENSURES_VIOLATIONMEMORY_LEAK]=== [2019-11-28 02:46:55,536 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 02:46:55,537 INFO L82 PathProgramCache]: Analyzing trace with hash -1425324251, now seen corresponding path program 1 times [2019-11-28 02:46:55,537 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 02:46:55,537 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [881538630] [2019-11-28 02:46:55,537 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 02:46:55,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:46:55,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:46:55,613 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 02:46:55,615 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [881538630] [2019-11-28 02:46:55,615 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 02:46:55,616 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-28 02:46:55,616 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1994752911] [2019-11-28 02:46:55,618 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-28 02:46:55,619 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 02:46:55,619 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-28 02:46:55,619 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-28 02:46:55,619 INFO L87 Difference]: Start difference. First operand 26 states and 27 transitions. Second operand 4 states. [2019-11-28 02:46:55,705 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 02:46:55,706 INFO L93 Difference]: Finished difference Result 32 states and 33 transitions. [2019-11-28 02:46:55,706 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-28 02:46:55,706 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 8 [2019-11-28 02:46:55,707 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 02:46:55,707 INFO L225 Difference]: With dead ends: 32 [2019-11-28 02:46:55,707 INFO L226 Difference]: Without dead ends: 32 [2019-11-28 02:46:55,708 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 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 02:46:55,710 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2019-11-28 02:46:55,716 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 27. [2019-11-28 02:46:55,717 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2019-11-28 02:46:55,718 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 28 transitions. [2019-11-28 02:46:55,719 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 28 transitions. Word has length 8 [2019-11-28 02:46:55,719 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 02:46:55,720 INFO L462 AbstractCegarLoop]: Abstraction has 27 states and 28 transitions. [2019-11-28 02:46:55,720 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-28 02:46:55,720 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 28 transitions. [2019-11-28 02:46:55,720 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2019-11-28 02:46:55,721 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 02:46:55,721 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 02:46:55,721 INFO L410 AbstractCegarLoop]: === Iteration 3 === [mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr8ENSURES_VIOLATIONMEMORY_LEAK]=== [2019-11-28 02:46:55,721 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 02:46:55,722 INFO L82 PathProgramCache]: Analyzing trace with hash -1425324200, now seen corresponding path program 1 times [2019-11-28 02:46:55,722 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 02:46:55,722 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [615783505] [2019-11-28 02:46:55,722 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 02:46:55,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:46:55,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:46:55,841 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 02:46:55,841 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [615783505] [2019-11-28 02:46:55,842 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 02:46:55,842 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-28 02:46:55,842 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [100590043] [2019-11-28 02:46:55,843 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-28 02:46:55,843 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 02:46:55,843 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-28 02:46:55,844 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-28 02:46:55,844 INFO L87 Difference]: Start difference. First operand 27 states and 28 transitions. Second operand 4 states. [2019-11-28 02:46:55,922 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 02:46:55,922 INFO L93 Difference]: Finished difference Result 31 states and 32 transitions. [2019-11-28 02:46:55,923 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-28 02:46:55,923 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 8 [2019-11-28 02:46:55,923 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 02:46:55,924 INFO L225 Difference]: With dead ends: 31 [2019-11-28 02:46:55,924 INFO L226 Difference]: Without dead ends: 31 [2019-11-28 02:46:55,925 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 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 02:46:55,925 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2019-11-28 02:46:55,928 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 28. [2019-11-28 02:46:55,928 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2019-11-28 02:46:55,929 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 30 transitions. [2019-11-28 02:46:55,930 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 30 transitions. Word has length 8 [2019-11-28 02:46:55,930 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 02:46:55,930 INFO L462 AbstractCegarLoop]: Abstraction has 28 states and 30 transitions. [2019-11-28 02:46:55,930 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-28 02:46:55,931 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 30 transitions. [2019-11-28 02:46:55,931 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2019-11-28 02:46:55,931 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 02:46:55,931 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 02:46:55,932 INFO L410 AbstractCegarLoop]: === Iteration 4 === [mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr8ENSURES_VIOLATIONMEMORY_LEAK]=== [2019-11-28 02:46:55,932 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 02:46:55,932 INFO L82 PathProgramCache]: Analyzing trace with hash -1425324201, now seen corresponding path program 1 times [2019-11-28 02:46:55,932 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 02:46:55,933 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1415539931] [2019-11-28 02:46:55,933 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 02:46:55,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:46:55,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:46:55,998 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 02:46:55,998 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1415539931] [2019-11-28 02:46:55,999 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 02:46:55,999 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-28 02:46:55,999 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [72461277] [2019-11-28 02:46:55,999 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-28 02:46:56,000 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 02:46:56,000 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-28 02:46:56,000 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-28 02:46:56,001 INFO L87 Difference]: Start difference. First operand 28 states and 30 transitions. Second operand 4 states. [2019-11-28 02:46:56,057 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 02:46:56,057 INFO L93 Difference]: Finished difference Result 24 states and 25 transitions. [2019-11-28 02:46:56,058 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-28 02:46:56,058 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 8 [2019-11-28 02:46:56,058 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 02:46:56,059 INFO L225 Difference]: With dead ends: 24 [2019-11-28 02:46:56,059 INFO L226 Difference]: Without dead ends: 24 [2019-11-28 02:46:56,060 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 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 02:46:56,060 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2019-11-28 02:46:56,063 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 24. [2019-11-28 02:46:56,063 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2019-11-28 02:46:56,064 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 25 transitions. [2019-11-28 02:46:56,064 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 25 transitions. Word has length 8 [2019-11-28 02:46:56,065 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 02:46:56,065 INFO L462 AbstractCegarLoop]: Abstraction has 24 states and 25 transitions. [2019-11-28 02:46:56,065 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-28 02:46:56,065 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 25 transitions. [2019-11-28 02:46:56,066 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2019-11-28 02:46:56,066 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 02:46:56,066 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 02:46:56,066 INFO L410 AbstractCegarLoop]: === Iteration 5 === [mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr8ENSURES_VIOLATIONMEMORY_LEAK]=== [2019-11-28 02:46:56,067 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 02:46:56,067 INFO L82 PathProgramCache]: Analyzing trace with hash 450080617, now seen corresponding path program 1 times [2019-11-28 02:46:56,067 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 02:46:56,068 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [448579911] [2019-11-28 02:46:56,068 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 02:46:56,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:46:56,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:46:56,156 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 02:46:56,157 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [448579911] [2019-11-28 02:46:56,157 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1588068541] [2019-11-28 02:46:56,158 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 02:46:56,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:46:56,222 INFO L255 TraceCheckSpWp]: Trace formula consists of 51 conjuncts, 3 conjunts are in the unsatisfiable core [2019-11-28 02:46:56,228 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 02:46:56,259 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 02:46:56,259 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-28 02:46:56,260 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4] total 6 [2019-11-28 02:46:56,260 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [410711108] [2019-11-28 02:46:56,261 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-28 02:46:56,261 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 02:46:56,261 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-28 02:46:56,262 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-11-28 02:46:56,262 INFO L87 Difference]: Start difference. First operand 24 states and 25 transitions. Second operand 6 states. [2019-11-28 02:46:56,322 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 02:46:56,322 INFO L93 Difference]: Finished difference Result 31 states and 32 transitions. [2019-11-28 02:46:56,323 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-28 02:46:56,323 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 12 [2019-11-28 02:46:56,324 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 02:46:56,325 INFO L225 Difference]: With dead ends: 31 [2019-11-28 02:46:56,325 INFO L226 Difference]: Without dead ends: 31 [2019-11-28 02:46:56,325 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-11-28 02:46:56,326 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2019-11-28 02:46:56,329 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 27. [2019-11-28 02:46:56,329 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2019-11-28 02:46:56,330 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 28 transitions. [2019-11-28 02:46:56,331 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 28 transitions. Word has length 12 [2019-11-28 02:46:56,331 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 02:46:56,331 INFO L462 AbstractCegarLoop]: Abstraction has 27 states and 28 transitions. [2019-11-28 02:46:56,332 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-28 02:46:56,332 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 28 transitions. [2019-11-28 02:46:56,332 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2019-11-28 02:46:56,333 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 02:46:56,333 INFO L410 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 02:46:56,538 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 02:46:56,538 INFO L410 AbstractCegarLoop]: === Iteration 6 === [mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr8ENSURES_VIOLATIONMEMORY_LEAK]=== [2019-11-28 02:46:56,538 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 02:46:56,539 INFO L82 PathProgramCache]: Analyzing trace with hash 450080667, now seen corresponding path program 1 times [2019-11-28 02:46:56,539 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 02:46:56,540 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [518773237] [2019-11-28 02:46:56,540 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 02:46:56,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:46:56,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:46:56,660 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 02:46:56,661 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [518773237] [2019-11-28 02:46:56,661 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [742637296] [2019-11-28 02:46:56,662 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 02:46:56,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:46:56,696 INFO L255 TraceCheckSpWp]: Trace formula consists of 53 conjuncts, 8 conjunts are in the unsatisfiable core [2019-11-28 02:46:56,697 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 02:46:56,739 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 6 treesize of output 5 [2019-11-28 02:46:56,740 INFO L508 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-28 02:46:56,761 INFO L588 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-28 02:46:56,762 INFO L508 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-28 02:46:56,762 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:13, output treesize:12 [2019-11-28 02:46:56,773 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 02:46:56,773 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-28 02:46:56,774 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 3] total 4 [2019-11-28 02:46:56,774 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2065248915] [2019-11-28 02:46:56,775 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-28 02:46:56,775 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 02:46:56,775 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-28 02:46:56,775 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-28 02:46:56,776 INFO L87 Difference]: Start difference. First operand 27 states and 28 transitions. Second operand 5 states. [2019-11-28 02:46:56,862 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 02:46:56,862 INFO L93 Difference]: Finished difference Result 30 states and 31 transitions. [2019-11-28 02:46:56,863 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-28 02:46:56,863 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 12 [2019-11-28 02:46:56,863 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 02:46:56,864 INFO L225 Difference]: With dead ends: 30 [2019-11-28 02:46:56,864 INFO L226 Difference]: Without dead ends: 30 [2019-11-28 02:46:56,864 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 11 SyntacticMatches, 2 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-28 02:46:56,865 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2019-11-28 02:46:56,868 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 28. [2019-11-28 02:46:56,868 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2019-11-28 02:46:56,869 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 29 transitions. [2019-11-28 02:46:56,869 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 29 transitions. Word has length 12 [2019-11-28 02:46:56,869 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 02:46:56,870 INFO L462 AbstractCegarLoop]: Abstraction has 28 states and 29 transitions. [2019-11-28 02:46:56,870 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-28 02:46:56,870 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 29 transitions. [2019-11-28 02:46:56,870 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-11-28 02:46:56,871 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 02:46:56,871 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 02:46:57,080 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 02:46:57,081 INFO L410 AbstractCegarLoop]: === Iteration 7 === [mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr8ENSURES_VIOLATIONMEMORY_LEAK]=== [2019-11-28 02:46:57,082 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 02:46:57,082 INFO L82 PathProgramCache]: Analyzing trace with hash 601374252, now seen corresponding path program 2 times [2019-11-28 02:46:57,082 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 02:46:57,082 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [710419555] [2019-11-28 02:46:57,083 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 02:46:57,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:46:57,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:46:57,156 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 02:46:57,157 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [710419555] [2019-11-28 02:46:57,158 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2044325604] [2019-11-28 02:46:57,158 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 02:46:57,195 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2019-11-28 02:46:57,196 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-28 02:46:57,197 INFO L255 TraceCheckSpWp]: Trace formula consists of 40 conjuncts, 4 conjunts are in the unsatisfiable core [2019-11-28 02:46:57,198 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 02:46:57,209 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 6 treesize of output 5 [2019-11-28 02:46:57,212 INFO L508 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-28 02:46:57,220 INFO L588 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-28 02:46:57,221 INFO L508 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-28 02:46:57,221 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2019-11-28 02:46:57,238 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-11-28 02:46:57,239 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-11-28 02:46:57,240 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [6] total 7 [2019-11-28 02:46:57,240 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1839349113] [2019-11-28 02:46:57,241 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-28 02:46:57,242 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 02:46:57,243 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 02:46:57,243 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2019-11-28 02:46:57,244 INFO L87 Difference]: Start difference. First operand 28 states and 29 transitions. Second operand 3 states. [2019-11-28 02:46:57,264 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 02:46:57,265 INFO L93 Difference]: Finished difference Result 25 states and 26 transitions. [2019-11-28 02:46:57,265 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 02:46:57,266 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 16 [2019-11-28 02:46:57,266 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 02:46:57,266 INFO L225 Difference]: With dead ends: 25 [2019-11-28 02:46:57,267 INFO L226 Difference]: Without dead ends: 25 [2019-11-28 02:46:57,267 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2019-11-28 02:46:57,268 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2019-11-28 02:46:57,272 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 25. [2019-11-28 02:46:57,273 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2019-11-28 02:46:57,274 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 26 transitions. [2019-11-28 02:46:57,279 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 26 transitions. Word has length 16 [2019-11-28 02:46:57,280 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 02:46:57,280 INFO L462 AbstractCegarLoop]: Abstraction has 25 states and 26 transitions. [2019-11-28 02:46:57,280 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-28 02:46:57,281 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 26 transitions. [2019-11-28 02:46:57,281 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-11-28 02:46:57,282 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 02:46:57,282 INFO L410 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 02:46:57,492 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 02:46:57,492 INFO L410 AbstractCegarLoop]: === Iteration 8 === [mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr8ENSURES_VIOLATIONMEMORY_LEAK]=== [2019-11-28 02:46:57,493 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 02:46:57,493 INFO L82 PathProgramCache]: Analyzing trace with hash 601374302, now seen corresponding path program 2 times [2019-11-28 02:46:57,494 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 02:46:57,495 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1353090135] [2019-11-28 02:46:57,495 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 02:46:57,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:46:57,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:46:57,629 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 02:46:57,630 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1353090135] [2019-11-28 02:46:57,631 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [795493397] [2019-11-28 02:46:57,631 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 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 02:46:57,673 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-11-28 02:46:57,674 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-28 02:46:57,675 INFO L255 TraceCheckSpWp]: Trace formula consists of 64 conjuncts, 8 conjunts are in the unsatisfiable core [2019-11-28 02:46:57,676 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 02:46:57,685 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 6 treesize of output 5 [2019-11-28 02:46:57,689 INFO L508 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-28 02:46:57,699 INFO L588 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-28 02:46:57,699 INFO L508 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-28 02:46:57,700 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:13, output treesize:12 [2019-11-28 02:46:57,782 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 02:46:57,783 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-11-28 02:46:57,783 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [5] total 9 [2019-11-28 02:46:57,783 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1160116629] [2019-11-28 02:46:57,784 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-28 02:46:57,784 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 02:46:57,784 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-28 02:46:57,785 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2019-11-28 02:46:57,785 INFO L87 Difference]: Start difference. First operand 25 states and 26 transitions. Second operand 6 states. [2019-11-28 02:46:57,845 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 02:46:57,845 INFO L93 Difference]: Finished difference Result 26 states and 27 transitions. [2019-11-28 02:46:57,846 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-28 02:46:57,846 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 16 [2019-11-28 02:46:57,846 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 02:46:57,846 INFO L225 Difference]: With dead ends: 26 [2019-11-28 02:46:57,847 INFO L226 Difference]: Without dead ends: 26 [2019-11-28 02:46:57,847 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2019-11-28 02:46:57,848 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2019-11-28 02:46:57,850 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 23. [2019-11-28 02:46:57,850 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2019-11-28 02:46:57,850 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 24 transitions. [2019-11-28 02:46:57,851 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 24 transitions. Word has length 16 [2019-11-28 02:46:57,851 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 02:46:57,851 INFO L462 AbstractCegarLoop]: Abstraction has 23 states and 24 transitions. [2019-11-28 02:46:57,851 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-28 02:46:57,851 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 24 transitions. [2019-11-28 02:46:57,852 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-11-28 02:46:57,852 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 02:46:57,852 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 02:46:58,055 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 02:46:58,056 INFO L410 AbstractCegarLoop]: === Iteration 9 === [mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr8ENSURES_VIOLATIONMEMORY_LEAK]=== [2019-11-28 02:46:58,057 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 02:46:58,057 INFO L82 PathProgramCache]: Analyzing trace with hash 1231721335, now seen corresponding path program 1 times [2019-11-28 02:46:58,057 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 02:46:58,058 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [843595468] [2019-11-28 02:46:58,058 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 02:46:58,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:46:58,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:46:58,122 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 02:46:58,122 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [843595468] [2019-11-28 02:46:58,123 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [83065771] [2019-11-28 02:46:58,123 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 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 02:46:58,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:46:58,167 INFO L255 TraceCheckSpWp]: Trace formula consists of 72 conjuncts, 4 conjunts are in the unsatisfiable core [2019-11-28 02:46:58,171 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 02:46:58,194 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 02:46:58,194 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-28 02:46:58,195 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5] total 7 [2019-11-28 02:46:58,195 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1796831741] [2019-11-28 02:46:58,198 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-11-28 02:46:58,198 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 02:46:58,199 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-11-28 02:46:58,199 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-11-28 02:46:58,199 INFO L87 Difference]: Start difference. First operand 23 states and 24 transitions. Second operand 7 states. [2019-11-28 02:46:58,262 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 02:46:58,262 INFO L93 Difference]: Finished difference Result 30 states and 31 transitions. [2019-11-28 02:46:58,263 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-28 02:46:58,263 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 19 [2019-11-28 02:46:58,263 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 02:46:58,264 INFO L225 Difference]: With dead ends: 30 [2019-11-28 02:46:58,264 INFO L226 Difference]: Without dead ends: 30 [2019-11-28 02:46:58,264 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-11-28 02:46:58,265 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2019-11-28 02:46:58,268 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 27. [2019-11-28 02:46:58,268 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2019-11-28 02:46:58,269 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 28 transitions. [2019-11-28 02:46:58,269 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 28 transitions. Word has length 19 [2019-11-28 02:46:58,269 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 02:46:58,269 INFO L462 AbstractCegarLoop]: Abstraction has 27 states and 28 transitions. [2019-11-28 02:46:58,270 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-11-28 02:46:58,270 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 28 transitions. [2019-11-28 02:46:58,270 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-11-28 02:46:58,270 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 02:46:58,271 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 02:46:58,477 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 02:46:58,477 INFO L410 AbstractCegarLoop]: === Iteration 10 === [mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr8ENSURES_VIOLATIONMEMORY_LEAK]=== [2019-11-28 02:46:58,478 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 02:46:58,478 INFO L82 PathProgramCache]: Analyzing trace with hash -615550124, now seen corresponding path program 2 times [2019-11-28 02:46:58,478 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 02:46:58,478 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [83440429] [2019-11-28 02:46:58,478 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 02:46:58,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:46:58,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:46:58,556 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 02:46:58,557 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [83440429] [2019-11-28 02:46:58,557 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1885174516] [2019-11-28 02:46:58,557 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 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 02:46:58,587 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2019-11-28 02:46:58,587 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-28 02:46:58,588 INFO L255 TraceCheckSpWp]: Trace formula consists of 50 conjuncts, 6 conjunts are in the unsatisfiable core [2019-11-28 02:46:58,590 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 02:46:58,635 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2019-11-28 02:46:58,635 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-11-28 02:46:58,635 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [7] total 10 [2019-11-28 02:46:58,636 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [640588970] [2019-11-28 02:46:58,636 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-28 02:46:58,636 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 02:46:58,636 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-28 02:46:58,637 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2019-11-28 02:46:58,637 INFO L87 Difference]: Start difference. First operand 27 states and 28 transitions. Second operand 5 states. [2019-11-28 02:46:58,666 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 02:46:58,667 INFO L93 Difference]: Finished difference Result 26 states and 27 transitions. [2019-11-28 02:46:58,667 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-28 02:46:58,667 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 23 [2019-11-28 02:46:58,667 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 02:46:58,667 INFO L225 Difference]: With dead ends: 26 [2019-11-28 02:46:58,668 INFO L226 Difference]: Without dead ends: 0 [2019-11-28 02:46:58,668 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2019-11-28 02:46:58,668 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-11-28 02:46:58,668 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-11-28 02:46:58,669 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-11-28 02:46:58,669 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-11-28 02:46:58,669 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 23 [2019-11-28 02:46:58,669 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 02:46:58,669 INFO L462 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-11-28 02:46:58,670 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-28 02:46:58,670 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-11-28 02:46:58,670 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-11-28 02:46:58,870 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 02:46:58,877 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 28.11 02:46:58 BoogieIcfgContainer [2019-11-28 02:46:58,878 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-11-28 02:46:58,878 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-11-28 02:46:58,878 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-11-28 02:46:58,878 INFO L275 PluginConnector]: Witness Printer initialized [2019-11-28 02:46:58,880 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 02:46:55" (3/4) ... [2019-11-28 02:46:58,883 INFO L137 WitnessPrinter]: Generating witness for correct program [2019-11-28 02:46:58,889 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ULTIMATE.init [2019-11-28 02:46:58,890 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure main [2019-11-28 02:46:58,894 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 9 nodes and edges [2019-11-28 02:46:58,894 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2019-11-28 02:46:58,894 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2019-11-28 02:46:58,894 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2019-11-28 02:46:58,932 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2019-11-28 02:46:58,932 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-11-28 02:46:58,934 INFO L168 Benchmark]: Toolchain (without parser) took 4584.52 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 143.1 MB). Free memory was 955.0 MB in the beginning and 868.1 MB in the end (delta: 86.9 MB). Peak memory consumption was 230.0 MB. Max. memory is 11.5 GB. [2019-11-28 02:46:58,934 INFO L168 Benchmark]: CDTParser took 0.28 ms. Allocated memory is still 1.0 GB. Free memory is still 981.8 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-28 02:46:58,935 INFO L168 Benchmark]: CACSL2BoogieTranslator took 279.82 ms. Allocated memory is still 1.0 GB. Free memory was 955.0 MB in the beginning and 944.2 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. [2019-11-28 02:46:58,936 INFO L168 Benchmark]: Boogie Preprocessor took 113.82 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 143.1 MB). Free memory was 944.2 MB in the beginning and 1.1 GB in the end (delta: -189.0 MB). Peak memory consumption was 9.6 MB. Max. memory is 11.5 GB. [2019-11-28 02:46:58,936 INFO L168 Benchmark]: RCFGBuilder took 331.05 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 19.2 MB). Peak memory consumption was 19.2 MB. Max. memory is 11.5 GB. [2019-11-28 02:46:58,937 INFO L168 Benchmark]: TraceAbstraction took 3795.07 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 874.7 MB in the end (delta: 239.4 MB). Peak memory consumption was 239.4 MB. Max. memory is 11.5 GB. [2019-11-28 02:46:58,937 INFO L168 Benchmark]: Witness Printer took 54.31 ms. Allocated memory is still 1.2 GB. Free memory was 874.7 MB in the beginning and 868.1 MB in the end (delta: 6.6 MB). Peak memory consumption was 6.6 MB. Max. memory is 11.5 GB. [2019-11-28 02:46:58,941 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.28 ms. Allocated memory is still 1.0 GB. Free memory is still 981.8 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 279.82 ms. Allocated memory is still 1.0 GB. Free memory was 955.0 MB in the beginning and 944.2 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 113.82 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 143.1 MB). Free memory was 944.2 MB in the beginning and 1.1 GB in the end (delta: -189.0 MB). Peak memory consumption was 9.6 MB. Max. memory is 11.5 GB. * RCFGBuilder took 331.05 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 19.2 MB). Peak memory consumption was 19.2 MB. Max. memory is 11.5 GB. * TraceAbstraction took 3795.07 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 874.7 MB in the end (delta: 239.4 MB). Peak memory consumption was 239.4 MB. Max. memory is 11.5 GB. * Witness Printer took 54.31 ms. Allocated memory is still 1.2 GB. Free memory was 874.7 MB in the beginning and 868.1 MB in the end (delta: 6.6 MB). Peak memory consumption was 6.6 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 17]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 17]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 18]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 18]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 14]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 14]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 18]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 18]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 10]: all allocated memory was freed For all program executions holds that all allocated memory was freed at this location - AllSpecificationsHoldResult: All specifications hold 9 specifications checked. All of them hold - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 29 locations, 9 error locations. Result: SAFE, OverallTime: 3.7s, OverallIterations: 10, TraceHistogramMax: 3, AutomataDifference: 0.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 170 SDtfs, 68 SDslu, 173 SDs, 0 SdLazy, 331 SolverSat, 18 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.4s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 148 GetRequests, 106 SyntacticMatches, 2 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=29occurred in iteration=0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 10 MinimizatonAttempts, 20 StatesRemovedByMinimization, 6 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 1.0s InterpolantComputationTime, 228 NumberOfCodeBlocks, 208 NumberOfCodeBlocksAsserted, 17 NumberOfCheckSat, 212 ConstructedInterpolants, 1 QuantifiedInterpolants, 16789 SizeOfPredicates, 2 NumberOfNonLiveVariables, 330 ConjunctsInSsa, 33 ConjunctsInUnsatCore, 16 InterpolantComputations, 7 PerfectInterpolantSequences, 29/76 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...