./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/verifythis/duplets.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/verifythis/duplets.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 c261d11d6e37ef6eda45455c8074b5a0eac3352b ......................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... 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:06:30,240 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-28 20:06:30,242 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-28 20:06:30,260 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-28 20:06:30,261 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-28 20:06:30,263 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-28 20:06:30,265 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-28 20:06:30,274 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-28 20:06:30,281 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-28 20:06:30,284 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-28 20:06:30,285 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-28 20:06:30,288 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-28 20:06:30,288 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-28 20:06:30,292 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-28 20:06:30,294 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-28 20:06:30,297 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-28 20:06:30,299 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-28 20:06:30,300 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-28 20:06:30,303 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-28 20:06:30,307 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-28 20:06:30,313 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-28 20:06:30,316 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-28 20:06:30,318 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-28 20:06:30,320 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-28 20:06:30,324 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-28 20:06:30,325 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-28 20:06:30,325 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-28 20:06:30,327 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-28 20:06:30,328 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-28 20:06:30,329 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-28 20:06:30,329 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-28 20:06:30,330 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-28 20:06:30,330 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-28 20:06:30,332 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-28 20:06:30,333 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-28 20:06:30,333 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-28 20:06:30,334 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-28 20:06:30,335 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-28 20:06:30,335 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-28 20:06:30,337 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-28 20:06:30,339 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-28 20:06:30,340 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:06:30,367 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-28 20:06:30,368 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-28 20:06:30,369 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-28 20:06:30,370 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-28 20:06:30,370 INFO L138 SettingsManager]: * Use SBE=true [2019-11-28 20:06:30,370 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-28 20:06:30,370 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-28 20:06:30,371 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-11-28 20:06:30,371 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-28 20:06:30,371 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-28 20:06:30,372 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-28 20:06:30,372 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2019-11-28 20:06:30,372 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2019-11-28 20:06:30,373 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2019-11-28 20:06:30,373 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-28 20:06:30,373 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2019-11-28 20:06:30,373 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-28 20:06:30,374 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-28 20:06:30,374 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-28 20:06:30,374 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-28 20:06:30,375 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-28 20:06:30,375 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-28 20:06:30,375 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-28 20:06:30,376 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-28 20:06:30,376 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-28 20:06:30,376 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-28 20:06:30,376 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-28 20:06:30,377 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2019-11-28 20:06:30,377 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 -> c261d11d6e37ef6eda45455c8074b5a0eac3352b [2019-11-28 20:06:30,725 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-28 20:06:30,748 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-28 20:06:30,752 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-28 20:06:30,753 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-28 20:06:30,754 INFO L275 PluginConnector]: CDTParser initialized [2019-11-28 20:06:30,756 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/verifythis/duplets.c [2019-11-28 20:06:30,832 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8850dc7a3/e25c1723b3244130a74418a32faf492c/FLAG149b59a83 [2019-11-28 20:06:31,308 INFO L306 CDTParser]: Found 1 translation units. [2019-11-28 20:06:31,309 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/verifythis/duplets.c [2019-11-28 20:06:31,315 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8850dc7a3/e25c1723b3244130a74418a32faf492c/FLAG149b59a83 [2019-11-28 20:06:31,725 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8850dc7a3/e25c1723b3244130a74418a32faf492c [2019-11-28 20:06:31,729 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-28 20:06:31,731 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-11-28 20:06:31,732 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-28 20:06:31,732 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-28 20:06:31,736 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-28 20:06:31,737 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 08:06:31" (1/1) ... [2019-11-28 20:06:31,740 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@79eb6408 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:06:31, skipping insertion in model container [2019-11-28 20:06:31,740 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 08:06:31" (1/1) ... [2019-11-28 20:06:31,748 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-11-28 20:06:31,769 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-11-28 20:06:31,978 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-28 20:06:31,990 INFO L203 MainTranslator]: Completed pre-run [2019-11-28 20:06:32,012 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-28 20:06:32,090 INFO L208 MainTranslator]: Completed translation [2019-11-28 20:06:32,091 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:06:32 WrapperNode [2019-11-28 20:06:32,091 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-28 20:06:32,092 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-28 20:06:32,092 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-28 20:06:32,092 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-28 20:06:32,104 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:06:32" (1/1) ... [2019-11-28 20:06:32,104 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:06:32" (1/1) ... [2019-11-28 20:06:32,113 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:06:32" (1/1) ... [2019-11-28 20:06:32,113 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:06:32" (1/1) ... [2019-11-28 20:06:32,134 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:06:32" (1/1) ... [2019-11-28 20:06:32,139 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:06:32" (1/1) ... [2019-11-28 20:06:32,141 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:06:32" (1/1) ... [2019-11-28 20:06:32,147 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-28 20:06:32,147 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-28 20:06:32,148 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-28 20:06:32,148 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-28 20:06:32,149 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:06:32" (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:06:32,202 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-11-28 20:06:32,202 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-28 20:06:32,202 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2019-11-28 20:06:32,202 INFO L138 BoogieDeclarations]: Found implementation of procedure mkdup [2019-11-28 20:06:32,203 INFO L138 BoogieDeclarations]: Found implementation of procedure finddup [2019-11-28 20:06:32,204 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-11-28 20:06:32,204 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.meminit [2019-11-28 20:06:32,205 INFO L130 BoogieDeclarations]: Found specification of procedure calloc [2019-11-28 20:06:32,206 INFO L130 BoogieDeclarations]: Found specification of procedure free [2019-11-28 20:06:32,206 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-11-28 20:06:32,207 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2019-11-28 20:06:32,207 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-11-28 20:06:32,208 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assume [2019-11-28 20:06:32,208 INFO L130 BoogieDeclarations]: Found specification of procedure mkdup [2019-11-28 20:06:32,208 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-11-28 20:06:32,208 INFO L130 BoogieDeclarations]: Found specification of procedure finddup [2019-11-28 20:06:32,211 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-11-28 20:06:32,211 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-11-28 20:06:32,211 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-11-28 20:06:32,212 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-11-28 20:06:32,212 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.meminit [2019-11-28 20:06:32,212 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-11-28 20:06:32,212 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-11-28 20:06:32,212 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-28 20:06:32,724 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-28 20:06:32,725 INFO L287 CfgBuilder]: Removed 2 assume(true) statements. [2019-11-28 20:06:32,726 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 08:06:32 BoogieIcfgContainer [2019-11-28 20:06:32,726 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-28 20:06:32,728 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-28 20:06:32,728 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-28 20:06:32,731 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-28 20:06:32,732 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.11 08:06:31" (1/3) ... [2019-11-28 20:06:32,733 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7c0f009d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.11 08:06:32, skipping insertion in model container [2019-11-28 20:06:32,733 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:06:32" (2/3) ... [2019-11-28 20:06:32,734 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7c0f009d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.11 08:06:32, skipping insertion in model container [2019-11-28 20:06:32,734 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 08:06:32" (3/3) ... [2019-11-28 20:06:32,736 INFO L109 eAbstractionObserver]: Analyzing ICFG duplets.c [2019-11-28 20:06:32,746 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-28 20:06:32,755 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 36 error locations. [2019-11-28 20:06:32,768 INFO L249 AbstractCegarLoop]: Starting to check reachability of 36 error locations. [2019-11-28 20:06:32,789 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-28 20:06:32,790 INFO L374 AbstractCegarLoop]: Hoare is false [2019-11-28 20:06:32,790 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-28 20:06:32,790 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-28 20:06:32,790 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-28 20:06:32,791 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-28 20:06:32,791 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-28 20:06:32,791 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-28 20:06:32,814 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states. [2019-11-28 20:06:32,824 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-11-28 20:06:32,825 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 20:06:32,826 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 20:06:32,827 INFO L410 AbstractCegarLoop]: === Iteration 1 === [finddupErr1REQUIRES_VIOLATION, finddupErr6REQUIRES_VIOLATION, finddupErr7REQUIRES_VIOLATION, finddupErr5REQUIRES_VIOLATION, finddupErr0REQUIRES_VIOLATION, finddupErr4REQUIRES_VIOLATION, finddupErr2REQUIRES_VIOLATION, finddupErr3REQUIRES_VIOLATION, mkdupErr0REQUIRES_VIOLATION, mkdupErr1REQUIRES_VIOLATION, mkdupErr3REQUIRES_VIOLATION, mkdupErr2REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr22ASSERT_VIOLATIONMEMORY_FREE, mainErr20ASSERT_VIOLATIONMEMORY_FREE, mainErr21ASSERT_VIOLATIONMEMORY_FREE, mainErr23ENSURES_VIOLATIONMEMORY_LEAK, mainErr5REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION]=== [2019-11-28 20:06:32,833 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 20:06:32,833 INFO L82 PathProgramCache]: Analyzing trace with hash -115732399, now seen corresponding path program 1 times [2019-11-28 20:06:32,843 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 20:06:32,844 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1959092167] [2019-11-28 20:06:32,844 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 20:06:32,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:06:33,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:06:33,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:06:33,151 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:06:33,152 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1959092167] [2019-11-28 20:06:33,153 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 20:06:33,154 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-11-28 20:06:33,155 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [292926948] [2019-11-28 20:06:33,161 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-11-28 20:06:33,162 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 20:06:33,180 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-11-28 20:06:33,182 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2019-11-28 20:06:33,184 INFO L87 Difference]: Start difference. First operand 106 states. Second operand 8 states. [2019-11-28 20:06:33,901 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 20:06:33,901 INFO L93 Difference]: Finished difference Result 103 states and 111 transitions. [2019-11-28 20:06:33,902 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-11-28 20:06:33,904 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 14 [2019-11-28 20:06:33,905 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 20:06:33,917 INFO L225 Difference]: With dead ends: 103 [2019-11-28 20:06:33,917 INFO L226 Difference]: Without dead ends: 100 [2019-11-28 20:06:33,920 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=45, Invalid=137, Unknown=0, NotChecked=0, Total=182 [2019-11-28 20:06:33,942 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2019-11-28 20:06:33,984 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 98. [2019-11-28 20:06:33,986 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 98 states. [2019-11-28 20:06:33,991 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 106 transitions. [2019-11-28 20:06:33,993 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 106 transitions. Word has length 14 [2019-11-28 20:06:33,993 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 20:06:33,994 INFO L462 AbstractCegarLoop]: Abstraction has 98 states and 106 transitions. [2019-11-28 20:06:33,994 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-11-28 20:06:33,994 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 106 transitions. [2019-11-28 20:06:33,995 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-11-28 20:06:33,995 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 20:06:33,995 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 20:06:33,996 INFO L410 AbstractCegarLoop]: === Iteration 2 === [finddupErr1REQUIRES_VIOLATION, finddupErr6REQUIRES_VIOLATION, finddupErr7REQUIRES_VIOLATION, finddupErr5REQUIRES_VIOLATION, finddupErr0REQUIRES_VIOLATION, finddupErr4REQUIRES_VIOLATION, finddupErr2REQUIRES_VIOLATION, finddupErr3REQUIRES_VIOLATION, mkdupErr0REQUIRES_VIOLATION, mkdupErr1REQUIRES_VIOLATION, mkdupErr3REQUIRES_VIOLATION, mkdupErr2REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr22ASSERT_VIOLATIONMEMORY_FREE, mainErr20ASSERT_VIOLATIONMEMORY_FREE, mainErr21ASSERT_VIOLATIONMEMORY_FREE, mainErr23ENSURES_VIOLATIONMEMORY_LEAK, mainErr5REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION]=== [2019-11-28 20:06:33,996 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 20:06:33,997 INFO L82 PathProgramCache]: Analyzing trace with hash -115732398, now seen corresponding path program 1 times [2019-11-28 20:06:33,997 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 20:06:33,997 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1117855602] [2019-11-28 20:06:33,998 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 20:06:34,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:06:34,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:06:34,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:06:34,208 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:06:34,208 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1117855602] [2019-11-28 20:06:34,209 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 20:06:34,209 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-11-28 20:06:34,209 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1272581752] [2019-11-28 20:06:34,211 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-11-28 20:06:34,212 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 20:06:34,212 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-11-28 20:06:34,212 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2019-11-28 20:06:34,213 INFO L87 Difference]: Start difference. First operand 98 states and 106 transitions. Second operand 8 states. [2019-11-28 20:06:34,789 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 20:06:34,790 INFO L93 Difference]: Finished difference Result 99 states and 107 transitions. [2019-11-28 20:06:34,790 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-11-28 20:06:34,791 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 14 [2019-11-28 20:06:34,791 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 20:06:34,793 INFO L225 Difference]: With dead ends: 99 [2019-11-28 20:06:34,793 INFO L226 Difference]: Without dead ends: 99 [2019-11-28 20:06:34,794 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=45, Invalid=137, Unknown=0, NotChecked=0, Total=182 [2019-11-28 20:06:34,795 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2019-11-28 20:06:34,802 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 97. [2019-11-28 20:06:34,803 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 97 states. [2019-11-28 20:06:34,805 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 105 transitions. [2019-11-28 20:06:34,805 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 105 transitions. Word has length 14 [2019-11-28 20:06:34,805 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 20:06:34,806 INFO L462 AbstractCegarLoop]: Abstraction has 97 states and 105 transitions. [2019-11-28 20:06:34,806 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-11-28 20:06:34,806 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 105 transitions. [2019-11-28 20:06:34,807 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-11-28 20:06:34,807 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 20:06:34,807 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 20:06:34,808 INFO L410 AbstractCegarLoop]: === Iteration 3 === [finddupErr1REQUIRES_VIOLATION, finddupErr6REQUIRES_VIOLATION, finddupErr7REQUIRES_VIOLATION, finddupErr5REQUIRES_VIOLATION, finddupErr0REQUIRES_VIOLATION, finddupErr4REQUIRES_VIOLATION, finddupErr2REQUIRES_VIOLATION, finddupErr3REQUIRES_VIOLATION, mkdupErr0REQUIRES_VIOLATION, mkdupErr1REQUIRES_VIOLATION, mkdupErr3REQUIRES_VIOLATION, mkdupErr2REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr22ASSERT_VIOLATIONMEMORY_FREE, mainErr20ASSERT_VIOLATIONMEMORY_FREE, mainErr21ASSERT_VIOLATIONMEMORY_FREE, mainErr23ENSURES_VIOLATIONMEMORY_LEAK, mainErr5REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION]=== [2019-11-28 20:06:34,808 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 20:06:34,809 INFO L82 PathProgramCache]: Analyzing trace with hash 707263019, now seen corresponding path program 1 times [2019-11-28 20:06:34,809 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 20:06:34,809 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1080040997] [2019-11-28 20:06:34,810 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 20:06:34,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:06:34,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:06:35,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:06:35,006 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:06:35,007 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1080040997] [2019-11-28 20:06:35,007 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 20:06:35,008 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-11-28 20:06:35,008 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [735594191] [2019-11-28 20:06:35,009 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-11-28 20:06:35,009 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 20:06:35,009 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-11-28 20:06:35,010 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2019-11-28 20:06:35,010 INFO L87 Difference]: Start difference. First operand 97 states and 105 transitions. Second operand 8 states. [2019-11-28 20:06:35,587 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 20:06:35,587 INFO L93 Difference]: Finished difference Result 98 states and 106 transitions. [2019-11-28 20:06:35,588 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-11-28 20:06:35,588 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 15 [2019-11-28 20:06:35,588 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 20:06:35,591 INFO L225 Difference]: With dead ends: 98 [2019-11-28 20:06:35,591 INFO L226 Difference]: Without dead ends: 98 [2019-11-28 20:06:35,592 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=45, Invalid=137, Unknown=0, NotChecked=0, Total=182 [2019-11-28 20:06:35,593 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2019-11-28 20:06:35,601 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 96. [2019-11-28 20:06:35,601 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 96 states. [2019-11-28 20:06:35,603 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 104 transitions. [2019-11-28 20:06:35,603 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 104 transitions. Word has length 15 [2019-11-28 20:06:35,604 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 20:06:35,604 INFO L462 AbstractCegarLoop]: Abstraction has 96 states and 104 transitions. [2019-11-28 20:06:35,604 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-11-28 20:06:35,605 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 104 transitions. [2019-11-28 20:06:35,605 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-11-28 20:06:35,606 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 20:06:35,606 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 20:06:35,607 INFO L410 AbstractCegarLoop]: === Iteration 4 === [finddupErr1REQUIRES_VIOLATION, finddupErr6REQUIRES_VIOLATION, finddupErr7REQUIRES_VIOLATION, finddupErr5REQUIRES_VIOLATION, finddupErr0REQUIRES_VIOLATION, finddupErr4REQUIRES_VIOLATION, finddupErr2REQUIRES_VIOLATION, finddupErr3REQUIRES_VIOLATION, mkdupErr0REQUIRES_VIOLATION, mkdupErr1REQUIRES_VIOLATION, mkdupErr3REQUIRES_VIOLATION, mkdupErr2REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr22ASSERT_VIOLATIONMEMORY_FREE, mainErr20ASSERT_VIOLATIONMEMORY_FREE, mainErr21ASSERT_VIOLATIONMEMORY_FREE, mainErr23ENSURES_VIOLATIONMEMORY_LEAK, mainErr5REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION]=== [2019-11-28 20:06:35,607 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 20:06:35,607 INFO L82 PathProgramCache]: Analyzing trace with hash 1976745985, now seen corresponding path program 1 times [2019-11-28 20:06:35,608 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 20:06:35,608 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2028629460] [2019-11-28 20:06:35,608 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 20:06:35,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:06:35,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:06:35,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:06:35,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:06:35,819 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:06:35,820 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2028629460] [2019-11-28 20:06:35,820 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 20:06:35,820 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-11-28 20:06:35,821 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1690754588] [2019-11-28 20:06:35,821 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-11-28 20:06:35,821 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 20:06:35,822 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-11-28 20:06:35,822 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2019-11-28 20:06:35,822 INFO L87 Difference]: Start difference. First operand 96 states and 104 transitions. Second operand 8 states. [2019-11-28 20:06:36,324 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 20:06:36,324 INFO L93 Difference]: Finished difference Result 96 states and 104 transitions. [2019-11-28 20:06:36,324 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-11-28 20:06:36,325 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 23 [2019-11-28 20:06:36,325 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 20:06:36,326 INFO L225 Difference]: With dead ends: 96 [2019-11-28 20:06:36,326 INFO L226 Difference]: Without dead ends: 96 [2019-11-28 20:06:36,327 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 6 SyntacticMatches, 1 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=45, Invalid=137, Unknown=0, NotChecked=0, Total=182 [2019-11-28 20:06:36,327 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2019-11-28 20:06:36,333 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 94. [2019-11-28 20:06:36,333 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 94 states. [2019-11-28 20:06:36,334 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 102 transitions. [2019-11-28 20:06:36,335 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 102 transitions. Word has length 23 [2019-11-28 20:06:36,335 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 20:06:36,335 INFO L462 AbstractCegarLoop]: Abstraction has 94 states and 102 transitions. [2019-11-28 20:06:36,335 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-11-28 20:06:36,335 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 102 transitions. [2019-11-28 20:06:36,336 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-11-28 20:06:36,336 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 20:06:36,336 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 20:06:36,337 INFO L410 AbstractCegarLoop]: === Iteration 5 === [finddupErr1REQUIRES_VIOLATION, finddupErr6REQUIRES_VIOLATION, finddupErr7REQUIRES_VIOLATION, finddupErr5REQUIRES_VIOLATION, finddupErr0REQUIRES_VIOLATION, finddupErr4REQUIRES_VIOLATION, finddupErr2REQUIRES_VIOLATION, finddupErr3REQUIRES_VIOLATION, mkdupErr0REQUIRES_VIOLATION, mkdupErr1REQUIRES_VIOLATION, mkdupErr3REQUIRES_VIOLATION, mkdupErr2REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr22ASSERT_VIOLATIONMEMORY_FREE, mainErr20ASSERT_VIOLATIONMEMORY_FREE, mainErr21ASSERT_VIOLATIONMEMORY_FREE, mainErr23ENSURES_VIOLATIONMEMORY_LEAK, mainErr5REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION]=== [2019-11-28 20:06:36,337 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 20:06:36,337 INFO L82 PathProgramCache]: Analyzing trace with hash 1976745986, now seen corresponding path program 1 times [2019-11-28 20:06:36,337 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 20:06:36,338 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2081090449] [2019-11-28 20:06:36,338 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 20:06:36,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:06:36,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:06:36,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:06:36,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:06:36,523 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:06:36,524 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2081090449] [2019-11-28 20:06:36,524 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 20:06:36,524 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-11-28 20:06:36,525 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1607640973] [2019-11-28 20:06:36,525 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-11-28 20:06:36,526 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 20:06:36,526 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-11-28 20:06:36,526 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=90, Unknown=0, NotChecked=0, Total=110 [2019-11-28 20:06:36,527 INFO L87 Difference]: Start difference. First operand 94 states and 102 transitions. Second operand 11 states. [2019-11-28 20:06:37,566 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 20:06:37,566 INFO L93 Difference]: Finished difference Result 116 states and 128 transitions. [2019-11-28 20:06:37,566 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-11-28 20:06:37,567 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 23 [2019-11-28 20:06:37,567 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 20:06:37,569 INFO L225 Difference]: With dead ends: 116 [2019-11-28 20:06:37,569 INFO L226 Difference]: Without dead ends: 116 [2019-11-28 20:06:37,570 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 35 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=86, Invalid=294, Unknown=0, NotChecked=0, Total=380 [2019-11-28 20:06:37,571 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116 states. [2019-11-28 20:06:37,577 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116 to 98. [2019-11-28 20:06:37,577 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 98 states. [2019-11-28 20:06:37,578 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 110 transitions. [2019-11-28 20:06:37,578 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 110 transitions. Word has length 23 [2019-11-28 20:06:37,579 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 20:06:37,579 INFO L462 AbstractCegarLoop]: Abstraction has 98 states and 110 transitions. [2019-11-28 20:06:37,579 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-11-28 20:06:37,579 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 110 transitions. [2019-11-28 20:06:37,580 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-11-28 20:06:37,580 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 20:06:37,580 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 20:06:37,580 INFO L410 AbstractCegarLoop]: === Iteration 6 === [finddupErr1REQUIRES_VIOLATION, finddupErr6REQUIRES_VIOLATION, finddupErr7REQUIRES_VIOLATION, finddupErr5REQUIRES_VIOLATION, finddupErr0REQUIRES_VIOLATION, finddupErr4REQUIRES_VIOLATION, finddupErr2REQUIRES_VIOLATION, finddupErr3REQUIRES_VIOLATION, mkdupErr0REQUIRES_VIOLATION, mkdupErr1REQUIRES_VIOLATION, mkdupErr3REQUIRES_VIOLATION, mkdupErr2REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr22ASSERT_VIOLATIONMEMORY_FREE, mainErr20ASSERT_VIOLATIONMEMORY_FREE, mainErr21ASSERT_VIOLATIONMEMORY_FREE, mainErr23ENSURES_VIOLATIONMEMORY_LEAK, mainErr5REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION]=== [2019-11-28 20:06:37,581 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 20:06:37,581 INFO L82 PathProgramCache]: Analyzing trace with hash 1149583382, now seen corresponding path program 1 times [2019-11-28 20:06:37,581 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 20:06:37,581 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [647571527] [2019-11-28 20:06:37,582 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 20:06:37,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:06:37,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:06:37,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:06:37,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:06:37,808 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:06:37,811 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [647571527] [2019-11-28 20:06:37,811 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 20:06:37,812 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-11-28 20:06:37,812 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2067538943] [2019-11-28 20:06:37,814 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-11-28 20:06:37,814 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 20:06:37,815 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-11-28 20:06:37,815 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=109, Unknown=0, NotChecked=0, Total=132 [2019-11-28 20:06:37,816 INFO L87 Difference]: Start difference. First operand 98 states and 110 transitions. Second operand 12 states. [2019-11-28 20:06:38,740 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 20:06:38,741 INFO L93 Difference]: Finished difference Result 99 states and 110 transitions. [2019-11-28 20:06:38,741 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-11-28 20:06:38,743 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 24 [2019-11-28 20:06:38,743 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 20:06:38,744 INFO L225 Difference]: With dead ends: 99 [2019-11-28 20:06:38,744 INFO L226 Difference]: Without dead ends: 99 [2019-11-28 20:06:38,748 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=95, Invalid=325, Unknown=0, NotChecked=0, Total=420 [2019-11-28 20:06:38,749 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2019-11-28 20:06:38,760 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 97. [2019-11-28 20:06:38,763 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 97 states. [2019-11-28 20:06:38,764 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 108 transitions. [2019-11-28 20:06:38,765 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 108 transitions. Word has length 24 [2019-11-28 20:06:38,768 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 20:06:38,768 INFO L462 AbstractCegarLoop]: Abstraction has 97 states and 108 transitions. [2019-11-28 20:06:38,768 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-11-28 20:06:38,769 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 108 transitions. [2019-11-28 20:06:38,770 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-11-28 20:06:38,770 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 20:06:38,770 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 20:06:38,771 INFO L410 AbstractCegarLoop]: === Iteration 7 === [finddupErr1REQUIRES_VIOLATION, finddupErr6REQUIRES_VIOLATION, finddupErr7REQUIRES_VIOLATION, finddupErr5REQUIRES_VIOLATION, finddupErr0REQUIRES_VIOLATION, finddupErr4REQUIRES_VIOLATION, finddupErr2REQUIRES_VIOLATION, finddupErr3REQUIRES_VIOLATION, mkdupErr0REQUIRES_VIOLATION, mkdupErr1REQUIRES_VIOLATION, mkdupErr3REQUIRES_VIOLATION, mkdupErr2REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr22ASSERT_VIOLATIONMEMORY_FREE, mainErr20ASSERT_VIOLATIONMEMORY_FREE, mainErr21ASSERT_VIOLATIONMEMORY_FREE, mainErr23ENSURES_VIOLATIONMEMORY_LEAK, mainErr5REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION]=== [2019-11-28 20:06:38,773 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 20:06:38,773 INFO L82 PathProgramCache]: Analyzing trace with hash 943033910, now seen corresponding path program 1 times [2019-11-28 20:06:38,773 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 20:06:38,774 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1417409350] [2019-11-28 20:06:38,774 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 20:06:38,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:06:38,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:06:38,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:06:38,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:06:38,893 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:06:38,894 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1417409350] [2019-11-28 20:06:38,894 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 20:06:38,894 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-11-28 20:06:38,895 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1047262689] [2019-11-28 20:06:38,895 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-11-28 20:06:38,896 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 20:06:38,896 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-11-28 20:06:38,896 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-11-28 20:06:38,897 INFO L87 Difference]: Start difference. First operand 97 states and 108 transitions. Second operand 7 states. [2019-11-28 20:06:39,226 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 20:06:39,226 INFO L93 Difference]: Finished difference Result 94 states and 105 transitions. [2019-11-28 20:06:39,227 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-11-28 20:06:39,227 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 26 [2019-11-28 20:06:39,227 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 20:06:39,228 INFO L225 Difference]: With dead ends: 94 [2019-11-28 20:06:39,229 INFO L226 Difference]: Without dead ends: 94 [2019-11-28 20:06:39,229 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2019-11-28 20:06:39,230 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2019-11-28 20:06:39,234 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 92. [2019-11-28 20:06:39,235 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 92 states. [2019-11-28 20:06:39,236 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 103 transitions. [2019-11-28 20:06:39,237 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 103 transitions. Word has length 26 [2019-11-28 20:06:39,237 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 20:06:39,237 INFO L462 AbstractCegarLoop]: Abstraction has 92 states and 103 transitions. [2019-11-28 20:06:39,238 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-11-28 20:06:39,238 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 103 transitions. [2019-11-28 20:06:39,239 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-11-28 20:06:39,239 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 20:06:39,239 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 20:06:39,240 INFO L410 AbstractCegarLoop]: === Iteration 8 === [finddupErr1REQUIRES_VIOLATION, finddupErr6REQUIRES_VIOLATION, finddupErr7REQUIRES_VIOLATION, finddupErr5REQUIRES_VIOLATION, finddupErr0REQUIRES_VIOLATION, finddupErr4REQUIRES_VIOLATION, finddupErr2REQUIRES_VIOLATION, finddupErr3REQUIRES_VIOLATION, mkdupErr0REQUIRES_VIOLATION, mkdupErr1REQUIRES_VIOLATION, mkdupErr3REQUIRES_VIOLATION, mkdupErr2REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr22ASSERT_VIOLATIONMEMORY_FREE, mainErr20ASSERT_VIOLATIONMEMORY_FREE, mainErr21ASSERT_VIOLATIONMEMORY_FREE, mainErr23ENSURES_VIOLATIONMEMORY_LEAK, mainErr5REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION]=== [2019-11-28 20:06:39,240 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 20:06:39,240 INFO L82 PathProgramCache]: Analyzing trace with hash 943033911, now seen corresponding path program 1 times [2019-11-28 20:06:39,240 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 20:06:39,241 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [879772643] [2019-11-28 20:06:39,241 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 20:06:39,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:06:39,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:06:39,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:06:39,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:06:39,355 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:06:39,356 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [879772643] [2019-11-28 20:06:39,356 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 20:06:39,356 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-11-28 20:06:39,357 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1648680119] [2019-11-28 20:06:39,357 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-11-28 20:06:39,358 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 20:06:39,358 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-11-28 20:06:39,358 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-11-28 20:06:39,358 INFO L87 Difference]: Start difference. First operand 92 states and 103 transitions. Second operand 7 states. [2019-11-28 20:06:39,678 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 20:06:39,678 INFO L93 Difference]: Finished difference Result 89 states and 100 transitions. [2019-11-28 20:06:39,679 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-11-28 20:06:39,679 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 26 [2019-11-28 20:06:39,679 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 20:06:39,681 INFO L225 Difference]: With dead ends: 89 [2019-11-28 20:06:39,681 INFO L226 Difference]: Without dead ends: 89 [2019-11-28 20:06:39,681 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2019-11-28 20:06:39,682 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2019-11-28 20:06:39,685 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 87. [2019-11-28 20:06:39,686 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 87 states. [2019-11-28 20:06:39,687 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 98 transitions. [2019-11-28 20:06:39,687 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 98 transitions. Word has length 26 [2019-11-28 20:06:39,687 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 20:06:39,688 INFO L462 AbstractCegarLoop]: Abstraction has 87 states and 98 transitions. [2019-11-28 20:06:39,688 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-11-28 20:06:39,688 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 98 transitions. [2019-11-28 20:06:39,689 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-11-28 20:06:39,689 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 20:06:39,689 INFO L410 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 20:06:39,690 INFO L410 AbstractCegarLoop]: === Iteration 9 === [finddupErr1REQUIRES_VIOLATION, finddupErr6REQUIRES_VIOLATION, finddupErr7REQUIRES_VIOLATION, finddupErr5REQUIRES_VIOLATION, finddupErr0REQUIRES_VIOLATION, finddupErr4REQUIRES_VIOLATION, finddupErr2REQUIRES_VIOLATION, finddupErr3REQUIRES_VIOLATION, mkdupErr0REQUIRES_VIOLATION, mkdupErr1REQUIRES_VIOLATION, mkdupErr3REQUIRES_VIOLATION, mkdupErr2REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr22ASSERT_VIOLATIONMEMORY_FREE, mainErr20ASSERT_VIOLATIONMEMORY_FREE, mainErr21ASSERT_VIOLATIONMEMORY_FREE, mainErr23ENSURES_VIOLATIONMEMORY_LEAK, mainErr5REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION]=== [2019-11-28 20:06:39,690 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 20:06:39,690 INFO L82 PathProgramCache]: Analyzing trace with hash 941830451, now seen corresponding path program 1 times [2019-11-28 20:06:39,690 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 20:06:39,691 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [974209359] [2019-11-28 20:06:39,691 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 20:06:39,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:06:39,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:06:39,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:06:39,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:06:39,764 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:06:39,764 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [974209359] [2019-11-28 20:06:39,765 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [131811875] [2019-11-28 20:06:39,765 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:06:39,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:06:39,836 INFO L264 TraceCheckSpWp]: Trace formula consists of 158 conjuncts, 4 conjunts are in the unsatisfiable core [2019-11-28 20:06:39,845 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 20:06:39,868 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 20:06:39,869 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-11-28 20:06:39,869 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [8] total 8 [2019-11-28 20:06:39,870 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1567638759] [2019-11-28 20:06:39,870 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-28 20:06:39,871 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 20:06:39,871 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-28 20:06:39,871 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2019-11-28 20:06:39,871 INFO L87 Difference]: Start difference. First operand 87 states and 98 transitions. Second operand 5 states. [2019-11-28 20:06:39,938 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 20:06:39,938 INFO L93 Difference]: Finished difference Result 112 states and 127 transitions. [2019-11-28 20:06:39,938 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-28 20:06:39,939 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 26 [2019-11-28 20:06:39,939 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 20:06:39,940 INFO L225 Difference]: With dead ends: 112 [2019-11-28 20:06:39,940 INFO L226 Difference]: Without dead ends: 112 [2019-11-28 20:06:39,941 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2019-11-28 20:06:39,941 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2019-11-28 20:06:39,945 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 91. [2019-11-28 20:06:39,946 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 91 states. [2019-11-28 20:06:39,947 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 104 transitions. [2019-11-28 20:06:39,947 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 104 transitions. Word has length 26 [2019-11-28 20:06:39,947 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 20:06:39,948 INFO L462 AbstractCegarLoop]: Abstraction has 91 states and 104 transitions. [2019-11-28 20:06:39,948 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-28 20:06:39,948 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 104 transitions. [2019-11-28 20:06:39,949 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-11-28 20:06:39,949 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 20:06:39,949 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 20:06:40,153 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 20:06:40,153 INFO L410 AbstractCegarLoop]: === Iteration 10 === [finddupErr1REQUIRES_VIOLATION, finddupErr6REQUIRES_VIOLATION, finddupErr7REQUIRES_VIOLATION, finddupErr5REQUIRES_VIOLATION, finddupErr0REQUIRES_VIOLATION, finddupErr4REQUIRES_VIOLATION, finddupErr2REQUIRES_VIOLATION, finddupErr3REQUIRES_VIOLATION, mkdupErr0REQUIRES_VIOLATION, mkdupErr1REQUIRES_VIOLATION, mkdupErr3REQUIRES_VIOLATION, mkdupErr2REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr22ASSERT_VIOLATIONMEMORY_FREE, mainErr20ASSERT_VIOLATIONMEMORY_FREE, mainErr21ASSERT_VIOLATIONMEMORY_FREE, mainErr23ENSURES_VIOLATIONMEMORY_LEAK, mainErr5REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION]=== [2019-11-28 20:06:40,153 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 20:06:40,153 INFO L82 PathProgramCache]: Analyzing trace with hash -830719863, now seen corresponding path program 1 times [2019-11-28 20:06:40,154 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 20:06:40,154 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1532535380] [2019-11-28 20:06:40,154 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 20:06:40,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:06:40,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:06:40,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:06:40,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:06:40,246 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:06:40,246 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1532535380] [2019-11-28 20:06:40,247 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 20:06:40,247 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-11-28 20:06:40,247 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1410153731] [2019-11-28 20:06:40,247 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-11-28 20:06:40,248 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 20:06:40,248 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-11-28 20:06:40,248 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-11-28 20:06:40,248 INFO L87 Difference]: Start difference. First operand 91 states and 104 transitions. Second operand 7 states. [2019-11-28 20:06:40,550 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 20:06:40,550 INFO L93 Difference]: Finished difference Result 88 states and 101 transitions. [2019-11-28 20:06:40,551 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-11-28 20:06:40,551 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 27 [2019-11-28 20:06:40,551 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 20:06:40,552 INFO L225 Difference]: With dead ends: 88 [2019-11-28 20:06:40,552 INFO L226 Difference]: Without dead ends: 88 [2019-11-28 20:06:40,553 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2019-11-28 20:06:40,555 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2019-11-28 20:06:40,561 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 86. [2019-11-28 20:06:40,561 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 86 states. [2019-11-28 20:06:40,562 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 99 transitions. [2019-11-28 20:06:40,562 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 99 transitions. Word has length 27 [2019-11-28 20:06:40,562 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 20:06:40,562 INFO L462 AbstractCegarLoop]: Abstraction has 86 states and 99 transitions. [2019-11-28 20:06:40,562 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-11-28 20:06:40,563 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 99 transitions. [2019-11-28 20:06:40,563 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-11-28 20:06:40,563 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 20:06:40,564 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 20:06:40,566 INFO L410 AbstractCegarLoop]: === Iteration 11 === [finddupErr1REQUIRES_VIOLATION, finddupErr6REQUIRES_VIOLATION, finddupErr7REQUIRES_VIOLATION, finddupErr5REQUIRES_VIOLATION, finddupErr0REQUIRES_VIOLATION, finddupErr4REQUIRES_VIOLATION, finddupErr2REQUIRES_VIOLATION, finddupErr3REQUIRES_VIOLATION, mkdupErr0REQUIRES_VIOLATION, mkdupErr1REQUIRES_VIOLATION, mkdupErr3REQUIRES_VIOLATION, mkdupErr2REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr22ASSERT_VIOLATIONMEMORY_FREE, mainErr20ASSERT_VIOLATIONMEMORY_FREE, mainErr21ASSERT_VIOLATIONMEMORY_FREE, mainErr23ENSURES_VIOLATIONMEMORY_LEAK, mainErr5REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION]=== [2019-11-28 20:06:40,566 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 20:06:40,566 INFO L82 PathProgramCache]: Analyzing trace with hash -830719862, now seen corresponding path program 1 times [2019-11-28 20:06:40,566 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 20:06:40,566 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1597879295] [2019-11-28 20:06:40,567 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 20:06:40,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:06:40,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:06:40,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:06:40,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:06:40,674 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:06:40,675 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1597879295] [2019-11-28 20:06:40,675 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 20:06:40,675 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-11-28 20:06:40,676 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1117863223] [2019-11-28 20:06:40,676 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-11-28 20:06:40,676 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 20:06:40,677 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-11-28 20:06:40,677 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-11-28 20:06:40,678 INFO L87 Difference]: Start difference. First operand 86 states and 99 transitions. Second operand 7 states. [2019-11-28 20:06:40,969 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 20:06:40,969 INFO L93 Difference]: Finished difference Result 83 states and 96 transitions. [2019-11-28 20:06:40,970 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-11-28 20:06:40,970 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 27 [2019-11-28 20:06:40,970 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 20:06:40,971 INFO L225 Difference]: With dead ends: 83 [2019-11-28 20:06:40,971 INFO L226 Difference]: Without dead ends: 83 [2019-11-28 20:06:40,972 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2019-11-28 20:06:40,972 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2019-11-28 20:06:40,975 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 81. [2019-11-28 20:06:40,977 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 81 states. [2019-11-28 20:06:40,978 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 94 transitions. [2019-11-28 20:06:40,979 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 94 transitions. Word has length 27 [2019-11-28 20:06:40,979 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 20:06:40,979 INFO L462 AbstractCegarLoop]: Abstraction has 81 states and 94 transitions. [2019-11-28 20:06:40,979 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-11-28 20:06:40,979 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 94 transitions. [2019-11-28 20:06:40,982 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2019-11-28 20:06:40,982 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 20:06:40,982 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 20:06:40,982 INFO L410 AbstractCegarLoop]: === Iteration 12 === [finddupErr1REQUIRES_VIOLATION, finddupErr6REQUIRES_VIOLATION, finddupErr7REQUIRES_VIOLATION, finddupErr5REQUIRES_VIOLATION, finddupErr0REQUIRES_VIOLATION, finddupErr4REQUIRES_VIOLATION, finddupErr2REQUIRES_VIOLATION, finddupErr3REQUIRES_VIOLATION, mkdupErr0REQUIRES_VIOLATION, mkdupErr1REQUIRES_VIOLATION, mkdupErr3REQUIRES_VIOLATION, mkdupErr2REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr22ASSERT_VIOLATIONMEMORY_FREE, mainErr20ASSERT_VIOLATIONMEMORY_FREE, mainErr21ASSERT_VIOLATIONMEMORY_FREE, mainErr23ENSURES_VIOLATIONMEMORY_LEAK, mainErr5REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION]=== [2019-11-28 20:06:40,982 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 20:06:40,983 INFO L82 PathProgramCache]: Analyzing trace with hash 48801308, now seen corresponding path program 1 times [2019-11-28 20:06:40,983 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 20:06:40,983 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [248886067] [2019-11-28 20:06:40,983 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 20:06:40,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:06:41,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:06:41,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:06:41,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:06:41,077 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 20:06:41,078 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [248886067] [2019-11-28 20:06:41,078 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [821136357] [2019-11-28 20:06:41,079 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:06:41,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:06:41,169 INFO L264 TraceCheckSpWp]: Trace formula consists of 174 conjuncts, 6 conjunts are in the unsatisfiable core [2019-11-28 20:06:41,177 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 20:06:41,200 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 20:06:41,201 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-28 20:06:41,201 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 7] total 9 [2019-11-28 20:06:41,202 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1379145242] [2019-11-28 20:06:41,204 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-11-28 20:06:41,205 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 20:06:41,205 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-11-28 20:06:41,206 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-11-28 20:06:41,206 INFO L87 Difference]: Start difference. First operand 81 states and 94 transitions. Second operand 9 states. [2019-11-28 20:06:41,675 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 20:06:41,675 INFO L93 Difference]: Finished difference Result 122 states and 142 transitions. [2019-11-28 20:06:41,676 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-11-28 20:06:41,676 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 31 [2019-11-28 20:06:41,676 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 20:06:41,677 INFO L225 Difference]: With dead ends: 122 [2019-11-28 20:06:41,677 INFO L226 Difference]: Without dead ends: 122 [2019-11-28 20:06:41,681 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 37 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 51 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=100, Invalid=242, Unknown=0, NotChecked=0, Total=342 [2019-11-28 20:06:41,681 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 122 states. [2019-11-28 20:06:41,687 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 122 to 94. [2019-11-28 20:06:41,688 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 94 states. [2019-11-28 20:06:41,689 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 113 transitions. [2019-11-28 20:06:41,689 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 113 transitions. Word has length 31 [2019-11-28 20:06:41,689 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 20:06:41,689 INFO L462 AbstractCegarLoop]: Abstraction has 94 states and 113 transitions. [2019-11-28 20:06:41,689 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-11-28 20:06:41,690 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 113 transitions. [2019-11-28 20:06:41,690 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2019-11-28 20:06:41,690 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 20:06:41,691 INFO L410 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 20:06:41,894 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 20:06:41,895 INFO L410 AbstractCegarLoop]: === Iteration 13 === [finddupErr1REQUIRES_VIOLATION, finddupErr6REQUIRES_VIOLATION, finddupErr7REQUIRES_VIOLATION, finddupErr5REQUIRES_VIOLATION, finddupErr0REQUIRES_VIOLATION, finddupErr4REQUIRES_VIOLATION, finddupErr2REQUIRES_VIOLATION, finddupErr3REQUIRES_VIOLATION, mkdupErr0REQUIRES_VIOLATION, mkdupErr1REQUIRES_VIOLATION, mkdupErr3REQUIRES_VIOLATION, mkdupErr2REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr22ASSERT_VIOLATIONMEMORY_FREE, mainErr20ASSERT_VIOLATIONMEMORY_FREE, mainErr21ASSERT_VIOLATIONMEMORY_FREE, mainErr23ENSURES_VIOLATIONMEMORY_LEAK, mainErr5REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION]=== [2019-11-28 20:06:41,895 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 20:06:41,896 INFO L82 PathProgramCache]: Analyzing trace with hash -1425745197, now seen corresponding path program 2 times [2019-11-28 20:06:41,896 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 20:06:41,896 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1446475419] [2019-11-28 20:06:41,897 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 20:06:41,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:06:41,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:06:41,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:06:41,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:06:41,999 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 4 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 20:06:42,000 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1446475419] [2019-11-28 20:06:42,000 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [440450089] [2019-11-28 20:06:42,000 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:06:42,060 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-11-28 20:06:42,060 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-28 20:06:42,061 INFO L264 TraceCheckSpWp]: Trace formula consists of 190 conjuncts, 11 conjunts are in the unsatisfiable core [2019-11-28 20:06:42,064 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 20:06:42,230 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 4 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 20:06:42,231 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-28 20:06:42,231 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 9] total 16 [2019-11-28 20:06:42,232 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1367226485] [2019-11-28 20:06:42,232 INFO L442 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-11-28 20:06:42,233 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 20:06:42,233 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-11-28 20:06:42,233 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=226, Unknown=0, NotChecked=0, Total=272 [2019-11-28 20:06:42,234 INFO L87 Difference]: Start difference. First operand 94 states and 113 transitions. Second operand 17 states. [2019-11-28 20:06:43,429 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 20:06:43,429 INFO L93 Difference]: Finished difference Result 123 states and 141 transitions. [2019-11-28 20:06:43,429 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-11-28 20:06:43,429 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 36 [2019-11-28 20:06:43,430 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 20:06:43,431 INFO L225 Difference]: With dead ends: 123 [2019-11-28 20:06:43,431 INFO L226 Difference]: Without dead ends: 123 [2019-11-28 20:06:43,432 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 139 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=235, Invalid=757, Unknown=0, NotChecked=0, Total=992 [2019-11-28 20:06:43,432 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 123 states. [2019-11-28 20:06:43,435 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 123 to 81. [2019-11-28 20:06:43,435 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 81 states. [2019-11-28 20:06:43,436 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 93 transitions. [2019-11-28 20:06:43,436 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 93 transitions. Word has length 36 [2019-11-28 20:06:43,436 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 20:06:43,437 INFO L462 AbstractCegarLoop]: Abstraction has 81 states and 93 transitions. [2019-11-28 20:06:43,437 INFO L463 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-11-28 20:06:43,437 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 93 transitions. [2019-11-28 20:06:43,438 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2019-11-28 20:06:43,438 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 20:06:43,438 INFO L410 BasicCegarLoop]: trace histogram [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, 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:06:43,642 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 20:06:43,643 INFO L410 AbstractCegarLoop]: === Iteration 14 === [finddupErr1REQUIRES_VIOLATION, finddupErr6REQUIRES_VIOLATION, finddupErr7REQUIRES_VIOLATION, finddupErr5REQUIRES_VIOLATION, finddupErr0REQUIRES_VIOLATION, finddupErr4REQUIRES_VIOLATION, finddupErr2REQUIRES_VIOLATION, finddupErr3REQUIRES_VIOLATION, mkdupErr0REQUIRES_VIOLATION, mkdupErr1REQUIRES_VIOLATION, mkdupErr3REQUIRES_VIOLATION, mkdupErr2REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr22ASSERT_VIOLATIONMEMORY_FREE, mainErr20ASSERT_VIOLATIONMEMORY_FREE, mainErr21ASSERT_VIOLATIONMEMORY_FREE, mainErr23ENSURES_VIOLATIONMEMORY_LEAK, mainErr5REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION]=== [2019-11-28 20:06:43,644 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 20:06:43,644 INFO L82 PathProgramCache]: Analyzing trace with hash -1630798574, now seen corresponding path program 1 times [2019-11-28 20:06:43,644 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 20:06:43,644 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2142270578] [2019-11-28 20:06:43,644 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 20:06:43,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:06:43,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:06:43,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:06:43,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:06:43,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:06:43,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:06:43,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:06:43,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:06:43,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:06:43,765 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2019-11-28 20:06:43,765 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2142270578] [2019-11-28 20:06:43,765 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1400915010] [2019-11-28 20:06:43,766 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:06:43,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:06:43,844 INFO L264 TraceCheckSpWp]: Trace formula consists of 231 conjuncts, 7 conjunts are in the unsatisfiable core [2019-11-28 20:06:43,856 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 20:06:43,955 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2019-11-28 20:06:43,955 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-11-28 20:06:43,956 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [9] total 13 [2019-11-28 20:06:43,956 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [908966091] [2019-11-28 20:06:43,958 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-28 20:06:43,958 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 20:06:43,959 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-28 20:06:43,959 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=133, Unknown=0, NotChecked=0, Total=156 [2019-11-28 20:06:43,959 INFO L87 Difference]: Start difference. First operand 81 states and 93 transitions. Second operand 6 states. [2019-11-28 20:06:44,056 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 20:06:44,057 INFO L93 Difference]: Finished difference Result 104 states and 121 transitions. [2019-11-28 20:06:44,059 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-28 20:06:44,059 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 58 [2019-11-28 20:06:44,059 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 20:06:44,061 INFO L225 Difference]: With dead ends: 104 [2019-11-28 20:06:44,061 INFO L226 Difference]: Without dead ends: 101 [2019-11-28 20:06:44,062 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 68 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=155, Unknown=0, NotChecked=0, Total=182 [2019-11-28 20:06:44,066 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2019-11-28 20:06:44,070 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 82. [2019-11-28 20:06:44,071 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 82 states. [2019-11-28 20:06:44,073 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 94 transitions. [2019-11-28 20:06:44,073 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 94 transitions. Word has length 58 [2019-11-28 20:06:44,074 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 20:06:44,074 INFO L462 AbstractCegarLoop]: Abstraction has 82 states and 94 transitions. [2019-11-28 20:06:44,074 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-28 20:06:44,074 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 94 transitions. [2019-11-28 20:06:44,077 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2019-11-28 20:06:44,077 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 20:06:44,077 INFO L410 BasicCegarLoop]: trace histogram [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, 1, 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:06:44,282 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 20:06:44,283 INFO L410 AbstractCegarLoop]: === Iteration 15 === [finddupErr1REQUIRES_VIOLATION, finddupErr6REQUIRES_VIOLATION, finddupErr7REQUIRES_VIOLATION, finddupErr5REQUIRES_VIOLATION, finddupErr0REQUIRES_VIOLATION, finddupErr4REQUIRES_VIOLATION, finddupErr2REQUIRES_VIOLATION, finddupErr3REQUIRES_VIOLATION, mkdupErr0REQUIRES_VIOLATION, mkdupErr1REQUIRES_VIOLATION, mkdupErr3REQUIRES_VIOLATION, mkdupErr2REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr22ASSERT_VIOLATIONMEMORY_FREE, mainErr20ASSERT_VIOLATIONMEMORY_FREE, mainErr21ASSERT_VIOLATIONMEMORY_FREE, mainErr23ENSURES_VIOLATIONMEMORY_LEAK, mainErr5REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION]=== [2019-11-28 20:06:44,283 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 20:06:44,283 INFO L82 PathProgramCache]: Analyzing trace with hash 1652012609, now seen corresponding path program 1 times [2019-11-28 20:06:44,283 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 20:06:44,283 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1745568758] [2019-11-28 20:06:44,283 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 20:06:44,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:06:44,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:06:44,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:06:44,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:06:44,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:06:44,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:06:44,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:06:44,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:06:44,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:06:44,382 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2019-11-28 20:06:44,383 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1745568758] [2019-11-28 20:06:44,383 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1030733994] [2019-11-28 20:06:44,384 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 20:06:44,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:06:44,472 INFO L264 TraceCheckSpWp]: Trace formula consists of 237 conjuncts, 11 conjunts are in the unsatisfiable core [2019-11-28 20:06:44,476 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 20:06:44,505 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2019-11-28 20:06:44,506 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-11-28 20:06:44,506 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [9] total 9 [2019-11-28 20:06:44,507 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [318975135] [2019-11-28 20:06:44,508 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-11-28 20:06:44,509 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 20:06:44,509 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-11-28 20:06:44,509 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-11-28 20:06:44,510 INFO L87 Difference]: Start difference. First operand 82 states and 94 transitions. Second operand 7 states. [2019-11-28 20:06:44,587 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 20:06:44,587 INFO L93 Difference]: Finished difference Result 86 states and 98 transitions. [2019-11-28 20:06:44,588 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-11-28 20:06:44,589 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 61 [2019-11-28 20:06:44,589 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 20:06:44,590 INFO L225 Difference]: With dead ends: 86 [2019-11-28 20:06:44,590 INFO L226 Difference]: Without dead ends: 76 [2019-11-28 20:06:44,595 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 83 GetRequests, 73 SyntacticMatches, 2 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2019-11-28 20:06:44,596 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2019-11-28 20:06:44,603 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 75. [2019-11-28 20:06:44,603 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 75 states. [2019-11-28 20:06:44,604 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 83 transitions. [2019-11-28 20:06:44,604 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 83 transitions. Word has length 61 [2019-11-28 20:06:44,605 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 20:06:44,605 INFO L462 AbstractCegarLoop]: Abstraction has 75 states and 83 transitions. [2019-11-28 20:06:44,605 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-11-28 20:06:44,606 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 83 transitions. [2019-11-28 20:06:44,606 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-11-28 20:06:44,606 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 20:06:44,607 INFO L410 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 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:06:44,812 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 20:06:44,812 INFO L410 AbstractCegarLoop]: === Iteration 16 === [finddupErr1REQUIRES_VIOLATION, finddupErr6REQUIRES_VIOLATION, finddupErr7REQUIRES_VIOLATION, finddupErr5REQUIRES_VIOLATION, finddupErr0REQUIRES_VIOLATION, finddupErr4REQUIRES_VIOLATION, finddupErr2REQUIRES_VIOLATION, finddupErr3REQUIRES_VIOLATION, mkdupErr0REQUIRES_VIOLATION, mkdupErr1REQUIRES_VIOLATION, mkdupErr3REQUIRES_VIOLATION, mkdupErr2REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr22ASSERT_VIOLATIONMEMORY_FREE, mainErr20ASSERT_VIOLATIONMEMORY_FREE, mainErr21ASSERT_VIOLATIONMEMORY_FREE, mainErr23ENSURES_VIOLATIONMEMORY_LEAK, mainErr5REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION]=== [2019-11-28 20:06:44,813 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 20:06:44,813 INFO L82 PathProgramCache]: Analyzing trace with hash -35663204, now seen corresponding path program 1 times [2019-11-28 20:06:44,813 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 20:06:44,813 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [977522402] [2019-11-28 20:06:44,814 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 20:06:44,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:06:44,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:06:44,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:06:44,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:06:44,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:06:45,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:06:45,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:06:45,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:06:45,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:06:45,015 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2019-11-28 20:06:45,016 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [977522402] [2019-11-28 20:06:45,019 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 20:06:45,019 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2019-11-28 20:06:45,022 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [469007363] [2019-11-28 20:06:45,022 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-11-28 20:06:45,023 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 20:06:45,023 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-11-28 20:06:45,025 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2019-11-28 20:06:45,025 INFO L87 Difference]: Start difference. First operand 75 states and 83 transitions. Second operand 12 states. [2019-11-28 20:06:45,567 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 20:06:45,567 INFO L93 Difference]: Finished difference Result 76 states and 83 transitions. [2019-11-28 20:06:45,567 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-11-28 20:06:45,568 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 64 [2019-11-28 20:06:45,568 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 20:06:45,569 INFO L225 Difference]: With dead ends: 76 [2019-11-28 20:06:45,569 INFO L226 Difference]: Without dead ends: 76 [2019-11-28 20:06:45,570 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 35 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=84, Invalid=378, Unknown=0, NotChecked=0, Total=462 [2019-11-28 20:06:45,570 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2019-11-28 20:06:45,572 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 75. [2019-11-28 20:06:45,574 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 75 states. [2019-11-28 20:06:45,574 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 82 transitions. [2019-11-28 20:06:45,575 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 82 transitions. Word has length 64 [2019-11-28 20:06:45,580 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 20:06:45,580 INFO L462 AbstractCegarLoop]: Abstraction has 75 states and 82 transitions. [2019-11-28 20:06:45,580 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-11-28 20:06:45,580 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 82 transitions. [2019-11-28 20:06:45,581 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-11-28 20:06:45,581 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 20:06:45,582 INFO L410 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 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:06:45,582 INFO L410 AbstractCegarLoop]: === Iteration 17 === [finddupErr1REQUIRES_VIOLATION, finddupErr6REQUIRES_VIOLATION, finddupErr7REQUIRES_VIOLATION, finddupErr5REQUIRES_VIOLATION, finddupErr0REQUIRES_VIOLATION, finddupErr4REQUIRES_VIOLATION, finddupErr2REQUIRES_VIOLATION, finddupErr3REQUIRES_VIOLATION, mkdupErr0REQUIRES_VIOLATION, mkdupErr1REQUIRES_VIOLATION, mkdupErr3REQUIRES_VIOLATION, mkdupErr2REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr22ASSERT_VIOLATIONMEMORY_FREE, mainErr20ASSERT_VIOLATIONMEMORY_FREE, mainErr21ASSERT_VIOLATIONMEMORY_FREE, mainErr23ENSURES_VIOLATIONMEMORY_LEAK, mainErr5REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION]=== [2019-11-28 20:06:45,582 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 20:06:45,583 INFO L82 PathProgramCache]: Analyzing trace with hash 1633609241, now seen corresponding path program 1 times [2019-11-28 20:06:45,583 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 20:06:45,583 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [849808081] [2019-11-28 20:06:45,583 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 20:06:45,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:06:45,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:06:45,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:06:45,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:06:45,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:06:45,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:06:45,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:06:45,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:06:45,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:06:45,801 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2019-11-28 20:06:45,801 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [849808081] [2019-11-28 20:06:45,801 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1549356924] [2019-11-28 20:06:45,802 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 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 20:06:45,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:06:45,882 INFO L264 TraceCheckSpWp]: Trace formula consists of 265 conjuncts, 6 conjunts are in the unsatisfiable core [2019-11-28 20:06:45,886 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 20:06:45,911 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2019-11-28 20:06:45,912 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-11-28 20:06:45,912 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [15] total 16 [2019-11-28 20:06:45,912 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [375424098] [2019-11-28 20:06:45,913 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-28 20:06:45,913 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 20:06:45,913 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-28 20:06:45,913 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=209, Unknown=0, NotChecked=0, Total=240 [2019-11-28 20:06:45,914 INFO L87 Difference]: Start difference. First operand 75 states and 82 transitions. Second operand 5 states. [2019-11-28 20:06:45,957 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 20:06:45,957 INFO L93 Difference]: Finished difference Result 76 states and 83 transitions. [2019-11-28 20:06:45,957 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-28 20:06:45,958 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 66 [2019-11-28 20:06:45,958 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 20:06:45,959 INFO L225 Difference]: With dead ends: 76 [2019-11-28 20:06:45,959 INFO L226 Difference]: Without dead ends: 75 [2019-11-28 20:06:45,959 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 93 GetRequests, 78 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=35, Invalid=237, Unknown=0, NotChecked=0, Total=272 [2019-11-28 20:06:45,960 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2019-11-28 20:06:45,962 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 75. [2019-11-28 20:06:45,962 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 75 states. [2019-11-28 20:06:45,963 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 81 transitions. [2019-11-28 20:06:45,963 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 81 transitions. Word has length 66 [2019-11-28 20:06:45,964 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 20:06:45,964 INFO L462 AbstractCegarLoop]: Abstraction has 75 states and 81 transitions. [2019-11-28 20:06:45,964 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-28 20:06:45,964 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 81 transitions. [2019-11-28 20:06:45,965 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-11-28 20:06:45,965 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 20:06:45,965 INFO L410 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 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:06:46,166 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 20:06:46,166 INFO L410 AbstractCegarLoop]: === Iteration 18 === [finddupErr1REQUIRES_VIOLATION, finddupErr6REQUIRES_VIOLATION, finddupErr7REQUIRES_VIOLATION, finddupErr5REQUIRES_VIOLATION, finddupErr0REQUIRES_VIOLATION, finddupErr4REQUIRES_VIOLATION, finddupErr2REQUIRES_VIOLATION, finddupErr3REQUIRES_VIOLATION, mkdupErr0REQUIRES_VIOLATION, mkdupErr1REQUIRES_VIOLATION, mkdupErr3REQUIRES_VIOLATION, mkdupErr2REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr22ASSERT_VIOLATIONMEMORY_FREE, mainErr20ASSERT_VIOLATIONMEMORY_FREE, mainErr21ASSERT_VIOLATIONMEMORY_FREE, mainErr23ENSURES_VIOLATIONMEMORY_LEAK, mainErr5REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION]=== [2019-11-28 20:06:46,166 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 20:06:46,167 INFO L82 PathProgramCache]: Analyzing trace with hash -1616930628, now seen corresponding path program 1 times [2019-11-28 20:06:46,167 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 20:06:46,167 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [883103931] [2019-11-28 20:06:46,167 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 20:06:46,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:06:46,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:06:46,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:06:46,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:06:46,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:06:46,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:06:46,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:06:46,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:06:46,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:06:46,801 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2019-11-28 20:06:46,801 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [883103931] [2019-11-28 20:06:46,801 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1499236341] [2019-11-28 20:06:46,802 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 20:06:46,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:06:46,882 INFO L264 TraceCheckSpWp]: Trace formula consists of 272 conjuncts, 35 conjunts are in the unsatisfiable core [2019-11-28 20:06:46,886 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 20:06:46,982 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 10 treesize of output 8 [2019-11-28 20:06:46,983 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-28 20:06:46,991 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-28 20:06:46,992 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-28 20:06:46,992 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:15, output treesize:11 [2019-11-28 20:06:47,177 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2019-11-28 20:06:47,178 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-28 20:06:47,189 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-28 20:06:47,190 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-28 20:06:47,190 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:30, output treesize:23 [2019-11-28 20:06:47,251 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-28 20:06:47,251 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 21 treesize of output 44 [2019-11-28 20:06:47,252 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 20:06:47,256 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-28 20:06:47,286 INFO L614 ElimStorePlain]: treesize reduction 16, result has 68.6 percent of original size [2019-11-28 20:06:47,287 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 20:06:47,288 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-28 20:06:47,289 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:31, output treesize:36 [2019-11-28 20:06:47,289 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 20:06:47,343 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 20:06:47,391 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 20:06:47,450 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 20:06:47,674 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 20:06:48,317 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 22 [2019-11-28 20:06:48,318 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-28 20:06:48,328 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-28 20:06:48,328 INFO L534 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-28 20:06:48,328 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:49, output treesize:20 [2019-11-28 20:06:48,412 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2019-11-28 20:06:48,412 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-11-28 20:06:48,413 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [21] total 36 [2019-11-28 20:06:48,413 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [782710521] [2019-11-28 20:06:48,413 INFO L442 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-11-28 20:06:48,414 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 20:06:48,414 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-11-28 20:06:48,415 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=119, Invalid=1213, Unknown=0, NotChecked=0, Total=1332 [2019-11-28 20:06:48,415 INFO L87 Difference]: Start difference. First operand 75 states and 81 transitions. Second operand 17 states. [2019-11-28 20:06:51,408 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 20:06:51,408 INFO L93 Difference]: Finished difference Result 78 states and 83 transitions. [2019-11-28 20:06:51,408 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-11-28 20:06:51,408 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 68 [2019-11-28 20:06:51,409 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 20:06:51,409 INFO L225 Difference]: With dead ends: 78 [2019-11-28 20:06:51,410 INFO L226 Difference]: Without dead ends: 78 [2019-11-28 20:06:51,411 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 112 GetRequests, 57 SyntacticMatches, 8 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 718 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=236, Invalid=2116, Unknown=0, NotChecked=0, Total=2352 [2019-11-28 20:06:51,412 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2019-11-28 20:06:51,414 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 78. [2019-11-28 20:06:51,414 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 78 states. [2019-11-28 20:06:51,415 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 83 transitions. [2019-11-28 20:06:51,415 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 83 transitions. Word has length 68 [2019-11-28 20:06:51,416 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 20:06:51,416 INFO L462 AbstractCegarLoop]: Abstraction has 78 states and 83 transitions. [2019-11-28 20:06:51,416 INFO L463 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-11-28 20:06:51,416 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 83 transitions. [2019-11-28 20:06:51,417 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2019-11-28 20:06:51,417 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 20:06:51,417 INFO L410 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:06:51,620 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 20:06:51,621 INFO L410 AbstractCegarLoop]: === Iteration 19 === [finddupErr1REQUIRES_VIOLATION, finddupErr6REQUIRES_VIOLATION, finddupErr7REQUIRES_VIOLATION, finddupErr5REQUIRES_VIOLATION, finddupErr0REQUIRES_VIOLATION, finddupErr4REQUIRES_VIOLATION, finddupErr2REQUIRES_VIOLATION, finddupErr3REQUIRES_VIOLATION, mkdupErr0REQUIRES_VIOLATION, mkdupErr1REQUIRES_VIOLATION, mkdupErr3REQUIRES_VIOLATION, mkdupErr2REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr22ASSERT_VIOLATIONMEMORY_FREE, mainErr20ASSERT_VIOLATIONMEMORY_FREE, mainErr21ASSERT_VIOLATIONMEMORY_FREE, mainErr23ENSURES_VIOLATIONMEMORY_LEAK, mainErr5REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION]=== [2019-11-28 20:06:51,621 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 20:06:51,621 INFO L82 PathProgramCache]: Analyzing trace with hash 907828895, now seen corresponding path program 1 times [2019-11-28 20:06:51,622 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 20:06:51,622 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2127121605] [2019-11-28 20:06:51,622 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 20:06:51,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:06:51,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:06:51,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:06:51,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:06:51,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:06:51,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:06:51,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:06:51,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:06:51,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:06:51,850 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2019-11-28 20:06:51,851 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2127121605] [2019-11-28 20:06:51,851 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 20:06:51,851 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2019-11-28 20:06:51,852 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1431610346] [2019-11-28 20:06:51,852 INFO L442 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-11-28 20:06:51,852 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 20:06:51,853 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-11-28 20:06:51,855 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=131, Unknown=0, NotChecked=0, Total=156 [2019-11-28 20:06:51,856 INFO L87 Difference]: Start difference. First operand 78 states and 83 transitions. Second operand 13 states. [2019-11-28 20:06:52,840 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 20:06:52,840 INFO L93 Difference]: Finished difference Result 126 states and 139 transitions. [2019-11-28 20:06:52,840 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-11-28 20:06:52,841 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 70 [2019-11-28 20:06:52,841 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 20:06:52,842 INFO L225 Difference]: With dead ends: 126 [2019-11-28 20:06:52,842 INFO L226 Difference]: Without dead ends: 126 [2019-11-28 20:06:52,843 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 84 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=112, Invalid=488, Unknown=0, NotChecked=0, Total=600 [2019-11-28 20:06:52,843 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 126 states. [2019-11-28 20:06:52,849 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 126 to 119. [2019-11-28 20:06:52,850 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 119 states. [2019-11-28 20:06:52,852 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 119 states and 131 transitions. [2019-11-28 20:06:52,852 INFO L78 Accepts]: Start accepts. Automaton has 119 states and 131 transitions. Word has length 70 [2019-11-28 20:06:52,852 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 20:06:52,852 INFO L462 AbstractCegarLoop]: Abstraction has 119 states and 131 transitions. [2019-11-28 20:06:52,853 INFO L463 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-11-28 20:06:52,853 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 131 transitions. [2019-11-28 20:06:52,854 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2019-11-28 20:06:52,854 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 20:06:52,854 INFO L410 BasicCegarLoop]: trace histogram [5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:06:52,855 INFO L410 AbstractCegarLoop]: === Iteration 20 === [finddupErr1REQUIRES_VIOLATION, finddupErr6REQUIRES_VIOLATION, finddupErr7REQUIRES_VIOLATION, finddupErr5REQUIRES_VIOLATION, finddupErr0REQUIRES_VIOLATION, finddupErr4REQUIRES_VIOLATION, finddupErr2REQUIRES_VIOLATION, finddupErr3REQUIRES_VIOLATION, mkdupErr0REQUIRES_VIOLATION, mkdupErr1REQUIRES_VIOLATION, mkdupErr3REQUIRES_VIOLATION, mkdupErr2REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr22ASSERT_VIOLATIONMEMORY_FREE, mainErr20ASSERT_VIOLATIONMEMORY_FREE, mainErr21ASSERT_VIOLATIONMEMORY_FREE, mainErr23ENSURES_VIOLATIONMEMORY_LEAK, mainErr5REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION]=== [2019-11-28 20:06:52,855 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 20:06:52,855 INFO L82 PathProgramCache]: Analyzing trace with hash -1554600484, now seen corresponding path program 1 times [2019-11-28 20:06:52,856 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 20:06:52,857 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1636152073] [2019-11-28 20:06:52,857 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 20:06:52,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:06:53,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:06:53,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:06:53,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:06:53,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:06:53,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:06:53,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:06:53,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:06:53,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:06:53,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:06:53,390 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2019-11-28 20:06:53,391 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1636152073] [2019-11-28 20:06:53,391 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2074284871] [2019-11-28 20:06:53,391 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 20:06:53,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:06:53,469 INFO L264 TraceCheckSpWp]: Trace formula consists of 307 conjuncts, 14 conjunts are in the unsatisfiable core [2019-11-28 20:06:53,472 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 20:06:53,495 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 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 12 treesize of output 9 [2019-11-28 20:06:53,496 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-28 20:06:53,498 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-28 20:06:53,498 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-28 20:06:53,498 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:12, output treesize:5 [2019-11-28 20:06:53,569 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 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 12 treesize of output 9 [2019-11-28 20:06:53,570 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-28 20:06:53,571 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-28 20:06:53,572 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-28 20:06:53,572 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:12, output treesize:5 [2019-11-28 20:06:53,708 INFO L343 Elim1Store]: treesize reduction 44, result has 44.3 percent of original size [2019-11-28 20:06:53,709 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 7 case distinctions, treesize of input 40 treesize of output 61 [2019-11-28 20:06:53,710 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-28 20:06:53,721 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-28 20:06:53,722 INFO L534 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-11-28 20:06:53,722 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:37, output treesize:28 [2019-11-28 20:06:53,860 INFO L343 Elim1Store]: treesize reduction 44, result has 44.3 percent of original size [2019-11-28 20:06:53,861 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 7 case distinctions, treesize of input 40 treesize of output 61 [2019-11-28 20:06:53,862 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-28 20:06:53,873 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-28 20:06:53,874 INFO L534 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-11-28 20:06:53,874 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:37, output treesize:28 [2019-11-28 20:06:54,004 INFO L343 Elim1Store]: treesize reduction 44, result has 44.3 percent of original size [2019-11-28 20:06:54,005 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 7 case distinctions, treesize of input 40 treesize of output 61 [2019-11-28 20:06:54,006 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-28 20:06:54,023 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-28 20:06:54,024 INFO L534 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-11-28 20:06:54,024 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:37, output treesize:28 [2019-11-28 20:06:54,167 INFO L343 Elim1Store]: treesize reduction 44, result has 44.3 percent of original size [2019-11-28 20:06:54,167 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 7 case distinctions, treesize of input 40 treesize of output 61 [2019-11-28 20:06:54,168 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-28 20:06:54,181 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-28 20:06:54,182 INFO L534 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-11-28 20:06:54,182 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:37, output treesize:28 [2019-11-28 20:06:54,302 INFO L343 Elim1Store]: treesize reduction 44, result has 44.3 percent of original size [2019-11-28 20:06:54,303 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 7 case distinctions, treesize of input 40 treesize of output 61 [2019-11-28 20:06:54,304 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-28 20:06:54,312 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-28 20:06:54,314 INFO L534 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-11-28 20:06:54,314 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:37, output treesize:28 [2019-11-28 20:06:54,445 INFO L343 Elim1Store]: treesize reduction 44, result has 44.3 percent of original size [2019-11-28 20:06:54,445 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 7 case distinctions, treesize of input 40 treesize of output 61 [2019-11-28 20:06:54,446 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-28 20:06:54,459 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-28 20:06:54,460 INFO L534 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-11-28 20:06:54,460 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:37, output treesize:28 [2019-11-28 20:06:54,638 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2019-11-28 20:06:54,639 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-11-28 20:06:54,639 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [11] total 17 [2019-11-28 20:06:54,640 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [289496047] [2019-11-28 20:06:54,640 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-11-28 20:06:54,641 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 20:06:54,642 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-11-28 20:06:54,642 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=261, Unknown=0, NotChecked=0, Total=306 [2019-11-28 20:06:54,642 INFO L87 Difference]: Start difference. First operand 119 states and 131 transitions. Second operand 9 states. [2019-11-28 20:06:55,118 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 20:06:55,119 INFO L93 Difference]: Finished difference Result 118 states and 130 transitions. [2019-11-28 20:06:55,119 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-11-28 20:06:55,120 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 80 [2019-11-28 20:06:55,120 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 20:06:55,121 INFO L225 Difference]: With dead ends: 118 [2019-11-28 20:06:55,121 INFO L226 Difference]: Without dead ends: 83 [2019-11-28 20:06:55,122 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 110 GetRequests, 76 SyntacticMatches, 15 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 127 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=60, Invalid=360, Unknown=0, NotChecked=0, Total=420 [2019-11-28 20:06:55,122 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2019-11-28 20:06:55,125 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 83. [2019-11-28 20:06:55,125 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 83 states. [2019-11-28 20:06:55,126 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 88 transitions. [2019-11-28 20:06:55,126 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 88 transitions. Word has length 80 [2019-11-28 20:06:55,127 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 20:06:55,127 INFO L462 AbstractCegarLoop]: Abstraction has 83 states and 88 transitions. [2019-11-28 20:06:55,127 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-11-28 20:06:55,127 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 88 transitions. [2019-11-28 20:06:55,128 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2019-11-28 20:06:55,128 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 20:06:55,128 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 20:06:55,331 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 20:06:55,332 INFO L410 AbstractCegarLoop]: === Iteration 21 === [finddupErr1REQUIRES_VIOLATION, finddupErr6REQUIRES_VIOLATION, finddupErr7REQUIRES_VIOLATION, finddupErr5REQUIRES_VIOLATION, finddupErr0REQUIRES_VIOLATION, finddupErr4REQUIRES_VIOLATION, finddupErr2REQUIRES_VIOLATION, finddupErr3REQUIRES_VIOLATION, mkdupErr0REQUIRES_VIOLATION, mkdupErr1REQUIRES_VIOLATION, mkdupErr3REQUIRES_VIOLATION, mkdupErr2REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr22ASSERT_VIOLATIONMEMORY_FREE, mainErr20ASSERT_VIOLATIONMEMORY_FREE, mainErr21ASSERT_VIOLATIONMEMORY_FREE, mainErr23ENSURES_VIOLATIONMEMORY_LEAK, mainErr5REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION]=== [2019-11-28 20:06:55,332 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 20:06:55,332 INFO L82 PathProgramCache]: Analyzing trace with hash -1047974994, now seen corresponding path program 1 times [2019-11-28 20:06:55,332 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 20:06:55,332 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [783872866] [2019-11-28 20:06:55,332 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 20:06:55,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:06:55,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:06:55,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:06:55,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:06:55,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:06:55,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:06:55,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:06:55,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:06:55,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:06:55,723 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 1 proven. 16 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2019-11-28 20:06:55,724 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [783872866] [2019-11-28 20:06:55,724 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1400601269] [2019-11-28 20:06:55,725 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 20:06:55,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:06:55,829 INFO L264 TraceCheckSpWp]: Trace formula consists of 322 conjuncts, 30 conjunts are in the unsatisfiable core [2019-11-28 20:06:55,840 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 20:06:56,278 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2019-11-28 20:06:56,278 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-28 20:06:56,286 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-28 20:06:56,287 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-28 20:06:56,287 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:29, output treesize:26 [2019-11-28 20:06:56,957 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 19 [2019-11-28 20:06:56,958 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-28 20:06:56,973 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-28 20:06:56,974 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-28 20:06:56,974 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:37, output treesize:22 [2019-11-28 20:06:57,087 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 3 proven. 14 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2019-11-28 20:06:57,087 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-28 20:06:57,088 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 14] total 30 [2019-11-28 20:06:57,088 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1304661993] [2019-11-28 20:06:57,088 INFO L442 AbstractCegarLoop]: Interpolant automaton has 31 states [2019-11-28 20:06:57,089 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 20:06:57,089 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2019-11-28 20:06:57,089 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=79, Invalid=851, Unknown=0, NotChecked=0, Total=930 [2019-11-28 20:06:57,090 INFO L87 Difference]: Start difference. First operand 83 states and 88 transitions. Second operand 31 states. [2019-11-28 20:06:59,894 WARN L192 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 53 [2019-11-28 20:07:00,693 WARN L192 SmtUtils]: Spent 132.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 44 [2019-11-28 20:07:03,703 WARN L192 SmtUtils]: Spent 846.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 51 [2019-11-28 20:07:04,665 WARN L192 SmtUtils]: Spent 137.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 46 [2019-11-28 20:07:05,698 WARN L192 SmtUtils]: Spent 519.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 46 [2019-11-28 20:07:06,117 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 20:07:06,117 INFO L93 Difference]: Finished difference Result 117 states and 125 transitions. [2019-11-28 20:07:06,117 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2019-11-28 20:07:06,117 INFO L78 Accepts]: Start accepts. Automaton has 31 states. Word has length 83 [2019-11-28 20:07:06,118 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 20:07:06,118 INFO L225 Difference]: With dead ends: 117 [2019-11-28 20:07:06,118 INFO L226 Difference]: Without dead ends: 0 [2019-11-28 20:07:06,119 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 144 GetRequests, 76 SyntacticMatches, 7 SemanticMatches, 61 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 885 ImplicationChecksByTransitivity, 5.7s TimeCoverageRelationStatistics Valid=458, Invalid=3448, Unknown=0, NotChecked=0, Total=3906 [2019-11-28 20:07:06,119 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-11-28 20:07:06,119 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-11-28 20:07:06,120 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-11-28 20:07:06,120 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-11-28 20:07:06,120 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 83 [2019-11-28 20:07:06,120 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 20:07:06,120 INFO L462 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-11-28 20:07:06,120 INFO L463 AbstractCegarLoop]: Interpolant automaton has 31 states. [2019-11-28 20:07:06,120 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-11-28 20:07:06,120 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-11-28 20:07:06,325 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 20:07:06,331 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 28.11 08:07:06 BoogieIcfgContainer [2019-11-28 20:07:06,332 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-11-28 20:07:06,332 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-11-28 20:07:06,332 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-11-28 20:07:06,333 INFO L275 PluginConnector]: Witness Printer initialized [2019-11-28 20:07:06,333 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 08:06:32" (3/4) ... [2019-11-28 20:07:06,337 INFO L137 WitnessPrinter]: Generating witness for correct program [2019-11-28 20:07:06,345 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ULTIMATE.init [2019-11-28 20:07:06,346 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure mkdup [2019-11-28 20:07:06,346 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure finddup [2019-11-28 20:07:06,346 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure main [2019-11-28 20:07:06,346 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure __VERIFIER_assert [2019-11-28 20:07:06,346 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure #Ultimate.meminit [2019-11-28 20:07:06,354 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 21 nodes and edges [2019-11-28 20:07:06,354 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 9 nodes and edges [2019-11-28 20:07:06,355 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2019-11-28 20:07:06,355 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2019-11-28 20:07:06,407 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2019-11-28 20:07:06,407 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-11-28 20:07:06,409 INFO L168 Benchmark]: Toolchain (without parser) took 34678.91 ms. Allocated memory was 1.0 GB in the beginning and 1.5 GB in the end (delta: 446.2 MB). Free memory was 956.3 MB in the beginning and 1.4 GB in the end (delta: -454.7 MB). There was no memory consumed. Max. memory is 11.5 GB. [2019-11-28 20:07:06,409 INFO L168 Benchmark]: CDTParser took 0.44 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:07:06,410 INFO L168 Benchmark]: CACSL2BoogieTranslator took 360.18 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 142.6 MB). Free memory was 956.3 MB in the beginning and 1.1 GB in the end (delta: -182.7 MB). Peak memory consumption was 20.7 MB. Max. memory is 11.5 GB. [2019-11-28 20:07:06,410 INFO L168 Benchmark]: Boogie Preprocessor took 54.99 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: 6.6 MB). Peak memory consumption was 6.6 MB. Max. memory is 11.5 GB. [2019-11-28 20:07:06,411 INFO L168 Benchmark]: RCFGBuilder took 579.15 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: 32.5 MB). Peak memory consumption was 32.5 MB. Max. memory is 11.5 GB. [2019-11-28 20:07:06,411 INFO L168 Benchmark]: TraceAbstraction took 33604.33 ms. Allocated memory was 1.2 GB in the beginning and 1.5 GB in the end (delta: 303.6 MB). Free memory was 1.1 GB in the beginning and 1.4 GB in the end (delta: -311.6 MB). There was no memory consumed. Max. memory is 11.5 GB. [2019-11-28 20:07:06,411 INFO L168 Benchmark]: Witness Printer took 75.08 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.4 GB in the end (delta: 469.4 kB). Peak memory consumption was 469.4 kB. Max. memory is 11.5 GB. [2019-11-28 20:07:06,413 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.44 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 360.18 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 142.6 MB). Free memory was 956.3 MB in the beginning and 1.1 GB in the end (delta: -182.7 MB). Peak memory consumption was 20.7 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 54.99 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: 6.6 MB). Peak memory consumption was 6.6 MB. Max. memory is 11.5 GB. * RCFGBuilder took 579.15 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: 32.5 MB). Peak memory consumption was 32.5 MB. Max. memory is 11.5 GB. * TraceAbstraction took 33604.33 ms. Allocated memory was 1.2 GB in the beginning and 1.5 GB in the end (delta: 303.6 MB). Free memory was 1.1 GB in the beginning and 1.4 GB in the end (delta: -311.6 MB). There was no memory consumed. Max. memory is 11.5 GB. * Witness Printer took 75.08 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.4 GB in the end (delta: 469.4 kB). Peak memory consumption was 469.4 kB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 33]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 35]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 35]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 34]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 33]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 34]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 33]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 33]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 24]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 24]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 25]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 25]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 58]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 58]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 57]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 57]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 59]: free always succeeds For all program executions holds that free always succeeds at this location - PositiveResult [Line: 59]: free always succeeds For all program executions holds that free always succeeds at this location - PositiveResult [Line: 59]: free always succeeds For all program executions holds that free always succeeds at this location - PositiveResult [Line: 43]: all allocated memory was freed For all program executions holds that all allocated memory was freed at this location - PositiveResult [Line: 56]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 58]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 56]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 56]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 58]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 55]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 55]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 58]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 58]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 58]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 56]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 57]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 57]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 55]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 55]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 58]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - AllSpecificationsHoldResult: All specifications hold 36 specifications checked. All of them hold - StatisticsResult: Ultimate Automizer benchmark data CFG has 7 procedures, 106 locations, 36 error locations. Result: SAFE, OverallTime: 33.5s, OverallIterations: 21, TraceHistogramMax: 5, AutomataDifference: 21.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 1220 SDtfs, 2611 SDslu, 3582 SDs, 0 SdLazy, 7644 SolverSat, 799 SolverUnsat, 2 SolverUnknown, 0 SolverNotchecked, 12.3s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 1030 GetRequests, 616 SyntacticMatches, 33 SemanticMatches, 381 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2184 ImplicationChecksByTransitivity, 12.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=119occurred in iteration=19, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 21 MinimizatonAttempts, 155 StatesRemovedByMinimization, 17 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.7s SatisfiabilityAnalysisTime, 8.1s InterpolantComputationTime, 1371 NumberOfCodeBlocks, 1371 NumberOfCodeBlocksAsserted, 31 NumberOfCheckSat, 1341 ConstructedInterpolants, 134 QuantifiedInterpolants, 833189 SizeOfPredicates, 48 NumberOfNonLiveVariables, 2156 ConjunctsInSsa, 124 ConjunctsInUnsatCore, 30 InterpolantComputations, 18 PerfectInterpolantSequences, 341/444 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...