./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/ntdrivers-simplified/cdaudio_simpl1.cil-1.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 20ed64ec Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.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/ntdrivers-simplified/cdaudio_simpl1.cil-1.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 602ea7c33e3d58a05b038901c89b84d09b02e08d ........................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.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/ntdrivers-simplified/cdaudio_simpl1.cil-1.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.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 602ea7c33e3d58a05b038901c89b84d09b02e08d .......................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: UNKNOWN: Overapproximated counterexample --- Real Ultimate output --- This is Ultimate 0.2.1-dev-20ed64e [2021-08-27 07:47:14,093 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-08-27 07:47:14,095 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-08-27 07:47:14,113 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-08-27 07:47:14,114 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-08-27 07:47:14,114 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-08-27 07:47:14,115 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-08-27 07:47:14,117 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-08-27 07:47:14,118 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-08-27 07:47:14,119 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-08-27 07:47:14,120 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-08-27 07:47:14,120 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-08-27 07:47:14,121 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-08-27 07:47:14,121 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-08-27 07:47:14,122 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-08-27 07:47:14,123 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-08-27 07:47:14,124 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-08-27 07:47:14,125 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-08-27 07:47:14,126 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-08-27 07:47:14,127 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-08-27 07:47:14,128 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-08-27 07:47:14,129 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-08-27 07:47:14,129 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-08-27 07:47:14,130 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-08-27 07:47:14,141 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-08-27 07:47:14,145 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-08-27 07:47:14,146 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-08-27 07:47:14,146 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-08-27 07:47:14,147 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-08-27 07:47:14,148 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-08-27 07:47:14,148 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-08-27 07:47:14,149 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-08-27 07:47:14,150 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-08-27 07:47:14,150 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-08-27 07:47:14,152 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-08-27 07:47:14,153 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-08-27 07:47:14,154 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-08-27 07:47:14,154 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-08-27 07:47:14,154 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-08-27 07:47:14,155 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-08-27 07:47:14,156 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-08-27 07:47:14,156 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2021-08-27 07:47:14,180 INFO L113 SettingsManager]: Loading preferences was successful [2021-08-27 07:47:14,180 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-08-27 07:47:14,181 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-08-27 07:47:14,181 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-08-27 07:47:14,183 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-08-27 07:47:14,183 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-08-27 07:47:14,183 INFO L138 SettingsManager]: * Use SBE=true [2021-08-27 07:47:14,183 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-08-27 07:47:14,183 INFO L138 SettingsManager]: * sizeof long=4 [2021-08-27 07:47:14,183 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2021-08-27 07:47:14,184 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-08-27 07:47:14,184 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-08-27 07:47:14,184 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-08-27 07:47:14,184 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2021-08-27 07:47:14,185 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2021-08-27 07:47:14,185 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2021-08-27 07:47:14,185 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-08-27 07:47:14,185 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2021-08-27 07:47:14,185 INFO L138 SettingsManager]: * sizeof long double=12 [2021-08-27 07:47:14,185 INFO L138 SettingsManager]: * Use constant arrays=true [2021-08-27 07:47:14,186 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-08-27 07:47:14,186 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-08-27 07:47:14,186 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-08-27 07:47:14,186 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-08-27 07:47:14,186 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-08-27 07:47:14,186 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-08-27 07:47:14,186 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-08-27 07:47:14,187 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-08-27 07:47:14,187 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-08-27 07:47:14,187 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release 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 -> 602ea7c33e3d58a05b038901c89b84d09b02e08d [2021-08-27 07:47:14,417 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-08-27 07:47:14,435 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-08-27 07:47:14,437 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-08-27 07:47:14,438 INFO L271 PluginConnector]: Initializing CDTParser... [2021-08-27 07:47:14,438 INFO L275 PluginConnector]: CDTParser initialized [2021-08-27 07:47:14,439 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/ntdrivers-simplified/cdaudio_simpl1.cil-1.c [2021-08-27 07:47:14,488 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6f19098c7/c5763e44efc74136ae3ab1c2ab1adf4f/FLAGba575fe75 [2021-08-27 07:47:14,884 INFO L306 CDTParser]: Found 1 translation units. [2021-08-27 07:47:14,884 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ntdrivers-simplified/cdaudio_simpl1.cil-1.c [2021-08-27 07:47:14,903 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6f19098c7/c5763e44efc74136ae3ab1c2ab1adf4f/FLAGba575fe75 [2021-08-27 07:47:15,244 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6f19098c7/c5763e44efc74136ae3ab1c2ab1adf4f [2021-08-27 07:47:15,245 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-08-27 07:47:15,247 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2021-08-27 07:47:15,249 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-08-27 07:47:15,249 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-08-27 07:47:15,253 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-08-27 07:47:15,254 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.08 07:47:15" (1/1) ... [2021-08-27 07:47:15,254 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@64d74b7d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 07:47:15, skipping insertion in model container [2021-08-27 07:47:15,255 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.08 07:47:15" (1/1) ... [2021-08-27 07:47:15,259 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-08-27 07:47:15,303 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-08-27 07:47:15,429 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ntdrivers-simplified/cdaudio_simpl1.cil-1.c[2074,2087] [2021-08-27 07:47:15,581 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-08-27 07:47:15,591 INFO L203 MainTranslator]: Completed pre-run [2021-08-27 07:47:15,599 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ntdrivers-simplified/cdaudio_simpl1.cil-1.c[2074,2087] [2021-08-27 07:47:15,648 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-08-27 07:47:15,659 INFO L208 MainTranslator]: Completed translation [2021-08-27 07:47:15,659 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 07:47:15 WrapperNode [2021-08-27 07:47:15,660 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-08-27 07:47:15,660 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-08-27 07:47:15,660 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-08-27 07:47:15,661 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-08-27 07:47:15,674 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 07:47:15" (1/1) ... [2021-08-27 07:47:15,674 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 07:47:15" (1/1) ... [2021-08-27 07:47:15,691 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 07:47:15" (1/1) ... [2021-08-27 07:47:15,691 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 07:47:15" (1/1) ... [2021-08-27 07:47:15,724 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 07:47:15" (1/1) ... [2021-08-27 07:47:15,735 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 07:47:15" (1/1) ... [2021-08-27 07:47:15,739 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 07:47:15" (1/1) ... [2021-08-27 07:47:15,746 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-08-27 07:47:15,747 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-08-27 07:47:15,747 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-08-27 07:47:15,747 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-08-27 07:47:15,748 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 07:47:15" (1/1) ... [2021-08-27 07:47:15,752 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-08-27 07:47:15,768 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 07:47:15,783 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2021-08-27 07:47:15,792 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2021-08-27 07:47:15,819 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2021-08-27 07:47:15,819 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-08-27 07:47:15,819 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2021-08-27 07:47:15,819 INFO L138 BoogieDeclarations]: Found implementation of procedure errorFn [2021-08-27 07:47:15,820 INFO L138 BoogieDeclarations]: Found implementation of procedure _BLAST_init [2021-08-27 07:47:15,820 INFO L138 BoogieDeclarations]: Found implementation of procedure SendSrbSynchronous [2021-08-27 07:47:15,820 INFO L138 BoogieDeclarations]: Found implementation of procedure CdAudioSignalCompletion [2021-08-27 07:47:15,820 INFO L138 BoogieDeclarations]: Found implementation of procedure CdAudioStartDevice [2021-08-27 07:47:15,820 INFO L138 BoogieDeclarations]: Found implementation of procedure CdAudioPnp [2021-08-27 07:47:15,820 INFO L138 BoogieDeclarations]: Found implementation of procedure CdAudioDeviceControl [2021-08-27 07:47:15,820 INFO L138 BoogieDeclarations]: Found implementation of procedure CdAudioSendToNextDriver [2021-08-27 07:47:15,821 INFO L138 BoogieDeclarations]: Found implementation of procedure CdAudioIsPlayActive [2021-08-27 07:47:15,821 INFO L138 BoogieDeclarations]: Found implementation of procedure CdAudio535DeviceControl [2021-08-27 07:47:15,821 INFO L138 BoogieDeclarations]: Found implementation of procedure AG_SetStatusAndReturn [2021-08-27 07:47:15,821 INFO L138 BoogieDeclarations]: Found implementation of procedure CdAudio435DeviceControl [2021-08-27 07:47:15,821 INFO L138 BoogieDeclarations]: Found implementation of procedure CdAudioAtapiDeviceControl [2021-08-27 07:47:15,821 INFO L138 BoogieDeclarations]: Found implementation of procedure HpCdrProcessLastSession [2021-08-27 07:47:15,821 INFO L138 BoogieDeclarations]: Found implementation of procedure HPCdrCompletion [2021-08-27 07:47:15,822 INFO L138 BoogieDeclarations]: Found implementation of procedure CdAudioHPCdrDeviceControl [2021-08-27 07:47:15,822 INFO L138 BoogieDeclarations]: Found implementation of procedure CdAudioForwardIrpSynchronous [2021-08-27 07:47:15,822 INFO L138 BoogieDeclarations]: Found implementation of procedure CdAudioUnload [2021-08-27 07:47:15,822 INFO L138 BoogieDeclarations]: Found implementation of procedure CdAudioPower [2021-08-27 07:47:15,822 INFO L138 BoogieDeclarations]: Found implementation of procedure stub_driver_init [2021-08-27 07:47:15,822 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2021-08-27 07:47:15,822 INFO L138 BoogieDeclarations]: Found implementation of procedure stubMoreProcessingRequired [2021-08-27 07:47:15,822 INFO L138 BoogieDeclarations]: Found implementation of procedure IofCallDriver [2021-08-27 07:47:15,823 INFO L138 BoogieDeclarations]: Found implementation of procedure IofCompleteRequest [2021-08-27 07:47:15,823 INFO L138 BoogieDeclarations]: Found implementation of procedure KeSetEvent [2021-08-27 07:47:15,823 INFO L138 BoogieDeclarations]: Found implementation of procedure KeWaitForSingleObject [2021-08-27 07:47:15,823 INFO L138 BoogieDeclarations]: Found implementation of procedure PoCallDriver [2021-08-27 07:47:15,823 INFO L138 BoogieDeclarations]: Found implementation of procedure ZwClose [2021-08-27 07:47:15,823 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2021-08-27 07:47:15,823 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2021-08-27 07:47:15,823 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2021-08-27 07:47:15,824 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-08-27 07:47:15,824 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_char [2021-08-27 07:47:15,824 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2021-08-27 07:47:15,824 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_long [2021-08-27 07:47:15,824 INFO L130 BoogieDeclarations]: Found specification of procedure SendSrbSynchronous [2021-08-27 07:47:15,824 INFO L130 BoogieDeclarations]: Found specification of procedure CdAudioSignalCompletion [2021-08-27 07:47:15,824 INFO L130 BoogieDeclarations]: Found specification of procedure CdAudioStartDevice [2021-08-27 07:47:15,824 INFO L130 BoogieDeclarations]: Found specification of procedure CdAudioPnp [2021-08-27 07:47:15,825 INFO L130 BoogieDeclarations]: Found specification of procedure CdAudioDeviceControl [2021-08-27 07:47:15,825 INFO L130 BoogieDeclarations]: Found specification of procedure CdAudioSendToNextDriver [2021-08-27 07:47:15,825 INFO L130 BoogieDeclarations]: Found specification of procedure CdAudioIsPlayActive [2021-08-27 07:47:15,825 INFO L130 BoogieDeclarations]: Found specification of procedure CdAudio535DeviceControl [2021-08-27 07:47:15,825 INFO L130 BoogieDeclarations]: Found specification of procedure AG_SetStatusAndReturn [2021-08-27 07:47:15,825 INFO L130 BoogieDeclarations]: Found specification of procedure CdAudio435DeviceControl [2021-08-27 07:47:15,825 INFO L130 BoogieDeclarations]: Found specification of procedure CdAudioAtapiDeviceControl [2021-08-27 07:47:15,826 INFO L130 BoogieDeclarations]: Found specification of procedure HPCdrCompletion [2021-08-27 07:47:15,826 INFO L130 BoogieDeclarations]: Found specification of procedure CdAudioHPCdrDeviceControl [2021-08-27 07:47:15,826 INFO L130 BoogieDeclarations]: Found specification of procedure CdAudioForwardIrpSynchronous [2021-08-27 07:47:15,826 INFO L130 BoogieDeclarations]: Found specification of procedure CdAudioPower [2021-08-27 07:47:15,826 INFO L130 BoogieDeclarations]: Found specification of procedure IofCallDriver [2021-08-27 07:47:15,826 INFO L130 BoogieDeclarations]: Found specification of procedure KeSetEvent [2021-08-27 07:47:15,826 INFO L130 BoogieDeclarations]: Found specification of procedure KeWaitForSingleObject [2021-08-27 07:47:15,826 INFO L130 BoogieDeclarations]: Found specification of procedure PoCallDriver [2021-08-27 07:47:15,827 INFO L130 BoogieDeclarations]: Found specification of procedure ZwClose [2021-08-27 07:47:15,827 INFO L130 BoogieDeclarations]: Found specification of procedure IofCompleteRequest [2021-08-27 07:47:15,827 INFO L130 BoogieDeclarations]: Found specification of procedure errorFn [2021-08-27 07:47:15,827 INFO L130 BoogieDeclarations]: Found specification of procedure _BLAST_init [2021-08-27 07:47:15,827 INFO L130 BoogieDeclarations]: Found specification of procedure HpCdrProcessLastSession [2021-08-27 07:47:15,827 INFO L130 BoogieDeclarations]: Found specification of procedure CdAudioUnload [2021-08-27 07:47:15,827 INFO L130 BoogieDeclarations]: Found specification of procedure stub_driver_init [2021-08-27 07:47:15,827 INFO L130 BoogieDeclarations]: Found specification of procedure main [2021-08-27 07:47:15,828 INFO L130 BoogieDeclarations]: Found specification of procedure stubMoreProcessingRequired [2021-08-27 07:47:15,828 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2021-08-27 07:47:15,828 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-08-27 07:47:15,828 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-08-27 07:47:15,828 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2021-08-27 07:47:15,828 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2021-08-27 07:47:15,828 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-08-27 07:47:16,183 WARN L805 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2021-08-27 07:47:16,257 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##15: assume !false; [2021-08-27 07:47:16,257 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##14: assume false; [2021-08-27 07:47:16,263 WARN L805 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2021-08-27 07:47:16,297 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##18: assume !false; [2021-08-27 07:47:16,297 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##17: assume false; [2021-08-27 07:47:16,314 WARN L805 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2021-08-27 07:47:16,325 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##16: assume !false; [2021-08-27 07:47:16,325 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##15: assume false; [2021-08-27 07:47:16,374 WARN L805 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2021-08-27 07:47:16,415 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##6: assume !false; [2021-08-27 07:47:16,415 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint L305: #res := 0; [2021-08-27 07:47:16,415 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##5: assume false; [2021-08-27 07:47:16,418 WARN L805 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2021-08-27 07:47:16,530 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##21: assume false; [2021-08-27 07:47:16,531 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##22: assume !false; [2021-08-27 07:47:16,531 WARN L805 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2021-08-27 07:47:16,551 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##21: assume !false; [2021-08-27 07:47:16,551 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##20: assume false; [2021-08-27 07:47:16,579 WARN L805 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2021-08-27 07:47:16,592 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##10: assume !false; [2021-08-27 07:47:16,592 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##9: assume false; [2021-08-27 07:47:16,595 WARN L805 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2021-08-27 07:47:16,711 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##26: assume !false; [2021-08-27 07:47:16,712 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##25: assume false; [2021-08-27 07:47:16,719 WARN L805 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2021-08-27 07:47:16,722 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##4: assume !false; [2021-08-27 07:47:16,722 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##3: assume false; [2021-08-27 07:47:16,747 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-08-27 07:47:16,747 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2021-08-27 07:47:16,749 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.08 07:47:16 BoogieIcfgContainer [2021-08-27 07:47:16,749 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-08-27 07:47:16,751 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-08-27 07:47:16,751 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-08-27 07:47:16,753 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-08-27 07:47:16,754 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.08 07:47:15" (1/3) ... [2021-08-27 07:47:16,754 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@575f9c52 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.08 07:47:16, skipping insertion in model container [2021-08-27 07:47:16,755 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 07:47:15" (2/3) ... [2021-08-27 07:47:16,755 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@575f9c52 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.08 07:47:16, skipping insertion in model container [2021-08-27 07:47:16,755 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.08 07:47:16" (3/3) ... [2021-08-27 07:47:16,756 INFO L111 eAbstractionObserver]: Analyzing ICFG cdaudio_simpl1.cil-1.c [2021-08-27 07:47:16,759 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-08-27 07:47:16,760 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2021-08-27 07:47:16,783 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2021-08-27 07:47:16,789 INFO L339 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=false, mConcurrency=FINITE_AUTOMATA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=All, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mLoopAccelerationTechnique=FAST_UPR [2021-08-27 07:47:16,789 INFO L340 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2021-08-27 07:47:16,816 INFO L276 IsEmpty]: Start isEmpty. Operand has 518 states, 383 states have (on average 1.4908616187989556) internal successors, (571), 405 states have internal predecessors, (571), 103 states have call successors, (103), 29 states have call predecessors, (103), 29 states have return successors, (103), 98 states have call predecessors, (103), 103 states have call successors, (103) [2021-08-27 07:47:16,822 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2021-08-27 07:47:16,822 INFO L504 BasicCegarLoop]: Found error trace [2021-08-27 07:47:16,823 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-27 07:47:16,823 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting mainErr0ENSURES_VIOLATIONMEMORY_LEAK === [mainErr0ENSURES_VIOLATIONMEMORY_LEAK, errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2021-08-27 07:47:16,829 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 07:47:16,830 INFO L82 PathProgramCache]: Analyzing trace with hash 633313405, now seen corresponding path program 1 times [2021-08-27 07:47:16,836 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 07:47:16,837 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [332951138] [2021-08-27 07:47:16,837 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 07:47:16,840 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 07:47:16,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:47:17,088 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-08-27 07:47:17,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:47:17,141 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-08-27 07:47:17,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:47:17,152 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 07:47:17,153 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 07:47:17,153 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [332951138] [2021-08-27 07:47:17,157 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [332951138] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-27 07:47:17,157 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-27 07:47:17,157 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-08-27 07:47:17,164 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [277953030] [2021-08-27 07:47:17,167 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-08-27 07:47:17,169 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-27 07:47:17,176 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-08-27 07:47:17,176 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-08-27 07:47:17,178 INFO L87 Difference]: Start difference. First operand has 518 states, 383 states have (on average 1.4908616187989556) internal successors, (571), 405 states have internal predecessors, (571), 103 states have call successors, (103), 29 states have call predecessors, (103), 29 states have return successors, (103), 98 states have call predecessors, (103), 103 states have call successors, (103) Second operand has 4 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 2 states have internal predecessors, (10), 1 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2021-08-27 07:47:18,777 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 07:47:18,777 INFO L93 Difference]: Finished difference Result 671 states and 1030 transitions. [2021-08-27 07:47:18,778 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-08-27 07:47:18,779 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 2 states have internal predecessors, (10), 1 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 15 [2021-08-27 07:47:18,779 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-27 07:47:18,789 INFO L225 Difference]: With dead ends: 671 [2021-08-27 07:47:18,789 INFO L226 Difference]: Without dead ends: 665 [2021-08-27 07:47:18,790 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 89.7ms TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-08-27 07:47:18,800 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 665 states. [2021-08-27 07:47:18,843 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 665 to 509. [2021-08-27 07:47:18,844 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 509 states, 378 states have (on average 1.4603174603174602) internal successors, (552), 397 states have internal predecessors, (552), 103 states have call successors, (103), 29 states have call predecessors, (103), 27 states have return successors, (86), 86 states have call predecessors, (86), 86 states have call successors, (86) [2021-08-27 07:47:18,847 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 509 states to 509 states and 741 transitions. [2021-08-27 07:47:18,847 INFO L78 Accepts]: Start accepts. Automaton has 509 states and 741 transitions. Word has length 15 [2021-08-27 07:47:18,848 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-27 07:47:18,848 INFO L470 AbstractCegarLoop]: Abstraction has 509 states and 741 transitions. [2021-08-27 07:47:18,848 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 2 states have internal predecessors, (10), 1 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2021-08-27 07:47:18,848 INFO L276 IsEmpty]: Start isEmpty. Operand 509 states and 741 transitions. [2021-08-27 07:47:18,849 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2021-08-27 07:47:18,849 INFO L504 BasicCegarLoop]: Found error trace [2021-08-27 07:47:18,849 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-27 07:47:18,857 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-08-27 07:47:18,857 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK === [mainErr0ENSURES_VIOLATIONMEMORY_LEAK, errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2021-08-27 07:47:18,858 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 07:47:18,858 INFO L82 PathProgramCache]: Analyzing trace with hash -1738610777, now seen corresponding path program 1 times [2021-08-27 07:47:18,859 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 07:47:18,859 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [283099869] [2021-08-27 07:47:18,859 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 07:47:18,859 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 07:47:18,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:47:18,968 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-08-27 07:47:18,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:47:19,002 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-08-27 07:47:19,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:47:19,010 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 07:47:19,010 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 07:47:19,011 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [283099869] [2021-08-27 07:47:19,011 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [283099869] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-27 07:47:19,011 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-27 07:47:19,011 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-08-27 07:47:19,011 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1356033020] [2021-08-27 07:47:19,012 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-08-27 07:47:19,012 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-27 07:47:19,013 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-08-27 07:47:19,013 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2021-08-27 07:47:19,013 INFO L87 Difference]: Start difference. First operand 509 states and 741 transitions. Second operand has 5 states, 5 states have (on average 2.8) internal successors, (14), 3 states have internal predecessors, (14), 2 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2021-08-27 07:47:20,874 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 07:47:20,874 INFO L93 Difference]: Finished difference Result 670 states and 1022 transitions. [2021-08-27 07:47:20,877 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-08-27 07:47:20,877 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.8) internal successors, (14), 3 states have internal predecessors, (14), 2 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 20 [2021-08-27 07:47:20,877 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-27 07:47:20,881 INFO L225 Difference]: With dead ends: 670 [2021-08-27 07:47:20,881 INFO L226 Difference]: Without dead ends: 665 [2021-08-27 07:47:20,881 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 159.7ms TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2021-08-27 07:47:20,882 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 665 states. [2021-08-27 07:47:20,898 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 665 to 509. [2021-08-27 07:47:20,898 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 509 states, 378 states have (on average 1.4576719576719577) internal successors, (551), 397 states have internal predecessors, (551), 103 states have call successors, (103), 29 states have call predecessors, (103), 27 states have return successors, (86), 86 states have call predecessors, (86), 86 states have call successors, (86) [2021-08-27 07:47:20,900 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 509 states to 509 states and 740 transitions. [2021-08-27 07:47:20,901 INFO L78 Accepts]: Start accepts. Automaton has 509 states and 740 transitions. Word has length 20 [2021-08-27 07:47:20,901 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-27 07:47:20,901 INFO L470 AbstractCegarLoop]: Abstraction has 509 states and 740 transitions. [2021-08-27 07:47:20,901 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.8) internal successors, (14), 3 states have internal predecessors, (14), 2 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2021-08-27 07:47:20,901 INFO L276 IsEmpty]: Start isEmpty. Operand 509 states and 740 transitions. [2021-08-27 07:47:20,905 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2021-08-27 07:47:20,906 INFO L504 BasicCegarLoop]: Found error trace [2021-08-27 07:47:20,906 INFO L512 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] [2021-08-27 07:47:20,906 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-08-27 07:47:20,906 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK === [mainErr0ENSURES_VIOLATIONMEMORY_LEAK, errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2021-08-27 07:47:20,906 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 07:47:20,907 INFO L82 PathProgramCache]: Analyzing trace with hash 1016281706, now seen corresponding path program 1 times [2021-08-27 07:47:20,907 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 07:47:20,907 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [375659046] [2021-08-27 07:47:20,907 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 07:47:20,907 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 07:47:20,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:47:21,014 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-08-27 07:47:21,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:47:21,044 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-08-27 07:47:21,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:47:21,062 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-08-27 07:47:21,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:47:21,070 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 07:47:21,070 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 07:47:21,071 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [375659046] [2021-08-27 07:47:21,071 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [375659046] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-27 07:47:21,071 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-27 07:47:21,071 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-08-27 07:47:21,072 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1301746416] [2021-08-27 07:47:21,072 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-08-27 07:47:21,072 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-27 07:47:21,073 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-08-27 07:47:21,073 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2021-08-27 07:47:21,073 INFO L87 Difference]: Start difference. First operand 509 states and 740 transitions. Second operand has 6 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 3 states have internal predecessors, (16), 3 states have call successors, (6), 6 states have call predecessors, (6), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2021-08-27 07:47:22,746 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 07:47:22,746 INFO L93 Difference]: Finished difference Result 847 states and 1261 transitions. [2021-08-27 07:47:22,747 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-08-27 07:47:22,747 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 3 states have internal predecessors, (16), 3 states have call successors, (6), 6 states have call predecessors, (6), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) Word has length 25 [2021-08-27 07:47:22,747 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-27 07:47:22,753 INFO L225 Difference]: With dead ends: 847 [2021-08-27 07:47:22,753 INFO L226 Difference]: Without dead ends: 846 [2021-08-27 07:47:22,753 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 172.8ms TimeCoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2021-08-27 07:47:22,754 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 846 states. [2021-08-27 07:47:22,781 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 846 to 664. [2021-08-27 07:47:22,783 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 664 states, 502 states have (on average 1.408366533864542) internal successors, (707), 510 states have internal predecessors, (707), 112 states have call successors, (112), 40 states have call predecessors, (112), 49 states have return successors, (145), 119 states have call predecessors, (145), 99 states have call successors, (145) [2021-08-27 07:47:22,787 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 664 states to 664 states and 964 transitions. [2021-08-27 07:47:22,787 INFO L78 Accepts]: Start accepts. Automaton has 664 states and 964 transitions. Word has length 25 [2021-08-27 07:47:22,787 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-27 07:47:22,788 INFO L470 AbstractCegarLoop]: Abstraction has 664 states and 964 transitions. [2021-08-27 07:47:22,788 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 3 states have internal predecessors, (16), 3 states have call successors, (6), 6 states have call predecessors, (6), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2021-08-27 07:47:22,788 INFO L276 IsEmpty]: Start isEmpty. Operand 664 states and 964 transitions. [2021-08-27 07:47:22,795 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2021-08-27 07:47:22,795 INFO L504 BasicCegarLoop]: Found error trace [2021-08-27 07:47:22,795 INFO L512 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, 1, 1, 1] [2021-08-27 07:47:22,796 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-08-27 07:47:22,796 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK === [mainErr0ENSURES_VIOLATIONMEMORY_LEAK, errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2021-08-27 07:47:22,796 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 07:47:22,796 INFO L82 PathProgramCache]: Analyzing trace with hash -1367852756, now seen corresponding path program 1 times [2021-08-27 07:47:22,796 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 07:47:22,797 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [39819073] [2021-08-27 07:47:22,798 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 07:47:22,798 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 07:47:22,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:47:22,926 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-08-27 07:47:22,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:47:22,955 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-08-27 07:47:22,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:47:22,973 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-08-27 07:47:22,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:47:23,007 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 07:47:23,007 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 07:47:23,008 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [39819073] [2021-08-27 07:47:23,010 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [39819073] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-27 07:47:23,011 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-27 07:47:23,011 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-08-27 07:47:23,011 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1139813568] [2021-08-27 07:47:23,012 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-08-27 07:47:23,012 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-27 07:47:23,012 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-08-27 07:47:23,012 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2021-08-27 07:47:23,013 INFO L87 Difference]: Start difference. First operand 664 states and 964 transitions. Second operand has 6 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 3 states have internal predecessors, (19), 3 states have call successors, (8), 6 states have call predecessors, (8), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2021-08-27 07:47:25,042 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 07:47:25,042 INFO L93 Difference]: Finished difference Result 970 states and 1415 transitions. [2021-08-27 07:47:25,049 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-08-27 07:47:25,049 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 3 states have internal predecessors, (19), 3 states have call successors, (8), 6 states have call predecessors, (8), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) Word has length 30 [2021-08-27 07:47:25,049 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-27 07:47:25,063 INFO L225 Difference]: With dead ends: 970 [2021-08-27 07:47:25,063 INFO L226 Difference]: Without dead ends: 970 [2021-08-27 07:47:25,063 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 8 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 169.8ms TimeCoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2021-08-27 07:47:25,064 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 970 states. [2021-08-27 07:47:25,080 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 970 to 789. [2021-08-27 07:47:25,081 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 789 states, 611 states have (on average 1.4042553191489362) internal successors, (858), 615 states have internal predecessors, (858), 114 states have call successors, (114), 46 states have call predecessors, (114), 63 states have return successors, (163), 130 states have call predecessors, (163), 104 states have call successors, (163) [2021-08-27 07:47:25,083 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 789 states to 789 states and 1135 transitions. [2021-08-27 07:47:25,083 INFO L78 Accepts]: Start accepts. Automaton has 789 states and 1135 transitions. Word has length 30 [2021-08-27 07:47:25,083 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-27 07:47:25,084 INFO L470 AbstractCegarLoop]: Abstraction has 789 states and 1135 transitions. [2021-08-27 07:47:25,084 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 3 states have internal predecessors, (19), 3 states have call successors, (8), 6 states have call predecessors, (8), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2021-08-27 07:47:25,084 INFO L276 IsEmpty]: Start isEmpty. Operand 789 states and 1135 transitions. [2021-08-27 07:47:25,085 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2021-08-27 07:47:25,085 INFO L504 BasicCegarLoop]: Found error trace [2021-08-27 07:47:25,085 INFO L512 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, 1, 1, 1, 1] [2021-08-27 07:47:25,086 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-08-27 07:47:25,086 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK === [mainErr0ENSURES_VIOLATIONMEMORY_LEAK, errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2021-08-27 07:47:25,086 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 07:47:25,086 INFO L82 PathProgramCache]: Analyzing trace with hash -1062919399, now seen corresponding path program 1 times [2021-08-27 07:47:25,087 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 07:47:25,087 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [776405773] [2021-08-27 07:47:25,087 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 07:47:25,087 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 07:47:25,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:47:25,184 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-08-27 07:47:25,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:47:25,221 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-08-27 07:47:25,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:47:25,237 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-08-27 07:47:25,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:47:25,240 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 07:47:25,240 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 07:47:25,240 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [776405773] [2021-08-27 07:47:25,241 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [776405773] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-27 07:47:25,241 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-27 07:47:25,241 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-08-27 07:47:25,241 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [787008784] [2021-08-27 07:47:25,241 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-08-27 07:47:25,241 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-27 07:47:25,243 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-08-27 07:47:25,243 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2021-08-27 07:47:25,244 INFO L87 Difference]: Start difference. First operand 789 states and 1135 transitions. Second operand has 6 states, 6 states have (on average 3.5) internal successors, (21), 3 states have internal predecessors, (21), 2 states have call successors, (7), 5 states have call predecessors, (7), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2021-08-27 07:47:27,607 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 07:47:27,607 INFO L93 Difference]: Finished difference Result 1344 states and 2031 transitions. [2021-08-27 07:47:27,608 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-08-27 07:47:27,608 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.5) internal successors, (21), 3 states have internal predecessors, (21), 2 states have call successors, (7), 5 states have call predecessors, (7), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 31 [2021-08-27 07:47:27,608 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-27 07:47:27,612 INFO L225 Difference]: With dead ends: 1344 [2021-08-27 07:47:27,612 INFO L226 Difference]: Without dead ends: 1344 [2021-08-27 07:47:27,612 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 178.4ms TimeCoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2021-08-27 07:47:27,613 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1344 states. [2021-08-27 07:47:27,628 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1344 to 907. [2021-08-27 07:47:27,629 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 907 states, 708 states have (on average 1.4138418079096045) internal successors, (1001), 711 states have internal predecessors, (1001), 127 states have call successors, (127), 54 states have call predecessors, (127), 71 states have return successors, (220), 144 states have call predecessors, (220), 117 states have call successors, (220) [2021-08-27 07:47:27,632 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 907 states to 907 states and 1348 transitions. [2021-08-27 07:47:27,632 INFO L78 Accepts]: Start accepts. Automaton has 907 states and 1348 transitions. Word has length 31 [2021-08-27 07:47:27,632 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-27 07:47:27,632 INFO L470 AbstractCegarLoop]: Abstraction has 907 states and 1348 transitions. [2021-08-27 07:47:27,632 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.5) internal successors, (21), 3 states have internal predecessors, (21), 2 states have call successors, (7), 5 states have call predecessors, (7), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2021-08-27 07:47:27,632 INFO L276 IsEmpty]: Start isEmpty. Operand 907 states and 1348 transitions. [2021-08-27 07:47:27,633 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2021-08-27 07:47:27,633 INFO L504 BasicCegarLoop]: Found error trace [2021-08-27 07:47:27,633 INFO L512 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, 1, 1, 1, 1, 1] [2021-08-27 07:47:27,633 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-08-27 07:47:27,633 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK === [mainErr0ENSURES_VIOLATIONMEMORY_LEAK, errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2021-08-27 07:47:27,634 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 07:47:27,634 INFO L82 PathProgramCache]: Analyzing trace with hash 1170843407, now seen corresponding path program 1 times [2021-08-27 07:47:27,634 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 07:47:27,634 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2023240801] [2021-08-27 07:47:27,634 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 07:47:27,634 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 07:47:27,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:47:27,741 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-08-27 07:47:27,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:47:27,784 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-08-27 07:47:27,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:47:27,815 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-08-27 07:47:27,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:47:27,836 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 07:47:27,837 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 07:47:27,837 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2023240801] [2021-08-27 07:47:27,837 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2023240801] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-27 07:47:27,837 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-27 07:47:27,837 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2021-08-27 07:47:27,837 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1824017367] [2021-08-27 07:47:27,838 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2021-08-27 07:47:27,838 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-27 07:47:27,838 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-08-27 07:47:27,838 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2021-08-27 07:47:27,838 INFO L87 Difference]: Start difference. First operand 907 states and 1348 transitions. Second operand has 9 states, 9 states have (on average 2.4444444444444446) internal successors, (22), 6 states have internal predecessors, (22), 4 states have call successors, (7), 6 states have call predecessors, (7), 3 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2021-08-27 07:47:30,381 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 07:47:30,381 INFO L93 Difference]: Finished difference Result 1046 states and 1583 transitions. [2021-08-27 07:47:30,382 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-08-27 07:47:30,382 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 2.4444444444444446) internal successors, (22), 6 states have internal predecessors, (22), 4 states have call successors, (7), 6 states have call predecessors, (7), 3 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) Word has length 32 [2021-08-27 07:47:30,382 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-27 07:47:30,385 INFO L225 Difference]: With dead ends: 1046 [2021-08-27 07:47:30,385 INFO L226 Difference]: Without dead ends: 1046 [2021-08-27 07:47:30,386 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 454.9ms TimeCoverageRelationStatistics Valid=61, Invalid=121, Unknown=0, NotChecked=0, Total=182 [2021-08-27 07:47:30,387 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1046 states. [2021-08-27 07:47:30,399 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1046 to 835. [2021-08-27 07:47:30,400 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 835 states, 649 states have (on average 1.399075500770416) internal successors, (908), 653 states have internal predecessors, (908), 118 states have call successors, (118), 50 states have call predecessors, (118), 67 states have return successors, (177), 134 states have call predecessors, (177), 108 states have call successors, (177) [2021-08-27 07:47:30,403 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 835 states to 835 states and 1203 transitions. [2021-08-27 07:47:30,404 INFO L78 Accepts]: Start accepts. Automaton has 835 states and 1203 transitions. Word has length 32 [2021-08-27 07:47:30,404 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-27 07:47:30,404 INFO L470 AbstractCegarLoop]: Abstraction has 835 states and 1203 transitions. [2021-08-27 07:47:30,404 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 2.4444444444444446) internal successors, (22), 6 states have internal predecessors, (22), 4 states have call successors, (7), 6 states have call predecessors, (7), 3 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2021-08-27 07:47:30,405 INFO L276 IsEmpty]: Start isEmpty. Operand 835 states and 1203 transitions. [2021-08-27 07:47:30,406 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2021-08-27 07:47:30,406 INFO L504 BasicCegarLoop]: Found error trace [2021-08-27 07:47:30,407 INFO L512 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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-27 07:47:30,407 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2021-08-27 07:47:30,407 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK === [mainErr0ENSURES_VIOLATIONMEMORY_LEAK, errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2021-08-27 07:47:30,407 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 07:47:30,407 INFO L82 PathProgramCache]: Analyzing trace with hash 1821153895, now seen corresponding path program 1 times [2021-08-27 07:47:30,408 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 07:47:30,411 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [72984226] [2021-08-27 07:47:30,411 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 07:47:30,411 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 07:47:30,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:47:30,507 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-08-27 07:47:30,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:47:30,534 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-08-27 07:47:30,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:47:30,556 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-08-27 07:47:30,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:47:30,560 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 07:47:30,560 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 07:47:30,560 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [72984226] [2021-08-27 07:47:30,560 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [72984226] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-27 07:47:30,560 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-27 07:47:30,560 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-08-27 07:47:30,560 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [238365305] [2021-08-27 07:47:30,560 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-08-27 07:47:30,560 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-27 07:47:30,561 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-08-27 07:47:30,561 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2021-08-27 07:47:30,561 INFO L87 Difference]: Start difference. First operand 835 states and 1203 transitions. Second operand has 6 states, 6 states have (on average 4.166666666666667) internal successors, (25), 3 states have internal predecessors, (25), 3 states have call successors, (8), 6 states have call predecessors, (8), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2021-08-27 07:47:32,522 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 07:47:32,522 INFO L93 Difference]: Finished difference Result 961 states and 1420 transitions. [2021-08-27 07:47:32,522 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-08-27 07:47:32,522 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 4.166666666666667) internal successors, (25), 3 states have internal predecessors, (25), 3 states have call successors, (8), 6 states have call predecessors, (8), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 36 [2021-08-27 07:47:32,522 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-27 07:47:32,525 INFO L225 Difference]: With dead ends: 961 [2021-08-27 07:47:32,525 INFO L226 Difference]: Without dead ends: 961 [2021-08-27 07:47:32,526 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 148.3ms TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2021-08-27 07:47:32,526 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 961 states. [2021-08-27 07:47:32,537 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 961 to 834. [2021-08-27 07:47:32,538 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 834 states, 649 states have (on average 1.3959938366718028) internal successors, (906), 652 states have internal predecessors, (906), 117 states have call successors, (117), 50 states have call predecessors, (117), 67 states have return successors, (177), 134 states have call predecessors, (177), 108 states have call successors, (177) [2021-08-27 07:47:32,541 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 834 states to 834 states and 1200 transitions. [2021-08-27 07:47:32,541 INFO L78 Accepts]: Start accepts. Automaton has 834 states and 1200 transitions. Word has length 36 [2021-08-27 07:47:32,541 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-27 07:47:32,541 INFO L470 AbstractCegarLoop]: Abstraction has 834 states and 1200 transitions. [2021-08-27 07:47:32,541 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 4.166666666666667) internal successors, (25), 3 states have internal predecessors, (25), 3 states have call successors, (8), 6 states have call predecessors, (8), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2021-08-27 07:47:32,541 INFO L276 IsEmpty]: Start isEmpty. Operand 834 states and 1200 transitions. [2021-08-27 07:47:32,543 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2021-08-27 07:47:32,543 INFO L504 BasicCegarLoop]: Found error trace [2021-08-27 07:47:32,543 INFO L512 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-27 07:47:32,543 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2021-08-27 07:47:32,543 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK === [mainErr0ENSURES_VIOLATIONMEMORY_LEAK, errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2021-08-27 07:47:32,544 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 07:47:32,544 INFO L82 PathProgramCache]: Analyzing trace with hash -591738262, now seen corresponding path program 1 times [2021-08-27 07:47:32,544 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 07:47:32,544 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [530758900] [2021-08-27 07:47:32,544 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 07:47:32,544 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 07:47:32,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:47:32,641 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-08-27 07:47:32,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:47:32,677 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-08-27 07:47:32,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:47:32,694 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-08-27 07:47:32,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:47:32,701 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 07:47:32,701 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 07:47:32,701 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [530758900] [2021-08-27 07:47:32,701 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [530758900] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-27 07:47:32,701 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-27 07:47:32,701 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-08-27 07:47:32,701 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [649433376] [2021-08-27 07:47:32,702 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-08-27 07:47:32,702 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-27 07:47:32,702 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-08-27 07:47:32,702 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2021-08-27 07:47:32,702 INFO L87 Difference]: Start difference. First operand 834 states and 1200 transitions. Second operand has 7 states, 7 states have (on average 3.7142857142857144) internal successors, (26), 4 states have internal predecessors, (26), 3 states have call successors, (10), 6 states have call predecessors, (10), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2021-08-27 07:47:35,182 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 07:47:35,182 INFO L93 Difference]: Finished difference Result 999 states and 1436 transitions. [2021-08-27 07:47:35,182 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-08-27 07:47:35,183 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 3.7142857142857144) internal successors, (26), 4 states have internal predecessors, (26), 3 states have call successors, (10), 6 states have call predecessors, (10), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 39 [2021-08-27 07:47:35,183 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-27 07:47:35,185 INFO L225 Difference]: With dead ends: 999 [2021-08-27 07:47:35,185 INFO L226 Difference]: Without dead ends: 999 [2021-08-27 07:47:35,186 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 282.8ms TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2021-08-27 07:47:35,186 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 999 states. [2021-08-27 07:47:35,195 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 999 to 736. [2021-08-27 07:47:35,196 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 736 states, 571 states have (on average 1.3870402802101576) internal successors, (792), 575 states have internal predecessors, (792), 106 states have call successors, (106), 45 states have call predecessors, (106), 58 states have return successors, (131), 118 states have call predecessors, (131), 97 states have call successors, (131) [2021-08-27 07:47:35,198 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 736 states to 736 states and 1029 transitions. [2021-08-27 07:47:35,198 INFO L78 Accepts]: Start accepts. Automaton has 736 states and 1029 transitions. Word has length 39 [2021-08-27 07:47:35,198 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-27 07:47:35,198 INFO L470 AbstractCegarLoop]: Abstraction has 736 states and 1029 transitions. [2021-08-27 07:47:35,198 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 3.7142857142857144) internal successors, (26), 4 states have internal predecessors, (26), 3 states have call successors, (10), 6 states have call predecessors, (10), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2021-08-27 07:47:35,198 INFO L276 IsEmpty]: Start isEmpty. Operand 736 states and 1029 transitions. [2021-08-27 07:47:35,199 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2021-08-27 07:47:35,199 INFO L504 BasicCegarLoop]: Found error trace [2021-08-27 07:47:35,199 INFO L512 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-27 07:47:35,200 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2021-08-27 07:47:35,200 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK === [mainErr0ENSURES_VIOLATIONMEMORY_LEAK, errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2021-08-27 07:47:35,200 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 07:47:35,200 INFO L82 PathProgramCache]: Analyzing trace with hash -1528077449, now seen corresponding path program 1 times [2021-08-27 07:47:35,200 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 07:47:35,200 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1246466150] [2021-08-27 07:47:35,201 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 07:47:35,201 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 07:47:35,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:47:35,292 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-08-27 07:47:35,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:47:35,331 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-08-27 07:47:35,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:47:35,348 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-08-27 07:47:35,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:47:35,368 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 07:47:35,368 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 07:47:35,368 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1246466150] [2021-08-27 07:47:35,368 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1246466150] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-27 07:47:35,369 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-27 07:47:35,369 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-08-27 07:47:35,369 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2144421495] [2021-08-27 07:47:35,370 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-08-27 07:47:35,370 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-27 07:47:35,370 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-08-27 07:47:35,370 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2021-08-27 07:47:35,370 INFO L87 Difference]: Start difference. First operand 736 states and 1029 transitions. Second operand has 6 states, 6 states have (on average 4.666666666666667) internal successors, (28), 3 states have internal predecessors, (28), 3 states have call successors, (9), 6 states have call predecessors, (9), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2021-08-27 07:47:36,625 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 07:47:36,625 INFO L93 Difference]: Finished difference Result 959 states and 1380 transitions. [2021-08-27 07:47:36,625 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-08-27 07:47:36,625 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 4.666666666666667) internal successors, (28), 3 states have internal predecessors, (28), 3 states have call successors, (9), 6 states have call predecessors, (9), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) Word has length 40 [2021-08-27 07:47:36,627 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-27 07:47:36,629 INFO L225 Difference]: With dead ends: 959 [2021-08-27 07:47:36,630 INFO L226 Difference]: Without dead ends: 959 [2021-08-27 07:47:36,630 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 9 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 188.1ms TimeCoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2021-08-27 07:47:36,631 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 959 states. [2021-08-27 07:47:36,639 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 959 to 762. [2021-08-27 07:47:36,641 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 762 states, 595 states have (on average 1.3983193277310924) internal successors, (832), 608 states have internal predecessors, (832), 108 states have call successors, (108), 48 states have call predecessors, (108), 58 states have return successors, (124), 110 states have call predecessors, (124), 100 states have call successors, (124) [2021-08-27 07:47:36,643 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 762 states to 762 states and 1064 transitions. [2021-08-27 07:47:36,643 INFO L78 Accepts]: Start accepts. Automaton has 762 states and 1064 transitions. Word has length 40 [2021-08-27 07:47:36,644 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-27 07:47:36,644 INFO L470 AbstractCegarLoop]: Abstraction has 762 states and 1064 transitions. [2021-08-27 07:47:36,644 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 4.666666666666667) internal successors, (28), 3 states have internal predecessors, (28), 3 states have call successors, (9), 6 states have call predecessors, (9), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2021-08-27 07:47:36,644 INFO L276 IsEmpty]: Start isEmpty. Operand 762 states and 1064 transitions. [2021-08-27 07:47:36,646 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2021-08-27 07:47:36,646 INFO L504 BasicCegarLoop]: Found error trace [2021-08-27 07:47:36,646 INFO L512 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-27 07:47:36,646 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2021-08-27 07:47:36,646 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK === [mainErr0ENSURES_VIOLATIONMEMORY_LEAK, errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2021-08-27 07:47:36,646 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 07:47:36,647 INFO L82 PathProgramCache]: Analyzing trace with hash -621720949, now seen corresponding path program 1 times [2021-08-27 07:47:36,647 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 07:47:36,647 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2091308962] [2021-08-27 07:47:36,648 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 07:47:36,648 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 07:47:36,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:47:36,741 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-08-27 07:47:36,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:47:36,767 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-08-27 07:47:36,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:47:36,783 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-08-27 07:47:36,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:47:36,793 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2021-08-27 07:47:36,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:47:36,795 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 07:47:36,796 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 07:47:36,796 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2091308962] [2021-08-27 07:47:36,796 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2091308962] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-27 07:47:36,796 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-27 07:47:36,796 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-08-27 07:47:36,796 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [914824500] [2021-08-27 07:47:36,796 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-08-27 07:47:36,797 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-27 07:47:36,797 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-08-27 07:47:36,797 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2021-08-27 07:47:36,797 INFO L87 Difference]: Start difference. First operand 762 states and 1064 transitions. Second operand has 7 states, 7 states have (on average 4.571428571428571) internal successors, (32), 3 states have internal predecessors, (32), 3 states have call successors, (10), 7 states have call predecessors, (10), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2021-08-27 07:47:38,603 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 07:47:38,603 INFO L93 Difference]: Finished difference Result 942 states and 1357 transitions. [2021-08-27 07:47:38,604 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-08-27 07:47:38,604 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 4.571428571428571) internal successors, (32), 3 states have internal predecessors, (32), 3 states have call successors, (10), 7 states have call predecessors, (10), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 46 [2021-08-27 07:47:38,604 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-27 07:47:38,607 INFO L225 Difference]: With dead ends: 942 [2021-08-27 07:47:38,607 INFO L226 Difference]: Without dead ends: 942 [2021-08-27 07:47:38,608 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 168.5ms TimeCoverageRelationStatistics Valid=29, Invalid=43, Unknown=0, NotChecked=0, Total=72 [2021-08-27 07:47:38,608 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 942 states. [2021-08-27 07:47:38,617 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 942 to 762. [2021-08-27 07:47:38,618 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 762 states, 595 states have (on average 1.3966386554621848) internal successors, (831), 608 states have internal predecessors, (831), 108 states have call successors, (108), 48 states have call predecessors, (108), 58 states have return successors, (124), 110 states have call predecessors, (124), 100 states have call successors, (124) [2021-08-27 07:47:38,619 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 762 states to 762 states and 1063 transitions. [2021-08-27 07:47:38,619 INFO L78 Accepts]: Start accepts. Automaton has 762 states and 1063 transitions. Word has length 46 [2021-08-27 07:47:38,620 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-27 07:47:38,620 INFO L470 AbstractCegarLoop]: Abstraction has 762 states and 1063 transitions. [2021-08-27 07:47:38,620 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 4.571428571428571) internal successors, (32), 3 states have internal predecessors, (32), 3 states have call successors, (10), 7 states have call predecessors, (10), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2021-08-27 07:47:38,620 INFO L276 IsEmpty]: Start isEmpty. Operand 762 states and 1063 transitions. [2021-08-27 07:47:38,622 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2021-08-27 07:47:38,622 INFO L504 BasicCegarLoop]: Found error trace [2021-08-27 07:47:38,622 INFO L512 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-27 07:47:38,622 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2021-08-27 07:47:38,623 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK === [mainErr0ENSURES_VIOLATIONMEMORY_LEAK, errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2021-08-27 07:47:38,623 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 07:47:38,623 INFO L82 PathProgramCache]: Analyzing trace with hash 1459738846, now seen corresponding path program 1 times [2021-08-27 07:47:38,623 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 07:47:38,624 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [827882993] [2021-08-27 07:47:38,624 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 07:47:38,625 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 07:47:38,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:47:38,712 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-08-27 07:47:38,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:47:38,742 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-08-27 07:47:38,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:47:38,757 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-08-27 07:47:38,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:47:38,767 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2021-08-27 07:47:38,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:47:38,772 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 07:47:38,772 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 07:47:38,772 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [827882993] [2021-08-27 07:47:38,772 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [827882993] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-27 07:47:38,772 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-27 07:47:38,772 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-08-27 07:47:38,772 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1222006444] [2021-08-27 07:47:38,773 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-08-27 07:47:38,773 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-27 07:47:38,773 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-08-27 07:47:38,773 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2021-08-27 07:47:38,773 INFO L87 Difference]: Start difference. First operand 762 states and 1063 transitions. Second operand has 7 states, 7 states have (on average 4.857142857142857) internal successors, (34), 3 states have internal predecessors, (34), 3 states have call successors, (9), 7 states have call predecessors, (9), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2021-08-27 07:47:39,795 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 07:47:39,796 INFO L93 Difference]: Finished difference Result 897 states and 1299 transitions. [2021-08-27 07:47:39,796 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-08-27 07:47:39,796 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 4.857142857142857) internal successors, (34), 3 states have internal predecessors, (34), 3 states have call successors, (9), 7 states have call predecessors, (9), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 47 [2021-08-27 07:47:39,796 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-27 07:47:39,799 INFO L225 Difference]: With dead ends: 897 [2021-08-27 07:47:39,799 INFO L226 Difference]: Without dead ends: 897 [2021-08-27 07:47:39,799 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 172.0ms TimeCoverageRelationStatistics Valid=37, Invalid=53, Unknown=0, NotChecked=0, Total=90 [2021-08-27 07:47:39,800 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 897 states. [2021-08-27 07:47:39,808 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 897 to 751. [2021-08-27 07:47:39,809 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 751 states, 588 states have (on average 1.3979591836734695) internal successors, (822), 601 states have internal predecessors, (822), 106 states have call successors, (106), 46 states have call predecessors, (106), 56 states have return successors, (122), 108 states have call predecessors, (122), 98 states have call successors, (122) [2021-08-27 07:47:39,810 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 751 states to 751 states and 1050 transitions. [2021-08-27 07:47:39,810 INFO L78 Accepts]: Start accepts. Automaton has 751 states and 1050 transitions. Word has length 47 [2021-08-27 07:47:39,810 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-27 07:47:39,810 INFO L470 AbstractCegarLoop]: Abstraction has 751 states and 1050 transitions. [2021-08-27 07:47:39,811 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 4.857142857142857) internal successors, (34), 3 states have internal predecessors, (34), 3 states have call successors, (9), 7 states have call predecessors, (9), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2021-08-27 07:47:39,811 INFO L276 IsEmpty]: Start isEmpty. Operand 751 states and 1050 transitions. [2021-08-27 07:47:39,812 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2021-08-27 07:47:39,812 INFO L504 BasicCegarLoop]: Found error trace [2021-08-27 07:47:39,812 INFO L512 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-27 07:47:39,812 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2021-08-27 07:47:39,812 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK === [mainErr0ENSURES_VIOLATIONMEMORY_LEAK, errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2021-08-27 07:47:39,812 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 07:47:39,813 INFO L82 PathProgramCache]: Analyzing trace with hash 1711019189, now seen corresponding path program 1 times [2021-08-27 07:47:39,813 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 07:47:39,813 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [52606420] [2021-08-27 07:47:39,813 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 07:47:39,813 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 07:47:39,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:47:39,909 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-08-27 07:47:39,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:47:39,953 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-08-27 07:47:39,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:47:39,976 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-08-27 07:47:39,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:47:39,986 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2021-08-27 07:47:39,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:47:40,020 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-08-27 07:47:40,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:47:40,041 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 07:47:40,041 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 07:47:40,041 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [52606420] [2021-08-27 07:47:40,041 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [52606420] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-27 07:47:40,041 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-27 07:47:40,041 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2021-08-27 07:47:40,042 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1701668772] [2021-08-27 07:47:40,042 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2021-08-27 07:47:40,042 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-27 07:47:40,042 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-08-27 07:47:40,042 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 [2021-08-27 07:47:40,043 INFO L87 Difference]: Start difference. First operand 751 states and 1050 transitions. Second operand has 11 states, 11 states have (on average 3.272727272727273) internal successors, (36), 7 states have internal predecessors, (36), 4 states have call successors, (7), 6 states have call predecessors, (7), 4 states have return successors, (5), 4 states have call predecessors, (5), 3 states have call successors, (5) [2021-08-27 07:47:42,541 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 07:47:42,541 INFO L93 Difference]: Finished difference Result 1006 states and 1439 transitions. [2021-08-27 07:47:42,541 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2021-08-27 07:47:42,541 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 3.272727272727273) internal successors, (36), 7 states have internal predecessors, (36), 4 states have call successors, (7), 6 states have call predecessors, (7), 4 states have return successors, (5), 4 states have call predecessors, (5), 3 states have call successors, (5) Word has length 48 [2021-08-27 07:47:42,542 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-27 07:47:42,544 INFO L225 Difference]: With dead ends: 1006 [2021-08-27 07:47:42,544 INFO L226 Difference]: Without dead ends: 1006 [2021-08-27 07:47:42,544 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 65 ImplicationChecksByTransitivity, 572.3ms TimeCoverageRelationStatistics Valid=118, Invalid=344, Unknown=0, NotChecked=0, Total=462 [2021-08-27 07:47:42,545 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1006 states. [2021-08-27 07:47:42,554 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1006 to 794. [2021-08-27 07:47:42,555 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 794 states, 623 states have (on average 1.3964686998394864) internal successors, (870), 635 states have internal predecessors, (870), 110 states have call successors, (110), 49 states have call predecessors, (110), 60 states have return successors, (131), 114 states have call predecessors, (131), 102 states have call successors, (131) [2021-08-27 07:47:42,556 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 794 states to 794 states and 1111 transitions. [2021-08-27 07:47:42,556 INFO L78 Accepts]: Start accepts. Automaton has 794 states and 1111 transitions. Word has length 48 [2021-08-27 07:47:42,557 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-27 07:47:42,557 INFO L470 AbstractCegarLoop]: Abstraction has 794 states and 1111 transitions. [2021-08-27 07:47:42,557 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 3.272727272727273) internal successors, (36), 7 states have internal predecessors, (36), 4 states have call successors, (7), 6 states have call predecessors, (7), 4 states have return successors, (5), 4 states have call predecessors, (5), 3 states have call successors, (5) [2021-08-27 07:47:42,557 INFO L276 IsEmpty]: Start isEmpty. Operand 794 states and 1111 transitions. [2021-08-27 07:47:42,558 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2021-08-27 07:47:42,558 INFO L504 BasicCegarLoop]: Found error trace [2021-08-27 07:47:42,558 INFO L512 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-27 07:47:42,558 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2021-08-27 07:47:42,559 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK === [mainErr0ENSURES_VIOLATIONMEMORY_LEAK, errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2021-08-27 07:47:42,559 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 07:47:42,559 INFO L82 PathProgramCache]: Analyzing trace with hash -17559376, now seen corresponding path program 1 times [2021-08-27 07:47:42,559 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 07:47:42,559 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [544294266] [2021-08-27 07:47:42,559 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 07:47:42,559 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 07:47:42,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:47:42,633 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-08-27 07:47:42,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:47:42,664 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-08-27 07:47:42,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:47:42,680 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-08-27 07:47:42,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:47:42,690 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2021-08-27 07:47:42,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:47:42,696 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-08-27 07:47:42,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:47:42,716 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 07:47:42,716 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 07:47:42,716 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [544294266] [2021-08-27 07:47:42,716 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [544294266] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-27 07:47:42,716 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-27 07:47:42,716 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-08-27 07:47:42,716 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1617763955] [2021-08-27 07:47:42,717 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2021-08-27 07:47:42,717 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-27 07:47:42,718 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-08-27 07:47:42,718 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2021-08-27 07:47:42,718 INFO L87 Difference]: Start difference. First operand 794 states and 1111 transitions. Second operand has 8 states, 8 states have (on average 4.75) internal successors, (38), 4 states have internal predecessors, (38), 2 states have call successors, (7), 6 states have call predecessors, (7), 2 states have return successors, (5), 2 states have call predecessors, (5), 1 states have call successors, (5) [2021-08-27 07:47:44,239 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 07:47:44,239 INFO L93 Difference]: Finished difference Result 927 states and 1338 transitions. [2021-08-27 07:47:44,240 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-08-27 07:47:44,240 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 4.75) internal successors, (38), 4 states have internal predecessors, (38), 2 states have call successors, (7), 6 states have call predecessors, (7), 2 states have return successors, (5), 2 states have call predecessors, (5), 1 states have call successors, (5) Word has length 50 [2021-08-27 07:47:44,240 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-27 07:47:44,242 INFO L225 Difference]: With dead ends: 927 [2021-08-27 07:47:44,242 INFO L226 Difference]: Without dead ends: 927 [2021-08-27 07:47:44,242 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 233.0ms TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2021-08-27 07:47:44,243 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 927 states. [2021-08-27 07:47:44,251 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 927 to 797. [2021-08-27 07:47:44,252 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 797 states, 626 states have (on average 1.3961661341853036) internal successors, (874), 638 states have internal predecessors, (874), 110 states have call successors, (110), 49 states have call predecessors, (110), 60 states have return successors, (131), 114 states have call predecessors, (131), 102 states have call successors, (131) [2021-08-27 07:47:44,254 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 797 states to 797 states and 1115 transitions. [2021-08-27 07:47:44,254 INFO L78 Accepts]: Start accepts. Automaton has 797 states and 1115 transitions. Word has length 50 [2021-08-27 07:47:44,254 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-27 07:47:44,254 INFO L470 AbstractCegarLoop]: Abstraction has 797 states and 1115 transitions. [2021-08-27 07:47:44,254 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 4.75) internal successors, (38), 4 states have internal predecessors, (38), 2 states have call successors, (7), 6 states have call predecessors, (7), 2 states have return successors, (5), 2 states have call predecessors, (5), 1 states have call successors, (5) [2021-08-27 07:47:44,254 INFO L276 IsEmpty]: Start isEmpty. Operand 797 states and 1115 transitions. [2021-08-27 07:47:44,255 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2021-08-27 07:47:44,255 INFO L504 BasicCegarLoop]: Found error trace [2021-08-27 07:47:44,256 INFO L512 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-27 07:47:44,256 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2021-08-27 07:47:44,256 INFO L402 AbstractCegarLoop]: === Iteration 14 === Targeting errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK === [mainErr0ENSURES_VIOLATIONMEMORY_LEAK, errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2021-08-27 07:47:44,256 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 07:47:44,256 INFO L82 PathProgramCache]: Analyzing trace with hash -2011704082, now seen corresponding path program 1 times [2021-08-27 07:47:44,256 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 07:47:44,257 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [154949736] [2021-08-27 07:47:44,257 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 07:47:44,257 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 07:47:44,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:47:44,333 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-08-27 07:47:44,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:47:44,356 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-08-27 07:47:44,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:47:44,376 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-08-27 07:47:44,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:47:44,386 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2021-08-27 07:47:44,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:47:44,404 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-08-27 07:47:44,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:47:44,423 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 07:47:44,424 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 07:47:44,424 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [154949736] [2021-08-27 07:47:44,424 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [154949736] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-27 07:47:44,424 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-27 07:47:44,424 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2021-08-27 07:47:44,424 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [216845447] [2021-08-27 07:47:44,424 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2021-08-27 07:47:44,425 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-27 07:47:44,425 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-08-27 07:47:44,425 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 [2021-08-27 07:47:44,425 INFO L87 Difference]: Start difference. First operand 797 states and 1115 transitions. Second operand has 11 states, 11 states have (on average 3.4545454545454546) internal successors, (38), 7 states have internal predecessors, (38), 4 states have call successors, (7), 6 states have call predecessors, (7), 4 states have return successors, (5), 4 states have call predecessors, (5), 3 states have call successors, (5) [2021-08-27 07:47:46,748 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 07:47:46,748 INFO L93 Difference]: Finished difference Result 914 states and 1320 transitions. [2021-08-27 07:47:46,748 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-08-27 07:47:46,749 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 3.4545454545454546) internal successors, (38), 7 states have internal predecessors, (38), 4 states have call successors, (7), 6 states have call predecessors, (7), 4 states have return successors, (5), 4 states have call predecessors, (5), 3 states have call successors, (5) Word has length 50 [2021-08-27 07:47:46,749 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-27 07:47:46,751 INFO L225 Difference]: With dead ends: 914 [2021-08-27 07:47:46,751 INFO L226 Difference]: Without dead ends: 914 [2021-08-27 07:47:46,751 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 38 ImplicationChecksByTransitivity, 386.7ms TimeCoverageRelationStatistics Valid=92, Invalid=250, Unknown=0, NotChecked=0, Total=342 [2021-08-27 07:47:46,752 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 914 states. [2021-08-27 07:47:46,760 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 914 to 792. [2021-08-27 07:47:46,761 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 792 states, 621 states have (on average 1.391304347826087) internal successors, (864), 633 states have internal predecessors, (864), 110 states have call successors, (110), 49 states have call predecessors, (110), 60 states have return successors, (131), 114 states have call predecessors, (131), 102 states have call successors, (131) [2021-08-27 07:47:46,762 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 792 states to 792 states and 1105 transitions. [2021-08-27 07:47:46,762 INFO L78 Accepts]: Start accepts. Automaton has 792 states and 1105 transitions. Word has length 50 [2021-08-27 07:47:46,763 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-27 07:47:46,763 INFO L470 AbstractCegarLoop]: Abstraction has 792 states and 1105 transitions. [2021-08-27 07:47:46,763 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 3.4545454545454546) internal successors, (38), 7 states have internal predecessors, (38), 4 states have call successors, (7), 6 states have call predecessors, (7), 4 states have return successors, (5), 4 states have call predecessors, (5), 3 states have call successors, (5) [2021-08-27 07:47:46,763 INFO L276 IsEmpty]: Start isEmpty. Operand 792 states and 1105 transitions. [2021-08-27 07:47:46,764 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2021-08-27 07:47:46,764 INFO L504 BasicCegarLoop]: Found error trace [2021-08-27 07:47:46,764 INFO L512 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-27 07:47:46,765 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2021-08-27 07:47:46,765 INFO L402 AbstractCegarLoop]: === Iteration 15 === Targeting errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK === [mainErr0ENSURES_VIOLATIONMEMORY_LEAK, errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2021-08-27 07:47:46,765 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 07:47:46,765 INFO L82 PathProgramCache]: Analyzing trace with hash -1865011280, now seen corresponding path program 1 times [2021-08-27 07:47:46,765 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 07:47:46,765 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1391738528] [2021-08-27 07:47:46,765 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 07:47:46,766 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 07:47:46,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:47:46,843 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-08-27 07:47:46,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:47:46,871 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-08-27 07:47:46,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:47:46,887 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-08-27 07:47:46,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:47:46,899 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2021-08-27 07:47:46,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:47:46,905 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-08-27 07:47:46,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:47:46,910 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 07:47:46,910 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 07:47:46,910 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1391738528] [2021-08-27 07:47:46,910 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1391738528] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-27 07:47:46,910 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-27 07:47:46,910 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-08-27 07:47:46,910 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [834914645] [2021-08-27 07:47:46,911 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-08-27 07:47:46,911 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-27 07:47:46,911 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-08-27 07:47:46,911 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2021-08-27 07:47:46,911 INFO L87 Difference]: Start difference. First operand 792 states and 1105 transitions. Second operand has 7 states, 7 states have (on average 5.428571428571429) internal successors, (38), 3 states have internal predecessors, (38), 2 states have call successors, (7), 6 states have call predecessors, (7), 2 states have return successors, (5), 2 states have call predecessors, (5), 1 states have call successors, (5) [2021-08-27 07:47:48,815 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 07:47:48,815 INFO L93 Difference]: Finished difference Result 1074 states and 1532 transitions. [2021-08-27 07:47:48,815 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-08-27 07:47:48,816 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 5.428571428571429) internal successors, (38), 3 states have internal predecessors, (38), 2 states have call successors, (7), 6 states have call predecessors, (7), 2 states have return successors, (5), 2 states have call predecessors, (5), 1 states have call successors, (5) Word has length 50 [2021-08-27 07:47:48,816 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-27 07:47:48,818 INFO L225 Difference]: With dead ends: 1074 [2021-08-27 07:47:48,818 INFO L226 Difference]: Without dead ends: 1074 [2021-08-27 07:47:48,818 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 155.0ms TimeCoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2021-08-27 07:47:48,819 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1074 states. [2021-08-27 07:47:48,827 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1074 to 848. [2021-08-27 07:47:48,828 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 848 states, 663 states have (on average 1.3725490196078431) internal successors, (910), 677 states have internal predecessors, (910), 112 states have call successors, (112), 51 states have call predecessors, (112), 72 states have return successors, (143), 126 states have call predecessors, (143), 104 states have call successors, (143) [2021-08-27 07:47:48,830 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 848 states to 848 states and 1165 transitions. [2021-08-27 07:47:48,830 INFO L78 Accepts]: Start accepts. Automaton has 848 states and 1165 transitions. Word has length 50 [2021-08-27 07:47:48,830 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-27 07:47:48,830 INFO L470 AbstractCegarLoop]: Abstraction has 848 states and 1165 transitions. [2021-08-27 07:47:48,830 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 5.428571428571429) internal successors, (38), 3 states have internal predecessors, (38), 2 states have call successors, (7), 6 states have call predecessors, (7), 2 states have return successors, (5), 2 states have call predecessors, (5), 1 states have call successors, (5) [2021-08-27 07:47:48,830 INFO L276 IsEmpty]: Start isEmpty. Operand 848 states and 1165 transitions. [2021-08-27 07:47:48,832 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2021-08-27 07:47:48,832 INFO L504 BasicCegarLoop]: Found error trace [2021-08-27 07:47:48,832 INFO L512 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-27 07:47:48,832 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2021-08-27 07:47:48,832 INFO L402 AbstractCegarLoop]: === Iteration 16 === Targeting errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK === [mainErr0ENSURES_VIOLATIONMEMORY_LEAK, errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2021-08-27 07:47:48,832 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 07:47:48,832 INFO L82 PathProgramCache]: Analyzing trace with hash -540904097, now seen corresponding path program 1 times [2021-08-27 07:47:48,833 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 07:47:48,833 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [822443728] [2021-08-27 07:47:48,833 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 07:47:48,833 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 07:47:48,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:47:48,919 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-08-27 07:47:48,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:47:48,943 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-08-27 07:47:48,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:47:48,978 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-08-27 07:47:48,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:47:48,998 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2021-08-27 07:47:49,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:47:49,020 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-08-27 07:47:49,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:47:49,031 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-08-27 07:47:49,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:47:49,035 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 07:47:49,035 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 07:47:49,035 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [822443728] [2021-08-27 07:47:49,037 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [822443728] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-27 07:47:49,037 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-27 07:47:49,037 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2021-08-27 07:47:49,037 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [708794985] [2021-08-27 07:47:49,037 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2021-08-27 07:47:49,037 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-27 07:47:49,038 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-08-27 07:47:49,038 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2021-08-27 07:47:49,038 INFO L87 Difference]: Start difference. First operand 848 states and 1165 transitions. Second operand has 9 states, 9 states have (on average 4.222222222222222) internal successors, (38), 3 states have internal predecessors, (38), 2 states have call successors, (8), 8 states have call predecessors, (8), 2 states have return successors, (6), 2 states have call predecessors, (6), 1 states have call successors, (6) [2021-08-27 07:47:50,501 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 07:47:50,502 INFO L93 Difference]: Finished difference Result 991 states and 1404 transitions. [2021-08-27 07:47:50,502 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-08-27 07:47:50,502 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 4.222222222222222) internal successors, (38), 3 states have internal predecessors, (38), 2 states have call successors, (8), 8 states have call predecessors, (8), 2 states have return successors, (6), 2 states have call predecessors, (6), 1 states have call successors, (6) Word has length 52 [2021-08-27 07:47:50,502 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-27 07:47:50,504 INFO L225 Difference]: With dead ends: 991 [2021-08-27 07:47:50,504 INFO L226 Difference]: Without dead ends: 991 [2021-08-27 07:47:50,505 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 170.5ms TimeCoverageRelationStatistics Valid=35, Invalid=55, Unknown=0, NotChecked=0, Total=90 [2021-08-27 07:47:50,505 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 991 states. [2021-08-27 07:47:50,514 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 991 to 867. [2021-08-27 07:47:50,515 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 867 states, 679 states have (on average 1.369661266568483) internal successors, (930), 694 states have internal predecessors, (930), 113 states have call successors, (113), 52 states have call predecessors, (113), 74 states have return successors, (145), 128 states have call predecessors, (145), 105 states have call successors, (145) [2021-08-27 07:47:50,516 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 867 states to 867 states and 1188 transitions. [2021-08-27 07:47:50,516 INFO L78 Accepts]: Start accepts. Automaton has 867 states and 1188 transitions. Word has length 52 [2021-08-27 07:47:50,516 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-27 07:47:50,516 INFO L470 AbstractCegarLoop]: Abstraction has 867 states and 1188 transitions. [2021-08-27 07:47:50,516 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 4.222222222222222) internal successors, (38), 3 states have internal predecessors, (38), 2 states have call successors, (8), 8 states have call predecessors, (8), 2 states have return successors, (6), 2 states have call predecessors, (6), 1 states have call successors, (6) [2021-08-27 07:47:50,516 INFO L276 IsEmpty]: Start isEmpty. Operand 867 states and 1188 transitions. [2021-08-27 07:47:50,518 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2021-08-27 07:47:50,518 INFO L504 BasicCegarLoop]: Found error trace [2021-08-27 07:47:50,518 INFO L512 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-27 07:47:50,518 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2021-08-27 07:47:50,518 INFO L402 AbstractCegarLoop]: === Iteration 17 === Targeting errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK === [mainErr0ENSURES_VIOLATIONMEMORY_LEAK, errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2021-08-27 07:47:50,518 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 07:47:50,518 INFO L82 PathProgramCache]: Analyzing trace with hash 1037319808, now seen corresponding path program 1 times [2021-08-27 07:47:50,519 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 07:47:50,519 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1859542633] [2021-08-27 07:47:50,519 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 07:47:50,519 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 07:47:50,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:47:50,591 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-08-27 07:47:50,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:47:50,615 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-08-27 07:47:50,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:47:50,628 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-08-27 07:47:50,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:47:50,635 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2021-08-27 07:47:50,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:47:50,642 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2021-08-27 07:47:50,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:47:50,645 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 07:47:50,645 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 07:47:50,645 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1859542633] [2021-08-27 07:47:50,645 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1859542633] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-27 07:47:50,645 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-27 07:47:50,645 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-08-27 07:47:50,645 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1754815242] [2021-08-27 07:47:50,646 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2021-08-27 07:47:50,646 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-27 07:47:50,646 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-08-27 07:47:50,646 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2021-08-27 07:47:50,647 INFO L87 Difference]: Start difference. First operand 867 states and 1188 transitions. Second operand has 8 states, 8 states have (on average 4.875) internal successors, (39), 3 states have internal predecessors, (39), 2 states have call successors, (10), 7 states have call predecessors, (10), 2 states have return successors, (5), 2 states have call predecessors, (5), 1 states have call successors, (5) [2021-08-27 07:47:52,892 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 07:47:52,892 INFO L93 Difference]: Finished difference Result 956 states and 1361 transitions. [2021-08-27 07:47:52,892 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-08-27 07:47:52,892 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 4.875) internal successors, (39), 3 states have internal predecessors, (39), 2 states have call successors, (10), 7 states have call predecessors, (10), 2 states have return successors, (5), 2 states have call predecessors, (5), 1 states have call successors, (5) Word has length 54 [2021-08-27 07:47:52,892 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-27 07:47:52,895 INFO L225 Difference]: With dead ends: 956 [2021-08-27 07:47:52,895 INFO L226 Difference]: Without dead ends: 956 [2021-08-27 07:47:52,895 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 154.0ms TimeCoverageRelationStatistics Valid=43, Invalid=67, Unknown=0, NotChecked=0, Total=110 [2021-08-27 07:47:52,895 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 956 states. [2021-08-27 07:47:52,903 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 956 to 836. [2021-08-27 07:47:52,904 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 836 states, 655 states have (on average 1.369465648854962) internal successors, (897), 668 states have internal predecessors, (897), 111 states have call successors, (111), 51 states have call predecessors, (111), 69 states have return successors, (140), 123 states have call predecessors, (140), 104 states have call successors, (140) [2021-08-27 07:47:52,905 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 836 states to 836 states and 1148 transitions. [2021-08-27 07:47:52,906 INFO L78 Accepts]: Start accepts. Automaton has 836 states and 1148 transitions. Word has length 54 [2021-08-27 07:47:52,906 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-27 07:47:52,906 INFO L470 AbstractCegarLoop]: Abstraction has 836 states and 1148 transitions. [2021-08-27 07:47:52,906 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 4.875) internal successors, (39), 3 states have internal predecessors, (39), 2 states have call successors, (10), 7 states have call predecessors, (10), 2 states have return successors, (5), 2 states have call predecessors, (5), 1 states have call successors, (5) [2021-08-27 07:47:52,906 INFO L276 IsEmpty]: Start isEmpty. Operand 836 states and 1148 transitions. [2021-08-27 07:47:52,907 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2021-08-27 07:47:52,907 INFO L504 BasicCegarLoop]: Found error trace [2021-08-27 07:47:52,907 INFO L512 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-27 07:47:52,908 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2021-08-27 07:47:52,908 INFO L402 AbstractCegarLoop]: === Iteration 18 === Targeting errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK === [mainErr0ENSURES_VIOLATIONMEMORY_LEAK, errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2021-08-27 07:47:52,908 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 07:47:52,908 INFO L82 PathProgramCache]: Analyzing trace with hash -1536910814, now seen corresponding path program 1 times [2021-08-27 07:47:52,908 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 07:47:52,908 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1456337154] [2021-08-27 07:47:52,908 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 07:47:52,908 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 07:47:52,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:47:52,987 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-08-27 07:47:52,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:47:53,012 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-08-27 07:47:53,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:47:53,027 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-08-27 07:47:53,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:47:53,038 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2021-08-27 07:47:53,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:47:53,056 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-08-27 07:47:53,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:47:53,086 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 07:47:53,087 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 07:47:53,087 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1456337154] [2021-08-27 07:47:53,087 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1456337154] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-27 07:47:53,087 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-27 07:47:53,087 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2021-08-27 07:47:53,087 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1173161702] [2021-08-27 07:47:53,088 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2021-08-27 07:47:53,089 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-27 07:47:53,089 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-08-27 07:47:53,089 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2021-08-27 07:47:53,089 INFO L87 Difference]: Start difference. First operand 836 states and 1148 transitions. Second operand has 12 states, 12 states have (on average 3.25) internal successors, (39), 6 states have internal predecessors, (39), 2 states have call successors, (7), 6 states have call predecessors, (7), 3 states have return successors, (5), 3 states have call predecessors, (5), 1 states have call successors, (5) [2021-08-27 07:47:55,147 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 07:47:55,147 INFO L93 Difference]: Finished difference Result 968 states and 1375 transitions. [2021-08-27 07:47:55,148 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-08-27 07:47:55,148 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 3.25) internal successors, (39), 6 states have internal predecessors, (39), 2 states have call successors, (7), 6 states have call predecessors, (7), 3 states have return successors, (5), 3 states have call predecessors, (5), 1 states have call successors, (5) Word has length 51 [2021-08-27 07:47:55,148 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-27 07:47:55,150 INFO L225 Difference]: With dead ends: 968 [2021-08-27 07:47:55,150 INFO L226 Difference]: Without dead ends: 967 [2021-08-27 07:47:55,151 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 135.1ms TimeCoverageRelationStatistics Valid=31, Invalid=125, Unknown=0, NotChecked=0, Total=156 [2021-08-27 07:47:55,151 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 967 states. [2021-08-27 07:47:55,159 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 967 to 843. [2021-08-27 07:47:55,160 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 843 states, 661 states have (on average 1.367624810892587) internal successors, (904), 675 states have internal predecessors, (904), 112 states have call successors, (112), 51 states have call predecessors, (112), 69 states have return successors, (141), 124 states have call predecessors, (141), 105 states have call successors, (141) [2021-08-27 07:47:55,161 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 843 states to 843 states and 1157 transitions. [2021-08-27 07:47:55,161 INFO L78 Accepts]: Start accepts. Automaton has 843 states and 1157 transitions. Word has length 51 [2021-08-27 07:47:55,162 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-27 07:47:55,162 INFO L470 AbstractCegarLoop]: Abstraction has 843 states and 1157 transitions. [2021-08-27 07:47:55,162 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 3.25) internal successors, (39), 6 states have internal predecessors, (39), 2 states have call successors, (7), 6 states have call predecessors, (7), 3 states have return successors, (5), 3 states have call predecessors, (5), 1 states have call successors, (5) [2021-08-27 07:47:55,162 INFO L276 IsEmpty]: Start isEmpty. Operand 843 states and 1157 transitions. [2021-08-27 07:47:55,163 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2021-08-27 07:47:55,163 INFO L504 BasicCegarLoop]: Found error trace [2021-08-27 07:47:55,163 INFO L512 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-27 07:47:55,163 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2021-08-27 07:47:55,164 INFO L402 AbstractCegarLoop]: === Iteration 19 === Targeting errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK === [mainErr0ENSURES_VIOLATIONMEMORY_LEAK, errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2021-08-27 07:47:55,164 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 07:47:55,164 INFO L82 PathProgramCache]: Analyzing trace with hash -1537187644, now seen corresponding path program 1 times [2021-08-27 07:47:55,164 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 07:47:55,164 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [988029653] [2021-08-27 07:47:55,164 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 07:47:55,164 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 07:47:55,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:47:55,240 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-08-27 07:47:55,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:47:55,269 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-08-27 07:47:55,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:47:55,287 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-08-27 07:47:55,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:47:55,303 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2021-08-27 07:47:55,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:47:55,336 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-08-27 07:47:55,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:47:55,369 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 07:47:55,370 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 07:47:55,370 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [988029653] [2021-08-27 07:47:55,370 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [988029653] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-27 07:47:55,370 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-27 07:47:55,370 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2021-08-27 07:47:55,370 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [220943803] [2021-08-27 07:47:55,371 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2021-08-27 07:47:55,371 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-27 07:47:55,372 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-08-27 07:47:55,372 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2021-08-27 07:47:55,372 INFO L87 Difference]: Start difference. First operand 843 states and 1157 transitions. Second operand has 12 states, 12 states have (on average 3.25) internal successors, (39), 6 states have internal predecessors, (39), 2 states have call successors, (7), 6 states have call predecessors, (7), 3 states have return successors, (5), 3 states have call predecessors, (5), 1 states have call successors, (5) [2021-08-27 07:47:57,628 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 07:47:57,628 INFO L93 Difference]: Finished difference Result 983 states and 1391 transitions. [2021-08-27 07:47:57,628 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-08-27 07:47:57,629 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 3.25) internal successors, (39), 6 states have internal predecessors, (39), 2 states have call successors, (7), 6 states have call predecessors, (7), 3 states have return successors, (5), 3 states have call predecessors, (5), 1 states have call successors, (5) Word has length 51 [2021-08-27 07:47:57,629 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-27 07:47:57,632 INFO L225 Difference]: With dead ends: 983 [2021-08-27 07:47:57,632 INFO L226 Difference]: Without dead ends: 962 [2021-08-27 07:47:57,632 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 209.6ms TimeCoverageRelationStatistics Valid=38, Invalid=144, Unknown=0, NotChecked=0, Total=182 [2021-08-27 07:47:57,632 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 962 states. [2021-08-27 07:47:57,642 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 962 to 842. [2021-08-27 07:47:57,643 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 842 states, 660 states have (on average 1.3666666666666667) internal successors, (902), 674 states have internal predecessors, (902), 112 states have call successors, (112), 51 states have call predecessors, (112), 69 states have return successors, (141), 124 states have call predecessors, (141), 105 states have call successors, (141) [2021-08-27 07:47:57,644 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 842 states to 842 states and 1155 transitions. [2021-08-27 07:47:57,644 INFO L78 Accepts]: Start accepts. Automaton has 842 states and 1155 transitions. Word has length 51 [2021-08-27 07:47:57,644 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-27 07:47:57,644 INFO L470 AbstractCegarLoop]: Abstraction has 842 states and 1155 transitions. [2021-08-27 07:47:57,644 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 3.25) internal successors, (39), 6 states have internal predecessors, (39), 2 states have call successors, (7), 6 states have call predecessors, (7), 3 states have return successors, (5), 3 states have call predecessors, (5), 1 states have call successors, (5) [2021-08-27 07:47:57,645 INFO L276 IsEmpty]: Start isEmpty. Operand 842 states and 1155 transitions. [2021-08-27 07:47:57,646 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2021-08-27 07:47:57,646 INFO L504 BasicCegarLoop]: Found error trace [2021-08-27 07:47:57,646 INFO L512 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-27 07:47:57,646 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2021-08-27 07:47:57,646 INFO L402 AbstractCegarLoop]: === Iteration 20 === Targeting errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK === [mainErr0ENSURES_VIOLATIONMEMORY_LEAK, errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2021-08-27 07:47:57,647 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 07:47:57,647 INFO L82 PathProgramCache]: Analyzing trace with hash 855429365, now seen corresponding path program 1 times [2021-08-27 07:47:57,647 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 07:47:57,647 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [34748749] [2021-08-27 07:47:57,647 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 07:47:57,647 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 07:47:57,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:47:57,739 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-08-27 07:47:57,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:47:57,764 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-08-27 07:47:57,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:47:57,788 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-08-27 07:47:57,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:47:57,804 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2021-08-27 07:47:57,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:47:57,851 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-08-27 07:47:57,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:47:57,877 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-08-27 07:47:57,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:47:57,889 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 07:47:57,890 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 07:47:57,890 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [34748749] [2021-08-27 07:47:57,890 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [34748749] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-27 07:47:57,890 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-27 07:47:57,890 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2021-08-27 07:47:57,890 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [772163454] [2021-08-27 07:47:57,890 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2021-08-27 07:47:57,891 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-27 07:47:57,891 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2021-08-27 07:47:57,891 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=119, Unknown=0, NotChecked=0, Total=156 [2021-08-27 07:47:57,891 INFO L87 Difference]: Start difference. First operand 842 states and 1155 transitions. Second operand has 13 states, 13 states have (on average 3.0) internal successors, (39), 7 states have internal predecessors, (39), 3 states have call successors, (8), 8 states have call predecessors, (8), 4 states have return successors, (6), 5 states have call predecessors, (6), 2 states have call successors, (6) [2021-08-27 07:48:00,648 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 07:48:00,649 INFO L93 Difference]: Finished difference Result 968 states and 1372 transitions. [2021-08-27 07:48:00,652 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-08-27 07:48:00,653 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 3.0) internal successors, (39), 7 states have internal predecessors, (39), 3 states have call successors, (8), 8 states have call predecessors, (8), 4 states have return successors, (6), 5 states have call predecessors, (6), 2 states have call successors, (6) Word has length 53 [2021-08-27 07:48:00,653 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-27 07:48:00,655 INFO L225 Difference]: With dead ends: 968 [2021-08-27 07:48:00,655 INFO L226 Difference]: Without dead ends: 968 [2021-08-27 07:48:00,656 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 43 ImplicationChecksByTransitivity, 505.1ms TimeCoverageRelationStatistics Valid=106, Invalid=274, Unknown=0, NotChecked=0, Total=380 [2021-08-27 07:48:00,656 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 968 states. [2021-08-27 07:48:00,664 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 968 to 842. [2021-08-27 07:48:00,665 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 842 states, 660 states have (on average 1.3651515151515152) internal successors, (901), 674 states have internal predecessors, (901), 112 states have call successors, (112), 51 states have call predecessors, (112), 69 states have return successors, (141), 124 states have call predecessors, (141), 105 states have call successors, (141) [2021-08-27 07:48:00,666 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 842 states to 842 states and 1154 transitions. [2021-08-27 07:48:00,666 INFO L78 Accepts]: Start accepts. Automaton has 842 states and 1154 transitions. Word has length 53 [2021-08-27 07:48:00,666 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-27 07:48:00,666 INFO L470 AbstractCegarLoop]: Abstraction has 842 states and 1154 transitions. [2021-08-27 07:48:00,667 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 3.0) internal successors, (39), 7 states have internal predecessors, (39), 3 states have call successors, (8), 8 states have call predecessors, (8), 4 states have return successors, (6), 5 states have call predecessors, (6), 2 states have call successors, (6) [2021-08-27 07:48:00,667 INFO L276 IsEmpty]: Start isEmpty. Operand 842 states and 1154 transitions. [2021-08-27 07:48:00,668 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2021-08-27 07:48:00,668 INFO L504 BasicCegarLoop]: Found error trace [2021-08-27 07:48:00,668 INFO L512 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-27 07:48:00,668 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2021-08-27 07:48:00,668 INFO L402 AbstractCegarLoop]: === Iteration 21 === Targeting errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK === [mainErr0ENSURES_VIOLATIONMEMORY_LEAK, errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2021-08-27 07:48:00,669 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 07:48:00,669 INFO L82 PathProgramCache]: Analyzing trace with hash -353388327, now seen corresponding path program 1 times [2021-08-27 07:48:00,669 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 07:48:00,669 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2144351785] [2021-08-27 07:48:00,669 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 07:48:00,669 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 07:48:00,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:48:00,756 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-08-27 07:48:00,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:48:00,784 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-08-27 07:48:00,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:48:00,802 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-08-27 07:48:00,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:48:00,815 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2021-08-27 07:48:00,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:48:00,828 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-08-27 07:48:00,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:48:00,834 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 07:48:00,834 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 07:48:00,835 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2144351785] [2021-08-27 07:48:00,835 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2144351785] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-27 07:48:00,835 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-27 07:48:00,835 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2021-08-27 07:48:00,835 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [623667409] [2021-08-27 07:48:00,836 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2021-08-27 07:48:00,836 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-27 07:48:00,836 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-08-27 07:48:00,836 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2021-08-27 07:48:00,837 INFO L87 Difference]: Start difference. First operand 842 states and 1154 transitions. Second operand has 9 states, 9 states have (on average 4.444444444444445) internal successors, (40), 5 states have internal predecessors, (40), 3 states have call successors, (7), 6 states have call predecessors, (7), 3 states have return successors, (5), 4 states have call predecessors, (5), 2 states have call successors, (5) [2021-08-27 07:48:03,447 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 07:48:03,447 INFO L93 Difference]: Finished difference Result 975 states and 1378 transitions. [2021-08-27 07:48:03,448 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2021-08-27 07:48:03,448 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 4.444444444444445) internal successors, (40), 5 states have internal predecessors, (40), 3 states have call successors, (7), 6 states have call predecessors, (7), 3 states have return successors, (5), 4 states have call predecessors, (5), 2 states have call successors, (5) Word has length 52 [2021-08-27 07:48:03,448 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-27 07:48:03,450 INFO L225 Difference]: With dead ends: 975 [2021-08-27 07:48:03,451 INFO L226 Difference]: Without dead ends: 943 [2021-08-27 07:48:03,451 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 481.6ms TimeCoverageRelationStatistics Valid=86, Invalid=186, Unknown=0, NotChecked=0, Total=272 [2021-08-27 07:48:03,451 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 943 states. [2021-08-27 07:48:03,459 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 943 to 815. [2021-08-27 07:48:03,460 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 815 states, 638 states have (on average 1.3746081504702194) internal successors, (877), 651 states have internal predecessors, (877), 109 states have call successors, (109), 49 states have call predecessors, (109), 67 states have return successors, (138), 121 states have call predecessors, (138), 102 states have call successors, (138) [2021-08-27 07:48:03,461 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 815 states to 815 states and 1124 transitions. [2021-08-27 07:48:03,461 INFO L78 Accepts]: Start accepts. Automaton has 815 states and 1124 transitions. Word has length 52 [2021-08-27 07:48:03,461 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-27 07:48:03,461 INFO L470 AbstractCegarLoop]: Abstraction has 815 states and 1124 transitions. [2021-08-27 07:48:03,462 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 4.444444444444445) internal successors, (40), 5 states have internal predecessors, (40), 3 states have call successors, (7), 6 states have call predecessors, (7), 3 states have return successors, (5), 4 states have call predecessors, (5), 2 states have call successors, (5) [2021-08-27 07:48:03,462 INFO L276 IsEmpty]: Start isEmpty. Operand 815 states and 1124 transitions. [2021-08-27 07:48:03,463 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2021-08-27 07:48:03,463 INFO L504 BasicCegarLoop]: Found error trace [2021-08-27 07:48:03,463 INFO L512 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-27 07:48:03,463 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2021-08-27 07:48:03,463 INFO L402 AbstractCegarLoop]: === Iteration 22 === Targeting errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK === [mainErr0ENSURES_VIOLATIONMEMORY_LEAK, errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2021-08-27 07:48:03,464 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 07:48:03,464 INFO L82 PathProgramCache]: Analyzing trace with hash 116484228, now seen corresponding path program 1 times [2021-08-27 07:48:03,464 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 07:48:03,464 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [286915802] [2021-08-27 07:48:03,464 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 07:48:03,464 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 07:48:03,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:48:03,552 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-08-27 07:48:03,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:48:03,577 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-08-27 07:48:03,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:48:03,599 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-08-27 07:48:03,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:48:03,615 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2021-08-27 07:48:03,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:48:03,663 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-08-27 07:48:03,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:48:03,687 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-08-27 07:48:03,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:48:03,693 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 07:48:03,693 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 07:48:03,693 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [286915802] [2021-08-27 07:48:03,693 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [286915802] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-27 07:48:03,693 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-27 07:48:03,694 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2021-08-27 07:48:03,694 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1346901044] [2021-08-27 07:48:03,694 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2021-08-27 07:48:03,694 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-27 07:48:03,695 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2021-08-27 07:48:03,695 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=119, Unknown=0, NotChecked=0, Total=156 [2021-08-27 07:48:03,695 INFO L87 Difference]: Start difference. First operand 815 states and 1124 transitions. Second operand has 13 states, 13 states have (on average 3.076923076923077) internal successors, (40), 7 states have internal predecessors, (40), 3 states have call successors, (8), 8 states have call predecessors, (8), 4 states have return successors, (6), 5 states have call predecessors, (6), 2 states have call successors, (6) [2021-08-27 07:48:06,744 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 07:48:06,744 INFO L93 Difference]: Finished difference Result 939 states and 1339 transitions. [2021-08-27 07:48:06,746 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-08-27 07:48:06,746 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 3.076923076923077) internal successors, (40), 7 states have internal predecessors, (40), 3 states have call successors, (8), 8 states have call predecessors, (8), 4 states have return successors, (6), 5 states have call predecessors, (6), 2 states have call successors, (6) Word has length 54 [2021-08-27 07:48:06,747 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-27 07:48:06,749 INFO L225 Difference]: With dead ends: 939 [2021-08-27 07:48:06,749 INFO L226 Difference]: Without dead ends: 939 [2021-08-27 07:48:06,749 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 43 ImplicationChecksByTransitivity, 508.2ms TimeCoverageRelationStatistics Valid=106, Invalid=274, Unknown=0, NotChecked=0, Total=380 [2021-08-27 07:48:06,750 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 939 states. [2021-08-27 07:48:06,757 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 939 to 815. [2021-08-27 07:48:06,758 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 815 states, 638 states have (on average 1.3730407523510972) internal successors, (876), 651 states have internal predecessors, (876), 109 states have call successors, (109), 49 states have call predecessors, (109), 67 states have return successors, (138), 121 states have call predecessors, (138), 102 states have call successors, (138) [2021-08-27 07:48:06,759 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 815 states to 815 states and 1123 transitions. [2021-08-27 07:48:06,759 INFO L78 Accepts]: Start accepts. Automaton has 815 states and 1123 transitions. Word has length 54 [2021-08-27 07:48:06,759 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-27 07:48:06,759 INFO L470 AbstractCegarLoop]: Abstraction has 815 states and 1123 transitions. [2021-08-27 07:48:06,759 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 3.076923076923077) internal successors, (40), 7 states have internal predecessors, (40), 3 states have call successors, (8), 8 states have call predecessors, (8), 4 states have return successors, (6), 5 states have call predecessors, (6), 2 states have call successors, (6) [2021-08-27 07:48:06,760 INFO L276 IsEmpty]: Start isEmpty. Operand 815 states and 1123 transitions. [2021-08-27 07:48:06,762 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2021-08-27 07:48:06,762 INFO L504 BasicCegarLoop]: Found error trace [2021-08-27 07:48:06,762 INFO L512 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-27 07:48:06,762 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2021-08-27 07:48:06,762 INFO L402 AbstractCegarLoop]: === Iteration 23 === Targeting errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK === [mainErr0ENSURES_VIOLATIONMEMORY_LEAK, errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2021-08-27 07:48:06,762 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 07:48:06,763 INFO L82 PathProgramCache]: Analyzing trace with hash -371811202, now seen corresponding path program 1 times [2021-08-27 07:48:06,763 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 07:48:06,763 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2118807044] [2021-08-27 07:48:06,763 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 07:48:06,763 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 07:48:06,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:48:06,850 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-08-27 07:48:06,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:48:06,876 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-08-27 07:48:06,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:48:06,890 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-08-27 07:48:06,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:48:06,904 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2021-08-27 07:48:06,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:48:06,946 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-08-27 07:48:06,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:48:06,982 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-08-27 07:48:06,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:48:06,987 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 07:48:06,987 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 07:48:06,987 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2118807044] [2021-08-27 07:48:06,987 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2118807044] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-27 07:48:06,987 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-27 07:48:06,987 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2021-08-27 07:48:06,988 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1792864300] [2021-08-27 07:48:06,988 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2021-08-27 07:48:06,989 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-27 07:48:06,989 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2021-08-27 07:48:06,989 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=172, Unknown=0, NotChecked=0, Total=210 [2021-08-27 07:48:06,989 INFO L87 Difference]: Start difference. First operand 815 states and 1123 transitions. Second operand has 15 states, 15 states have (on average 2.7333333333333334) internal successors, (41), 7 states have internal predecessors, (41), 3 states have call successors, (8), 8 states have call predecessors, (8), 3 states have return successors, (6), 4 states have call predecessors, (6), 2 states have call successors, (6) [2021-08-27 07:48:09,779 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 07:48:09,779 INFO L93 Difference]: Finished difference Result 963 states and 1369 transitions. [2021-08-27 07:48:09,779 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2021-08-27 07:48:09,779 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 2.7333333333333334) internal successors, (41), 7 states have internal predecessors, (41), 3 states have call successors, (8), 8 states have call predecessors, (8), 3 states have return successors, (6), 4 states have call predecessors, (6), 2 states have call successors, (6) Word has length 55 [2021-08-27 07:48:09,780 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-27 07:48:09,782 INFO L225 Difference]: With dead ends: 963 [2021-08-27 07:48:09,782 INFO L226 Difference]: Without dead ends: 926 [2021-08-27 07:48:09,782 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 258.8ms TimeCoverageRelationStatistics Valid=62, Invalid=280, Unknown=0, NotChecked=0, Total=342 [2021-08-27 07:48:09,783 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 926 states. [2021-08-27 07:48:09,801 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 926 to 806. [2021-08-27 07:48:09,802 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 806 states, 631 states have (on average 1.3565768621236134) internal successors, (856), 644 states have internal predecessors, (856), 107 states have call successors, (107), 49 states have call predecessors, (107), 67 states have return successors, (136), 119 states have call predecessors, (136), 100 states have call successors, (136) [2021-08-27 07:48:09,803 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 806 states to 806 states and 1099 transitions. [2021-08-27 07:48:09,803 INFO L78 Accepts]: Start accepts. Automaton has 806 states and 1099 transitions. Word has length 55 [2021-08-27 07:48:09,804 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-27 07:48:09,804 INFO L470 AbstractCegarLoop]: Abstraction has 806 states and 1099 transitions. [2021-08-27 07:48:09,804 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 2.7333333333333334) internal successors, (41), 7 states have internal predecessors, (41), 3 states have call successors, (8), 8 states have call predecessors, (8), 3 states have return successors, (6), 4 states have call predecessors, (6), 2 states have call successors, (6) [2021-08-27 07:48:09,804 INFO L276 IsEmpty]: Start isEmpty. Operand 806 states and 1099 transitions. [2021-08-27 07:48:09,805 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2021-08-27 07:48:09,805 INFO L504 BasicCegarLoop]: Found error trace [2021-08-27 07:48:09,805 INFO L512 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-27 07:48:09,805 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2021-08-27 07:48:09,806 INFO L402 AbstractCegarLoop]: === Iteration 24 === Targeting errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK === [mainErr0ENSURES_VIOLATIONMEMORY_LEAK, errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2021-08-27 07:48:09,806 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 07:48:09,806 INFO L82 PathProgramCache]: Analyzing trace with hash 149703456, now seen corresponding path program 1 times [2021-08-27 07:48:09,806 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 07:48:09,806 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1513423650] [2021-08-27 07:48:09,806 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 07:48:09,807 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 07:48:09,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:48:09,887 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-08-27 07:48:09,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:48:09,912 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-08-27 07:48:09,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:48:09,928 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-08-27 07:48:09,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:48:09,942 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2021-08-27 07:48:09,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:48:09,971 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2021-08-27 07:48:09,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:48:09,992 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-08-27 07:48:09,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:48:10,016 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 07:48:10,016 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 07:48:10,016 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1513423650] [2021-08-27 07:48:10,016 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1513423650] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-27 07:48:10,016 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-27 07:48:10,016 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2021-08-27 07:48:10,017 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1730415312] [2021-08-27 07:48:10,017 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2021-08-27 07:48:10,017 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-27 07:48:10,017 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2021-08-27 07:48:10,017 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=175, Unknown=0, NotChecked=0, Total=210 [2021-08-27 07:48:10,018 INFO L87 Difference]: Start difference. First operand 806 states and 1099 transitions. Second operand has 15 states, 15 states have (on average 2.8) internal successors, (42), 7 states have internal predecessors, (42), 2 states have call successors, (8), 7 states have call predecessors, (8), 4 states have return successors, (6), 4 states have call predecessors, (6), 1 states have call successors, (6) [2021-08-27 07:48:12,877 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 07:48:12,877 INFO L93 Difference]: Finished difference Result 939 states and 1323 transitions. [2021-08-27 07:48:12,878 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2021-08-27 07:48:12,878 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 2.8) internal successors, (42), 7 states have internal predecessors, (42), 2 states have call successors, (8), 7 states have call predecessors, (8), 4 states have return successors, (6), 4 states have call predecessors, (6), 1 states have call successors, (6) Word has length 56 [2021-08-27 07:48:12,878 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-27 07:48:12,880 INFO L225 Difference]: With dead ends: 939 [2021-08-27 07:48:12,880 INFO L226 Difference]: Without dead ends: 924 [2021-08-27 07:48:12,880 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 167.2ms TimeCoverageRelationStatistics Valid=39, Invalid=201, Unknown=0, NotChecked=0, Total=240 [2021-08-27 07:48:12,881 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 924 states. [2021-08-27 07:48:12,888 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 924 to 804. [2021-08-27 07:48:12,889 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 804 states, 630 states have (on average 1.3555555555555556) internal successors, (854), 643 states have internal predecessors, (854), 106 states have call successors, (106), 49 states have call predecessors, (106), 67 states have return successors, (135), 118 states have call predecessors, (135), 99 states have call successors, (135) [2021-08-27 07:48:12,891 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 804 states to 804 states and 1095 transitions. [2021-08-27 07:48:12,891 INFO L78 Accepts]: Start accepts. Automaton has 804 states and 1095 transitions. Word has length 56 [2021-08-27 07:48:12,891 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-27 07:48:12,891 INFO L470 AbstractCegarLoop]: Abstraction has 804 states and 1095 transitions. [2021-08-27 07:48:12,891 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 2.8) internal successors, (42), 7 states have internal predecessors, (42), 2 states have call successors, (8), 7 states have call predecessors, (8), 4 states have return successors, (6), 4 states have call predecessors, (6), 1 states have call successors, (6) [2021-08-27 07:48:12,891 INFO L276 IsEmpty]: Start isEmpty. Operand 804 states and 1095 transitions. [2021-08-27 07:48:12,892 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2021-08-27 07:48:12,892 INFO L504 BasicCegarLoop]: Found error trace [2021-08-27 07:48:12,893 INFO L512 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-27 07:48:12,893 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2021-08-27 07:48:12,893 INFO L402 AbstractCegarLoop]: === Iteration 25 === Targeting errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK === [mainErr0ENSURES_VIOLATIONMEMORY_LEAK, errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2021-08-27 07:48:12,893 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 07:48:12,893 INFO L82 PathProgramCache]: Analyzing trace with hash -1617706055, now seen corresponding path program 1 times [2021-08-27 07:48:12,893 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 07:48:12,893 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1876447429] [2021-08-27 07:48:12,894 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 07:48:12,894 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 07:48:12,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:48:12,973 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-08-27 07:48:12,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:48:13,013 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-08-27 07:48:13,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:48:13,031 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-08-27 07:48:13,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:48:13,059 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2021-08-27 07:48:13,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:48:13,092 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-08-27 07:48:13,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:48:13,117 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-08-27 07:48:13,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:48:13,139 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 07:48:13,140 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 07:48:13,140 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1876447429] [2021-08-27 07:48:13,140 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1876447429] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-27 07:48:13,140 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-27 07:48:13,140 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2021-08-27 07:48:13,140 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [634747194] [2021-08-27 07:48:13,141 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2021-08-27 07:48:13,141 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-27 07:48:13,141 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2021-08-27 07:48:13,141 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=175, Unknown=0, NotChecked=0, Total=210 [2021-08-27 07:48:13,141 INFO L87 Difference]: Start difference. First operand 804 states and 1095 transitions. Second operand has 15 states, 15 states have (on average 2.7333333333333334) internal successors, (41), 7 states have internal predecessors, (41), 2 states have call successors, (8), 7 states have call predecessors, (8), 4 states have return successors, (6), 4 states have call predecessors, (6), 1 states have call successors, (6) [2021-08-27 07:48:16,152 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 07:48:16,152 INFO L93 Difference]: Finished difference Result 934 states and 1316 transitions. [2021-08-27 07:48:16,152 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2021-08-27 07:48:16,152 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 2.7333333333333334) internal successors, (41), 7 states have internal predecessors, (41), 2 states have call successors, (8), 7 states have call predecessors, (8), 4 states have return successors, (6), 4 states have call predecessors, (6), 1 states have call successors, (6) Word has length 55 [2021-08-27 07:48:16,153 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-27 07:48:16,155 INFO L225 Difference]: With dead ends: 934 [2021-08-27 07:48:16,155 INFO L226 Difference]: Without dead ends: 919 [2021-08-27 07:48:16,155 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 168.7ms TimeCoverageRelationStatistics Valid=39, Invalid=201, Unknown=0, NotChecked=0, Total=240 [2021-08-27 07:48:16,155 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 919 states. [2021-08-27 07:48:16,163 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 919 to 799. [2021-08-27 07:48:16,168 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 799 states, 627 states have (on average 1.3556618819776713) internal successors, (850), 640 states have internal predecessors, (850), 105 states have call successors, (105), 49 states have call predecessors, (105), 66 states have return successors, (133), 116 states have call predecessors, (133), 98 states have call successors, (133) [2021-08-27 07:48:16,169 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 799 states to 799 states and 1088 transitions. [2021-08-27 07:48:16,169 INFO L78 Accepts]: Start accepts. Automaton has 799 states and 1088 transitions. Word has length 55 [2021-08-27 07:48:16,170 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-27 07:48:16,170 INFO L470 AbstractCegarLoop]: Abstraction has 799 states and 1088 transitions. [2021-08-27 07:48:16,170 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 2.7333333333333334) internal successors, (41), 7 states have internal predecessors, (41), 2 states have call successors, (8), 7 states have call predecessors, (8), 4 states have return successors, (6), 4 states have call predecessors, (6), 1 states have call successors, (6) [2021-08-27 07:48:16,170 INFO L276 IsEmpty]: Start isEmpty. Operand 799 states and 1088 transitions. [2021-08-27 07:48:16,173 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2021-08-27 07:48:16,173 INFO L504 BasicCegarLoop]: Found error trace [2021-08-27 07:48:16,173 INFO L512 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-27 07:48:16,173 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2021-08-27 07:48:16,173 INFO L402 AbstractCegarLoop]: === Iteration 26 === Targeting errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK === [mainErr0ENSURES_VIOLATIONMEMORY_LEAK, errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2021-08-27 07:48:16,174 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 07:48:16,174 INFO L82 PathProgramCache]: Analyzing trace with hash -29735584, now seen corresponding path program 1 times [2021-08-27 07:48:16,174 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 07:48:16,174 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1961571995] [2021-08-27 07:48:16,174 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 07:48:16,174 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 07:48:16,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:48:16,251 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-08-27 07:48:16,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:48:16,274 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-08-27 07:48:16,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:48:16,286 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-08-27 07:48:16,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:48:16,299 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2021-08-27 07:48:16,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:48:16,316 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2021-08-27 07:48:16,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:48:16,336 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2021-08-27 07:48:16,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:48:16,347 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 07:48:16,347 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 07:48:16,347 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1961571995] [2021-08-27 07:48:16,347 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1961571995] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-27 07:48:16,347 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-27 07:48:16,347 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2021-08-27 07:48:16,347 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [114864368] [2021-08-27 07:48:16,348 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2021-08-27 07:48:16,348 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-27 07:48:16,348 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-08-27 07:48:16,348 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2021-08-27 07:48:16,349 INFO L87 Difference]: Start difference. First operand 799 states and 1088 transitions. Second operand has 10 states, 10 states have (on average 4.2) internal successors, (42), 4 states have internal predecessors, (42), 3 states have call successors, (8), 8 states have call predecessors, (8), 3 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2021-08-27 07:48:18,571 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 07:48:18,572 INFO L93 Difference]: Finished difference Result 941 states and 1319 transitions. [2021-08-27 07:48:18,572 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-08-27 07:48:18,572 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 4.2) internal successors, (42), 4 states have internal predecessors, (42), 3 states have call successors, (8), 8 states have call predecessors, (8), 3 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) Word has length 56 [2021-08-27 07:48:18,572 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-27 07:48:18,574 INFO L225 Difference]: With dead ends: 941 [2021-08-27 07:48:18,574 INFO L226 Difference]: Without dead ends: 941 [2021-08-27 07:48:18,575 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 273.1ms TimeCoverageRelationStatistics Valid=59, Invalid=123, Unknown=0, NotChecked=0, Total=182 [2021-08-27 07:48:18,575 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 941 states. [2021-08-27 07:48:18,590 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 941 to 799. [2021-08-27 07:48:18,591 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 799 states, 627 states have (on average 1.354066985645933) internal successors, (849), 640 states have internal predecessors, (849), 105 states have call successors, (105), 49 states have call predecessors, (105), 66 states have return successors, (133), 116 states have call predecessors, (133), 98 states have call successors, (133) [2021-08-27 07:48:18,593 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 799 states to 799 states and 1087 transitions. [2021-08-27 07:48:18,593 INFO L78 Accepts]: Start accepts. Automaton has 799 states and 1087 transitions. Word has length 56 [2021-08-27 07:48:18,593 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-27 07:48:18,593 INFO L470 AbstractCegarLoop]: Abstraction has 799 states and 1087 transitions. [2021-08-27 07:48:18,593 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 4.2) internal successors, (42), 4 states have internal predecessors, (42), 3 states have call successors, (8), 8 states have call predecessors, (8), 3 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2021-08-27 07:48:18,593 INFO L276 IsEmpty]: Start isEmpty. Operand 799 states and 1087 transitions. [2021-08-27 07:48:18,598 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2021-08-27 07:48:18,598 INFO L504 BasicCegarLoop]: Found error trace [2021-08-27 07:48:18,598 INFO L512 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-27 07:48:18,598 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2021-08-27 07:48:18,598 INFO L402 AbstractCegarLoop]: === Iteration 27 === Targeting errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK === [mainErr0ENSURES_VIOLATIONMEMORY_LEAK, errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2021-08-27 07:48:18,599 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 07:48:18,599 INFO L82 PathProgramCache]: Analyzing trace with hash 961876664, now seen corresponding path program 1 times [2021-08-27 07:48:18,599 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 07:48:18,599 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [430708735] [2021-08-27 07:48:18,599 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 07:48:18,599 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 07:48:18,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:48:18,671 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-08-27 07:48:18,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:48:18,694 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-08-27 07:48:18,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:48:18,707 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-08-27 07:48:18,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:48:18,716 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2021-08-27 07:48:18,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:48:18,726 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2021-08-27 07:48:18,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:48:18,743 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2021-08-27 07:48:18,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:48:18,748 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-08-27 07:48:18,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:48:18,751 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 07:48:18,751 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 07:48:18,751 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [430708735] [2021-08-27 07:48:18,752 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [430708735] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-27 07:48:18,752 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [38530208] [2021-08-27 07:48:18,753 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 07:48:18,753 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-08-27 07:48:18,753 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 07:48:18,757 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-08-27 07:48:18,771 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2021-08-27 07:48:18,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:48:18,990 INFO L263 TraceCheckSpWp]: Trace formula consists of 871 conjuncts, 6 conjunts are in the unsatisfiable core [2021-08-27 07:48:18,996 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-27 07:48:19,470 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 07:48:19,470 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [38530208] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-27 07:48:19,470 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-08-27 07:48:19,471 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 5] total 12 [2021-08-27 07:48:19,471 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [282715862] [2021-08-27 07:48:19,471 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2021-08-27 07:48:19,471 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-27 07:48:19,471 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-08-27 07:48:19,471 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=95, Unknown=0, NotChecked=0, Total=132 [2021-08-27 07:48:19,472 INFO L87 Difference]: Start difference. First operand 799 states and 1087 transitions. Second operand has 12 states, 12 states have (on average 8.75) internal successors, (105), 6 states have internal predecessors, (105), 5 states have call successors, (22), 11 states have call predecessors, (22), 4 states have return successors, (13), 4 states have call predecessors, (13), 2 states have call successors, (13) [2021-08-27 07:48:22,203 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 07:48:22,203 INFO L93 Difference]: Finished difference Result 1179 states and 1630 transitions. [2021-08-27 07:48:22,204 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2021-08-27 07:48:22,204 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 8.75) internal successors, (105), 6 states have internal predecessors, (105), 5 states have call successors, (22), 11 states have call predecessors, (22), 4 states have return successors, (13), 4 states have call predecessors, (13), 2 states have call successors, (13) Word has length 74 [2021-08-27 07:48:22,204 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-27 07:48:22,207 INFO L225 Difference]: With dead ends: 1179 [2021-08-27 07:48:22,207 INFO L226 Difference]: Without dead ends: 1179 [2021-08-27 07:48:22,207 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 111 GetRequests, 89 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 66 ImplicationChecksByTransitivity, 498.8ms TimeCoverageRelationStatistics Valid=161, Invalid=391, Unknown=0, NotChecked=0, Total=552 [2021-08-27 07:48:22,208 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1179 states. [2021-08-27 07:48:22,216 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1179 to 878. [2021-08-27 07:48:22,217 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 878 states, 691 states have (on average 1.3429811866859624) internal successors, (928), 703 states have internal predecessors, (928), 109 states have call successors, (109), 55 states have call predecessors, (109), 77 states have return successors, (144), 126 states have call predecessors, (144), 103 states have call successors, (144) [2021-08-27 07:48:22,218 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 878 states to 878 states and 1181 transitions. [2021-08-27 07:48:22,218 INFO L78 Accepts]: Start accepts. Automaton has 878 states and 1181 transitions. Word has length 74 [2021-08-27 07:48:22,218 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-27 07:48:22,218 INFO L470 AbstractCegarLoop]: Abstraction has 878 states and 1181 transitions. [2021-08-27 07:48:22,218 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 8.75) internal successors, (105), 6 states have internal predecessors, (105), 5 states have call successors, (22), 11 states have call predecessors, (22), 4 states have return successors, (13), 4 states have call predecessors, (13), 2 states have call successors, (13) [2021-08-27 07:48:22,218 INFO L276 IsEmpty]: Start isEmpty. Operand 878 states and 1181 transitions. [2021-08-27 07:48:22,220 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2021-08-27 07:48:22,220 INFO L504 BasicCegarLoop]: Found error trace [2021-08-27 07:48:22,220 INFO L512 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-27 07:48:22,242 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2021-08-27 07:48:22,437 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable26 [2021-08-27 07:48:22,437 INFO L402 AbstractCegarLoop]: === Iteration 28 === Targeting errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK === [mainErr0ENSURES_VIOLATIONMEMORY_LEAK, errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2021-08-27 07:48:22,437 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 07:48:22,437 INFO L82 PathProgramCache]: Analyzing trace with hash -1650252631, now seen corresponding path program 1 times [2021-08-27 07:48:22,437 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 07:48:22,437 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [798177646] [2021-08-27 07:48:22,438 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 07:48:22,438 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 07:48:22,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:48:22,516 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-08-27 07:48:22,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:48:22,541 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-08-27 07:48:22,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:48:22,556 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-08-27 07:48:22,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:48:22,573 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2021-08-27 07:48:22,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:48:22,626 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-08-27 07:48:22,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:48:22,685 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2021-08-27 07:48:22,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:48:22,743 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-08-27 07:48:22,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:48:22,746 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 07:48:22,746 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 07:48:22,746 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [798177646] [2021-08-27 07:48:22,746 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [798177646] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-27 07:48:22,746 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-27 07:48:22,746 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [20] imperfect sequences [] total 20 [2021-08-27 07:48:22,746 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [783832359] [2021-08-27 07:48:22,747 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2021-08-27 07:48:22,747 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-27 07:48:22,747 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2021-08-27 07:48:22,747 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=327, Unknown=0, NotChecked=0, Total=380 [2021-08-27 07:48:22,747 INFO L87 Difference]: Start difference. First operand 878 states and 1181 transitions. Second operand has 20 states, 19 states have (on average 2.263157894736842) internal successors, (43), 10 states have internal predecessors, (43), 4 states have call successors, (9), 9 states have call predecessors, (9), 4 states have return successors, (7), 5 states have call predecessors, (7), 3 states have call successors, (7) [2021-08-27 07:48:26,034 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 07:48:26,034 INFO L93 Difference]: Finished difference Result 1043 states and 1451 transitions. [2021-08-27 07:48:26,034 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2021-08-27 07:48:26,034 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 19 states have (on average 2.263157894736842) internal successors, (43), 10 states have internal predecessors, (43), 4 states have call successors, (9), 9 states have call predecessors, (9), 4 states have return successors, (7), 5 states have call predecessors, (7), 3 states have call successors, (7) Word has length 59 [2021-08-27 07:48:26,035 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-27 07:48:26,037 INFO L225 Difference]: With dead ends: 1043 [2021-08-27 07:48:26,037 INFO L226 Difference]: Without dead ends: 1020 [2021-08-27 07:48:26,037 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 62 ImplicationChecksByTransitivity, 419.5ms TimeCoverageRelationStatistics Valid=99, Invalid=603, Unknown=0, NotChecked=0, Total=702 [2021-08-27 07:48:26,038 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1020 states. [2021-08-27 07:48:26,045 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1020 to 877. [2021-08-27 07:48:26,046 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 877 states, 690 states have (on average 1.3289855072463768) internal successors, (917), 702 states have internal predecessors, (917), 109 states have call successors, (109), 55 states have call predecessors, (109), 77 states have return successors, (144), 126 states have call predecessors, (144), 103 states have call successors, (144) [2021-08-27 07:48:26,047 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 877 states to 877 states and 1170 transitions. [2021-08-27 07:48:26,047 INFO L78 Accepts]: Start accepts. Automaton has 877 states and 1170 transitions. Word has length 59 [2021-08-27 07:48:26,047 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-27 07:48:26,048 INFO L470 AbstractCegarLoop]: Abstraction has 877 states and 1170 transitions. [2021-08-27 07:48:26,048 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 19 states have (on average 2.263157894736842) internal successors, (43), 10 states have internal predecessors, (43), 4 states have call successors, (9), 9 states have call predecessors, (9), 4 states have return successors, (7), 5 states have call predecessors, (7), 3 states have call successors, (7) [2021-08-27 07:48:26,048 INFO L276 IsEmpty]: Start isEmpty. Operand 877 states and 1170 transitions. [2021-08-27 07:48:26,049 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2021-08-27 07:48:26,049 INFO L504 BasicCegarLoop]: Found error trace [2021-08-27 07:48:26,049 INFO L512 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-27 07:48:26,049 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2021-08-27 07:48:26,050 INFO L402 AbstractCegarLoop]: === Iteration 29 === Targeting errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK === [mainErr0ENSURES_VIOLATIONMEMORY_LEAK, errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2021-08-27 07:48:26,050 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 07:48:26,050 INFO L82 PathProgramCache]: Analyzing trace with hash 846257089, now seen corresponding path program 1 times [2021-08-27 07:48:26,050 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 07:48:26,050 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [972182653] [2021-08-27 07:48:26,050 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 07:48:26,050 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 07:48:26,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:48:26,139 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-08-27 07:48:26,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:48:26,169 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-08-27 07:48:26,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:48:26,184 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-08-27 07:48:26,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:48:26,199 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2021-08-27 07:48:26,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:48:26,264 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-08-27 07:48:26,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:48:26,286 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-08-27 07:48:26,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:48:26,311 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 07:48:26,311 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 07:48:26,311 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [972182653] [2021-08-27 07:48:26,312 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [972182653] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-27 07:48:26,312 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-27 07:48:26,312 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2021-08-27 07:48:26,312 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1548267906] [2021-08-27 07:48:26,312 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2021-08-27 07:48:26,312 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-27 07:48:26,312 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2021-08-27 07:48:26,312 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=203, Unknown=0, NotChecked=0, Total=240 [2021-08-27 07:48:26,313 INFO L87 Difference]: Start difference. First operand 877 states and 1170 transitions. Second operand has 16 states, 16 states have (on average 2.75) internal successors, (44), 8 states have internal predecessors, (44), 2 states have call successors, (8), 7 states have call predecessors, (8), 4 states have return successors, (6), 4 states have call predecessors, (6), 1 states have call successors, (6) [2021-08-27 07:48:29,009 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 07:48:29,009 INFO L93 Difference]: Finished difference Result 1032 states and 1425 transitions. [2021-08-27 07:48:29,010 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2021-08-27 07:48:29,010 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 2.75) internal successors, (44), 8 states have internal predecessors, (44), 2 states have call successors, (8), 7 states have call predecessors, (8), 4 states have return successors, (6), 4 states have call predecessors, (6), 1 states have call successors, (6) Word has length 58 [2021-08-27 07:48:29,010 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-27 07:48:29,012 INFO L225 Difference]: With dead ends: 1032 [2021-08-27 07:48:29,012 INFO L226 Difference]: Without dead ends: 1015 [2021-08-27 07:48:29,012 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 207.6ms TimeCoverageRelationStatistics Valid=45, Invalid=261, Unknown=0, NotChecked=0, Total=306 [2021-08-27 07:48:29,013 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1015 states. [2021-08-27 07:48:29,021 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1015 to 874. [2021-08-27 07:48:29,021 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 874 states, 688 states have (on average 1.3284883720930232) internal successors, (914), 700 states have internal predecessors, (914), 108 states have call successors, (108), 55 states have call predecessors, (108), 77 states have return successors, (143), 125 states have call predecessors, (143), 102 states have call successors, (143) [2021-08-27 07:48:29,022 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 874 states to 874 states and 1165 transitions. [2021-08-27 07:48:29,023 INFO L78 Accepts]: Start accepts. Automaton has 874 states and 1165 transitions. Word has length 58 [2021-08-27 07:48:29,023 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-27 07:48:29,023 INFO L470 AbstractCegarLoop]: Abstraction has 874 states and 1165 transitions. [2021-08-27 07:48:29,023 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 2.75) internal successors, (44), 8 states have internal predecessors, (44), 2 states have call successors, (8), 7 states have call predecessors, (8), 4 states have return successors, (6), 4 states have call predecessors, (6), 1 states have call successors, (6) [2021-08-27 07:48:29,023 INFO L276 IsEmpty]: Start isEmpty. Operand 874 states and 1165 transitions. [2021-08-27 07:48:29,024 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2021-08-27 07:48:29,024 INFO L504 BasicCegarLoop]: Found error trace [2021-08-27 07:48:29,024 INFO L512 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-27 07:48:29,025 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2021-08-27 07:48:29,025 INFO L402 AbstractCegarLoop]: === Iteration 30 === Targeting errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK === [mainErr0ENSURES_VIOLATIONMEMORY_LEAK, errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2021-08-27 07:48:29,025 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 07:48:29,025 INFO L82 PathProgramCache]: Analyzing trace with hash -1695565928, now seen corresponding path program 1 times [2021-08-27 07:48:29,025 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 07:48:29,025 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2104511389] [2021-08-27 07:48:29,025 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 07:48:29,025 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 07:48:29,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:48:29,118 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-08-27 07:48:29,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:48:29,145 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-08-27 07:48:29,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:48:29,159 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-08-27 07:48:29,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:48:29,189 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2021-08-27 07:48:29,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:48:29,236 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-08-27 07:48:29,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:48:29,271 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-08-27 07:48:29,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:48:29,277 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 07:48:29,278 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 07:48:29,278 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2104511389] [2021-08-27 07:48:29,278 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2104511389] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-27 07:48:29,278 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-27 07:48:29,278 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2021-08-27 07:48:29,278 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1741789011] [2021-08-27 07:48:29,278 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2021-08-27 07:48:29,278 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-27 07:48:29,279 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2021-08-27 07:48:29,279 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=172, Unknown=0, NotChecked=0, Total=210 [2021-08-27 07:48:29,279 INFO L87 Difference]: Start difference. First operand 874 states and 1165 transitions. Second operand has 15 states, 15 states have (on average 3.0) internal successors, (45), 7 states have internal predecessors, (45), 3 states have call successors, (8), 8 states have call predecessors, (8), 3 states have return successors, (6), 4 states have call predecessors, (6), 2 states have call successors, (6) [2021-08-27 07:48:31,466 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 07:48:31,467 INFO L93 Difference]: Finished difference Result 1034 states and 1425 transitions. [2021-08-27 07:48:31,467 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2021-08-27 07:48:31,467 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 3.0) internal successors, (45), 7 states have internal predecessors, (45), 3 states have call successors, (8), 8 states have call predecessors, (8), 3 states have return successors, (6), 4 states have call predecessors, (6), 2 states have call successors, (6) Word has length 59 [2021-08-27 07:48:31,467 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-27 07:48:31,469 INFO L225 Difference]: With dead ends: 1034 [2021-08-27 07:48:31,469 INFO L226 Difference]: Without dead ends: 1000 [2021-08-27 07:48:31,470 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 288.5ms TimeCoverageRelationStatistics Valid=62, Invalid=280, Unknown=0, NotChecked=0, Total=342 [2021-08-27 07:48:31,470 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1000 states. [2021-08-27 07:48:31,477 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1000 to 862. [2021-08-27 07:48:31,478 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 862 states, 679 states have (on average 1.3240058910162003) internal successors, (899), 691 states have internal predecessors, (899), 105 states have call successors, (105), 55 states have call predecessors, (105), 77 states have return successors, (140), 122 states have call predecessors, (140), 99 states have call successors, (140) [2021-08-27 07:48:31,479 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 862 states to 862 states and 1144 transitions. [2021-08-27 07:48:31,479 INFO L78 Accepts]: Start accepts. Automaton has 862 states and 1144 transitions. Word has length 59 [2021-08-27 07:48:31,479 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-27 07:48:31,479 INFO L470 AbstractCegarLoop]: Abstraction has 862 states and 1144 transitions. [2021-08-27 07:48:31,479 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 3.0) internal successors, (45), 7 states have internal predecessors, (45), 3 states have call successors, (8), 8 states have call predecessors, (8), 3 states have return successors, (6), 4 states have call predecessors, (6), 2 states have call successors, (6) [2021-08-27 07:48:31,479 INFO L276 IsEmpty]: Start isEmpty. Operand 862 states and 1144 transitions. [2021-08-27 07:48:31,480 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2021-08-27 07:48:31,481 INFO L504 BasicCegarLoop]: Found error trace [2021-08-27 07:48:31,481 INFO L512 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-27 07:48:31,481 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2021-08-27 07:48:31,481 INFO L402 AbstractCegarLoop]: === Iteration 31 === Targeting errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK === [mainErr0ENSURES_VIOLATIONMEMORY_LEAK, errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2021-08-27 07:48:31,481 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 07:48:31,481 INFO L82 PathProgramCache]: Analyzing trace with hash 1230874093, now seen corresponding path program 1 times [2021-08-27 07:48:31,481 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 07:48:31,481 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1276881120] [2021-08-27 07:48:31,482 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 07:48:31,482 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 07:48:31,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:48:31,549 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-08-27 07:48:31,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:48:31,573 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-08-27 07:48:31,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:48:31,585 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-08-27 07:48:31,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:48:31,599 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2021-08-27 07:48:31,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:48:31,619 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2021-08-27 07:48:31,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:48:31,633 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-08-27 07:48:31,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:48:31,655 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-08-27 07:48:31,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:48:31,657 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 07:48:31,657 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 07:48:31,657 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1276881120] [2021-08-27 07:48:31,657 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1276881120] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-27 07:48:31,658 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-27 07:48:31,658 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2021-08-27 07:48:31,658 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1843350015] [2021-08-27 07:48:31,658 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2021-08-27 07:48:31,658 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-27 07:48:31,658 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-08-27 07:48:31,658 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=74, Unknown=0, NotChecked=0, Total=110 [2021-08-27 07:48:31,659 INFO L87 Difference]: Start difference. First operand 862 states and 1144 transitions. Second operand has 11 states, 11 states have (on average 4.0) internal successors, (44), 4 states have internal predecessors, (44), 2 states have call successors, (9), 9 states have call predecessors, (9), 3 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2021-08-27 07:48:33,775 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 07:48:33,775 INFO L93 Difference]: Finished difference Result 1068 states and 1495 transitions. [2021-08-27 07:48:33,776 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-08-27 07:48:33,776 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 4.0) internal successors, (44), 4 states have internal predecessors, (44), 2 states have call successors, (9), 9 states have call predecessors, (9), 3 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) Word has length 60 [2021-08-27 07:48:33,776 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-27 07:48:33,778 INFO L225 Difference]: With dead ends: 1068 [2021-08-27 07:48:33,778 INFO L226 Difference]: Without dead ends: 1068 [2021-08-27 07:48:33,778 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 262.1ms TimeCoverageRelationStatistics Valid=63, Invalid=119, Unknown=0, NotChecked=0, Total=182 [2021-08-27 07:48:33,779 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1068 states. [2021-08-27 07:48:33,786 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1068 to 869. [2021-08-27 07:48:33,787 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 869 states, 684 states have (on average 1.3245614035087718) internal successors, (906), 697 states have internal predecessors, (906), 106 states have call successors, (106), 55 states have call predecessors, (106), 78 states have return successors, (147), 123 states have call predecessors, (147), 100 states have call successors, (147) [2021-08-27 07:48:33,788 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 869 states to 869 states and 1159 transitions. [2021-08-27 07:48:33,788 INFO L78 Accepts]: Start accepts. Automaton has 869 states and 1159 transitions. Word has length 60 [2021-08-27 07:48:33,788 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-27 07:48:33,789 INFO L470 AbstractCegarLoop]: Abstraction has 869 states and 1159 transitions. [2021-08-27 07:48:33,789 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 4.0) internal successors, (44), 4 states have internal predecessors, (44), 2 states have call successors, (9), 9 states have call predecessors, (9), 3 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2021-08-27 07:48:33,789 INFO L276 IsEmpty]: Start isEmpty. Operand 869 states and 1159 transitions. [2021-08-27 07:48:33,790 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2021-08-27 07:48:33,790 INFO L504 BasicCegarLoop]: Found error trace [2021-08-27 07:48:33,790 INFO L512 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-27 07:48:33,790 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2021-08-27 07:48:33,791 INFO L402 AbstractCegarLoop]: === Iteration 32 === Targeting errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK === [mainErr0ENSURES_VIOLATIONMEMORY_LEAK, errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2021-08-27 07:48:33,791 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 07:48:33,791 INFO L82 PathProgramCache]: Analyzing trace with hash 1505633707, now seen corresponding path program 1 times [2021-08-27 07:48:33,791 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 07:48:33,791 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [615218998] [2021-08-27 07:48:33,791 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 07:48:33,791 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 07:48:33,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:48:33,874 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-08-27 07:48:33,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:48:33,902 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-08-27 07:48:33,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:48:33,916 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-08-27 07:48:33,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:48:33,932 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2021-08-27 07:48:33,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:48:33,986 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2021-08-27 07:48:33,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:48:34,026 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-08-27 07:48:34,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:48:34,040 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-08-27 07:48:34,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:48:34,043 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 07:48:34,043 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 07:48:34,043 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [615218998] [2021-08-27 07:48:34,043 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [615218998] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-27 07:48:34,043 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-27 07:48:34,043 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2021-08-27 07:48:34,043 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1008767372] [2021-08-27 07:48:34,044 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2021-08-27 07:48:34,044 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-27 07:48:34,044 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2021-08-27 07:48:34,044 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=194, Unknown=0, NotChecked=0, Total=240 [2021-08-27 07:48:34,044 INFO L87 Difference]: Start difference. First operand 869 states and 1159 transitions. Second operand has 16 states, 16 states have (on average 2.75) internal successors, (44), 7 states have internal predecessors, (44), 3 states have call successors, (9), 9 states have call predecessors, (9), 3 states have return successors, (7), 4 states have call predecessors, (7), 2 states have call successors, (7) [2021-08-27 07:48:36,194 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 07:48:36,195 INFO L93 Difference]: Finished difference Result 1030 states and 1429 transitions. [2021-08-27 07:48:36,195 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2021-08-27 07:48:36,195 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 2.75) internal successors, (44), 7 states have internal predecessors, (44), 3 states have call successors, (9), 9 states have call predecessors, (9), 3 states have return successors, (7), 4 states have call predecessors, (7), 2 states have call successors, (7) Word has length 60 [2021-08-27 07:48:36,195 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-27 07:48:36,197 INFO L225 Difference]: With dead ends: 1030 [2021-08-27 07:48:36,197 INFO L226 Difference]: Without dead ends: 1008 [2021-08-27 07:48:36,197 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 233.2ms TimeCoverageRelationStatistics Valid=61, Invalid=281, Unknown=0, NotChecked=0, Total=342 [2021-08-27 07:48:36,198 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1008 states. [2021-08-27 07:48:36,205 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1008 to 867. [2021-08-27 07:48:36,205 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 867 states, 683 states have (on average 1.3235724743777453) internal successors, (904), 696 states have internal predecessors, (904), 105 states have call successors, (105), 55 states have call predecessors, (105), 78 states have return successors, (146), 122 states have call predecessors, (146), 99 states have call successors, (146) [2021-08-27 07:48:36,206 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 867 states to 867 states and 1155 transitions. [2021-08-27 07:48:36,206 INFO L78 Accepts]: Start accepts. Automaton has 867 states and 1155 transitions. Word has length 60 [2021-08-27 07:48:36,207 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-27 07:48:36,207 INFO L470 AbstractCegarLoop]: Abstraction has 867 states and 1155 transitions. [2021-08-27 07:48:36,207 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 2.75) internal successors, (44), 7 states have internal predecessors, (44), 3 states have call successors, (9), 9 states have call predecessors, (9), 3 states have return successors, (7), 4 states have call predecessors, (7), 2 states have call successors, (7) [2021-08-27 07:48:36,207 INFO L276 IsEmpty]: Start isEmpty. Operand 867 states and 1155 transitions. [2021-08-27 07:48:36,208 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2021-08-27 07:48:36,208 INFO L504 BasicCegarLoop]: Found error trace [2021-08-27 07:48:36,208 INFO L512 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-27 07:48:36,209 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2021-08-27 07:48:36,209 INFO L402 AbstractCegarLoop]: === Iteration 33 === Targeting errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK === [mainErr0ENSURES_VIOLATIONMEMORY_LEAK, errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2021-08-27 07:48:36,209 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 07:48:36,209 INFO L82 PathProgramCache]: Analyzing trace with hash -297990324, now seen corresponding path program 1 times [2021-08-27 07:48:36,209 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 07:48:36,209 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [825493756] [2021-08-27 07:48:36,209 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 07:48:36,210 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 07:48:36,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:48:36,287 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-08-27 07:48:36,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:48:36,311 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-08-27 07:48:36,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:48:36,325 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-08-27 07:48:36,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:48:36,341 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2021-08-27 07:48:36,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:48:36,373 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-08-27 07:48:36,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:48:36,413 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2021-08-27 07:48:36,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:48:36,415 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 07:48:36,415 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 07:48:36,415 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [825493756] [2021-08-27 07:48:36,415 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [825493756] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-27 07:48:36,415 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-27 07:48:36,416 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2021-08-27 07:48:36,416 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1771586902] [2021-08-27 07:48:36,417 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2021-08-27 07:48:36,417 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-27 07:48:36,417 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-08-27 07:48:36,418 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110 [2021-08-27 07:48:36,418 INFO L87 Difference]: Start difference. First operand 867 states and 1155 transitions. Second operand has 11 states, 11 states have (on average 4.181818181818182) internal successors, (46), 4 states have internal predecessors, (46), 2 states have call successors, (8), 8 states have call predecessors, (8), 2 states have return successors, (6), 3 states have call predecessors, (6), 2 states have call successors, (6) [2021-08-27 07:48:37,840 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 07:48:37,840 INFO L93 Difference]: Finished difference Result 1010 states and 1403 transitions. [2021-08-27 07:48:37,841 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-08-27 07:48:37,841 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 4.181818181818182) internal successors, (46), 4 states have internal predecessors, (46), 2 states have call successors, (8), 8 states have call predecessors, (8), 2 states have return successors, (6), 3 states have call predecessors, (6), 2 states have call successors, (6) Word has length 60 [2021-08-27 07:48:37,841 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-27 07:48:37,843 INFO L225 Difference]: With dead ends: 1010 [2021-08-27 07:48:37,843 INFO L226 Difference]: Without dead ends: 1010 [2021-08-27 07:48:37,843 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 217.6ms TimeCoverageRelationStatistics Valid=46, Invalid=110, Unknown=0, NotChecked=0, Total=156 [2021-08-27 07:48:37,843 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1010 states. [2021-08-27 07:48:37,850 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1010 to 867. [2021-08-27 07:48:37,851 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 867 states, 683 states have (on average 1.322108345534407) internal successors, (903), 696 states have internal predecessors, (903), 105 states have call successors, (105), 55 states have call predecessors, (105), 78 states have return successors, (146), 122 states have call predecessors, (146), 99 states have call successors, (146) [2021-08-27 07:48:37,852 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 867 states to 867 states and 1154 transitions. [2021-08-27 07:48:37,852 INFO L78 Accepts]: Start accepts. Automaton has 867 states and 1154 transitions. Word has length 60 [2021-08-27 07:48:37,852 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-27 07:48:37,852 INFO L470 AbstractCegarLoop]: Abstraction has 867 states and 1154 transitions. [2021-08-27 07:48:37,852 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 4.181818181818182) internal successors, (46), 4 states have internal predecessors, (46), 2 states have call successors, (8), 8 states have call predecessors, (8), 2 states have return successors, (6), 3 states have call predecessors, (6), 2 states have call successors, (6) [2021-08-27 07:48:37,852 INFO L276 IsEmpty]: Start isEmpty. Operand 867 states and 1154 transitions. [2021-08-27 07:48:37,854 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2021-08-27 07:48:37,854 INFO L504 BasicCegarLoop]: Found error trace [2021-08-27 07:48:37,854 INFO L512 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-27 07:48:37,854 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2021-08-27 07:48:37,854 INFO L402 AbstractCegarLoop]: === Iteration 34 === Targeting errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK === [mainErr0ENSURES_VIOLATIONMEMORY_LEAK, errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2021-08-27 07:48:37,854 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 07:48:37,855 INFO L82 PathProgramCache]: Analyzing trace with hash -807463414, now seen corresponding path program 1 times [2021-08-27 07:48:37,855 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 07:48:37,855 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1565756159] [2021-08-27 07:48:37,855 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 07:48:37,855 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 07:48:37,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:48:37,934 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-08-27 07:48:37,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:48:37,961 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-08-27 07:48:37,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:48:37,977 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-08-27 07:48:37,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:48:37,992 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2021-08-27 07:48:37,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:48:38,060 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-08-27 07:48:38,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:48:38,109 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2021-08-27 07:48:38,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:48:38,112 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 07:48:38,112 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 07:48:38,112 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1565756159] [2021-08-27 07:48:38,112 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1565756159] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-27 07:48:38,112 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-27 07:48:38,113 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2021-08-27 07:48:38,113 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1411640294] [2021-08-27 07:48:38,113 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2021-08-27 07:48:38,113 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-27 07:48:38,113 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2021-08-27 07:48:38,113 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=172, Unknown=0, NotChecked=0, Total=210 [2021-08-27 07:48:38,114 INFO L87 Difference]: Start difference. First operand 867 states and 1154 transitions. Second operand has 15 states, 15 states have (on average 3.066666666666667) internal successors, (46), 7 states have internal predecessors, (46), 3 states have call successors, (8), 8 states have call predecessors, (8), 3 states have return successors, (6), 4 states have call predecessors, (6), 2 states have call successors, (6) [2021-08-27 07:48:40,407 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 07:48:40,407 INFO L93 Difference]: Finished difference Result 1044 states and 1448 transitions. [2021-08-27 07:48:40,408 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2021-08-27 07:48:40,408 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 3.066666666666667) internal successors, (46), 7 states have internal predecessors, (46), 3 states have call successors, (8), 8 states have call predecessors, (8), 3 states have return successors, (6), 4 states have call predecessors, (6), 2 states have call successors, (6) Word has length 60 [2021-08-27 07:48:40,408 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-27 07:48:40,410 INFO L225 Difference]: With dead ends: 1044 [2021-08-27 07:48:40,410 INFO L226 Difference]: Without dead ends: 997 [2021-08-27 07:48:40,410 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 299.6ms TimeCoverageRelationStatistics Valid=62, Invalid=280, Unknown=0, NotChecked=0, Total=342 [2021-08-27 07:48:40,410 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 997 states. [2021-08-27 07:48:40,419 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 997 to 859. [2021-08-27 07:48:40,419 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 859 states, 677 states have (on average 1.3175775480059084) internal successors, (892), 690 states have internal predecessors, (892), 103 states have call successors, (103), 55 states have call predecessors, (103), 78 states have return successors, (144), 120 states have call predecessors, (144), 97 states have call successors, (144) [2021-08-27 07:48:40,420 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 859 states to 859 states and 1139 transitions. [2021-08-27 07:48:40,421 INFO L78 Accepts]: Start accepts. Automaton has 859 states and 1139 transitions. Word has length 60 [2021-08-27 07:48:40,421 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-27 07:48:40,421 INFO L470 AbstractCegarLoop]: Abstraction has 859 states and 1139 transitions. [2021-08-27 07:48:40,421 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 3.066666666666667) internal successors, (46), 7 states have internal predecessors, (46), 3 states have call successors, (8), 8 states have call predecessors, (8), 3 states have return successors, (6), 4 states have call predecessors, (6), 2 states have call successors, (6) [2021-08-27 07:48:40,421 INFO L276 IsEmpty]: Start isEmpty. Operand 859 states and 1139 transitions. [2021-08-27 07:48:40,422 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2021-08-27 07:48:40,422 INFO L504 BasicCegarLoop]: Found error trace [2021-08-27 07:48:40,422 INFO L512 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-27 07:48:40,423 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33 [2021-08-27 07:48:40,423 INFO L402 AbstractCegarLoop]: === Iteration 35 === Targeting errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK === [mainErr0ENSURES_VIOLATIONMEMORY_LEAK, errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2021-08-27 07:48:40,423 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 07:48:40,423 INFO L82 PathProgramCache]: Analyzing trace with hash -819904678, now seen corresponding path program 1 times [2021-08-27 07:48:40,423 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 07:48:40,423 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [203708675] [2021-08-27 07:48:40,423 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 07:48:40,423 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 07:48:40,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:48:40,495 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-08-27 07:48:40,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:48:40,518 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-08-27 07:48:40,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:48:40,530 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-08-27 07:48:40,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:48:40,543 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2021-08-27 07:48:40,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:48:40,559 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2021-08-27 07:48:40,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:48:40,584 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-08-27 07:48:40,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:48:40,602 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2021-08-27 07:48:40,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:48:40,604 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 07:48:40,604 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 07:48:40,604 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [203708675] [2021-08-27 07:48:40,604 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [203708675] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-27 07:48:40,604 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-27 07:48:40,604 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2021-08-27 07:48:40,604 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1359757922] [2021-08-27 07:48:40,605 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2021-08-27 07:48:40,605 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-27 07:48:40,605 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-08-27 07:48:40,605 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=94, Unknown=0, NotChecked=0, Total=132 [2021-08-27 07:48:40,606 INFO L87 Difference]: Start difference. First operand 859 states and 1139 transitions. Second operand has 12 states, 12 states have (on average 3.75) internal successors, (45), 4 states have internal predecessors, (45), 2 states have call successors, (9), 9 states have call predecessors, (9), 3 states have return successors, (7), 3 states have call predecessors, (7), 2 states have call successors, (7) [2021-08-27 07:48:42,296 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 07:48:42,296 INFO L93 Difference]: Finished difference Result 1015 states and 1423 transitions. [2021-08-27 07:48:42,297 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-08-27 07:48:42,297 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 3.75) internal successors, (45), 4 states have internal predecessors, (45), 2 states have call successors, (9), 9 states have call predecessors, (9), 3 states have return successors, (7), 3 states have call predecessors, (7), 2 states have call successors, (7) Word has length 61 [2021-08-27 07:48:42,297 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-27 07:48:42,299 INFO L225 Difference]: With dead ends: 1015 [2021-08-27 07:48:42,299 INFO L226 Difference]: Without dead ends: 1013 [2021-08-27 07:48:42,299 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 314.2ms TimeCoverageRelationStatistics Valid=68, Invalid=142, Unknown=0, NotChecked=0, Total=210 [2021-08-27 07:48:42,299 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1013 states. [2021-08-27 07:48:42,307 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1013 to 863. [2021-08-27 07:48:42,308 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 863 states, 679 states have (on average 1.316642120765832) internal successors, (894), 694 states have internal predecessors, (894), 103 states have call successors, (103), 55 states have call predecessors, (103), 80 states have return successors, (160), 120 states have call predecessors, (160), 97 states have call successors, (160) [2021-08-27 07:48:42,309 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 863 states to 863 states and 1157 transitions. [2021-08-27 07:48:42,309 INFO L78 Accepts]: Start accepts. Automaton has 863 states and 1157 transitions. Word has length 61 [2021-08-27 07:48:42,309 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-27 07:48:42,309 INFO L470 AbstractCegarLoop]: Abstraction has 863 states and 1157 transitions. [2021-08-27 07:48:42,309 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 3.75) internal successors, (45), 4 states have internal predecessors, (45), 2 states have call successors, (9), 9 states have call predecessors, (9), 3 states have return successors, (7), 3 states have call predecessors, (7), 2 states have call successors, (7) [2021-08-27 07:48:42,309 INFO L276 IsEmpty]: Start isEmpty. Operand 863 states and 1157 transitions. [2021-08-27 07:48:42,311 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2021-08-27 07:48:42,311 INFO L504 BasicCegarLoop]: Found error trace [2021-08-27 07:48:42,311 INFO L512 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-27 07:48:42,311 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34 [2021-08-27 07:48:42,311 INFO L402 AbstractCegarLoop]: === Iteration 36 === Targeting errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK === [mainErr0ENSURES_VIOLATIONMEMORY_LEAK, errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2021-08-27 07:48:42,311 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 07:48:42,311 INFO L82 PathProgramCache]: Analyzing trace with hash 153196542, now seen corresponding path program 1 times [2021-08-27 07:48:42,312 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 07:48:42,312 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [100488685] [2021-08-27 07:48:42,312 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 07:48:42,312 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 07:48:42,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:48:42,398 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-08-27 07:48:42,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:48:42,438 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-08-27 07:48:42,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:48:42,456 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-08-27 07:48:42,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:48:42,473 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2021-08-27 07:48:42,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:48:42,528 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-08-27 07:48:42,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:48:42,593 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2021-08-27 07:48:42,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:48:42,647 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-08-27 07:48:42,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:48:42,652 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 07:48:42,653 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 07:48:42,653 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [100488685] [2021-08-27 07:48:42,653 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [100488685] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-27 07:48:42,653 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-27 07:48:42,653 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [20] imperfect sequences [] total 20 [2021-08-27 07:48:42,653 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [304272989] [2021-08-27 07:48:42,653 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2021-08-27 07:48:42,654 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-27 07:48:42,654 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2021-08-27 07:48:42,654 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=327, Unknown=0, NotChecked=0, Total=380 [2021-08-27 07:48:42,654 INFO L87 Difference]: Start difference. First operand 863 states and 1157 transitions. Second operand has 20 states, 19 states have (on average 2.4210526315789473) internal successors, (46), 10 states have internal predecessors, (46), 4 states have call successors, (9), 9 states have call predecessors, (9), 4 states have return successors, (7), 5 states have call predecessors, (7), 3 states have call successors, (7) [2021-08-27 07:48:45,815 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 07:48:45,816 INFO L93 Difference]: Finished difference Result 1022 states and 1423 transitions. [2021-08-27 07:48:45,816 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2021-08-27 07:48:45,816 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 19 states have (on average 2.4210526315789473) internal successors, (46), 10 states have internal predecessors, (46), 4 states have call successors, (9), 9 states have call predecessors, (9), 4 states have return successors, (7), 5 states have call predecessors, (7), 3 states have call successors, (7) Word has length 62 [2021-08-27 07:48:45,817 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-27 07:48:45,818 INFO L225 Difference]: With dead ends: 1022 [2021-08-27 07:48:45,818 INFO L226 Difference]: Without dead ends: 1001 [2021-08-27 07:48:45,819 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 62 ImplicationChecksByTransitivity, 448.4ms TimeCoverageRelationStatistics Valid=99, Invalid=603, Unknown=0, NotChecked=0, Total=702 [2021-08-27 07:48:45,819 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1001 states. [2021-08-27 07:48:45,836 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1001 to 861. [2021-08-27 07:48:45,837 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 861 states, 678 states have (on average 1.3156342182890854) internal successors, (892), 693 states have internal predecessors, (892), 102 states have call successors, (102), 55 states have call predecessors, (102), 80 states have return successors, (159), 119 states have call predecessors, (159), 96 states have call successors, (159) [2021-08-27 07:48:45,838 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 861 states to 861 states and 1153 transitions. [2021-08-27 07:48:45,838 INFO L78 Accepts]: Start accepts. Automaton has 861 states and 1153 transitions. Word has length 62 [2021-08-27 07:48:45,839 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-27 07:48:45,839 INFO L470 AbstractCegarLoop]: Abstraction has 861 states and 1153 transitions. [2021-08-27 07:48:45,839 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 19 states have (on average 2.4210526315789473) internal successors, (46), 10 states have internal predecessors, (46), 4 states have call successors, (9), 9 states have call predecessors, (9), 4 states have return successors, (7), 5 states have call predecessors, (7), 3 states have call successors, (7) [2021-08-27 07:48:45,839 INFO L276 IsEmpty]: Start isEmpty. Operand 861 states and 1153 transitions. [2021-08-27 07:48:45,840 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2021-08-27 07:48:45,840 INFO L504 BasicCegarLoop]: Found error trace [2021-08-27 07:48:45,841 INFO L512 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-27 07:48:45,841 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35 [2021-08-27 07:48:45,841 INFO L402 AbstractCegarLoop]: === Iteration 37 === Targeting errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK === [mainErr0ENSURES_VIOLATIONMEMORY_LEAK, errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2021-08-27 07:48:45,841 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 07:48:45,841 INFO L82 PathProgramCache]: Analyzing trace with hash -317898980, now seen corresponding path program 1 times [2021-08-27 07:48:45,842 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 07:48:45,842 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1426155023] [2021-08-27 07:48:45,842 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 07:48:45,842 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 07:48:45,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:48:45,923 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-08-27 07:48:45,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:48:45,950 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-08-27 07:48:45,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:48:45,965 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-08-27 07:48:45,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:48:45,980 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2021-08-27 07:48:45,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:48:46,022 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2021-08-27 07:48:46,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:48:46,058 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-08-27 07:48:46,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:48:46,084 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-08-27 07:48:46,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:48:46,111 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 07:48:46,112 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 07:48:46,112 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1426155023] [2021-08-27 07:48:46,112 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1426155023] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-27 07:48:46,112 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-27 07:48:46,112 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [19] imperfect sequences [] total 19 [2021-08-27 07:48:46,112 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [151027453] [2021-08-27 07:48:46,113 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2021-08-27 07:48:46,113 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-27 07:48:46,114 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2021-08-27 07:48:46,114 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=296, Unknown=0, NotChecked=0, Total=342 [2021-08-27 07:48:46,114 INFO L87 Difference]: Start difference. First operand 861 states and 1153 transitions. Second operand has 19 states, 19 states have (on average 2.473684210526316) internal successors, (47), 9 states have internal predecessors, (47), 2 states have call successors, (9), 8 states have call predecessors, (9), 5 states have return successors, (7), 5 states have call predecessors, (7), 1 states have call successors, (7) [2021-08-27 07:48:49,192 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 07:48:49,192 INFO L93 Difference]: Finished difference Result 1013 states and 1412 transitions. [2021-08-27 07:48:49,192 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2021-08-27 07:48:49,192 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 2.473684210526316) internal successors, (47), 9 states have internal predecessors, (47), 2 states have call successors, (9), 8 states have call predecessors, (9), 5 states have return successors, (7), 5 states have call predecessors, (7), 1 states have call successors, (7) Word has length 63 [2021-08-27 07:48:49,192 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-27 07:48:49,194 INFO L225 Difference]: With dead ends: 1013 [2021-08-27 07:48:49,194 INFO L226 Difference]: Without dead ends: 994 [2021-08-27 07:48:49,194 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 42 ImplicationChecksByTransitivity, 249.5ms TimeCoverageRelationStatistics Valid=61, Invalid=401, Unknown=0, NotChecked=0, Total=462 [2021-08-27 07:48:49,195 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 994 states. [2021-08-27 07:48:49,209 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 994 to 856. [2021-08-27 07:48:49,210 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 856 states, 675 states have (on average 1.3155555555555556) internal successors, (888), 690 states have internal predecessors, (888), 101 states have call successors, (101), 55 states have call predecessors, (101), 79 states have return successors, (157), 117 states have call predecessors, (157), 95 states have call successors, (157) [2021-08-27 07:48:49,212 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 856 states to 856 states and 1146 transitions. [2021-08-27 07:48:49,212 INFO L78 Accepts]: Start accepts. Automaton has 856 states and 1146 transitions. Word has length 63 [2021-08-27 07:48:49,212 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-27 07:48:49,212 INFO L470 AbstractCegarLoop]: Abstraction has 856 states and 1146 transitions. [2021-08-27 07:48:49,212 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 2.473684210526316) internal successors, (47), 9 states have internal predecessors, (47), 2 states have call successors, (9), 8 states have call predecessors, (9), 5 states have return successors, (7), 5 states have call predecessors, (7), 1 states have call successors, (7) [2021-08-27 07:48:49,212 INFO L276 IsEmpty]: Start isEmpty. Operand 856 states and 1146 transitions. [2021-08-27 07:48:49,214 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2021-08-27 07:48:49,214 INFO L504 BasicCegarLoop]: Found error trace [2021-08-27 07:48:49,214 INFO L512 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-27 07:48:49,214 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable36 [2021-08-27 07:48:49,214 INFO L402 AbstractCegarLoop]: === Iteration 38 === Targeting errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK === [mainErr0ENSURES_VIOLATIONMEMORY_LEAK, errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2021-08-27 07:48:49,214 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 07:48:49,214 INFO L82 PathProgramCache]: Analyzing trace with hash 251959398, now seen corresponding path program 1 times [2021-08-27 07:48:49,215 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 07:48:49,215 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1190975834] [2021-08-27 07:48:49,215 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 07:48:49,215 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 07:48:49,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:48:49,309 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-08-27 07:48:49,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:48:49,337 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-08-27 07:48:49,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:48:49,350 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-08-27 07:48:49,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:48:49,366 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2021-08-27 07:48:49,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:48:49,414 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-08-27 07:48:49,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:48:49,455 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2021-08-27 07:48:49,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:48:49,478 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-08-27 07:48:49,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:48:49,502 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 07:48:49,502 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 07:48:49,502 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1190975834] [2021-08-27 07:48:49,502 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1190975834] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-27 07:48:49,502 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-27 07:48:49,502 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [19] imperfect sequences [] total 19 [2021-08-27 07:48:49,502 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2067299854] [2021-08-27 07:48:49,504 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2021-08-27 07:48:49,504 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-27 07:48:49,504 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2021-08-27 07:48:49,504 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=296, Unknown=0, NotChecked=0, Total=342 [2021-08-27 07:48:49,504 INFO L87 Difference]: Start difference. First operand 856 states and 1146 transitions. Second operand has 19 states, 19 states have (on average 2.789473684210526) internal successors, (53), 9 states have internal predecessors, (53), 2 states have call successors, (9), 8 states have call predecessors, (9), 5 states have return successors, (7), 5 states have call predecessors, (7), 1 states have call successors, (7) [2021-08-27 07:48:51,997 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 07:48:51,997 INFO L93 Difference]: Finished difference Result 1008 states and 1405 transitions. [2021-08-27 07:48:51,997 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2021-08-27 07:48:51,998 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 2.789473684210526) internal successors, (53), 9 states have internal predecessors, (53), 2 states have call successors, (9), 8 states have call predecessors, (9), 5 states have return successors, (7), 5 states have call predecessors, (7), 1 states have call successors, (7) Word has length 69 [2021-08-27 07:48:51,998 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-27 07:48:51,999 INFO L225 Difference]: With dead ends: 1008 [2021-08-27 07:48:51,999 INFO L226 Difference]: Without dead ends: 981 [2021-08-27 07:48:52,000 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 217.6ms TimeCoverageRelationStatistics Valid=54, Invalid=366, Unknown=0, NotChecked=0, Total=420 [2021-08-27 07:48:52,000 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 981 states. [2021-08-27 07:48:52,007 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 981 to 845. [2021-08-27 07:48:52,008 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 845 states, 667 states have (on average 1.3163418290854574) internal successors, (878), 682 states have internal predecessors, (878), 99 states have call successors, (99), 55 states have call predecessors, (99), 78 states have return successors, (154), 114 states have call predecessors, (154), 93 states have call successors, (154) [2021-08-27 07:48:52,009 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 845 states to 845 states and 1131 transitions. [2021-08-27 07:48:52,009 INFO L78 Accepts]: Start accepts. Automaton has 845 states and 1131 transitions. Word has length 69 [2021-08-27 07:48:52,009 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-27 07:48:52,009 INFO L470 AbstractCegarLoop]: Abstraction has 845 states and 1131 transitions. [2021-08-27 07:48:52,009 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 2.789473684210526) internal successors, (53), 9 states have internal predecessors, (53), 2 states have call successors, (9), 8 states have call predecessors, (9), 5 states have return successors, (7), 5 states have call predecessors, (7), 1 states have call successors, (7) [2021-08-27 07:48:52,009 INFO L276 IsEmpty]: Start isEmpty. Operand 845 states and 1131 transitions. [2021-08-27 07:48:52,010 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2021-08-27 07:48:52,011 INFO L504 BasicCegarLoop]: Found error trace [2021-08-27 07:48:52,011 INFO L512 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-27 07:48:52,011 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable37 [2021-08-27 07:48:52,011 INFO L402 AbstractCegarLoop]: === Iteration 39 === Targeting errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK === [mainErr0ENSURES_VIOLATIONMEMORY_LEAK, errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2021-08-27 07:48:52,011 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 07:48:52,011 INFO L82 PathProgramCache]: Analyzing trace with hash -136722259, now seen corresponding path program 1 times [2021-08-27 07:48:52,011 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 07:48:52,011 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [782534348] [2021-08-27 07:48:52,012 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 07:48:52,012 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 07:48:52,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:48:52,111 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-08-27 07:48:52,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:48:52,159 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-08-27 07:48:52,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:48:52,173 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-08-27 07:48:52,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:48:52,188 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2021-08-27 07:48:52,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:48:52,225 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2021-08-27 07:48:52,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:48:52,263 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-08-27 07:48:52,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:48:52,285 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-08-27 07:48:52,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:48:52,309 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 07:48:52,309 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 07:48:52,309 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [782534348] [2021-08-27 07:48:52,309 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [782534348] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-27 07:48:52,309 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-27 07:48:52,309 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [19] imperfect sequences [] total 19 [2021-08-27 07:48:52,310 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1551462670] [2021-08-27 07:48:52,310 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2021-08-27 07:48:52,310 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-27 07:48:52,310 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2021-08-27 07:48:52,310 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=296, Unknown=0, NotChecked=0, Total=342 [2021-08-27 07:48:52,310 INFO L87 Difference]: Start difference. First operand 845 states and 1131 transitions. Second operand has 19 states, 19 states have (on average 2.4210526315789473) internal successors, (46), 9 states have internal predecessors, (46), 2 states have call successors, (9), 8 states have call predecessors, (9), 5 states have return successors, (7), 5 states have call predecessors, (7), 1 states have call successors, (7) [2021-08-27 07:48:55,248 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 07:48:55,249 INFO L93 Difference]: Finished difference Result 995 states and 1386 transitions. [2021-08-27 07:48:55,249 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2021-08-27 07:48:55,249 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 2.4210526315789473) internal successors, (46), 9 states have internal predecessors, (46), 2 states have call successors, (9), 8 states have call predecessors, (9), 5 states have return successors, (7), 5 states have call predecessors, (7), 1 states have call successors, (7) Word has length 62 [2021-08-27 07:48:55,249 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-27 07:48:55,251 INFO L225 Difference]: With dead ends: 995 [2021-08-27 07:48:55,251 INFO L226 Difference]: Without dead ends: 976 [2021-08-27 07:48:55,251 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 259.7ms TimeCoverageRelationStatistics Valid=54, Invalid=366, Unknown=0, NotChecked=0, Total=420 [2021-08-27 07:48:55,252 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 976 states. [2021-08-27 07:48:55,259 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 976 to 840. [2021-08-27 07:48:55,259 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 840 states, 664 states have (on average 1.3162650602409638) internal successors, (874), 679 states have internal predecessors, (874), 98 states have call successors, (98), 55 states have call predecessors, (98), 77 states have return successors, (152), 112 states have call predecessors, (152), 92 states have call successors, (152) [2021-08-27 07:48:55,260 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 840 states to 840 states and 1124 transitions. [2021-08-27 07:48:55,260 INFO L78 Accepts]: Start accepts. Automaton has 840 states and 1124 transitions. Word has length 62 [2021-08-27 07:48:55,260 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-27 07:48:55,260 INFO L470 AbstractCegarLoop]: Abstraction has 840 states and 1124 transitions. [2021-08-27 07:48:55,260 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 2.4210526315789473) internal successors, (46), 9 states have internal predecessors, (46), 2 states have call successors, (9), 8 states have call predecessors, (9), 5 states have return successors, (7), 5 states have call predecessors, (7), 1 states have call successors, (7) [2021-08-27 07:48:55,261 INFO L276 IsEmpty]: Start isEmpty. Operand 840 states and 1124 transitions. [2021-08-27 07:48:55,262 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2021-08-27 07:48:55,262 INFO L504 BasicCegarLoop]: Found error trace [2021-08-27 07:48:55,262 INFO L512 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-27 07:48:55,262 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable38 [2021-08-27 07:48:55,262 INFO L402 AbstractCegarLoop]: === Iteration 40 === Targeting errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK === [mainErr0ENSURES_VIOLATIONMEMORY_LEAK, errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2021-08-27 07:48:55,262 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 07:48:55,262 INFO L82 PathProgramCache]: Analyzing trace with hash -937088575, now seen corresponding path program 1 times [2021-08-27 07:48:55,262 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 07:48:55,262 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [61612990] [2021-08-27 07:48:55,262 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 07:48:55,262 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 07:48:55,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:48:55,343 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-08-27 07:48:55,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:48:55,368 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-08-27 07:48:55,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:48:55,382 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-08-27 07:48:55,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:48:55,397 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2021-08-27 07:48:55,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:48:55,446 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-08-27 07:48:55,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:48:55,495 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-08-27 07:48:55,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:48:55,511 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2021-08-27 07:48:55,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:48:55,564 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-08-27 07:48:55,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:48:55,566 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 07:48:55,566 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 07:48:55,566 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [61612990] [2021-08-27 07:48:55,567 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [61612990] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-27 07:48:55,567 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-27 07:48:55,567 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [21] imperfect sequences [] total 21 [2021-08-27 07:48:55,567 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [329549513] [2021-08-27 07:48:55,567 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2021-08-27 07:48:55,567 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-27 07:48:55,567 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2021-08-27 07:48:55,568 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=359, Unknown=0, NotChecked=0, Total=420 [2021-08-27 07:48:55,568 INFO L87 Difference]: Start difference. First operand 840 states and 1124 transitions. Second operand has 21 states, 20 states have (on average 2.4) internal successors, (48), 10 states have internal predecessors, (48), 4 states have call successors, (10), 10 states have call predecessors, (10), 4 states have return successors, (8), 5 states have call predecessors, (8), 3 states have call successors, (8) [2021-08-27 07:48:58,102 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 07:48:58,102 INFO L93 Difference]: Finished difference Result 997 states and 1386 transitions. [2021-08-27 07:48:58,102 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2021-08-27 07:48:58,103 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 20 states have (on average 2.4) internal successors, (48), 10 states have internal predecessors, (48), 4 states have call successors, (10), 10 states have call predecessors, (10), 4 states have return successors, (8), 5 states have call predecessors, (8), 3 states have call successors, (8) Word has length 66 [2021-08-27 07:48:58,103 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-27 07:48:58,105 INFO L225 Difference]: With dead ends: 997 [2021-08-27 07:48:58,105 INFO L226 Difference]: Without dead ends: 975 [2021-08-27 07:48:58,105 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 75 ImplicationChecksByTransitivity, 459.2ms TimeCoverageRelationStatistics Valid=120, Invalid=692, Unknown=0, NotChecked=0, Total=812 [2021-08-27 07:48:58,105 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 975 states. [2021-08-27 07:48:58,112 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 975 to 838. [2021-08-27 07:48:58,113 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 838 states, 663 states have (on average 1.315233785822021) internal successors, (872), 678 states have internal predecessors, (872), 97 states have call successors, (97), 55 states have call predecessors, (97), 77 states have return successors, (151), 111 states have call predecessors, (151), 91 states have call successors, (151) [2021-08-27 07:48:58,114 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 838 states to 838 states and 1120 transitions. [2021-08-27 07:48:58,114 INFO L78 Accepts]: Start accepts. Automaton has 838 states and 1120 transitions. Word has length 66 [2021-08-27 07:48:58,114 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-27 07:48:58,114 INFO L470 AbstractCegarLoop]: Abstraction has 838 states and 1120 transitions. [2021-08-27 07:48:58,114 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 20 states have (on average 2.4) internal successors, (48), 10 states have internal predecessors, (48), 4 states have call successors, (10), 10 states have call predecessors, (10), 4 states have return successors, (8), 5 states have call predecessors, (8), 3 states have call successors, (8) [2021-08-27 07:48:58,114 INFO L276 IsEmpty]: Start isEmpty. Operand 838 states and 1120 transitions. [2021-08-27 07:48:58,115 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2021-08-27 07:48:58,115 INFO L504 BasicCegarLoop]: Found error trace [2021-08-27 07:48:58,115 INFO L512 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-27 07:48:58,116 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable39 [2021-08-27 07:48:58,116 INFO L402 AbstractCegarLoop]: === Iteration 41 === Targeting errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK === [mainErr0ENSURES_VIOLATIONMEMORY_LEAK, errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2021-08-27 07:48:58,116 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 07:48:58,116 INFO L82 PathProgramCache]: Analyzing trace with hash -972482111, now seen corresponding path program 1 times [2021-08-27 07:48:58,116 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 07:48:58,116 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [650157195] [2021-08-27 07:48:58,116 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 07:48:58,116 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 07:48:58,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:48:58,196 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-08-27 07:48:58,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:48:58,222 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-08-27 07:48:58,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:48:58,236 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-08-27 07:48:58,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:48:58,252 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2021-08-27 07:48:58,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:48:58,300 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-08-27 07:48:58,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:48:58,366 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2021-08-27 07:48:58,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:48:58,380 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-08-27 07:48:58,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:48:58,443 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-08-27 07:48:58,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:48:58,447 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 07:48:58,447 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 07:48:58,447 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [650157195] [2021-08-27 07:48:58,448 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [650157195] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-27 07:48:58,448 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-27 07:48:58,448 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [21] imperfect sequences [] total 21 [2021-08-27 07:48:58,448 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [590580789] [2021-08-27 07:48:58,448 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2021-08-27 07:48:58,448 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-27 07:48:58,449 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2021-08-27 07:48:58,449 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=359, Unknown=0, NotChecked=0, Total=420 [2021-08-27 07:48:58,449 INFO L87 Difference]: Start difference. First operand 838 states and 1120 transitions. Second operand has 21 states, 20 states have (on average 2.45) internal successors, (49), 10 states have internal predecessors, (49), 4 states have call successors, (10), 10 states have call predecessors, (10), 4 states have return successors, (8), 5 states have call predecessors, (8), 3 states have call successors, (8) [2021-08-27 07:49:00,822 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 07:49:00,823 INFO L93 Difference]: Finished difference Result 994 states and 1379 transitions. [2021-08-27 07:49:00,823 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2021-08-27 07:49:00,823 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 20 states have (on average 2.45) internal successors, (49), 10 states have internal predecessors, (49), 4 states have call successors, (10), 10 states have call predecessors, (10), 4 states have return successors, (8), 5 states have call predecessors, (8), 3 states have call successors, (8) Word has length 67 [2021-08-27 07:49:00,823 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-27 07:49:00,825 INFO L225 Difference]: With dead ends: 994 [2021-08-27 07:49:00,825 INFO L226 Difference]: Without dead ends: 972 [2021-08-27 07:49:00,825 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 75 ImplicationChecksByTransitivity, 453.9ms TimeCoverageRelationStatistics Valid=120, Invalid=692, Unknown=0, NotChecked=0, Total=812 [2021-08-27 07:49:00,826 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 972 states. [2021-08-27 07:49:00,832 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 972 to 836. [2021-08-27 07:49:00,833 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 836 states, 662 states have (on average 1.3141993957703928) internal successors, (870), 677 states have internal predecessors, (870), 96 states have call successors, (96), 55 states have call predecessors, (96), 77 states have return successors, (150), 110 states have call predecessors, (150), 90 states have call successors, (150) [2021-08-27 07:49:00,834 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 836 states to 836 states and 1116 transitions. [2021-08-27 07:49:00,834 INFO L78 Accepts]: Start accepts. Automaton has 836 states and 1116 transitions. Word has length 67 [2021-08-27 07:49:00,834 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-27 07:49:00,834 INFO L470 AbstractCegarLoop]: Abstraction has 836 states and 1116 transitions. [2021-08-27 07:49:00,834 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 20 states have (on average 2.45) internal successors, (49), 10 states have internal predecessors, (49), 4 states have call successors, (10), 10 states have call predecessors, (10), 4 states have return successors, (8), 5 states have call predecessors, (8), 3 states have call successors, (8) [2021-08-27 07:49:00,834 INFO L276 IsEmpty]: Start isEmpty. Operand 836 states and 1116 transitions. [2021-08-27 07:49:00,835 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2021-08-27 07:49:00,836 INFO L504 BasicCegarLoop]: Found error trace [2021-08-27 07:49:00,836 INFO L512 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-27 07:49:00,836 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable40 [2021-08-27 07:49:00,836 INFO L402 AbstractCegarLoop]: === Iteration 42 === Targeting errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK === [mainErr0ENSURES_VIOLATIONMEMORY_LEAK, errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2021-08-27 07:49:00,836 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 07:49:00,836 INFO L82 PathProgramCache]: Analyzing trace with hash -2145458307, now seen corresponding path program 1 times [2021-08-27 07:49:00,836 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 07:49:00,836 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1802027147] [2021-08-27 07:49:00,837 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 07:49:00,837 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 07:49:00,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:49:00,916 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-08-27 07:49:00,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:49:00,941 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-08-27 07:49:00,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:49:00,954 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-08-27 07:49:00,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:49:00,968 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2021-08-27 07:49:00,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:49:01,010 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-08-27 07:49:01,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:49:01,056 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2021-08-27 07:49:01,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:49:01,108 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-08-27 07:49:01,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:49:01,110 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 07:49:01,110 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 07:49:01,110 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1802027147] [2021-08-27 07:49:01,111 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1802027147] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-27 07:49:01,111 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-27 07:49:01,111 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [20] imperfect sequences [] total 20 [2021-08-27 07:49:01,111 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1729598767] [2021-08-27 07:49:01,111 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2021-08-27 07:49:01,112 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-27 07:49:01,112 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2021-08-27 07:49:01,112 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=327, Unknown=0, NotChecked=0, Total=380 [2021-08-27 07:49:01,112 INFO L87 Difference]: Start difference. First operand 836 states and 1116 transitions. Second operand has 20 states, 19 states have (on average 2.473684210526316) internal successors, (47), 10 states have internal predecessors, (47), 4 states have call successors, (9), 9 states have call predecessors, (9), 4 states have return successors, (7), 5 states have call predecessors, (7), 3 states have call successors, (7) [2021-08-27 07:49:03,651 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 07:49:03,651 INFO L93 Difference]: Finished difference Result 989 states and 1370 transitions. [2021-08-27 07:49:03,652 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2021-08-27 07:49:03,652 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 19 states have (on average 2.473684210526316) internal successors, (47), 10 states have internal predecessors, (47), 4 states have call successors, (9), 9 states have call predecessors, (9), 4 states have return successors, (7), 5 states have call predecessors, (7), 3 states have call successors, (7) Word has length 63 [2021-08-27 07:49:03,652 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-27 07:49:03,654 INFO L225 Difference]: With dead ends: 989 [2021-08-27 07:49:03,654 INFO L226 Difference]: Without dead ends: 968 [2021-08-27 07:49:03,654 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 62 ImplicationChecksByTransitivity, 404.4ms TimeCoverageRelationStatistics Valid=99, Invalid=603, Unknown=0, NotChecked=0, Total=702 [2021-08-27 07:49:03,654 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 968 states. [2021-08-27 07:49:03,661 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 968 to 834. [2021-08-27 07:49:03,662 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 834 states, 661 states have (on average 1.313161875945537) internal successors, (868), 676 states have internal predecessors, (868), 95 states have call successors, (95), 55 states have call predecessors, (95), 77 states have return successors, (149), 109 states have call predecessors, (149), 89 states have call successors, (149) [2021-08-27 07:49:03,663 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 834 states to 834 states and 1112 transitions. [2021-08-27 07:49:03,663 INFO L78 Accepts]: Start accepts. Automaton has 834 states and 1112 transitions. Word has length 63 [2021-08-27 07:49:03,663 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-27 07:49:03,663 INFO L470 AbstractCegarLoop]: Abstraction has 834 states and 1112 transitions. [2021-08-27 07:49:03,663 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 19 states have (on average 2.473684210526316) internal successors, (47), 10 states have internal predecessors, (47), 4 states have call successors, (9), 9 states have call predecessors, (9), 4 states have return successors, (7), 5 states have call predecessors, (7), 3 states have call successors, (7) [2021-08-27 07:49:03,663 INFO L276 IsEmpty]: Start isEmpty. Operand 834 states and 1112 transitions. [2021-08-27 07:49:03,664 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2021-08-27 07:49:03,664 INFO L504 BasicCegarLoop]: Found error trace [2021-08-27 07:49:03,664 INFO L512 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-27 07:49:03,664 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable41 [2021-08-27 07:49:03,664 INFO L402 AbstractCegarLoop]: === Iteration 43 === Targeting errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK === [mainErr0ENSURES_VIOLATIONMEMORY_LEAK, errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2021-08-27 07:49:03,664 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 07:49:03,664 INFO L82 PathProgramCache]: Analyzing trace with hash 727665943, now seen corresponding path program 1 times [2021-08-27 07:49:03,664 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 07:49:03,665 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [907437414] [2021-08-27 07:49:03,665 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 07:49:03,665 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 07:49:03,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:49:03,730 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-08-27 07:49:03,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:49:03,752 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-08-27 07:49:03,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:49:03,764 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-08-27 07:49:03,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:49:03,778 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2021-08-27 07:49:03,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:49:03,794 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2021-08-27 07:49:03,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:49:03,807 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-08-27 07:49:03,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:49:03,821 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2021-08-27 07:49:03,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:49:03,823 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 07:49:03,823 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 07:49:03,823 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [907437414] [2021-08-27 07:49:03,823 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [907437414] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-27 07:49:03,823 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-27 07:49:03,823 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2021-08-27 07:49:03,823 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1344835608] [2021-08-27 07:49:03,824 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2021-08-27 07:49:03,824 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-27 07:49:03,824 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-08-27 07:49:03,824 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=56, Unknown=0, NotChecked=0, Total=90 [2021-08-27 07:49:03,824 INFO L87 Difference]: Start difference. First operand 834 states and 1112 transitions. Second operand has 10 states, 10 states have (on average 4.7) internal successors, (47), 3 states have internal predecessors, (47), 2 states have call successors, (9), 9 states have call predecessors, (9), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2021-08-27 07:49:05,182 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 07:49:05,182 INFO L93 Difference]: Finished difference Result 829 states and 1097 transitions. [2021-08-27 07:49:05,182 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-08-27 07:49:05,182 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 4.7) internal successors, (47), 3 states have internal predecessors, (47), 2 states have call successors, (9), 9 states have call predecessors, (9), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) Word has length 63 [2021-08-27 07:49:05,182 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-27 07:49:05,184 INFO L225 Difference]: With dead ends: 829 [2021-08-27 07:49:05,184 INFO L226 Difference]: Without dead ends: 825 [2021-08-27 07:49:05,184 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 174.5ms TimeCoverageRelationStatistics Valid=44, Invalid=66, Unknown=0, NotChecked=0, Total=110 [2021-08-27 07:49:05,185 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 825 states. [2021-08-27 07:49:05,190 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 825 to 704. [2021-08-27 07:49:05,190 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 704 states, 558 states have (on average 1.3010752688172043) internal successors, (726), 573 states have internal predecessors, (726), 81 states have call successors, (81), 48 states have call predecessors, (81), 64 states have return successors, (102), 89 states have call predecessors, (102), 75 states have call successors, (102) [2021-08-27 07:49:05,191 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 704 states to 704 states and 909 transitions. [2021-08-27 07:49:05,191 INFO L78 Accepts]: Start accepts. Automaton has 704 states and 909 transitions. Word has length 63 [2021-08-27 07:49:05,191 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-27 07:49:05,191 INFO L470 AbstractCegarLoop]: Abstraction has 704 states and 909 transitions. [2021-08-27 07:49:05,192 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 4.7) internal successors, (47), 3 states have internal predecessors, (47), 2 states have call successors, (9), 9 states have call predecessors, (9), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2021-08-27 07:49:05,192 INFO L276 IsEmpty]: Start isEmpty. Operand 704 states and 909 transitions. [2021-08-27 07:49:05,193 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2021-08-27 07:49:05,193 INFO L504 BasicCegarLoop]: Found error trace [2021-08-27 07:49:05,193 INFO L512 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-27 07:49:05,193 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable42 [2021-08-27 07:49:05,193 INFO L402 AbstractCegarLoop]: === Iteration 44 === Targeting errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK === [mainErr0ENSURES_VIOLATIONMEMORY_LEAK, errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2021-08-27 07:49:05,193 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 07:49:05,194 INFO L82 PathProgramCache]: Analyzing trace with hash 1717945833, now seen corresponding path program 1 times [2021-08-27 07:49:05,194 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 07:49:05,194 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1906083883] [2021-08-27 07:49:05,194 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 07:49:05,194 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 07:49:05,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:49:05,265 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-08-27 07:49:05,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:49:05,293 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-08-27 07:49:05,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:49:05,307 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-08-27 07:49:05,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:49:05,327 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2021-08-27 07:49:05,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:49:05,338 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-08-27 07:49:05,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:49:05,370 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2021-08-27 07:49:05,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:49:05,383 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2021-08-27 07:49:05,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:49:05,386 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-08-27 07:49:05,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:49:05,388 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 07:49:05,388 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 07:49:05,388 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1906083883] [2021-08-27 07:49:05,388 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1906083883] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-27 07:49:05,388 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-27 07:49:05,388 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2021-08-27 07:49:05,388 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [943729505] [2021-08-27 07:49:05,388 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2021-08-27 07:49:05,389 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-27 07:49:05,389 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-08-27 07:49:05,389 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2021-08-27 07:49:05,389 INFO L87 Difference]: Start difference. First operand 704 states and 909 transitions. Second operand has 9 states, 9 states have (on average 5.111111111111111) internal successors, (46), 3 states have internal predecessors, (46), 2 states have call successors, (12), 8 states have call predecessors, (12), 2 states have return successors, (8), 2 states have call predecessors, (8), 1 states have call successors, (8) [2021-08-27 07:49:06,542 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 07:49:06,542 INFO L93 Difference]: Finished difference Result 772 states and 1012 transitions. [2021-08-27 07:49:06,542 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-08-27 07:49:06,543 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 5.111111111111111) internal successors, (46), 3 states have internal predecessors, (46), 2 states have call successors, (12), 8 states have call predecessors, (12), 2 states have return successors, (8), 2 states have call predecessors, (8), 1 states have call successors, (8) Word has length 66 [2021-08-27 07:49:06,543 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-27 07:49:06,544 INFO L225 Difference]: With dead ends: 772 [2021-08-27 07:49:06,544 INFO L226 Difference]: Without dead ends: 772 [2021-08-27 07:49:06,544 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 143.8ms TimeCoverageRelationStatistics Valid=36, Invalid=54, Unknown=0, NotChecked=0, Total=90 [2021-08-27 07:49:06,545 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 772 states. [2021-08-27 07:49:06,549 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 772 to 704. [2021-08-27 07:49:06,550 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 704 states, 558 states have (on average 1.2956989247311828) internal successors, (723), 573 states have internal predecessors, (723), 81 states have call successors, (81), 48 states have call predecessors, (81), 64 states have return successors, (102), 89 states have call predecessors, (102), 75 states have call successors, (102) [2021-08-27 07:49:06,550 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 704 states to 704 states and 906 transitions. [2021-08-27 07:49:06,550 INFO L78 Accepts]: Start accepts. Automaton has 704 states and 906 transitions. Word has length 66 [2021-08-27 07:49:06,551 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-27 07:49:06,551 INFO L470 AbstractCegarLoop]: Abstraction has 704 states and 906 transitions. [2021-08-27 07:49:06,551 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 5.111111111111111) internal successors, (46), 3 states have internal predecessors, (46), 2 states have call successors, (12), 8 states have call predecessors, (12), 2 states have return successors, (8), 2 states have call predecessors, (8), 1 states have call successors, (8) [2021-08-27 07:49:06,551 INFO L276 IsEmpty]: Start isEmpty. Operand 704 states and 906 transitions. [2021-08-27 07:49:06,552 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2021-08-27 07:49:06,552 INFO L504 BasicCegarLoop]: Found error trace [2021-08-27 07:49:06,552 INFO L512 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-27 07:49:06,552 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable43 [2021-08-27 07:49:06,552 INFO L402 AbstractCegarLoop]: === Iteration 45 === Targeting errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK === [mainErr0ENSURES_VIOLATIONMEMORY_LEAK, errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2021-08-27 07:49:06,552 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 07:49:06,552 INFO L82 PathProgramCache]: Analyzing trace with hash 1167771296, now seen corresponding path program 1 times [2021-08-27 07:49:06,552 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 07:49:06,552 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1520630835] [2021-08-27 07:49:06,552 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 07:49:06,552 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 07:49:06,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:49:06,622 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-08-27 07:49:06,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:49:06,644 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-08-27 07:49:06,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:49:06,657 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-08-27 07:49:06,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:49:06,670 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2021-08-27 07:49:06,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:49:06,693 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-08-27 07:49:06,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:49:06,730 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2021-08-27 07:49:06,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:49:06,744 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2021-08-27 07:49:06,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:49:06,746 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 07:49:06,746 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 07:49:06,746 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1520630835] [2021-08-27 07:49:06,753 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1520630835] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-27 07:49:06,753 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-27 07:49:06,753 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2021-08-27 07:49:06,753 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [373552456] [2021-08-27 07:49:06,754 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2021-08-27 07:49:06,754 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-27 07:49:06,754 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-08-27 07:49:06,754 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=94, Unknown=0, NotChecked=0, Total=132 [2021-08-27 07:49:06,754 INFO L87 Difference]: Start difference. First operand 704 states and 906 transitions. Second operand has 12 states, 12 states have (on average 4.083333333333333) internal successors, (49), 5 states have internal predecessors, (49), 3 states have call successors, (9), 9 states have call predecessors, (9), 2 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2021-08-27 07:49:08,223 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 07:49:08,223 INFO L93 Difference]: Finished difference Result 796 states and 1044 transitions. [2021-08-27 07:49:08,224 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2021-08-27 07:49:08,224 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 4.083333333333333) internal successors, (49), 5 states have internal predecessors, (49), 3 states have call successors, (9), 9 states have call predecessors, (9), 2 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) Word has length 65 [2021-08-27 07:49:08,224 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-27 07:49:08,225 INFO L225 Difference]: With dead ends: 796 [2021-08-27 07:49:08,226 INFO L226 Difference]: Without dead ends: 796 [2021-08-27 07:49:08,226 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 391.1ms TimeCoverageRelationStatistics Valid=102, Invalid=204, Unknown=0, NotChecked=0, Total=306 [2021-08-27 07:49:08,226 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 796 states. [2021-08-27 07:49:08,231 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 796 to 710. [2021-08-27 07:49:08,231 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 710 states, 563 states have (on average 1.2948490230905862) internal successors, (729), 578 states have internal predecessors, (729), 82 states have call successors, (82), 48 states have call predecessors, (82), 64 states have return successors, (103), 90 states have call predecessors, (103), 76 states have call successors, (103) [2021-08-27 07:49:08,232 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 710 states to 710 states and 914 transitions. [2021-08-27 07:49:08,232 INFO L78 Accepts]: Start accepts. Automaton has 710 states and 914 transitions. Word has length 65 [2021-08-27 07:49:08,232 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-27 07:49:08,232 INFO L470 AbstractCegarLoop]: Abstraction has 710 states and 914 transitions. [2021-08-27 07:49:08,232 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 4.083333333333333) internal successors, (49), 5 states have internal predecessors, (49), 3 states have call successors, (9), 9 states have call predecessors, (9), 2 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2021-08-27 07:49:08,232 INFO L276 IsEmpty]: Start isEmpty. Operand 710 states and 914 transitions. [2021-08-27 07:49:08,233 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2021-08-27 07:49:08,233 INFO L504 BasicCegarLoop]: Found error trace [2021-08-27 07:49:08,233 INFO L512 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-27 07:49:08,233 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable44 [2021-08-27 07:49:08,234 INFO L402 AbstractCegarLoop]: === Iteration 46 === Targeting errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK === [mainErr0ENSURES_VIOLATIONMEMORY_LEAK, errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2021-08-27 07:49:08,234 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 07:49:08,234 INFO L82 PathProgramCache]: Analyzing trace with hash -788931073, now seen corresponding path program 1 times [2021-08-27 07:49:08,234 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 07:49:08,234 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1576707578] [2021-08-27 07:49:08,234 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 07:49:08,234 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 07:49:08,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:49:08,310 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-08-27 07:49:08,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:49:08,335 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-08-27 07:49:08,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:49:08,348 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-08-27 07:49:08,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:49:08,362 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2021-08-27 07:49:08,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:49:08,403 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-08-27 07:49:08,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:49:08,438 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2021-08-27 07:49:08,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:49:08,450 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2021-08-27 07:49:08,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:49:08,452 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 07:49:08,452 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 07:49:08,452 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1576707578] [2021-08-27 07:49:08,452 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1576707578] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-27 07:49:08,452 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-27 07:49:08,452 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2021-08-27 07:49:08,452 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [104173448] [2021-08-27 07:49:08,452 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2021-08-27 07:49:08,452 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-27 07:49:08,453 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2021-08-27 07:49:08,453 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=194, Unknown=0, NotChecked=0, Total=240 [2021-08-27 07:49:08,453 INFO L87 Difference]: Start difference. First operand 710 states and 914 transitions. Second operand has 16 states, 16 states have (on average 3.125) internal successors, (50), 7 states have internal predecessors, (50), 3 states have call successors, (9), 9 states have call predecessors, (9), 3 states have return successors, (7), 4 states have call predecessors, (7), 2 states have call successors, (7) [2021-08-27 07:49:10,431 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 07:49:10,431 INFO L93 Difference]: Finished difference Result 813 states and 1062 transitions. [2021-08-27 07:49:10,432 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2021-08-27 07:49:10,432 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 3.125) internal successors, (50), 7 states have internal predecessors, (50), 3 states have call successors, (9), 9 states have call predecessors, (9), 3 states have return successors, (7), 4 states have call predecessors, (7), 2 states have call successors, (7) Word has length 66 [2021-08-27 07:49:10,432 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-27 07:49:10,433 INFO L225 Difference]: With dead ends: 813 [2021-08-27 07:49:10,433 INFO L226 Difference]: Without dead ends: 739 [2021-08-27 07:49:10,433 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 267.1ms TimeCoverageRelationStatistics Valid=72, Invalid=308, Unknown=0, NotChecked=0, Total=380 [2021-08-27 07:49:10,434 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 739 states. [2021-08-27 07:49:10,438 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 739 to 683. [2021-08-27 07:49:10,439 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 683 states, 541 states have (on average 1.2809611829944547) internal successors, (693), 556 states have internal predecessors, (693), 77 states have call successors, (77), 48 states have call predecessors, (77), 64 states have return successors, (97), 85 states have call predecessors, (97), 71 states have call successors, (97) [2021-08-27 07:49:10,440 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 683 states to 683 states and 867 transitions. [2021-08-27 07:49:10,440 INFO L78 Accepts]: Start accepts. Automaton has 683 states and 867 transitions. Word has length 66 [2021-08-27 07:49:10,440 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-27 07:49:10,440 INFO L470 AbstractCegarLoop]: Abstraction has 683 states and 867 transitions. [2021-08-27 07:49:10,440 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 3.125) internal successors, (50), 7 states have internal predecessors, (50), 3 states have call successors, (9), 9 states have call predecessors, (9), 3 states have return successors, (7), 4 states have call predecessors, (7), 2 states have call successors, (7) [2021-08-27 07:49:10,440 INFO L276 IsEmpty]: Start isEmpty. Operand 683 states and 867 transitions. [2021-08-27 07:49:10,441 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2021-08-27 07:49:10,441 INFO L504 BasicCegarLoop]: Found error trace [2021-08-27 07:49:10,441 INFO L512 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-27 07:49:10,441 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable45 [2021-08-27 07:49:10,442 INFO L402 AbstractCegarLoop]: === Iteration 47 === Targeting errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK === [mainErr0ENSURES_VIOLATIONMEMORY_LEAK, errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2021-08-27 07:49:10,442 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 07:49:10,442 INFO L82 PathProgramCache]: Analyzing trace with hash -1490530947, now seen corresponding path program 1 times [2021-08-27 07:49:10,442 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 07:49:10,442 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [375471565] [2021-08-27 07:49:10,442 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 07:49:10,443 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 07:49:10,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:49:10,527 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-08-27 07:49:10,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:49:10,551 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-08-27 07:49:10,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:49:10,575 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-08-27 07:49:10,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:49:10,590 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2021-08-27 07:49:10,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:49:10,609 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-08-27 07:49:10,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:49:10,644 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2021-08-27 07:49:10,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:49:10,663 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2021-08-27 07:49:10,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:49:10,668 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 07:49:10,669 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 07:49:10,669 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [375471565] [2021-08-27 07:49:10,669 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [375471565] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-27 07:49:10,669 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-27 07:49:10,669 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2021-08-27 07:49:10,669 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1551836320] [2021-08-27 07:49:10,669 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2021-08-27 07:49:10,669 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-27 07:49:10,669 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-08-27 07:49:10,669 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=94, Unknown=0, NotChecked=0, Total=132 [2021-08-27 07:49:10,670 INFO L87 Difference]: Start difference. First operand 683 states and 867 transitions. Second operand has 12 states, 12 states have (on average 4.166666666666667) internal successors, (50), 4 states have internal predecessors, (50), 2 states have call successors, (9), 9 states have call predecessors, (9), 3 states have return successors, (7), 3 states have call predecessors, (7), 2 states have call successors, (7) [2021-08-27 07:49:11,878 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 07:49:11,878 INFO L93 Difference]: Finished difference Result 726 states and 932 transitions. [2021-08-27 07:49:11,879 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-08-27 07:49:11,879 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 4.166666666666667) internal successors, (50), 4 states have internal predecessors, (50), 2 states have call successors, (9), 9 states have call predecessors, (9), 3 states have return successors, (7), 3 states have call predecessors, (7), 2 states have call successors, (7) Word has length 66 [2021-08-27 07:49:11,879 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-27 07:49:11,880 INFO L225 Difference]: With dead ends: 726 [2021-08-27 07:49:11,880 INFO L226 Difference]: Without dead ends: 726 [2021-08-27 07:49:11,880 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 329.2ms TimeCoverageRelationStatistics Valid=68, Invalid=142, Unknown=0, NotChecked=0, Total=210 [2021-08-27 07:49:11,881 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 726 states. [2021-08-27 07:49:11,885 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 726 to 673. [2021-08-27 07:49:11,885 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 673 states, 533 states have (on average 1.277673545966229) internal successors, (681), 548 states have internal predecessors, (681), 75 states have call successors, (75), 48 states have call predecessors, (75), 64 states have return successors, (95), 83 states have call predecessors, (95), 69 states have call successors, (95) [2021-08-27 07:49:11,886 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 673 states to 673 states and 851 transitions. [2021-08-27 07:49:11,886 INFO L78 Accepts]: Start accepts. Automaton has 673 states and 851 transitions. Word has length 66 [2021-08-27 07:49:11,886 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-27 07:49:11,886 INFO L470 AbstractCegarLoop]: Abstraction has 673 states and 851 transitions. [2021-08-27 07:49:11,886 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 4.166666666666667) internal successors, (50), 4 states have internal predecessors, (50), 2 states have call successors, (9), 9 states have call predecessors, (9), 3 states have return successors, (7), 3 states have call predecessors, (7), 2 states have call successors, (7) [2021-08-27 07:49:11,886 INFO L276 IsEmpty]: Start isEmpty. Operand 673 states and 851 transitions. [2021-08-27 07:49:11,887 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2021-08-27 07:49:11,887 INFO L504 BasicCegarLoop]: Found error trace [2021-08-27 07:49:11,887 INFO L512 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-27 07:49:11,888 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable46 [2021-08-27 07:49:11,888 INFO L402 AbstractCegarLoop]: === Iteration 48 === Targeting errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK === [mainErr0ENSURES_VIOLATIONMEMORY_LEAK, errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2021-08-27 07:49:11,888 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 07:49:11,888 INFO L82 PathProgramCache]: Analyzing trace with hash 1087637683, now seen corresponding path program 1 times [2021-08-27 07:49:11,888 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 07:49:11,888 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1735746989] [2021-08-27 07:49:11,888 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 07:49:11,888 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 07:49:11,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:49:11,957 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-08-27 07:49:11,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:49:11,979 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-08-27 07:49:11,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:49:11,992 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-08-27 07:49:11,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:49:12,006 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2021-08-27 07:49:12,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:49:12,024 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-08-27 07:49:12,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:49:12,051 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2021-08-27 07:49:12,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:49:12,068 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2021-08-27 07:49:12,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:49:12,070 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 07:49:12,070 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 07:49:12,071 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1735746989] [2021-08-27 07:49:12,071 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1735746989] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-27 07:49:12,071 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-27 07:49:12,071 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2021-08-27 07:49:12,071 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [662885005] [2021-08-27 07:49:12,071 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2021-08-27 07:49:12,071 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-27 07:49:12,072 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-08-27 07:49:12,072 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=94, Unknown=0, NotChecked=0, Total=132 [2021-08-27 07:49:12,072 INFO L87 Difference]: Start difference. First operand 673 states and 851 transitions. Second operand has 12 states, 12 states have (on average 4.25) internal successors, (51), 4 states have internal predecessors, (51), 2 states have call successors, (9), 9 states have call predecessors, (9), 3 states have return successors, (7), 3 states have call predecessors, (7), 2 states have call successors, (7) [2021-08-27 07:49:13,398 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 07:49:13,398 INFO L93 Difference]: Finished difference Result 722 states and 926 transitions. [2021-08-27 07:49:13,402 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-08-27 07:49:13,402 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 4.25) internal successors, (51), 4 states have internal predecessors, (51), 2 states have call successors, (9), 9 states have call predecessors, (9), 3 states have return successors, (7), 3 states have call predecessors, (7), 2 states have call successors, (7) Word has length 67 [2021-08-27 07:49:13,402 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-27 07:49:13,403 INFO L225 Difference]: With dead ends: 722 [2021-08-27 07:49:13,403 INFO L226 Difference]: Without dead ends: 717 [2021-08-27 07:49:13,403 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 313.9ms TimeCoverageRelationStatistics Valid=68, Invalid=142, Unknown=0, NotChecked=0, Total=210 [2021-08-27 07:49:13,403 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 717 states. [2021-08-27 07:49:13,408 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 717 to 668. [2021-08-27 07:49:13,408 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 668 states, 529 states have (on average 1.277882797731569) internal successors, (676), 544 states have internal predecessors, (676), 74 states have call successors, (74), 48 states have call predecessors, (74), 64 states have return successors, (94), 82 states have call predecessors, (94), 68 states have call successors, (94) [2021-08-27 07:49:13,409 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 668 states to 668 states and 844 transitions. [2021-08-27 07:49:13,409 INFO L78 Accepts]: Start accepts. Automaton has 668 states and 844 transitions. Word has length 67 [2021-08-27 07:49:13,409 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-27 07:49:13,409 INFO L470 AbstractCegarLoop]: Abstraction has 668 states and 844 transitions. [2021-08-27 07:49:13,410 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 4.25) internal successors, (51), 4 states have internal predecessors, (51), 2 states have call successors, (9), 9 states have call predecessors, (9), 3 states have return successors, (7), 3 states have call predecessors, (7), 2 states have call successors, (7) [2021-08-27 07:49:13,410 INFO L276 IsEmpty]: Start isEmpty. Operand 668 states and 844 transitions. [2021-08-27 07:49:13,410 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2021-08-27 07:49:13,410 INFO L504 BasicCegarLoop]: Found error trace [2021-08-27 07:49:13,411 INFO L512 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-27 07:49:13,411 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable47 [2021-08-27 07:49:13,411 INFO L402 AbstractCegarLoop]: === Iteration 49 === Targeting errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK === [mainErr0ENSURES_VIOLATIONMEMORY_LEAK, errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2021-08-27 07:49:13,411 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 07:49:13,411 INFO L82 PathProgramCache]: Analyzing trace with hash 1213196842, now seen corresponding path program 1 times [2021-08-27 07:49:13,411 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 07:49:13,411 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1899870934] [2021-08-27 07:49:13,411 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 07:49:13,411 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 07:49:13,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:49:13,483 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-08-27 07:49:13,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:49:13,506 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-08-27 07:49:13,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:49:13,519 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-08-27 07:49:13,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:49:13,533 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2021-08-27 07:49:13,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:49:13,551 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2021-08-27 07:49:13,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:49:13,567 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2021-08-27 07:49:13,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:49:13,578 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-08-27 07:49:13,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:49:13,581 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 07:49:13,581 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 07:49:13,582 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1899870934] [2021-08-27 07:49:13,582 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1899870934] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-27 07:49:13,582 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-27 07:49:13,582 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2021-08-27 07:49:13,582 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2102855822] [2021-08-27 07:49:13,582 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2021-08-27 07:49:13,583 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-27 07:49:13,583 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-08-27 07:49:13,583 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=56, Unknown=0, NotChecked=0, Total=90 [2021-08-27 07:49:13,583 INFO L87 Difference]: Start difference. First operand 668 states and 844 transitions. Second operand has 10 states, 10 states have (on average 5.1) internal successors, (51), 3 states have internal predecessors, (51), 2 states have call successors, (9), 9 states have call predecessors, (9), 2 states have return successors, (7), 2 states have call predecessors, (7), 1 states have call successors, (7) [2021-08-27 07:49:14,776 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 07:49:14,776 INFO L93 Difference]: Finished difference Result 823 states and 1052 transitions. [2021-08-27 07:49:14,777 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-08-27 07:49:14,777 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 5.1) internal successors, (51), 3 states have internal predecessors, (51), 2 states have call successors, (9), 9 states have call predecessors, (9), 2 states have return successors, (7), 2 states have call predecessors, (7), 1 states have call successors, (7) Word has length 67 [2021-08-27 07:49:14,777 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-27 07:49:14,778 INFO L225 Difference]: With dead ends: 823 [2021-08-27 07:49:14,778 INFO L226 Difference]: Without dead ends: 823 [2021-08-27 07:49:14,779 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 210.1ms TimeCoverageRelationStatistics Valid=58, Invalid=98, Unknown=0, NotChecked=0, Total=156 [2021-08-27 07:49:14,779 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 823 states. [2021-08-27 07:49:14,784 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 823 to 714. [2021-08-27 07:49:14,785 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 714 states, 565 states have (on average 1.2707964601769912) internal successors, (718), 582 states have internal predecessors, (718), 76 states have call successors, (76), 50 states have call predecessors, (76), 72 states have return successors, (102), 90 states have call predecessors, (102), 70 states have call successors, (102) [2021-08-27 07:49:14,786 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 714 states to 714 states and 896 transitions. [2021-08-27 07:49:14,786 INFO L78 Accepts]: Start accepts. Automaton has 714 states and 896 transitions. Word has length 67 [2021-08-27 07:49:14,786 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-27 07:49:14,786 INFO L470 AbstractCegarLoop]: Abstraction has 714 states and 896 transitions. [2021-08-27 07:49:14,786 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 5.1) internal successors, (51), 3 states have internal predecessors, (51), 2 states have call successors, (9), 9 states have call predecessors, (9), 2 states have return successors, (7), 2 states have call predecessors, (7), 1 states have call successors, (7) [2021-08-27 07:49:14,786 INFO L276 IsEmpty]: Start isEmpty. Operand 714 states and 896 transitions. [2021-08-27 07:49:14,787 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2021-08-27 07:49:14,787 INFO L504 BasicCegarLoop]: Found error trace [2021-08-27 07:49:14,787 INFO L512 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-27 07:49:14,788 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable48 [2021-08-27 07:49:14,788 INFO L402 AbstractCegarLoop]: === Iteration 50 === Targeting errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK === [mainErr0ENSURES_VIOLATIONMEMORY_LEAK, errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2021-08-27 07:49:14,788 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 07:49:14,788 INFO L82 PathProgramCache]: Analyzing trace with hash -601739544, now seen corresponding path program 1 times [2021-08-27 07:49:14,788 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 07:49:14,788 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1799291352] [2021-08-27 07:49:14,788 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 07:49:14,789 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 07:49:14,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:49:14,867 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-08-27 07:49:14,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:49:14,891 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-08-27 07:49:14,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:49:14,906 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-08-27 07:49:14,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:49:14,921 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2021-08-27 07:49:14,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:49:14,947 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2021-08-27 07:49:14,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:49:14,964 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2021-08-27 07:49:14,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:49:14,976 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-08-27 07:49:14,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:49:14,978 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 07:49:14,978 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 07:49:14,978 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1799291352] [2021-08-27 07:49:14,979 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1799291352] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-27 07:49:14,979 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-27 07:49:14,979 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2021-08-27 07:49:14,979 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [259328398] [2021-08-27 07:49:14,979 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2021-08-27 07:49:14,979 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-27 07:49:14,979 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-08-27 07:49:14,979 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=94, Unknown=0, NotChecked=0, Total=132 [2021-08-27 07:49:14,979 INFO L87 Difference]: Start difference. First operand 714 states and 896 transitions. Second operand has 12 states, 12 states have (on average 4.333333333333333) internal successors, (52), 5 states have internal predecessors, (52), 3 states have call successors, (9), 9 states have call predecessors, (9), 3 states have return successors, (7), 4 states have call predecessors, (7), 2 states have call successors, (7) [2021-08-27 07:49:16,452 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 07:49:16,452 INFO L93 Difference]: Finished difference Result 820 states and 1046 transitions. [2021-08-27 07:49:16,453 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2021-08-27 07:49:16,453 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 4.333333333333333) internal successors, (52), 5 states have internal predecessors, (52), 3 states have call successors, (9), 9 states have call predecessors, (9), 3 states have return successors, (7), 4 states have call predecessors, (7), 2 states have call successors, (7) Word has length 68 [2021-08-27 07:49:16,453 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-27 07:49:16,454 INFO L225 Difference]: With dead ends: 820 [2021-08-27 07:49:16,454 INFO L226 Difference]: Without dead ends: 820 [2021-08-27 07:49:16,455 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 479.7ms TimeCoverageRelationStatistics Valid=113, Invalid=267, Unknown=0, NotChecked=0, Total=380 [2021-08-27 07:49:16,455 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 820 states. [2021-08-27 07:49:16,459 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 820 to 714. [2021-08-27 07:49:16,460 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 714 states, 565 states have (on average 1.2672566371681415) internal successors, (716), 582 states have internal predecessors, (716), 76 states have call successors, (76), 50 states have call predecessors, (76), 72 states have return successors, (102), 90 states have call predecessors, (102), 70 states have call successors, (102) [2021-08-27 07:49:16,461 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 714 states to 714 states and 894 transitions. [2021-08-27 07:49:16,461 INFO L78 Accepts]: Start accepts. Automaton has 714 states and 894 transitions. Word has length 68 [2021-08-27 07:49:16,461 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-27 07:49:16,461 INFO L470 AbstractCegarLoop]: Abstraction has 714 states and 894 transitions. [2021-08-27 07:49:16,461 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 4.333333333333333) internal successors, (52), 5 states have internal predecessors, (52), 3 states have call successors, (9), 9 states have call predecessors, (9), 3 states have return successors, (7), 4 states have call predecessors, (7), 2 states have call successors, (7) [2021-08-27 07:49:16,461 INFO L276 IsEmpty]: Start isEmpty. Operand 714 states and 894 transitions. [2021-08-27 07:49:16,462 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2021-08-27 07:49:16,462 INFO L504 BasicCegarLoop]: Found error trace [2021-08-27 07:49:16,462 INFO L512 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-27 07:49:16,462 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable49 [2021-08-27 07:49:16,462 INFO L402 AbstractCegarLoop]: === Iteration 51 === Targeting errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK === [mainErr0ENSURES_VIOLATIONMEMORY_LEAK, errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2021-08-27 07:49:16,463 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 07:49:16,463 INFO L82 PathProgramCache]: Analyzing trace with hash -151974564, now seen corresponding path program 1 times [2021-08-27 07:49:16,463 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 07:49:16,463 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1481596028] [2021-08-27 07:49:16,463 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 07:49:16,463 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 07:49:16,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:49:16,542 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-08-27 07:49:16,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:49:16,566 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-08-27 07:49:16,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:49:16,580 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-08-27 07:49:16,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:49:16,594 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2021-08-27 07:49:16,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:49:16,641 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-08-27 07:49:16,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:49:16,702 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2021-08-27 07:49:16,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:49:16,735 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2021-08-27 07:49:16,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:49:16,794 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-08-27 07:49:16,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:49:16,796 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 07:49:16,796 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 07:49:16,796 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1481596028] [2021-08-27 07:49:16,796 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1481596028] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-27 07:49:16,796 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-27 07:49:16,796 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [23] imperfect sequences [] total 23 [2021-08-27 07:49:16,796 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [343474693] [2021-08-27 07:49:16,797 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2021-08-27 07:49:16,797 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-27 07:49:16,797 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2021-08-27 07:49:16,798 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=441, Unknown=0, NotChecked=0, Total=506 [2021-08-27 07:49:16,798 INFO L87 Difference]: Start difference. First operand 714 states and 894 transitions. Second operand has 23 states, 22 states have (on average 2.3636363636363638) internal successors, (52), 11 states have internal predecessors, (52), 4 states have call successors, (10), 10 states have call predecessors, (10), 5 states have return successors, (8), 6 states have call predecessors, (8), 3 states have call successors, (8) [2021-08-27 07:49:19,334 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 07:49:19,334 INFO L93 Difference]: Finished difference Result 784 states and 993 transitions. [2021-08-27 07:49:19,335 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2021-08-27 07:49:19,335 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 22 states have (on average 2.3636363636363638) internal successors, (52), 11 states have internal predecessors, (52), 4 states have call successors, (10), 10 states have call predecessors, (10), 5 states have return successors, (8), 6 states have call predecessors, (8), 3 states have call successors, (8) Word has length 70 [2021-08-27 07:49:19,335 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-27 07:49:19,336 INFO L225 Difference]: With dead ends: 784 [2021-08-27 07:49:19,336 INFO L226 Difference]: Without dead ends: 759 [2021-08-27 07:49:19,337 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 97 ImplicationChecksByTransitivity, 614.4ms TimeCoverageRelationStatistics Valid=148, Invalid=908, Unknown=0, NotChecked=0, Total=1056 [2021-08-27 07:49:19,337 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 759 states. [2021-08-27 07:49:19,341 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 759 to 710. [2021-08-27 07:49:19,342 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 710 states, 562 states have (on average 1.2669039145907472) internal successors, (712), 579 states have internal predecessors, (712), 75 states have call successors, (75), 50 states have call predecessors, (75), 72 states have return successors, (101), 89 states have call predecessors, (101), 69 states have call successors, (101) [2021-08-27 07:49:19,343 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 710 states to 710 states and 888 transitions. [2021-08-27 07:49:19,343 INFO L78 Accepts]: Start accepts. Automaton has 710 states and 888 transitions. Word has length 70 [2021-08-27 07:49:19,343 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-27 07:49:19,343 INFO L470 AbstractCegarLoop]: Abstraction has 710 states and 888 transitions. [2021-08-27 07:49:19,343 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 22 states have (on average 2.3636363636363638) internal successors, (52), 11 states have internal predecessors, (52), 4 states have call successors, (10), 10 states have call predecessors, (10), 5 states have return successors, (8), 6 states have call predecessors, (8), 3 states have call successors, (8) [2021-08-27 07:49:19,343 INFO L276 IsEmpty]: Start isEmpty. Operand 710 states and 888 transitions. [2021-08-27 07:49:19,344 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2021-08-27 07:49:19,344 INFO L504 BasicCegarLoop]: Found error trace [2021-08-27 07:49:19,345 INFO L512 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-27 07:49:19,345 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable50 [2021-08-27 07:49:19,345 INFO L402 AbstractCegarLoop]: === Iteration 52 === Targeting errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK === [mainErr0ENSURES_VIOLATIONMEMORY_LEAK, errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2021-08-27 07:49:19,346 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 07:49:19,346 INFO L82 PathProgramCache]: Analyzing trace with hash -836181127, now seen corresponding path program 1 times [2021-08-27 07:49:19,346 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 07:49:19,346 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [358776850] [2021-08-27 07:49:19,346 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 07:49:19,346 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 07:49:19,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:49:19,431 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-08-27 07:49:19,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:49:19,457 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-08-27 07:49:19,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:49:19,473 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-08-27 07:49:19,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:49:19,491 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2021-08-27 07:49:19,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:49:19,549 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-08-27 07:49:19,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:49:19,604 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-08-27 07:49:19,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:49:19,629 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2021-08-27 07:49:19,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:49:19,633 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 07:49:19,633 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 07:49:19,633 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [358776850] [2021-08-27 07:49:19,633 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [358776850] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-27 07:49:19,633 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-27 07:49:19,633 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2021-08-27 07:49:19,633 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [606493639] [2021-08-27 07:49:19,634 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2021-08-27 07:49:19,634 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-27 07:49:19,634 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2021-08-27 07:49:19,634 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=256, Unknown=0, NotChecked=0, Total=306 [2021-08-27 07:49:19,635 INFO L87 Difference]: Start difference. First operand 710 states and 888 transitions. Second operand has 18 states, 18 states have (on average 2.9444444444444446) internal successors, (53), 8 states have internal predecessors, (53), 3 states have call successors, (9), 9 states have call predecessors, (9), 4 states have return successors, (7), 5 states have call predecessors, (7), 2 states have call successors, (7) [2021-08-27 07:49:21,556 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 07:49:21,556 INFO L93 Difference]: Finished difference Result 783 states and 991 transitions. [2021-08-27 07:49:21,557 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2021-08-27 07:49:21,557 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 2.9444444444444446) internal successors, (53), 8 states have internal predecessors, (53), 3 states have call successors, (9), 9 states have call predecessors, (9), 4 states have return successors, (7), 5 states have call predecessors, (7), 2 states have call successors, (7) Word has length 69 [2021-08-27 07:49:21,557 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-27 07:49:21,558 INFO L225 Difference]: With dead ends: 783 [2021-08-27 07:49:21,558 INFO L226 Difference]: Without dead ends: 756 [2021-08-27 07:49:21,559 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 43 ImplicationChecksByTransitivity, 475.8ms TimeCoverageRelationStatistics Valid=96, Invalid=456, Unknown=0, NotChecked=0, Total=552 [2021-08-27 07:49:21,559 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 756 states. [2021-08-27 07:49:21,564 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 756 to 707. [2021-08-27 07:49:21,564 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 707 states, 560 states have (on average 1.2660714285714285) internal successors, (709), 577 states have internal predecessors, (709), 74 states have call successors, (74), 50 states have call predecessors, (74), 72 states have return successors, (100), 88 states have call predecessors, (100), 68 states have call successors, (100) [2021-08-27 07:49:21,565 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 707 states to 707 states and 883 transitions. [2021-08-27 07:49:21,565 INFO L78 Accepts]: Start accepts. Automaton has 707 states and 883 transitions. Word has length 69 [2021-08-27 07:49:21,565 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-27 07:49:21,565 INFO L470 AbstractCegarLoop]: Abstraction has 707 states and 883 transitions. [2021-08-27 07:49:21,566 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 2.9444444444444446) internal successors, (53), 8 states have internal predecessors, (53), 3 states have call successors, (9), 9 states have call predecessors, (9), 4 states have return successors, (7), 5 states have call predecessors, (7), 2 states have call successors, (7) [2021-08-27 07:49:21,566 INFO L276 IsEmpty]: Start isEmpty. Operand 707 states and 883 transitions. [2021-08-27 07:49:21,567 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2021-08-27 07:49:21,567 INFO L504 BasicCegarLoop]: Found error trace [2021-08-27 07:49:21,567 INFO L512 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-27 07:49:21,567 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable51 [2021-08-27 07:49:21,567 INFO L402 AbstractCegarLoop]: === Iteration 53 === Targeting errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK === [mainErr0ENSURES_VIOLATIONMEMORY_LEAK, errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2021-08-27 07:49:21,567 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 07:49:21,568 INFO L82 PathProgramCache]: Analyzing trace with hash 1918393902, now seen corresponding path program 1 times [2021-08-27 07:49:21,568 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 07:49:21,568 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1313548956] [2021-08-27 07:49:21,568 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 07:49:21,568 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 07:49:21,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:49:21,639 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-08-27 07:49:21,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:49:21,662 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-08-27 07:49:21,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:49:21,675 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-08-27 07:49:21,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:49:21,690 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2021-08-27 07:49:21,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:49:21,710 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-08-27 07:49:21,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:49:21,739 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2021-08-27 07:49:21,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:49:21,757 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2021-08-27 07:49:21,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:49:21,759 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 07:49:21,759 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 07:49:21,759 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1313548956] [2021-08-27 07:49:21,759 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1313548956] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-27 07:49:21,759 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-27 07:49:21,759 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2021-08-27 07:49:21,760 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [860474796] [2021-08-27 07:49:21,760 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2021-08-27 07:49:21,760 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-27 07:49:21,760 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-08-27 07:49:21,760 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=94, Unknown=0, NotChecked=0, Total=132 [2021-08-27 07:49:21,761 INFO L87 Difference]: Start difference. First operand 707 states and 883 transitions. Second operand has 12 states, 12 states have (on average 4.416666666666667) internal successors, (53), 4 states have internal predecessors, (53), 2 states have call successors, (9), 9 states have call predecessors, (9), 3 states have return successors, (7), 3 states have call predecessors, (7), 2 states have call successors, (7) [2021-08-27 07:49:23,152 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 07:49:23,153 INFO L93 Difference]: Finished difference Result 756 states and 958 transitions. [2021-08-27 07:49:23,153 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-08-27 07:49:23,153 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 4.416666666666667) internal successors, (53), 4 states have internal predecessors, (53), 2 states have call successors, (9), 9 states have call predecessors, (9), 3 states have return successors, (7), 3 states have call predecessors, (7), 2 states have call successors, (7) Word has length 69 [2021-08-27 07:49:23,153 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-27 07:49:23,155 INFO L225 Difference]: With dead ends: 756 [2021-08-27 07:49:23,155 INFO L226 Difference]: Without dead ends: 751 [2021-08-27 07:49:23,155 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 328.6ms TimeCoverageRelationStatistics Valid=68, Invalid=142, Unknown=0, NotChecked=0, Total=210 [2021-08-27 07:49:23,155 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 751 states. [2021-08-27 07:49:23,160 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 751 to 702. [2021-08-27 07:49:23,161 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 702 states, 556 states have (on average 1.2661870503597121) internal successors, (704), 573 states have internal predecessors, (704), 73 states have call successors, (73), 50 states have call predecessors, (73), 72 states have return successors, (99), 87 states have call predecessors, (99), 67 states have call successors, (99) [2021-08-27 07:49:23,162 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 702 states to 702 states and 876 transitions. [2021-08-27 07:49:23,162 INFO L78 Accepts]: Start accepts. Automaton has 702 states and 876 transitions. Word has length 69 [2021-08-27 07:49:23,162 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-27 07:49:23,162 INFO L470 AbstractCegarLoop]: Abstraction has 702 states and 876 transitions. [2021-08-27 07:49:23,163 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 4.416666666666667) internal successors, (53), 4 states have internal predecessors, (53), 2 states have call successors, (9), 9 states have call predecessors, (9), 3 states have return successors, (7), 3 states have call predecessors, (7), 2 states have call successors, (7) [2021-08-27 07:49:23,163 INFO L276 IsEmpty]: Start isEmpty. Operand 702 states and 876 transitions. [2021-08-27 07:49:23,168 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2021-08-27 07:49:23,169 INFO L504 BasicCegarLoop]: Found error trace [2021-08-27 07:49:23,169 INFO L512 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-27 07:49:23,169 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable52 [2021-08-27 07:49:23,169 INFO L402 AbstractCegarLoop]: === Iteration 54 === Targeting errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK === [mainErr0ENSURES_VIOLATIONMEMORY_LEAK, errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2021-08-27 07:49:23,170 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 07:49:23,170 INFO L82 PathProgramCache]: Analyzing trace with hash -2114383891, now seen corresponding path program 1 times [2021-08-27 07:49:23,170 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 07:49:23,170 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1627515938] [2021-08-27 07:49:23,170 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 07:49:23,170 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 07:49:23,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:49:23,260 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-08-27 07:49:23,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:49:23,286 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-08-27 07:49:23,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:49:23,301 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-08-27 07:49:23,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:49:23,316 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2021-08-27 07:49:23,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:49:23,377 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2021-08-27 07:49:23,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:49:23,423 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2021-08-27 07:49:23,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:49:23,479 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-08-27 07:49:23,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:49:23,482 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 07:49:23,482 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 07:49:23,482 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1627515938] [2021-08-27 07:49:23,482 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1627515938] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-27 07:49:23,482 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-27 07:49:23,482 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2021-08-27 07:49:23,482 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [633644605] [2021-08-27 07:49:23,482 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2021-08-27 07:49:23,482 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-27 07:49:23,482 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2021-08-27 07:49:23,483 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=256, Unknown=0, NotChecked=0, Total=306 [2021-08-27 07:49:23,483 INFO L87 Difference]: Start difference. First operand 702 states and 876 transitions. Second operand has 18 states, 18 states have (on average 2.9444444444444446) internal successors, (53), 8 states have internal predecessors, (53), 2 states have call successors, (9), 9 states have call predecessors, (9), 4 states have return successors, (7), 4 states have call predecessors, (7), 1 states have call successors, (7) [2021-08-27 07:49:25,673 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 07:49:25,673 INFO L93 Difference]: Finished difference Result 758 states and 958 transitions. [2021-08-27 07:49:25,674 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2021-08-27 07:49:25,674 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 2.9444444444444446) internal successors, (53), 8 states have internal predecessors, (53), 2 states have call successors, (9), 9 states have call predecessors, (9), 4 states have return successors, (7), 4 states have call predecessors, (7), 1 states have call successors, (7) Word has length 69 [2021-08-27 07:49:25,674 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-27 07:49:25,675 INFO L225 Difference]: With dead ends: 758 [2021-08-27 07:49:25,675 INFO L226 Difference]: Without dead ends: 755 [2021-08-27 07:49:25,675 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 72 ImplicationChecksByTransitivity, 347.5ms TimeCoverageRelationStatistics Valid=100, Invalid=656, Unknown=0, NotChecked=0, Total=756 [2021-08-27 07:49:25,676 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 755 states. [2021-08-27 07:49:25,680 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 755 to 699. [2021-08-27 07:49:25,681 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 699 states, 553 states have (on average 1.2603978300180831) internal successors, (697), 570 states have internal predecessors, (697), 73 states have call successors, (73), 50 states have call predecessors, (73), 72 states have return successors, (99), 87 states have call predecessors, (99), 67 states have call successors, (99) [2021-08-27 07:49:25,682 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 699 states to 699 states and 869 transitions. [2021-08-27 07:49:25,682 INFO L78 Accepts]: Start accepts. Automaton has 699 states and 869 transitions. Word has length 69 [2021-08-27 07:49:25,682 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-27 07:49:25,682 INFO L470 AbstractCegarLoop]: Abstraction has 699 states and 869 transitions. [2021-08-27 07:49:25,682 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 2.9444444444444446) internal successors, (53), 8 states have internal predecessors, (53), 2 states have call successors, (9), 9 states have call predecessors, (9), 4 states have return successors, (7), 4 states have call predecessors, (7), 1 states have call successors, (7) [2021-08-27 07:49:25,682 INFO L276 IsEmpty]: Start isEmpty. Operand 699 states and 869 transitions. [2021-08-27 07:49:25,683 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2021-08-27 07:49:25,683 INFO L504 BasicCegarLoop]: Found error trace [2021-08-27 07:49:25,684 INFO L512 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-27 07:49:25,684 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable53 [2021-08-27 07:49:25,684 INFO L402 AbstractCegarLoop]: === Iteration 55 === Targeting errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK === [mainErr0ENSURES_VIOLATIONMEMORY_LEAK, errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2021-08-27 07:49:25,684 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 07:49:25,684 INFO L82 PathProgramCache]: Analyzing trace with hash -2114660721, now seen corresponding path program 1 times [2021-08-27 07:49:25,684 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 07:49:25,684 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1546999603] [2021-08-27 07:49:25,684 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 07:49:25,685 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 07:49:25,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:49:25,766 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-08-27 07:49:25,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:49:25,790 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-08-27 07:49:25,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:49:25,807 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-08-27 07:49:25,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:49:25,828 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2021-08-27 07:49:25,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:49:25,855 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2021-08-27 07:49:25,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:49:25,874 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2021-08-27 07:49:25,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:49:25,888 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-08-27 07:49:25,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:49:25,891 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 07:49:25,891 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 07:49:25,891 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1546999603] [2021-08-27 07:49:25,891 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1546999603] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-27 07:49:25,891 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-27 07:49:25,891 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2021-08-27 07:49:25,891 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1169739418] [2021-08-27 07:49:25,892 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2021-08-27 07:49:25,892 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-27 07:49:25,892 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-08-27 07:49:25,892 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=94, Unknown=0, NotChecked=0, Total=132 [2021-08-27 07:49:25,892 INFO L87 Difference]: Start difference. First operand 699 states and 869 transitions. Second operand has 12 states, 12 states have (on average 4.416666666666667) internal successors, (53), 5 states have internal predecessors, (53), 3 states have call successors, (9), 9 states have call predecessors, (9), 3 states have return successors, (7), 4 states have call predecessors, (7), 2 states have call successors, (7) [2021-08-27 07:49:27,975 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 07:49:27,975 INFO L93 Difference]: Finished difference Result 806 states and 1021 transitions. [2021-08-27 07:49:27,975 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2021-08-27 07:49:27,975 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 4.416666666666667) internal successors, (53), 5 states have internal predecessors, (53), 3 states have call successors, (9), 9 states have call predecessors, (9), 3 states have return successors, (7), 4 states have call predecessors, (7), 2 states have call successors, (7) Word has length 69 [2021-08-27 07:49:27,975 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-27 07:49:27,976 INFO L225 Difference]: With dead ends: 806 [2021-08-27 07:49:27,976 INFO L226 Difference]: Without dead ends: 775 [2021-08-27 07:49:27,977 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 42 ImplicationChecksByTransitivity, 566.6ms TimeCoverageRelationStatistics Valid=137, Invalid=325, Unknown=0, NotChecked=0, Total=462 [2021-08-27 07:49:27,977 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 775 states. [2021-08-27 07:49:27,981 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 775 to 670. [2021-08-27 07:49:27,982 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 670 states, 529 states have (on average 1.2589792060491494) internal successors, (666), 545 states have internal predecessors, (666), 72 states have call successors, (72), 49 states have call predecessors, (72), 68 states have return successors, (95), 83 states have call predecessors, (95), 66 states have call successors, (95) [2021-08-27 07:49:27,983 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 670 states to 670 states and 833 transitions. [2021-08-27 07:49:27,983 INFO L78 Accepts]: Start accepts. Automaton has 670 states and 833 transitions. Word has length 69 [2021-08-27 07:49:27,983 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-27 07:49:27,983 INFO L470 AbstractCegarLoop]: Abstraction has 670 states and 833 transitions. [2021-08-27 07:49:27,983 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 4.416666666666667) internal successors, (53), 5 states have internal predecessors, (53), 3 states have call successors, (9), 9 states have call predecessors, (9), 3 states have return successors, (7), 4 states have call predecessors, (7), 2 states have call successors, (7) [2021-08-27 07:49:27,983 INFO L276 IsEmpty]: Start isEmpty. Operand 670 states and 833 transitions. [2021-08-27 07:49:27,984 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2021-08-27 07:49:27,984 INFO L504 BasicCegarLoop]: Found error trace [2021-08-27 07:49:27,984 INFO L512 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-27 07:49:27,985 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable54 [2021-08-27 07:49:27,985 INFO L402 AbstractCegarLoop]: === Iteration 56 === Targeting errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK === [mainErr0ENSURES_VIOLATIONMEMORY_LEAK, errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2021-08-27 07:49:27,985 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 07:49:27,985 INFO L82 PathProgramCache]: Analyzing trace with hash 1980103703, now seen corresponding path program 1 times [2021-08-27 07:49:27,985 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 07:49:27,985 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [77536080] [2021-08-27 07:49:27,985 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 07:49:27,986 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 07:49:27,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:49:28,055 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-08-27 07:49:28,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:49:28,078 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-08-27 07:49:28,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:49:28,091 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-08-27 07:49:28,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:49:28,105 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2021-08-27 07:49:28,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:49:28,123 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2021-08-27 07:49:28,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:49:28,138 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2021-08-27 07:49:28,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:49:28,149 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-08-27 07:49:28,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:49:28,153 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 07:49:28,154 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 07:49:28,154 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [77536080] [2021-08-27 07:49:28,154 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [77536080] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-27 07:49:28,154 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-27 07:49:28,154 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2021-08-27 07:49:28,154 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1426144152] [2021-08-27 07:49:28,155 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2021-08-27 07:49:28,155 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-27 07:49:28,155 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-08-27 07:49:28,155 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=56, Unknown=0, NotChecked=0, Total=90 [2021-08-27 07:49:28,155 INFO L87 Difference]: Start difference. First operand 670 states and 833 transitions. Second operand has 10 states, 10 states have (on average 5.3) internal successors, (53), 3 states have internal predecessors, (53), 2 states have call successors, (9), 9 states have call predecessors, (9), 2 states have return successors, (7), 2 states have call predecessors, (7), 1 states have call successors, (7) [2021-08-27 07:49:29,302 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 07:49:29,302 INFO L93 Difference]: Finished difference Result 722 states and 905 transitions. [2021-08-27 07:49:29,302 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-08-27 07:49:29,302 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 5.3) internal successors, (53), 3 states have internal predecessors, (53), 2 states have call successors, (9), 9 states have call predecessors, (9), 2 states have return successors, (7), 2 states have call predecessors, (7), 1 states have call successors, (7) Word has length 69 [2021-08-27 07:49:29,303 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-27 07:49:29,304 INFO L225 Difference]: With dead ends: 722 [2021-08-27 07:49:29,304 INFO L226 Difference]: Without dead ends: 705 [2021-08-27 07:49:29,304 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 206.3ms TimeCoverageRelationStatistics Valid=58, Invalid=98, Unknown=0, NotChecked=0, Total=156 [2021-08-27 07:49:29,304 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 705 states. [2021-08-27 07:49:29,308 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 705 to 652. [2021-08-27 07:49:29,309 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 652 states, 516 states have (on average 1.251937984496124) internal successors, (646), 531 states have internal predecessors, (646), 71 states have call successors, (71), 48 states have call predecessors, (71), 64 states have return successors, (91), 79 states have call predecessors, (91), 65 states have call successors, (91) [2021-08-27 07:49:29,310 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 652 states to 652 states and 808 transitions. [2021-08-27 07:49:29,310 INFO L78 Accepts]: Start accepts. Automaton has 652 states and 808 transitions. Word has length 69 [2021-08-27 07:49:29,310 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-27 07:49:29,310 INFO L470 AbstractCegarLoop]: Abstraction has 652 states and 808 transitions. [2021-08-27 07:49:29,310 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 5.3) internal successors, (53), 3 states have internal predecessors, (53), 2 states have call successors, (9), 9 states have call predecessors, (9), 2 states have return successors, (7), 2 states have call predecessors, (7), 1 states have call successors, (7) [2021-08-27 07:49:29,311 INFO L276 IsEmpty]: Start isEmpty. Operand 652 states and 808 transitions. [2021-08-27 07:49:29,311 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2021-08-27 07:49:29,311 INFO L504 BasicCegarLoop]: Found error trace [2021-08-27 07:49:29,312 INFO L512 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-27 07:49:29,312 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable55 [2021-08-27 07:49:29,312 INFO L402 AbstractCegarLoop]: === Iteration 57 === Targeting errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK === [mainErr0ENSURES_VIOLATIONMEMORY_LEAK, errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2021-08-27 07:49:29,312 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 07:49:29,312 INFO L82 PathProgramCache]: Analyzing trace with hash -2137250320, now seen corresponding path program 1 times [2021-08-27 07:49:29,312 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 07:49:29,312 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1168968420] [2021-08-27 07:49:29,313 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 07:49:29,313 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 07:49:29,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:49:29,392 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-08-27 07:49:29,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:49:29,417 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-08-27 07:49:29,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:49:29,430 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-08-27 07:49:29,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:49:29,445 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2021-08-27 07:49:29,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:49:29,496 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-08-27 07:49:29,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:49:29,545 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-08-27 07:49:29,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:49:29,547 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2021-08-27 07:49:29,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:49:29,561 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2021-08-27 07:49:29,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:49:29,614 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-08-27 07:49:29,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:49:29,617 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 07:49:29,617 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 07:49:29,617 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1168968420] [2021-08-27 07:49:29,618 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1168968420] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-27 07:49:29,618 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-27 07:49:29,618 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [21] imperfect sequences [] total 21 [2021-08-27 07:49:29,618 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1515193847] [2021-08-27 07:49:29,618 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2021-08-27 07:49:29,618 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-27 07:49:29,618 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2021-08-27 07:49:29,619 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=359, Unknown=0, NotChecked=0, Total=420 [2021-08-27 07:49:29,619 INFO L87 Difference]: Start difference. First operand 652 states and 808 transitions. Second operand has 21 states, 20 states have (on average 2.7) internal successors, (54), 10 states have internal predecessors, (54), 4 states have call successors, (11), 10 states have call predecessors, (11), 4 states have return successors, (9), 5 states have call predecessors, (9), 3 states have call successors, (9) [2021-08-27 07:49:31,699 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 07:49:31,699 INFO L93 Difference]: Finished difference Result 738 states and 932 transitions. [2021-08-27 07:49:31,700 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2021-08-27 07:49:31,700 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 20 states have (on average 2.7) internal successors, (54), 10 states have internal predecessors, (54), 4 states have call successors, (11), 10 states have call predecessors, (11), 4 states have return successors, (9), 5 states have call predecessors, (9), 3 states have call successors, (9) Word has length 74 [2021-08-27 07:49:31,700 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-27 07:49:31,701 INFO L225 Difference]: With dead ends: 738 [2021-08-27 07:49:31,701 INFO L226 Difference]: Without dead ends: 716 [2021-08-27 07:49:31,701 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 71 ImplicationChecksByTransitivity, 438.6ms TimeCoverageRelationStatistics Valid=120, Invalid=692, Unknown=0, NotChecked=0, Total=812 [2021-08-27 07:49:31,702 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 716 states. [2021-08-27 07:49:31,706 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 716 to 650. [2021-08-27 07:49:31,706 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 650 states, 515 states have (on average 1.250485436893204) internal successors, (644), 530 states have internal predecessors, (644), 70 states have call successors, (70), 48 states have call predecessors, (70), 64 states have return successors, (90), 78 states have call predecessors, (90), 64 states have call successors, (90) [2021-08-27 07:49:31,707 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 650 states to 650 states and 804 transitions. [2021-08-27 07:49:31,707 INFO L78 Accepts]: Start accepts. Automaton has 650 states and 804 transitions. Word has length 74 [2021-08-27 07:49:31,707 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-27 07:49:31,707 INFO L470 AbstractCegarLoop]: Abstraction has 650 states and 804 transitions. [2021-08-27 07:49:31,707 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 20 states have (on average 2.7) internal successors, (54), 10 states have internal predecessors, (54), 4 states have call successors, (11), 10 states have call predecessors, (11), 4 states have return successors, (9), 5 states have call predecessors, (9), 3 states have call successors, (9) [2021-08-27 07:49:31,707 INFO L276 IsEmpty]: Start isEmpty. Operand 650 states and 804 transitions. [2021-08-27 07:49:31,708 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2021-08-27 07:49:31,708 INFO L504 BasicCegarLoop]: Found error trace [2021-08-27 07:49:31,708 INFO L512 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-27 07:49:31,708 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable56 [2021-08-27 07:49:31,708 INFO L402 AbstractCegarLoop]: === Iteration 58 === Targeting errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK === [mainErr0ENSURES_VIOLATIONMEMORY_LEAK, errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2021-08-27 07:49:31,709 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 07:49:31,709 INFO L82 PathProgramCache]: Analyzing trace with hash 1031688052, now seen corresponding path program 1 times [2021-08-27 07:49:31,709 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 07:49:31,709 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1361329238] [2021-08-27 07:49:31,709 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 07:49:31,709 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 07:49:31,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:49:31,781 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-08-27 07:49:31,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:49:31,806 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-08-27 07:49:31,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:49:31,818 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-08-27 07:49:31,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:49:31,832 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2021-08-27 07:49:31,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:49:31,860 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-08-27 07:49:31,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:49:31,890 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2021-08-27 07:49:31,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:49:31,910 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2021-08-27 07:49:31,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:49:31,926 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-08-27 07:49:31,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:49:31,928 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 07:49:31,928 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 07:49:31,929 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1361329238] [2021-08-27 07:49:31,929 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1361329238] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-27 07:49:31,929 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-27 07:49:31,929 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2021-08-27 07:49:31,930 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [835877905] [2021-08-27 07:49:31,930 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2021-08-27 07:49:31,930 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-27 07:49:31,930 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2021-08-27 07:49:31,931 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=112, Unknown=0, NotChecked=0, Total=156 [2021-08-27 07:49:31,931 INFO L87 Difference]: Start difference. First operand 650 states and 804 transitions. Second operand has 13 states, 13 states have (on average 4.076923076923077) internal successors, (53), 4 states have internal predecessors, (53), 2 states have call successors, (10), 10 states have call predecessors, (10), 3 states have return successors, (8), 3 states have call predecessors, (8), 2 states have call successors, (8) [2021-08-27 07:49:33,036 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 07:49:33,037 INFO L93 Difference]: Finished difference Result 702 states and 881 transitions. [2021-08-27 07:49:33,037 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-08-27 07:49:33,037 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 4.076923076923077) internal successors, (53), 4 states have internal predecessors, (53), 2 states have call successors, (10), 10 states have call predecessors, (10), 3 states have return successors, (8), 3 states have call predecessors, (8), 2 states have call successors, (8) Word has length 71 [2021-08-27 07:49:33,037 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-27 07:49:33,038 INFO L225 Difference]: With dead ends: 702 [2021-08-27 07:49:33,038 INFO L226 Difference]: Without dead ends: 702 [2021-08-27 07:49:33,038 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 359.2ms TimeCoverageRelationStatistics Valid=88, Invalid=184, Unknown=0, NotChecked=0, Total=272 [2021-08-27 07:49:33,039 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 702 states. [2021-08-27 07:49:33,042 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 702 to 650. [2021-08-27 07:49:33,043 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 650 states, 515 states have (on average 1.2485436893203883) internal successors, (643), 530 states have internal predecessors, (643), 70 states have call successors, (70), 48 states have call predecessors, (70), 64 states have return successors, (90), 78 states have call predecessors, (90), 64 states have call successors, (90) [2021-08-27 07:49:33,052 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 650 states to 650 states and 803 transitions. [2021-08-27 07:49:33,052 INFO L78 Accepts]: Start accepts. Automaton has 650 states and 803 transitions. Word has length 71 [2021-08-27 07:49:33,052 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-27 07:49:33,052 INFO L470 AbstractCegarLoop]: Abstraction has 650 states and 803 transitions. [2021-08-27 07:49:33,053 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 4.076923076923077) internal successors, (53), 4 states have internal predecessors, (53), 2 states have call successors, (10), 10 states have call predecessors, (10), 3 states have return successors, (8), 3 states have call predecessors, (8), 2 states have call successors, (8) [2021-08-27 07:49:33,053 INFO L276 IsEmpty]: Start isEmpty. Operand 650 states and 803 transitions. [2021-08-27 07:49:33,053 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2021-08-27 07:49:33,053 INFO L504 BasicCegarLoop]: Found error trace [2021-08-27 07:49:33,054 INFO L512 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-27 07:49:33,054 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable57 [2021-08-27 07:49:33,054 INFO L402 AbstractCegarLoop]: === Iteration 59 === Targeting errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK === [mainErr0ENSURES_VIOLATIONMEMORY_LEAK, errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2021-08-27 07:49:33,054 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 07:49:33,054 INFO L82 PathProgramCache]: Analyzing trace with hash -1212295246, now seen corresponding path program 1 times [2021-08-27 07:49:33,054 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 07:49:33,054 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2108383674] [2021-08-27 07:49:33,054 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 07:49:33,054 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 07:49:33,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:49:33,130 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-08-27 07:49:33,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:49:33,156 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-08-27 07:49:33,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:49:33,170 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-08-27 07:49:33,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:49:33,186 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2021-08-27 07:49:33,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:49:33,239 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-08-27 07:49:33,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:49:33,292 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2021-08-27 07:49:33,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:49:33,307 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2021-08-27 07:49:33,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:49:33,364 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-08-27 07:49:33,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:49:33,367 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 07:49:33,367 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 07:49:33,367 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2108383674] [2021-08-27 07:49:33,367 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2108383674] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-27 07:49:33,367 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-27 07:49:33,367 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [21] imperfect sequences [] total 21 [2021-08-27 07:49:33,367 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1746402318] [2021-08-27 07:49:33,368 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2021-08-27 07:49:33,368 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-27 07:49:33,368 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2021-08-27 07:49:33,368 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=359, Unknown=0, NotChecked=0, Total=420 [2021-08-27 07:49:33,368 INFO L87 Difference]: Start difference. First operand 650 states and 803 transitions. Second operand has 21 states, 20 states have (on average 2.65) internal successors, (53), 10 states have internal predecessors, (53), 4 states have call successors, (10), 10 states have call predecessors, (10), 4 states have return successors, (8), 5 states have call predecessors, (8), 3 states have call successors, (8) [2021-08-27 07:49:35,370 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 07:49:35,370 INFO L93 Difference]: Finished difference Result 735 states and 924 transitions. [2021-08-27 07:49:35,370 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2021-08-27 07:49:35,370 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 20 states have (on average 2.65) internal successors, (53), 10 states have internal predecessors, (53), 4 states have call successors, (10), 10 states have call predecessors, (10), 4 states have return successors, (8), 5 states have call predecessors, (8), 3 states have call successors, (8) Word has length 71 [2021-08-27 07:49:35,370 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-27 07:49:35,371 INFO L225 Difference]: With dead ends: 735 [2021-08-27 07:49:35,371 INFO L226 Difference]: Without dead ends: 700 [2021-08-27 07:49:35,372 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 71 ImplicationChecksByTransitivity, 455.8ms TimeCoverageRelationStatistics Valid=120, Invalid=692, Unknown=0, NotChecked=0, Total=812 [2021-08-27 07:49:35,372 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 700 states. [2021-08-27 07:49:35,376 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 700 to 645. [2021-08-27 07:49:35,376 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 645 states, 511 states have (on average 1.2446183953033267) internal successors, (636), 526 states have internal predecessors, (636), 69 states have call successors, (69), 48 states have call predecessors, (69), 64 states have return successors, (88), 77 states have call predecessors, (88), 63 states have call successors, (88) [2021-08-27 07:49:35,377 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 645 states to 645 states and 793 transitions. [2021-08-27 07:49:35,377 INFO L78 Accepts]: Start accepts. Automaton has 645 states and 793 transitions. Word has length 71 [2021-08-27 07:49:35,377 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-27 07:49:35,377 INFO L470 AbstractCegarLoop]: Abstraction has 645 states and 793 transitions. [2021-08-27 07:49:35,377 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 20 states have (on average 2.65) internal successors, (53), 10 states have internal predecessors, (53), 4 states have call successors, (10), 10 states have call predecessors, (10), 4 states have return successors, (8), 5 states have call predecessors, (8), 3 states have call successors, (8) [2021-08-27 07:49:35,377 INFO L276 IsEmpty]: Start isEmpty. Operand 645 states and 793 transitions. [2021-08-27 07:49:35,378 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2021-08-27 07:49:35,378 INFO L504 BasicCegarLoop]: Found error trace [2021-08-27 07:49:35,378 INFO L512 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-27 07:49:35,378 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable58 [2021-08-27 07:49:35,378 INFO L402 AbstractCegarLoop]: === Iteration 60 === Targeting errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK === [mainErr0ENSURES_VIOLATIONMEMORY_LEAK, errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2021-08-27 07:49:35,378 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 07:49:35,379 INFO L82 PathProgramCache]: Analyzing trace with hash -1255722987, now seen corresponding path program 1 times [2021-08-27 07:49:35,379 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 07:49:35,379 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1183813791] [2021-08-27 07:49:35,379 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 07:49:35,379 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 07:49:35,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:49:35,448 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-08-27 07:49:35,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:49:35,472 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-08-27 07:49:35,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:49:35,484 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-08-27 07:49:35,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:49:35,497 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2021-08-27 07:49:35,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:49:35,517 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-08-27 07:49:35,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:49:35,547 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2021-08-27 07:49:35,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:49:35,567 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2021-08-27 07:49:35,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:49:35,579 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-08-27 07:49:35,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:49:35,581 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 07:49:35,581 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 07:49:35,581 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1183813791] [2021-08-27 07:49:35,581 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1183813791] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-27 07:49:35,581 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-27 07:49:35,581 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2021-08-27 07:49:35,582 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1395026476] [2021-08-27 07:49:35,582 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2021-08-27 07:49:35,582 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-27 07:49:35,582 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2021-08-27 07:49:35,582 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=112, Unknown=0, NotChecked=0, Total=156 [2021-08-27 07:49:35,582 INFO L87 Difference]: Start difference. First operand 645 states and 793 transitions. Second operand has 13 states, 13 states have (on average 4.076923076923077) internal successors, (53), 4 states have internal predecessors, (53), 2 states have call successors, (10), 10 states have call predecessors, (10), 3 states have return successors, (8), 3 states have call predecessors, (8), 2 states have call successors, (8) [2021-08-27 07:49:36,688 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 07:49:36,688 INFO L93 Difference]: Finished difference Result 695 states and 867 transitions. [2021-08-27 07:49:36,688 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-08-27 07:49:36,688 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 4.076923076923077) internal successors, (53), 4 states have internal predecessors, (53), 2 states have call successors, (10), 10 states have call predecessors, (10), 3 states have return successors, (8), 3 states have call predecessors, (8), 2 states have call successors, (8) Word has length 71 [2021-08-27 07:49:36,688 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-27 07:49:36,689 INFO L225 Difference]: With dead ends: 695 [2021-08-27 07:49:36,689 INFO L226 Difference]: Without dead ends: 689 [2021-08-27 07:49:36,689 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 333.1ms TimeCoverageRelationStatistics Valid=88, Invalid=184, Unknown=0, NotChecked=0, Total=272 [2021-08-27 07:49:36,690 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 689 states. [2021-08-27 07:49:36,693 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 689 to 639. [2021-08-27 07:49:36,694 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 639 states, 506 states have (on average 1.2450592885375493) internal successors, (630), 521 states have internal predecessors, (630), 68 states have call successors, (68), 48 states have call predecessors, (68), 64 states have return successors, (87), 76 states have call predecessors, (87), 62 states have call successors, (87) [2021-08-27 07:49:36,694 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 639 states to 639 states and 785 transitions. [2021-08-27 07:49:36,694 INFO L78 Accepts]: Start accepts. Automaton has 639 states and 785 transitions. Word has length 71 [2021-08-27 07:49:36,694 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-27 07:49:36,694 INFO L470 AbstractCegarLoop]: Abstraction has 639 states and 785 transitions. [2021-08-27 07:49:36,695 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 4.076923076923077) internal successors, (53), 4 states have internal predecessors, (53), 2 states have call successors, (10), 10 states have call predecessors, (10), 3 states have return successors, (8), 3 states have call predecessors, (8), 2 states have call successors, (8) [2021-08-27 07:49:36,695 INFO L276 IsEmpty]: Start isEmpty. Operand 639 states and 785 transitions. [2021-08-27 07:49:36,695 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2021-08-27 07:49:36,695 INFO L504 BasicCegarLoop]: Found error trace [2021-08-27 07:49:36,695 INFO L512 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-27 07:49:36,696 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable59 [2021-08-27 07:49:36,696 INFO L402 AbstractCegarLoop]: === Iteration 61 === Targeting errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK === [mainErr0ENSURES_VIOLATIONMEMORY_LEAK, errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2021-08-27 07:49:36,696 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 07:49:36,696 INFO L82 PathProgramCache]: Analyzing trace with hash 110398293, now seen corresponding path program 1 times [2021-08-27 07:49:36,696 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 07:49:36,696 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1700614190] [2021-08-27 07:49:36,696 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 07:49:36,696 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 07:49:36,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:49:36,786 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-08-27 07:49:36,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:49:36,815 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-08-27 07:49:36,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:49:36,831 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-08-27 07:49:36,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:49:36,849 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2021-08-27 07:49:36,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:49:36,906 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2021-08-27 07:49:36,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:49:36,952 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2021-08-27 07:49:36,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:49:37,009 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-08-27 07:49:37,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:49:37,012 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 07:49:37,012 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 07:49:37,012 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1700614190] [2021-08-27 07:49:37,012 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1700614190] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-27 07:49:37,012 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-27 07:49:37,012 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2021-08-27 07:49:37,012 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [425581400] [2021-08-27 07:49:37,012 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2021-08-27 07:49:37,012 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-27 07:49:37,013 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2021-08-27 07:49:37,013 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=256, Unknown=0, NotChecked=0, Total=306 [2021-08-27 07:49:37,013 INFO L87 Difference]: Start difference. First operand 639 states and 785 transitions. Second operand has 18 states, 18 states have (on average 3.0555555555555554) internal successors, (55), 8 states have internal predecessors, (55), 2 states have call successors, (9), 9 states have call predecessors, (9), 4 states have return successors, (7), 4 states have call predecessors, (7), 1 states have call successors, (7) [2021-08-27 07:49:39,000 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 07:49:39,000 INFO L93 Difference]: Finished difference Result 756 states and 933 transitions. [2021-08-27 07:49:39,000 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2021-08-27 07:49:39,000 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 3.0555555555555554) internal successors, (55), 8 states have internal predecessors, (55), 2 states have call successors, (9), 9 states have call predecessors, (9), 4 states have return successors, (7), 4 states have call predecessors, (7), 1 states have call successors, (7) Word has length 71 [2021-08-27 07:49:39,000 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-27 07:49:39,001 INFO L225 Difference]: With dead ends: 756 [2021-08-27 07:49:39,001 INFO L226 Difference]: Without dead ends: 731 [2021-08-27 07:49:39,001 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 82 ImplicationChecksByTransitivity, 451.4ms TimeCoverageRelationStatistics Valid=112, Invalid=700, Unknown=0, NotChecked=0, Total=812 [2021-08-27 07:49:39,002 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 731 states. [2021-08-27 07:49:39,005 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 731 to 645. [2021-08-27 07:49:39,006 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 645 states, 512 states have (on average 1.234375) internal successors, (632), 527 states have internal predecessors, (632), 68 states have call successors, (68), 48 states have call predecessors, (68), 64 states have return successors, (87), 76 states have call predecessors, (87), 62 states have call successors, (87) [2021-08-27 07:49:39,006 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 645 states to 645 states and 787 transitions. [2021-08-27 07:49:39,006 INFO L78 Accepts]: Start accepts. Automaton has 645 states and 787 transitions. Word has length 71 [2021-08-27 07:49:39,007 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-27 07:49:39,007 INFO L470 AbstractCegarLoop]: Abstraction has 645 states and 787 transitions. [2021-08-27 07:49:39,007 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 3.0555555555555554) internal successors, (55), 8 states have internal predecessors, (55), 2 states have call successors, (9), 9 states have call predecessors, (9), 4 states have return successors, (7), 4 states have call predecessors, (7), 1 states have call successors, (7) [2021-08-27 07:49:39,007 INFO L276 IsEmpty]: Start isEmpty. Operand 645 states and 787 transitions. [2021-08-27 07:49:39,007 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2021-08-27 07:49:39,008 INFO L504 BasicCegarLoop]: Found error trace [2021-08-27 07:49:39,008 INFO L512 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-27 07:49:39,008 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable60 [2021-08-27 07:49:39,008 INFO L402 AbstractCegarLoop]: === Iteration 62 === Targeting errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK === [mainErr0ENSURES_VIOLATIONMEMORY_LEAK, errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2021-08-27 07:49:39,008 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 07:49:39,008 INFO L82 PathProgramCache]: Analyzing trace with hash -955000686, now seen corresponding path program 1 times [2021-08-27 07:49:39,008 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 07:49:39,008 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [475247648] [2021-08-27 07:49:39,008 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 07:49:39,008 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 07:49:39,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:49:39,086 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-08-27 07:49:39,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:49:39,110 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-08-27 07:49:39,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:49:39,123 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-08-27 07:49:39,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:49:39,137 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2021-08-27 07:49:39,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:49:39,182 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-08-27 07:49:39,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:49:39,233 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2021-08-27 07:49:39,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:49:39,235 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-08-27 07:49:39,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:49:39,250 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2021-08-27 07:49:39,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:49:39,309 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-08-27 07:49:39,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:49:39,311 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 07:49:39,311 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 07:49:39,311 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [475247648] [2021-08-27 07:49:39,311 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [475247648] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-27 07:49:39,311 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-27 07:49:39,311 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [21] imperfect sequences [] total 21 [2021-08-27 07:49:39,311 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [998187445] [2021-08-27 07:49:39,312 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2021-08-27 07:49:39,312 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-27 07:49:39,312 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2021-08-27 07:49:39,312 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=359, Unknown=0, NotChecked=0, Total=420 [2021-08-27 07:49:39,312 INFO L87 Difference]: Start difference. First operand 645 states and 787 transitions. Second operand has 21 states, 21 states have (on average 2.7142857142857144) internal successors, (57), 10 states have internal predecessors, (57), 4 states have call successors, (11), 10 states have call predecessors, (11), 4 states have return successors, (9), 5 states have call predecessors, (9), 3 states have call successors, (9) [2021-08-27 07:49:41,127 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 07:49:41,128 INFO L93 Difference]: Finished difference Result 717 states and 887 transitions. [2021-08-27 07:49:41,128 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2021-08-27 07:49:41,128 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 21 states have (on average 2.7142857142857144) internal successors, (57), 10 states have internal predecessors, (57), 4 states have call successors, (11), 10 states have call predecessors, (11), 4 states have return successors, (9), 5 states have call predecessors, (9), 3 states have call successors, (9) Word has length 77 [2021-08-27 07:49:41,128 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-27 07:49:41,129 INFO L225 Difference]: With dead ends: 717 [2021-08-27 07:49:41,129 INFO L226 Difference]: Without dead ends: 691 [2021-08-27 07:49:41,129 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 71 ImplicationChecksByTransitivity, 448.6ms TimeCoverageRelationStatistics Valid=120, Invalid=692, Unknown=0, NotChecked=0, Total=812 [2021-08-27 07:49:41,130 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 691 states. [2021-08-27 07:49:41,133 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 691 to 643. [2021-08-27 07:49:41,134 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 643 states, 510 states have (on average 1.2333333333333334) internal successors, (629), 525 states have internal predecessors, (629), 68 states have call successors, (68), 48 states have call predecessors, (68), 64 states have return successors, (87), 76 states have call predecessors, (87), 62 states have call successors, (87) [2021-08-27 07:49:41,134 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 643 states to 643 states and 784 transitions. [2021-08-27 07:49:41,134 INFO L78 Accepts]: Start accepts. Automaton has 643 states and 784 transitions. Word has length 77 [2021-08-27 07:49:41,135 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-27 07:49:41,135 INFO L470 AbstractCegarLoop]: Abstraction has 643 states and 784 transitions. [2021-08-27 07:49:41,135 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 21 states have (on average 2.7142857142857144) internal successors, (57), 10 states have internal predecessors, (57), 4 states have call successors, (11), 10 states have call predecessors, (11), 4 states have return successors, (9), 5 states have call predecessors, (9), 3 states have call successors, (9) [2021-08-27 07:49:41,135 INFO L276 IsEmpty]: Start isEmpty. Operand 643 states and 784 transitions. [2021-08-27 07:49:41,136 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2021-08-27 07:49:41,136 INFO L504 BasicCegarLoop]: Found error trace [2021-08-27 07:49:41,136 INFO L512 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-27 07:49:41,136 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable61 [2021-08-27 07:49:41,136 INFO L402 AbstractCegarLoop]: === Iteration 63 === Targeting errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK === [mainErr0ENSURES_VIOLATIONMEMORY_LEAK, errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2021-08-27 07:49:41,136 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 07:49:41,136 INFO L82 PathProgramCache]: Analyzing trace with hash -111129446, now seen corresponding path program 1 times [2021-08-27 07:49:41,137 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 07:49:41,137 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [719384619] [2021-08-27 07:49:41,137 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 07:49:41,137 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 07:49:41,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:49:41,224 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-08-27 07:49:41,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:49:41,248 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-08-27 07:49:41,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:49:41,261 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-08-27 07:49:41,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:49:41,275 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2021-08-27 07:49:41,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:49:41,296 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-08-27 07:49:41,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:49:41,331 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2021-08-27 07:49:41,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:49:41,350 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2021-08-27 07:49:41,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:49:41,366 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-08-27 07:49:41,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:49:41,373 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 07:49:41,373 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 07:49:41,373 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [719384619] [2021-08-27 07:49:41,374 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [719384619] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-27 07:49:41,374 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-27 07:49:41,374 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2021-08-27 07:49:41,374 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2127446417] [2021-08-27 07:49:41,374 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2021-08-27 07:49:41,374 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-27 07:49:41,374 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2021-08-27 07:49:41,374 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=112, Unknown=0, NotChecked=0, Total=156 [2021-08-27 07:49:41,374 INFO L87 Difference]: Start difference. First operand 643 states and 784 transitions. Second operand has 13 states, 13 states have (on average 4.230769230769231) internal successors, (55), 4 states have internal predecessors, (55), 2 states have call successors, (10), 10 states have call predecessors, (10), 3 states have return successors, (8), 3 states have call predecessors, (8), 2 states have call successors, (8) [2021-08-27 07:49:42,559 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 07:49:42,559 INFO L93 Difference]: Finished difference Result 690 states and 853 transitions. [2021-08-27 07:49:42,559 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-08-27 07:49:42,559 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 4.230769230769231) internal successors, (55), 4 states have internal predecessors, (55), 2 states have call successors, (10), 10 states have call predecessors, (10), 3 states have return successors, (8), 3 states have call predecessors, (8), 2 states have call successors, (8) Word has length 73 [2021-08-27 07:49:42,560 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-27 07:49:42,560 INFO L225 Difference]: With dead ends: 690 [2021-08-27 07:49:42,560 INFO L226 Difference]: Without dead ends: 679 [2021-08-27 07:49:42,561 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 376.8ms TimeCoverageRelationStatistics Valid=88, Invalid=184, Unknown=0, NotChecked=0, Total=272 [2021-08-27 07:49:42,561 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 679 states. [2021-08-27 07:49:42,564 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 679 to 631. [2021-08-27 07:49:42,565 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 631 states, 499 states have (on average 1.2284569138276553) internal successors, (613), 514 states have internal predecessors, (613), 67 states have call successors, (67), 48 states have call predecessors, (67), 64 states have return successors, (86), 75 states have call predecessors, (86), 61 states have call successors, (86) [2021-08-27 07:49:42,565 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 631 states to 631 states and 766 transitions. [2021-08-27 07:49:42,565 INFO L78 Accepts]: Start accepts. Automaton has 631 states and 766 transitions. Word has length 73 [2021-08-27 07:49:42,565 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-27 07:49:42,565 INFO L470 AbstractCegarLoop]: Abstraction has 631 states and 766 transitions. [2021-08-27 07:49:42,566 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 4.230769230769231) internal successors, (55), 4 states have internal predecessors, (55), 2 states have call successors, (10), 10 states have call predecessors, (10), 3 states have return successors, (8), 3 states have call predecessors, (8), 2 states have call successors, (8) [2021-08-27 07:49:42,566 INFO L276 IsEmpty]: Start isEmpty. Operand 631 states and 766 transitions. [2021-08-27 07:49:42,566 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2021-08-27 07:49:42,566 INFO L504 BasicCegarLoop]: Found error trace [2021-08-27 07:49:42,567 INFO L512 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-27 07:49:42,567 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable62 [2021-08-27 07:49:42,567 INFO L402 AbstractCegarLoop]: === Iteration 64 === Targeting errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK === [mainErr0ENSURES_VIOLATIONMEMORY_LEAK, errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2021-08-27 07:49:42,567 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 07:49:42,567 INFO L82 PathProgramCache]: Analyzing trace with hash -2040120255, now seen corresponding path program 1 times [2021-08-27 07:49:42,567 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 07:49:42,567 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1988770036] [2021-08-27 07:49:42,567 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 07:49:42,567 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 07:49:42,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:49:42,651 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-08-27 07:49:42,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:49:42,678 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-08-27 07:49:42,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:49:42,695 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-08-27 07:49:42,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:49:42,711 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2021-08-27 07:49:42,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:49:42,754 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-08-27 07:49:42,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:49:42,805 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2021-08-27 07:49:42,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:49:42,830 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-08-27 07:49:42,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:49:42,859 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 07:49:42,859 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 07:49:42,859 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1988770036] [2021-08-27 07:49:42,859 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1988770036] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-27 07:49:42,860 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-27 07:49:42,860 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [19] imperfect sequences [] total 19 [2021-08-27 07:49:42,860 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [178447190] [2021-08-27 07:49:42,860 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2021-08-27 07:49:42,860 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-27 07:49:42,860 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2021-08-27 07:49:42,860 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=296, Unknown=0, NotChecked=0, Total=342 [2021-08-27 07:49:42,861 INFO L87 Difference]: Start difference. First operand 631 states and 766 transitions. Second operand has 19 states, 19 states have (on average 2.9473684210526314) internal successors, (56), 9 states have internal predecessors, (56), 2 states have call successors, (9), 8 states have call predecessors, (9), 5 states have return successors, (7), 5 states have call predecessors, (7), 1 states have call successors, (7) [2021-08-27 07:49:44,715 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 07:49:44,715 INFO L93 Difference]: Finished difference Result 696 states and 856 transitions. [2021-08-27 07:49:44,715 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2021-08-27 07:49:44,716 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 2.9473684210526314) internal successors, (56), 9 states have internal predecessors, (56), 2 states have call successors, (9), 8 states have call predecessors, (9), 5 states have return successors, (7), 5 states have call predecessors, (7), 1 states have call successors, (7) Word has length 72 [2021-08-27 07:49:44,716 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-27 07:49:44,717 INFO L225 Difference]: With dead ends: 696 [2021-08-27 07:49:44,717 INFO L226 Difference]: Without dead ends: 677 [2021-08-27 07:49:44,717 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 224.8ms TimeCoverageRelationStatistics Valid=54, Invalid=366, Unknown=0, NotChecked=0, Total=420 [2021-08-27 07:49:44,717 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 677 states. [2021-08-27 07:49:44,721 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 677 to 629. [2021-08-27 07:49:44,721 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 629 states, 498 states have (on average 1.2269076305220883) internal successors, (611), 513 states have internal predecessors, (611), 66 states have call successors, (66), 48 states have call predecessors, (66), 64 states have return successors, (85), 74 states have call predecessors, (85), 60 states have call successors, (85) [2021-08-27 07:49:44,722 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 629 states to 629 states and 762 transitions. [2021-08-27 07:49:44,722 INFO L78 Accepts]: Start accepts. Automaton has 629 states and 762 transitions. Word has length 72 [2021-08-27 07:49:44,722 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-27 07:49:44,722 INFO L470 AbstractCegarLoop]: Abstraction has 629 states and 762 transitions. [2021-08-27 07:49:44,722 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 2.9473684210526314) internal successors, (56), 9 states have internal predecessors, (56), 2 states have call successors, (9), 8 states have call predecessors, (9), 5 states have return successors, (7), 5 states have call predecessors, (7), 1 states have call successors, (7) [2021-08-27 07:49:44,722 INFO L276 IsEmpty]: Start isEmpty. Operand 629 states and 762 transitions. [2021-08-27 07:49:44,723 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2021-08-27 07:49:44,723 INFO L504 BasicCegarLoop]: Found error trace [2021-08-27 07:49:44,723 INFO L512 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-27 07:49:44,723 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable63 [2021-08-27 07:49:44,723 INFO L402 AbstractCegarLoop]: === Iteration 65 === Targeting errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK === [mainErr0ENSURES_VIOLATIONMEMORY_LEAK, errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2021-08-27 07:49:44,724 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 07:49:44,724 INFO L82 PathProgramCache]: Analyzing trace with hash 1909315756, now seen corresponding path program 1 times [2021-08-27 07:49:44,724 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 07:49:44,724 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1437363984] [2021-08-27 07:49:44,724 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 07:49:44,724 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 07:49:44,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:49:44,813 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-08-27 07:49:44,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:49:44,838 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-08-27 07:49:44,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:49:44,852 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-08-27 07:49:44,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:49:44,877 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2021-08-27 07:49:44,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:49:44,912 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2021-08-27 07:49:44,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:49:44,938 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2021-08-27 07:49:44,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:49:45,016 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-08-27 07:49:45,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:49:45,072 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2021-08-27 07:49:45,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:49:45,075 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 07:49:45,075 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 07:49:45,075 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1437363984] [2021-08-27 07:49:45,075 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1437363984] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-27 07:49:45,076 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-27 07:49:45,076 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [19] imperfect sequences [] total 19 [2021-08-27 07:49:45,076 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1568447021] [2021-08-27 07:49:45,076 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2021-08-27 07:49:45,076 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-27 07:49:45,076 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2021-08-27 07:49:45,078 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=276, Unknown=0, NotChecked=0, Total=342 [2021-08-27 07:49:45,078 INFO L87 Difference]: Start difference. First operand 629 states and 762 transitions. Second operand has 19 states, 19 states have (on average 2.8947368421052633) internal successors, (55), 10 states have internal predecessors, (55), 5 states have call successors, (10), 10 states have call predecessors, (10), 4 states have return successors, (8), 6 states have call predecessors, (8), 4 states have call successors, (8) [2021-08-27 07:49:49,007 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 07:49:49,007 INFO L93 Difference]: Finished difference Result 1384 states and 1695 transitions. [2021-08-27 07:49:49,008 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2021-08-27 07:49:49,008 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 2.8947368421052633) internal successors, (55), 10 states have internal predecessors, (55), 5 states have call successors, (10), 10 states have call predecessors, (10), 4 states have return successors, (8), 6 states have call predecessors, (8), 4 states have call successors, (8) Word has length 73 [2021-08-27 07:49:49,008 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-27 07:49:49,009 INFO L225 Difference]: With dead ends: 1384 [2021-08-27 07:49:49,009 INFO L226 Difference]: Without dead ends: 1377 [2021-08-27 07:49:49,010 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 56 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 755 ImplicationChecksByTransitivity, 1683.4ms TimeCoverageRelationStatistics Valid=676, Invalid=2630, Unknown=0, NotChecked=0, Total=3306 [2021-08-27 07:49:49,010 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1377 states. [2021-08-27 07:49:49,017 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1377 to 1004. [2021-08-27 07:49:49,018 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1004 states, 799 states have (on average 1.2453066332916145) internal successors, (995), 824 states have internal predecessors, (995), 101 states have call successors, (101), 79 states have call predecessors, (101), 103 states have return successors, (136), 107 states have call predecessors, (136), 95 states have call successors, (136) [2021-08-27 07:49:49,019 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1004 states to 1004 states and 1232 transitions. [2021-08-27 07:49:49,019 INFO L78 Accepts]: Start accepts. Automaton has 1004 states and 1232 transitions. Word has length 73 [2021-08-27 07:49:49,019 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-27 07:49:49,019 INFO L470 AbstractCegarLoop]: Abstraction has 1004 states and 1232 transitions. [2021-08-27 07:49:49,019 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 2.8947368421052633) internal successors, (55), 10 states have internal predecessors, (55), 5 states have call successors, (10), 10 states have call predecessors, (10), 4 states have return successors, (8), 6 states have call predecessors, (8), 4 states have call successors, (8) [2021-08-27 07:49:49,019 INFO L276 IsEmpty]: Start isEmpty. Operand 1004 states and 1232 transitions. [2021-08-27 07:49:49,021 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2021-08-27 07:49:49,021 INFO L504 BasicCegarLoop]: Found error trace [2021-08-27 07:49:49,021 INFO L512 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-27 07:49:49,021 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable64 [2021-08-27 07:49:49,021 INFO L402 AbstractCegarLoop]: === Iteration 66 === Targeting errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK === [mainErr0ENSURES_VIOLATIONMEMORY_LEAK, errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2021-08-27 07:49:49,021 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 07:49:49,021 INFO L82 PathProgramCache]: Analyzing trace with hash -1706379286, now seen corresponding path program 1 times [2021-08-27 07:49:49,021 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 07:49:49,021 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1840954886] [2021-08-27 07:49:49,021 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 07:49:49,021 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 07:49:49,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:49:49,096 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-08-27 07:49:49,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:49:49,121 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-08-27 07:49:49,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:49:49,135 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-08-27 07:49:49,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:49:49,150 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2021-08-27 07:49:49,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:49:49,189 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2021-08-27 07:49:49,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:49:49,213 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2021-08-27 07:49:49,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:49:49,226 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-08-27 07:49:49,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:49:49,239 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2021-08-27 07:49:49,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:49:49,248 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 07:49:49,249 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 07:49:49,249 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1840954886] [2021-08-27 07:49:49,249 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1840954886] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-27 07:49:49,249 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-27 07:49:49,249 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2021-08-27 07:49:49,249 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [713701114] [2021-08-27 07:49:49,249 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2021-08-27 07:49:49,249 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-27 07:49:49,249 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2021-08-27 07:49:49,249 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=131, Unknown=0, NotChecked=0, Total=182 [2021-08-27 07:49:49,250 INFO L87 Difference]: Start difference. First operand 1004 states and 1232 transitions. Second operand has 14 states, 14 states have (on average 3.9285714285714284) internal successors, (55), 6 states have internal predecessors, (55), 5 states have call successors, (10), 10 states have call predecessors, (10), 3 states have return successors, (8), 5 states have call predecessors, (8), 4 states have call successors, (8) [2021-08-27 07:49:51,670 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 07:49:51,671 INFO L93 Difference]: Finished difference Result 1267 states and 1563 transitions. [2021-08-27 07:49:51,671 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2021-08-27 07:49:51,671 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 3.9285714285714284) internal successors, (55), 6 states have internal predecessors, (55), 5 states have call successors, (10), 10 states have call predecessors, (10), 3 states have return successors, (8), 5 states have call predecessors, (8), 4 states have call successors, (8) Word has length 73 [2021-08-27 07:49:51,671 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-27 07:49:51,673 INFO L225 Difference]: With dead ends: 1267 [2021-08-27 07:49:51,673 INFO L226 Difference]: Without dead ends: 1267 [2021-08-27 07:49:51,673 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 119 ImplicationChecksByTransitivity, 535.6ms TimeCoverageRelationStatistics Valid=199, Invalid=613, Unknown=0, NotChecked=0, Total=812 [2021-08-27 07:49:51,674 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1267 states. [2021-08-27 07:49:51,682 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1267 to 1095. [2021-08-27 07:49:51,682 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1095 states, 870 states have (on average 1.2344827586206897) internal successors, (1074), 890 states have internal predecessors, (1074), 115 states have call successors, (115), 83 states have call predecessors, (115), 109 states have return successors, (152), 126 states have call predecessors, (152), 109 states have call successors, (152) [2021-08-27 07:49:51,684 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1095 states to 1095 states and 1341 transitions. [2021-08-27 07:49:51,684 INFO L78 Accepts]: Start accepts. Automaton has 1095 states and 1341 transitions. Word has length 73 [2021-08-27 07:49:51,684 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-27 07:49:51,684 INFO L470 AbstractCegarLoop]: Abstraction has 1095 states and 1341 transitions. [2021-08-27 07:49:51,684 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 3.9285714285714284) internal successors, (55), 6 states have internal predecessors, (55), 5 states have call successors, (10), 10 states have call predecessors, (10), 3 states have return successors, (8), 5 states have call predecessors, (8), 4 states have call successors, (8) [2021-08-27 07:49:51,684 INFO L276 IsEmpty]: Start isEmpty. Operand 1095 states and 1341 transitions. [2021-08-27 07:49:51,686 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2021-08-27 07:49:51,686 INFO L504 BasicCegarLoop]: Found error trace [2021-08-27 07:49:51,686 INFO L512 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-27 07:49:51,686 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable65 [2021-08-27 07:49:51,686 INFO L402 AbstractCegarLoop]: === Iteration 67 === Targeting errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK === [mainErr0ENSURES_VIOLATIONMEMORY_LEAK, errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2021-08-27 07:49:51,687 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 07:49:51,687 INFO L82 PathProgramCache]: Analyzing trace with hash -513989019, now seen corresponding path program 1 times [2021-08-27 07:49:51,687 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 07:49:51,687 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1770756311] [2021-08-27 07:49:51,687 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 07:49:51,687 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 07:49:51,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:49:51,782 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-08-27 07:49:51,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:49:51,812 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-08-27 07:49:51,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:49:51,826 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-08-27 07:49:51,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:49:51,842 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2021-08-27 07:49:51,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:49:51,867 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-08-27 07:49:51,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:49:51,906 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2021-08-27 07:49:51,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:49:51,908 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-08-27 07:49:51,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:49:51,927 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2021-08-27 07:49:51,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:49:51,944 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-08-27 07:49:51,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:49:51,947 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 07:49:51,947 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 07:49:51,947 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1770756311] [2021-08-27 07:49:51,947 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1770756311] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-27 07:49:51,947 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-27 07:49:51,947 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2021-08-27 07:49:51,947 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1673539384] [2021-08-27 07:49:51,947 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2021-08-27 07:49:51,947 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-27 07:49:51,947 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2021-08-27 07:49:51,948 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=112, Unknown=0, NotChecked=0, Total=156 [2021-08-27 07:49:51,948 INFO L87 Difference]: Start difference. First operand 1095 states and 1341 transitions. Second operand has 13 states, 13 states have (on average 4.461538461538462) internal successors, (58), 4 states have internal predecessors, (58), 2 states have call successors, (11), 10 states have call predecessors, (11), 3 states have return successors, (9), 3 states have call predecessors, (9), 2 states have call successors, (9) [2021-08-27 07:49:53,066 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 07:49:53,066 INFO L93 Difference]: Finished difference Result 1161 states and 1431 transitions. [2021-08-27 07:49:53,067 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-08-27 07:49:53,067 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 4.461538461538462) internal successors, (58), 4 states have internal predecessors, (58), 2 states have call successors, (11), 10 states have call predecessors, (11), 3 states have return successors, (9), 3 states have call predecessors, (9), 2 states have call successors, (9) Word has length 78 [2021-08-27 07:49:53,067 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-27 07:49:53,068 INFO L225 Difference]: With dead ends: 1161 [2021-08-27 07:49:53,068 INFO L226 Difference]: Without dead ends: 1131 [2021-08-27 07:49:53,068 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 404.4ms TimeCoverageRelationStatistics Valid=88, Invalid=184, Unknown=0, NotChecked=0, Total=272 [2021-08-27 07:49:53,069 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1131 states. [2021-08-27 07:49:53,075 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1131 to 1061. [2021-08-27 07:49:53,075 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1061 states, 842 states have (on average 1.2304038004750595) internal successors, (1036), 862 states have internal predecessors, (1036), 109 states have call successors, (109), 83 states have call predecessors, (109), 109 states have return successors, (144), 120 states have call predecessors, (144), 103 states have call successors, (144) [2021-08-27 07:49:53,076 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1061 states to 1061 states and 1289 transitions. [2021-08-27 07:49:53,076 INFO L78 Accepts]: Start accepts. Automaton has 1061 states and 1289 transitions. Word has length 78 [2021-08-27 07:49:53,076 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-27 07:49:53,076 INFO L470 AbstractCegarLoop]: Abstraction has 1061 states and 1289 transitions. [2021-08-27 07:49:53,077 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 4.461538461538462) internal successors, (58), 4 states have internal predecessors, (58), 2 states have call successors, (11), 10 states have call predecessors, (11), 3 states have return successors, (9), 3 states have call predecessors, (9), 2 states have call successors, (9) [2021-08-27 07:49:53,077 INFO L276 IsEmpty]: Start isEmpty. Operand 1061 states and 1289 transitions. [2021-08-27 07:49:53,078 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2021-08-27 07:49:53,078 INFO L504 BasicCegarLoop]: Found error trace [2021-08-27 07:49:53,078 INFO L512 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-27 07:49:53,078 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable66 [2021-08-27 07:49:53,078 INFO L402 AbstractCegarLoop]: === Iteration 68 === Targeting errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK === [mainErr0ENSURES_VIOLATIONMEMORY_LEAK, errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2021-08-27 07:49:53,078 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 07:49:53,078 INFO L82 PathProgramCache]: Analyzing trace with hash 314197659, now seen corresponding path program 1 times [2021-08-27 07:49:53,079 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 07:49:53,079 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1287972943] [2021-08-27 07:49:53,079 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 07:49:53,079 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 07:49:53,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:49:53,170 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-08-27 07:49:53,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:49:53,195 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-08-27 07:49:53,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:49:53,210 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-08-27 07:49:53,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:49:53,225 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2021-08-27 07:49:53,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:49:53,249 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-08-27 07:49:53,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:49:53,287 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-08-27 07:49:53,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:49:53,289 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2021-08-27 07:49:53,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:49:53,311 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2021-08-27 07:49:53,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:49:53,323 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-08-27 07:49:53,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:49:53,325 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 07:49:53,325 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 07:49:53,325 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1287972943] [2021-08-27 07:49:53,325 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1287972943] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-27 07:49:53,325 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-27 07:49:53,325 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2021-08-27 07:49:53,325 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1696893223] [2021-08-27 07:49:53,326 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2021-08-27 07:49:53,326 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-27 07:49:53,326 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2021-08-27 07:49:53,326 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=162, Unknown=0, NotChecked=0, Total=210 [2021-08-27 07:49:53,326 INFO L87 Difference]: Start difference. First operand 1061 states and 1289 transitions. Second operand has 15 states, 15 states have (on average 3.6666666666666665) internal successors, (55), 5 states have internal predecessors, (55), 2 states have call successors, (11), 10 states have call predecessors, (11), 3 states have return successors, (9), 4 states have call predecessors, (9), 2 states have call successors, (9) [2021-08-27 07:49:54,493 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 07:49:54,493 INFO L93 Difference]: Finished difference Result 1101 states and 1347 transitions. [2021-08-27 07:49:54,493 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-08-27 07:49:54,493 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 3.6666666666666665) internal successors, (55), 5 states have internal predecessors, (55), 2 states have call successors, (11), 10 states have call predecessors, (11), 3 states have return successors, (9), 4 states have call predecessors, (9), 2 states have call successors, (9) Word has length 75 [2021-08-27 07:49:54,494 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-27 07:49:54,495 INFO L225 Difference]: With dead ends: 1101 [2021-08-27 07:49:54,495 INFO L226 Difference]: Without dead ends: 1065 [2021-08-27 07:49:54,495 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 361.6ms TimeCoverageRelationStatistics Valid=92, Invalid=250, Unknown=0, NotChecked=0, Total=342 [2021-08-27 07:49:54,496 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1065 states. [2021-08-27 07:49:54,502 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1065 to 1013. [2021-08-27 07:49:54,503 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1013 states, 808 states have (on average 1.2326732673267327) internal successors, (996), 828 states have internal predecessors, (996), 99 states have call successors, (99), 79 states have call predecessors, (99), 105 states have return successors, (132), 110 states have call predecessors, (132), 93 states have call successors, (132) [2021-08-27 07:49:54,504 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1013 states to 1013 states and 1227 transitions. [2021-08-27 07:49:54,504 INFO L78 Accepts]: Start accepts. Automaton has 1013 states and 1227 transitions. Word has length 75 [2021-08-27 07:49:54,504 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-27 07:49:54,504 INFO L470 AbstractCegarLoop]: Abstraction has 1013 states and 1227 transitions. [2021-08-27 07:49:54,504 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 3.6666666666666665) internal successors, (55), 5 states have internal predecessors, (55), 2 states have call successors, (11), 10 states have call predecessors, (11), 3 states have return successors, (9), 4 states have call predecessors, (9), 2 states have call successors, (9) [2021-08-27 07:49:54,504 INFO L276 IsEmpty]: Start isEmpty. Operand 1013 states and 1227 transitions. [2021-08-27 07:49:54,505 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2021-08-27 07:49:54,509 INFO L504 BasicCegarLoop]: Found error trace [2021-08-27 07:49:54,510 INFO L512 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-27 07:49:54,510 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable67 [2021-08-27 07:49:54,510 INFO L402 AbstractCegarLoop]: === Iteration 69 === Targeting errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK === [mainErr0ENSURES_VIOLATIONMEMORY_LEAK, errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2021-08-27 07:49:54,510 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 07:49:54,510 INFO L82 PathProgramCache]: Analyzing trace with hash -901263887, now seen corresponding path program 1 times [2021-08-27 07:49:54,510 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 07:49:54,510 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2007476985] [2021-08-27 07:49:54,510 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 07:49:54,510 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 07:49:54,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:49:54,585 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-08-27 07:49:54,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:49:54,610 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-08-27 07:49:54,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:49:54,623 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-08-27 07:49:54,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:49:54,637 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2021-08-27 07:49:54,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:49:54,656 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-08-27 07:49:54,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:49:54,688 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2021-08-27 07:49:54,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:49:54,708 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2021-08-27 07:49:54,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:49:54,710 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 07:49:54,710 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 07:49:54,710 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2007476985] [2021-08-27 07:49:54,710 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2007476985] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-27 07:49:54,710 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-27 07:49:54,710 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2021-08-27 07:49:54,710 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1979836203] [2021-08-27 07:49:54,711 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2021-08-27 07:49:54,711 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-27 07:49:54,711 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-08-27 07:49:54,711 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=94, Unknown=0, NotChecked=0, Total=132 [2021-08-27 07:49:54,711 INFO L87 Difference]: Start difference. First operand 1013 states and 1227 transitions. Second operand has 12 states, 12 states have (on average 4.75) internal successors, (57), 4 states have internal predecessors, (57), 2 states have call successors, (9), 9 states have call predecessors, (9), 3 states have return successors, (7), 3 states have call predecessors, (7), 2 states have call successors, (7) [2021-08-27 07:49:55,745 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 07:49:55,745 INFO L93 Difference]: Finished difference Result 1061 states and 1293 transitions. [2021-08-27 07:49:55,746 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-08-27 07:49:55,746 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 4.75) internal successors, (57), 4 states have internal predecessors, (57), 2 states have call successors, (9), 9 states have call predecessors, (9), 3 states have return successors, (7), 3 states have call predecessors, (7), 2 states have call successors, (7) Word has length 73 [2021-08-27 07:49:55,746 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-27 07:49:55,747 INFO L225 Difference]: With dead ends: 1061 [2021-08-27 07:49:55,747 INFO L226 Difference]: Without dead ends: 1049 [2021-08-27 07:49:55,747 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 323.6ms TimeCoverageRelationStatistics Valid=68, Invalid=142, Unknown=0, NotChecked=0, Total=210 [2021-08-27 07:49:55,748 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1049 states. [2021-08-27 07:49:55,753 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1049 to 997. [2021-08-27 07:49:55,754 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 997 states, 794 states have (on average 1.2317380352644836) internal successors, (978), 814 states have internal predecessors, (978), 97 states have call successors, (97), 79 states have call predecessors, (97), 105 states have return successors, (128), 108 states have call predecessors, (128), 91 states have call successors, (128) [2021-08-27 07:49:55,755 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 997 states to 997 states and 1203 transitions. [2021-08-27 07:49:55,755 INFO L78 Accepts]: Start accepts. Automaton has 997 states and 1203 transitions. Word has length 73 [2021-08-27 07:49:55,755 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-27 07:49:55,755 INFO L470 AbstractCegarLoop]: Abstraction has 997 states and 1203 transitions. [2021-08-27 07:49:55,755 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 4.75) internal successors, (57), 4 states have internal predecessors, (57), 2 states have call successors, (9), 9 states have call predecessors, (9), 3 states have return successors, (7), 3 states have call predecessors, (7), 2 states have call successors, (7) [2021-08-27 07:49:55,755 INFO L276 IsEmpty]: Start isEmpty. Operand 997 states and 1203 transitions. [2021-08-27 07:49:55,757 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2021-08-27 07:49:55,757 INFO L504 BasicCegarLoop]: Found error trace [2021-08-27 07:49:55,757 INFO L512 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-27 07:49:55,757 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable68 [2021-08-27 07:49:55,757 INFO L402 AbstractCegarLoop]: === Iteration 70 === Targeting errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK === [mainErr0ENSURES_VIOLATIONMEMORY_LEAK, errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2021-08-27 07:49:55,757 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 07:49:55,758 INFO L82 PathProgramCache]: Analyzing trace with hash -586736919, now seen corresponding path program 1 times [2021-08-27 07:49:55,758 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 07:49:55,758 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [688211740] [2021-08-27 07:49:55,758 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 07:49:55,758 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 07:49:55,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-27 07:49:55,778 INFO L354 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-08-27 07:49:55,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-27 07:49:55,829 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-08-27 07:49:55,829 INFO L626 BasicCegarLoop]: Counterexample is feasible [2021-08-27 07:49:55,830 INFO L764 garLoopResultBuilder]: Registering result UNSAFE for location errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK [2021-08-27 07:49:55,831 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr0ENSURES_VIOLATIONMEMORY_LEAK [2021-08-27 07:49:55,831 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable69 [2021-08-27 07:49:55,835 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2021-08-27 07:49:55,914 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 27.08 07:49:55 BoogieIcfgContainer [2021-08-27 07:49:55,914 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-08-27 07:49:55,915 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2021-08-27 07:49:55,915 INFO L271 PluginConnector]: Initializing Witness Printer... [2021-08-27 07:49:55,915 INFO L275 PluginConnector]: Witness Printer initialized [2021-08-27 07:49:55,915 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.08 07:47:16" (3/4) ... [2021-08-27 07:49:55,918 INFO L140 WitnessPrinter]: No result that supports witness generation found [2021-08-27 07:49:55,918 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2021-08-27 07:49:55,919 INFO L168 Benchmark]: Toolchain (without parser) took 160671.93 ms. Allocated memory was 65.0 MB in the beginning and 436.2 MB in the end (delta: 371.2 MB). Free memory was 43.7 MB in the beginning and 247.8 MB in the end (delta: -204.1 MB). Peak memory consumption was 165.1 MB. Max. memory is 16.1 GB. [2021-08-27 07:49:55,919 INFO L168 Benchmark]: CDTParser took 0.15 ms. Allocated memory is still 65.0 MB. Free memory is still 45.8 MB. There was no memory consumed. Max. memory is 16.1 GB. [2021-08-27 07:49:55,920 INFO L168 Benchmark]: CACSL2BoogieTranslator took 411.27 ms. Allocated memory is still 65.0 MB. Free memory was 43.5 MB in the beginning and 30.1 MB in the end (delta: 13.5 MB). Peak memory consumption was 12.0 MB. Max. memory is 16.1 GB. [2021-08-27 07:49:55,920 INFO L168 Benchmark]: Boogie Preprocessor took 86.00 ms. Allocated memory was 65.0 MB in the beginning and 83.9 MB in the end (delta: 18.9 MB). Free memory was 30.1 MB in the beginning and 60.3 MB in the end (delta: -30.3 MB). Peak memory consumption was 6.4 MB. Max. memory is 16.1 GB. [2021-08-27 07:49:55,921 INFO L168 Benchmark]: RCFGBuilder took 1002.63 ms. Allocated memory was 83.9 MB in the beginning and 100.7 MB in the end (delta: 16.8 MB). Free memory was 60.3 MB in the beginning and 58.9 MB in the end (delta: 1.4 MB). Peak memory consumption was 33.4 MB. Max. memory is 16.1 GB. [2021-08-27 07:49:55,921 INFO L168 Benchmark]: TraceAbstraction took 159162.63 ms. Allocated memory was 100.7 MB in the beginning and 436.2 MB in the end (delta: 335.5 MB). Free memory was 58.9 MB in the beginning and 247.8 MB in the end (delta: -188.9 MB). Peak memory consumption was 145.5 MB. Max. memory is 16.1 GB. [2021-08-27 07:49:55,921 INFO L168 Benchmark]: Witness Printer took 3.38 ms. Allocated memory is still 436.2 MB. Free memory is still 247.8 MB. There was no memory consumed. Max. memory is 16.1 GB. [2021-08-27 07:49:55,922 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.15 ms. Allocated memory is still 65.0 MB. Free memory is still 45.8 MB. There was no memory consumed. Max. memory is 16.1 GB. * CACSL2BoogieTranslator took 411.27 ms. Allocated memory is still 65.0 MB. Free memory was 43.5 MB in the beginning and 30.1 MB in the end (delta: 13.5 MB). Peak memory consumption was 12.0 MB. Max. memory is 16.1 GB. * Boogie Preprocessor took 86.00 ms. Allocated memory was 65.0 MB in the beginning and 83.9 MB in the end (delta: 18.9 MB). Free memory was 30.1 MB in the beginning and 60.3 MB in the end (delta: -30.3 MB). Peak memory consumption was 6.4 MB. Max. memory is 16.1 GB. * RCFGBuilder took 1002.63 ms. Allocated memory was 83.9 MB in the beginning and 100.7 MB in the end (delta: 16.8 MB). Free memory was 60.3 MB in the beginning and 58.9 MB in the end (delta: 1.4 MB). Peak memory consumption was 33.4 MB. Max. memory is 16.1 GB. * TraceAbstraction took 159162.63 ms. Allocated memory was 100.7 MB in the beginning and 436.2 MB in the end (delta: 335.5 MB). Free memory was 58.9 MB in the beginning and 247.8 MB in the end (delta: -188.9 MB). Peak memory consumption was 145.5 MB. Max. memory is 16.1 GB. * Witness Printer took 3.38 ms. Allocated memory is still 436.2 MB. Free memory is still 247.8 MB. There was no memory consumed. Max. memory is 16.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0ms ErrorAutomatonConstructionTimeTotal, 0.0ms FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0ms ErrorAutomatonConstructionTimeAvg, 0.0ms ErrorAutomatonDifferenceTimeAvg, 0.0ms ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 59]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: overapproximation of memtrack at line 59. Possible FailurePath: [L32] int s ; [L33] int UNLOADED ; [L34] int NP ; [L35] int DC ; [L36] int SKIP1 ; [L37] int SKIP2 ; [L38] int MPR1 ; [L39] int MPR3 ; [L40] int IPC ; [L41] int pended ; [L42] int compFptr ; [L43] int compRegistered ; [L44] int lowerDriverReturn ; [L45] int setEventCalled ; [L46] int customIrp ; [L47] int routine ; [L48] int myStatus ; [L49] int pirp ; [L50] int Executive ; [L51] int Suspended ; [L52] int KernelMode ; [L53] int DeviceUsageTypePaging ; VAL [\old(compFptr)=147534, \old(compRegistered)=147513, \old(customIrp)=147517, \old(DC)=147539, \old(DeviceUsageTypePaging)=147538, \old(Executive)=147536, \old(IPC)=147525, \old(KernelMode)=147521, \old(lowerDriverReturn)=147526, \old(MPR1)=147533, \old(MPR3)=147542, \old(myStatus)=147537, \old(NP)=147518, \old(pended)=147535, \old(pirp)=147540, \old(routine)=147514, \old(s)=147522, \old(setEventCalled)=147515, \old(SKIP1)=147520, \old(SKIP2)=147531, \old(Suspended)=147532, \old(UNLOADED)=147524, compFptr=0, compRegistered=0, customIrp=0, DC=0, DeviceUsageTypePaging=0, Executive=0, IPC=0, KernelMode=0, lowerDriverReturn=0, MPR1=0, MPR3=0, myStatus=0, NP=0, pended=0, pirp=0, routine=0, s=0, setEventCalled=0, SKIP1=0, SKIP2=0, Suspended=0, UNLOADED=0] [L1718] int pirp__IoStatus__Status ; [L1719] int d = __VERIFIER_nondet_int() ; [L1720] int status = __VERIFIER_nondet_int() ; [L1721] int irp = __VERIFIER_nondet_int() ; [L1722] int we_should_unload = __VERIFIER_nondet_int() ; [L1723] int irp_choice = __VERIFIER_nondet_int() ; [L1724] int devobj = __VERIFIER_nondet_int() ; [L1725] int __cil_tmp9 ; [L1730] s = 0 [L1731] UNLOADED = 0 [L1732] NP = 0 [L1733] DC = 0 [L1734] SKIP1 = 0 [L1735] SKIP2 = 0 [L1736] MPR1 = 0 [L1737] MPR3 = 0 [L1738] IPC = 0 [L1739] pended = 0 [L1740] compFptr = 0 [L1741] compRegistered = 0 [L1742] lowerDriverReturn = 0 [L1743] setEventCalled = 0 [L1744] customIrp = 0 [L1745] routine = 0 [L1746] myStatus = 0 [L1747] pirp = 0 [L1748] Executive = 0 [L1749] Suspended = 5 [L1750] KernelMode = 0 [L1751] DeviceUsageTypePaging = 1 [L1754] pirp = irp VAL [\old(compFptr)=0, \old(compRegistered)=0, \old(customIrp)=0, \old(DC)=0, \old(DeviceUsageTypePaging)=0, \old(Executive)=0, \old(IPC)=0, \old(KernelMode)=0, \old(lowerDriverReturn)=0, \old(MPR1)=0, \old(MPR3)=0, \old(myStatus)=0, \old(NP)=0, \old(pended)=0, \old(pirp)=0, \old(routine)=0, \old(s)=0, \old(setEventCalled)=0, \old(SKIP1)=0, \old(SKIP2)=0, \old(Suspended)=0, \old(UNLOADED)=0, compFptr=0, compRegistered=0, customIrp=0, d=-4, DC=0, DeviceUsageTypePaging=1, devobj=-3, Executive=0, IPC=0, irp=-2, irp_choice=0, KernelMode=0, lowerDriverReturn=0, MPR1=0, MPR3=0, myStatus=0, NP=0, pended=0, pirp=-2, routine=0, s=0, setEventCalled=0, SKIP1=0, SKIP2=0, status=0, Suspended=5, UNLOADED=0, we_should_unload=0] [L1755] CALL _BLAST_init() VAL [\old(compFptr)=0, \old(compRegistered)=0, \old(customIrp)=0, \old(DC)=0, \old(DeviceUsageTypePaging)=0, \old(Executive)=0, \old(IPC)=0, \old(KernelMode)=0, \old(lowerDriverReturn)=0, \old(MPR1)=0, \old(MPR3)=0, \old(myStatus)=0, \old(NP)=0, \old(pended)=0, \old(pirp)=0, \old(routine)=0, \old(s)=0, \old(setEventCalled)=0, \old(SKIP1)=0, \old(SKIP2)=0, \old(Suspended)=0, \old(UNLOADED)=0, compFptr=0, compRegistered=0, customIrp=0, DC=0, DeviceUsageTypePaging=1, Executive=0, IPC=0, KernelMode=0, lowerDriverReturn=0, MPR1=0, MPR3=0, myStatus=0, NP=0, pended=0, pirp=-2, routine=0, s=0, setEventCalled=0, SKIP1=0, SKIP2=0, Suspended=5, UNLOADED=0] [L67] UNLOADED = 0 [L68] NP = 1 [L69] DC = 2 [L70] SKIP1 = 3 [L71] SKIP2 = 4 [L72] MPR1 = 5 [L73] MPR3 = 6 [L74] IPC = 7 [L75] s = UNLOADED [L76] pended = 0 [L77] compFptr = 0 [L78] compRegistered = 0 [L79] lowerDriverReturn = 0 [L80] setEventCalled = 0 [L81] customIrp = 0 VAL [\old(compFptr)=0, \old(compRegistered)=0, \old(customIrp)=0, \old(DC)=0, \old(DeviceUsageTypePaging)=0, \old(Executive)=0, \old(IPC)=0, \old(KernelMode)=0, \old(lowerDriverReturn)=0, \old(MPR1)=0, \old(MPR3)=0, \old(myStatus)=0, \old(NP)=0, \old(pended)=0, \old(pirp)=0, \old(routine)=0, \old(s)=0, \old(setEventCalled)=0, \old(SKIP1)=0, \old(SKIP2)=0, \old(Suspended)=0, \old(UNLOADED)=0, compFptr=0, compRegistered=0, customIrp=0, DC=2, DeviceUsageTypePaging=1, Executive=0, IPC=7, KernelMode=0, lowerDriverReturn=0, MPR1=5, MPR3=6, myStatus=0, NP=1, pended=0, pirp=-2, routine=0, s=0, setEventCalled=0, SKIP1=3, SKIP2=4, Suspended=5, UNLOADED=0] [L1755] RET _BLAST_init() VAL [\old(compFptr)=0, \old(compRegistered)=0, \old(customIrp)=0, \old(DC)=0, \old(DeviceUsageTypePaging)=0, \old(Executive)=0, \old(IPC)=0, \old(KernelMode)=0, \old(lowerDriverReturn)=0, \old(MPR1)=0, \old(MPR3)=0, \old(myStatus)=0, \old(NP)=0, \old(pended)=0, \old(pirp)=0, \old(routine)=0, \old(s)=0, \old(setEventCalled)=0, \old(SKIP1)=0, \old(SKIP2)=0, \old(Suspended)=0, \old(UNLOADED)=0, compFptr=0, compRegistered=0, customIrp=0, d=-4, DC=2, DeviceUsageTypePaging=1, devobj=-3, Executive=0, IPC=7, irp=-2, irp_choice=0, KernelMode=0, lowerDriverReturn=0, MPR1=5, MPR3=6, myStatus=0, NP=1, pended=0, pirp=-2, routine=0, s=0, setEventCalled=0, SKIP1=3, SKIP2=4, status=0, Suspended=5, UNLOADED=0, we_should_unload=0] [L1757] COND TRUE status >= 0 [L1758] s = NP [L1759] customIrp = 0 [L1760] setEventCalled = customIrp [L1761] lowerDriverReturn = setEventCalled [L1762] compRegistered = lowerDriverReturn [L1763] compFptr = compRegistered [L1764] pended = compFptr [L1765] pirp__IoStatus__Status = 0 [L1766] myStatus = 0 VAL [\old(compFptr)=0, \old(compRegistered)=0, \old(customIrp)=0, \old(DC)=0, \old(DeviceUsageTypePaging)=0, \old(Executive)=0, \old(IPC)=0, \old(KernelMode)=0, \old(lowerDriverReturn)=0, \old(MPR1)=0, \old(MPR3)=0, \old(myStatus)=0, \old(NP)=0, \old(pended)=0, \old(pirp)=0, \old(routine)=0, \old(s)=0, \old(setEventCalled)=0, \old(SKIP1)=0, \old(SKIP2)=0, \old(Suspended)=0, \old(UNLOADED)=0, compFptr=0, compRegistered=0, customIrp=0, d=-4, DC=2, DeviceUsageTypePaging=1, devobj=-3, Executive=0, IPC=7, irp=-2, irp_choice=0, KernelMode=0, lowerDriverReturn=0, MPR1=5, MPR3=6, myStatus=0, NP=1, pended=0, pirp=-2, pirp__IoStatus__Status=0, routine=0, s=1, setEventCalled=0, SKIP1=3, SKIP2=4, status=0, Suspended=5, UNLOADED=0, we_should_unload=0] [L1767] COND TRUE irp_choice == 0 [L1768] pirp__IoStatus__Status = -1073741637 [L1769] myStatus = -1073741637 VAL [\old(compFptr)=0, \old(compRegistered)=0, \old(customIrp)=0, \old(DC)=0, \old(DeviceUsageTypePaging)=0, \old(Executive)=0, \old(IPC)=0, \old(KernelMode)=0, \old(lowerDriverReturn)=0, \old(MPR1)=0, \old(MPR3)=0, \old(myStatus)=0, \old(NP)=0, \old(pended)=0, \old(pirp)=0, \old(routine)=0, \old(s)=0, \old(setEventCalled)=0, \old(SKIP1)=0, \old(SKIP2)=0, \old(Suspended)=0, \old(UNLOADED)=0, compFptr=0, compRegistered=0, customIrp=0, d=-4, DC=2, DeviceUsageTypePaging=1, devobj=-3, Executive=0, IPC=7, irp=-2, irp_choice=0, KernelMode=0, lowerDriverReturn=0, MPR1=5, MPR3=6, myStatus=-1073741637, NP=1, pended=0, pirp=-2, pirp__IoStatus__Status=-1073741637, routine=0, s=1, setEventCalled=0, SKIP1=3, SKIP2=4, status=0, Suspended=5, UNLOADED=0, we_should_unload=0] [L1772] CALL stub_driver_init() VAL [\old(compFptr)=0, \old(compRegistered)=0, \old(customIrp)=0, \old(DC)=0, \old(DeviceUsageTypePaging)=0, \old(Executive)=0, \old(IPC)=0, \old(KernelMode)=0, \old(lowerDriverReturn)=0, \old(MPR1)=0, \old(MPR3)=0, \old(myStatus)=0, \old(NP)=0, \old(pended)=0, \old(pirp)=0, \old(routine)=0, \old(s)=1, \old(setEventCalled)=0, \old(SKIP1)=0, \old(SKIP2)=0, \old(Suspended)=0, \old(UNLOADED)=0, compFptr=0, compRegistered=0, customIrp=0, DC=2, DeviceUsageTypePaging=1, Executive=0, IPC=7, KernelMode=0, lowerDriverReturn=0, MPR1=5, MPR3=6, myStatus=-1073741637, NP=1, pended=0, pirp=-2, routine=0, s=1, setEventCalled=0, SKIP1=3, SKIP2=4, Suspended=5, UNLOADED=0] [L1707] s = NP [L1708] customIrp = 0 [L1709] setEventCalled = customIrp [L1710] lowerDriverReturn = setEventCalled [L1711] compRegistered = lowerDriverReturn [L1712] compFptr = compRegistered [L1713] pended = compFptr VAL [\old(compFptr)=0, \old(compRegistered)=0, \old(customIrp)=0, \old(DC)=0, \old(DeviceUsageTypePaging)=0, \old(Executive)=0, \old(IPC)=0, \old(KernelMode)=0, \old(lowerDriverReturn)=0, \old(MPR1)=0, \old(MPR3)=0, \old(myStatus)=0, \old(NP)=0, \old(pended)=0, \old(pirp)=0, \old(routine)=0, \old(s)=1, \old(setEventCalled)=0, \old(SKIP1)=0, \old(SKIP2)=0, \old(Suspended)=0, \old(UNLOADED)=0, compFptr=0, compRegistered=0, customIrp=0, DC=2, DeviceUsageTypePaging=1, Executive=0, IPC=7, KernelMode=0, lowerDriverReturn=0, MPR1=5, MPR3=6, myStatus=-1073741637, NP=1, pended=0, pirp=-2, routine=0, s=1, setEventCalled=0, SKIP1=3, SKIP2=4, Suspended=5, UNLOADED=0] [L1772] RET stub_driver_init() VAL [\old(compFptr)=0, \old(compRegistered)=0, \old(customIrp)=0, \old(DC)=0, \old(DeviceUsageTypePaging)=0, \old(Executive)=0, \old(IPC)=0, \old(KernelMode)=0, \old(lowerDriverReturn)=0, \old(MPR1)=0, \old(MPR3)=0, \old(myStatus)=0, \old(NP)=0, \old(pended)=0, \old(pirp)=0, \old(routine)=0, \old(s)=0, \old(setEventCalled)=0, \old(SKIP1)=0, \old(SKIP2)=0, \old(Suspended)=0, \old(UNLOADED)=0, compFptr=0, compRegistered=0, customIrp=0, d=-4, DC=2, DeviceUsageTypePaging=1, devobj=-3, Executive=0, IPC=7, irp=-2, irp_choice=0, KernelMode=0, lowerDriverReturn=0, MPR1=5, MPR3=6, myStatus=-1073741637, NP=1, pended=0, pirp=-2, pirp__IoStatus__Status=-1073741637, routine=0, s=1, setEventCalled=0, SKIP1=3, SKIP2=4, status=0, Suspended=5, UNLOADED=0, we_should_unload=0] [L1775] COND FALSE !(status < 0) [L1779] int tmp_ndt_1; [L1780] tmp_ndt_1 = __VERIFIER_nondet_int() [L1781] COND TRUE tmp_ndt_1 == 2 VAL [\old(compFptr)=0, \old(compRegistered)=0, \old(customIrp)=0, \old(DC)=0, \old(DeviceUsageTypePaging)=0, \old(Executive)=0, \old(IPC)=0, \old(KernelMode)=0, \old(lowerDriverReturn)=0, \old(MPR1)=0, \old(MPR3)=0, \old(myStatus)=0, \old(NP)=0, \old(pended)=0, \old(pirp)=0, \old(routine)=0, \old(s)=0, \old(setEventCalled)=0, \old(SKIP1)=0, \old(SKIP2)=0, \old(Suspended)=0, \old(UNLOADED)=0, compFptr=0, compRegistered=0, customIrp=0, d=-4, DC=2, DeviceUsageTypePaging=1, devobj=-3, Executive=0, IPC=7, irp=-2, irp_choice=0, KernelMode=0, lowerDriverReturn=0, MPR1=5, MPR3=6, myStatus=-1073741637, NP=1, pended=0, pirp=-2, pirp__IoStatus__Status=-1073741637, routine=0, s=1, setEventCalled=0, SKIP1=3, SKIP2=4, status=0, Suspended=5, tmp_ndt_1=2, UNLOADED=0, we_should_unload=0] [L1798] CALL, EXPR CdAudioDeviceControl(devobj, pirp) VAL [\old(compFptr)=0, \old(compRegistered)=0, \old(customIrp)=0, \old(DC)=0, \old(DeviceObject)=-3, \old(DeviceUsageTypePaging)=0, \old(Executive)=0, \old(IPC)=0, \old(Irp)=-2, \old(KernelMode)=0, \old(lowerDriverReturn)=0, \old(MPR1)=0, \old(MPR3)=0, \old(myStatus)=-1073741637, \old(NP)=0, \old(pended)=0, \old(pirp)=0, \old(routine)=0, \old(s)=1, \old(setEventCalled)=0, \old(SKIP1)=0, \old(SKIP2)=0, \old(Suspended)=0, \old(UNLOADED)=0, compFptr=0, compRegistered=0, customIrp=0, DC=2, DeviceUsageTypePaging=1, Executive=0, IPC=7, KernelMode=0, lowerDriverReturn=0, MPR1=5, MPR3=6, myStatus=-1073741637, NP=1, pended=0, pirp=-2, routine=0, s=1, setEventCalled=0, SKIP1=3, SKIP2=4, Suspended=5, UNLOADED=0] [L313] int deviceExtension__Active = __VERIFIER_nondet_int() ; [L314] int status ; VAL [\old(compFptr)=0, \old(compRegistered)=0, \old(customIrp)=0, \old(DC)=0, \old(DeviceObject)=-3, \old(DeviceUsageTypePaging)=0, \old(Executive)=0, \old(IPC)=0, \old(Irp)=-2, \old(KernelMode)=0, \old(lowerDriverReturn)=0, \old(MPR1)=0, \old(MPR3)=0, \old(myStatus)=-1073741637, \old(NP)=0, \old(pended)=0, \old(pirp)=0, \old(routine)=0, \old(s)=1, \old(setEventCalled)=0, \old(SKIP1)=0, \old(SKIP2)=0, \old(Suspended)=0, \old(UNLOADED)=0, compFptr=0, compRegistered=0, customIrp=0, DC=2, deviceExtension__Active=7, DeviceObject=-3, DeviceUsageTypePaging=1, Executive=0, IPC=7, Irp=-2, KernelMode=0, lowerDriverReturn=0, MPR1=5, MPR3=6, myStatus=-1073741637, NP=1, pended=0, pirp=-2, routine=0, s=1, setEventCalled=0, SKIP1=3, SKIP2=4, Suspended=5, UNLOADED=0] [L317] COND FALSE !(deviceExtension__Active == 2) VAL [\old(compFptr)=0, \old(compRegistered)=0, \old(customIrp)=0, \old(DC)=0, \old(DeviceObject)=-3, \old(DeviceUsageTypePaging)=0, \old(Executive)=0, \old(IPC)=0, \old(Irp)=-2, \old(KernelMode)=0, \old(lowerDriverReturn)=0, \old(MPR1)=0, \old(MPR3)=0, \old(myStatus)=-1073741637, \old(NP)=0, \old(pended)=0, \old(pirp)=0, \old(routine)=0, \old(s)=1, \old(setEventCalled)=0, \old(SKIP1)=0, \old(SKIP2)=0, \old(Suspended)=0, \old(UNLOADED)=0, compFptr=0, compRegistered=0, customIrp=0, DC=2, deviceExtension__Active=7, DeviceObject=-3, DeviceUsageTypePaging=1, Executive=0, IPC=7, Irp=-2, KernelMode=0, lowerDriverReturn=0, MPR1=5, MPR3=6, myStatus=-1073741637, NP=1, pended=0, pirp=-2, routine=0, s=1, setEventCalled=0, SKIP1=3, SKIP2=4, Suspended=5, UNLOADED=0] [L320] COND FALSE !(deviceExtension__Active == 3) VAL [\old(compFptr)=0, \old(compRegistered)=0, \old(customIrp)=0, \old(DC)=0, \old(DeviceObject)=-3, \old(DeviceUsageTypePaging)=0, \old(Executive)=0, \old(IPC)=0, \old(Irp)=-2, \old(KernelMode)=0, \old(lowerDriverReturn)=0, \old(MPR1)=0, \old(MPR3)=0, \old(myStatus)=-1073741637, \old(NP)=0, \old(pended)=0, \old(pirp)=0, \old(routine)=0, \old(s)=1, \old(setEventCalled)=0, \old(SKIP1)=0, \old(SKIP2)=0, \old(Suspended)=0, \old(UNLOADED)=0, compFptr=0, compRegistered=0, customIrp=0, DC=2, deviceExtension__Active=7, DeviceObject=-3, DeviceUsageTypePaging=1, Executive=0, IPC=7, Irp=-2, KernelMode=0, lowerDriverReturn=0, MPR1=5, MPR3=6, myStatus=-1073741637, NP=1, pended=0, pirp=-2, routine=0, s=1, setEventCalled=0, SKIP1=3, SKIP2=4, Suspended=5, UNLOADED=0] [L323] COND FALSE !(deviceExtension__Active == 1) VAL [\old(compFptr)=0, \old(compRegistered)=0, \old(customIrp)=0, \old(DC)=0, \old(DeviceObject)=-3, \old(DeviceUsageTypePaging)=0, \old(Executive)=0, \old(IPC)=0, \old(Irp)=-2, \old(KernelMode)=0, \old(lowerDriverReturn)=0, \old(MPR1)=0, \old(MPR3)=0, \old(myStatus)=-1073741637, \old(NP)=0, \old(pended)=0, \old(pirp)=0, \old(routine)=0, \old(s)=1, \old(setEventCalled)=0, \old(SKIP1)=0, \old(SKIP2)=0, \old(Suspended)=0, \old(UNLOADED)=0, compFptr=0, compRegistered=0, customIrp=0, DC=2, deviceExtension__Active=7, DeviceObject=-3, DeviceUsageTypePaging=1, Executive=0, IPC=7, Irp=-2, KernelMode=0, lowerDriverReturn=0, MPR1=5, MPR3=6, myStatus=-1073741637, NP=1, pended=0, pirp=-2, routine=0, s=1, setEventCalled=0, SKIP1=3, SKIP2=4, Suspended=5, UNLOADED=0] [L326] COND TRUE deviceExtension__Active == 7 VAL [\old(compFptr)=0, \old(compRegistered)=0, \old(customIrp)=0, \old(DC)=0, \old(DeviceObject)=-3, \old(DeviceUsageTypePaging)=0, \old(Executive)=0, \old(IPC)=0, \old(Irp)=-2, \old(KernelMode)=0, \old(lowerDriverReturn)=0, \old(MPR1)=0, \old(MPR3)=0, \old(myStatus)=-1073741637, \old(NP)=0, \old(pended)=0, \old(pirp)=0, \old(routine)=0, \old(s)=1, \old(setEventCalled)=0, \old(SKIP1)=0, \old(SKIP2)=0, \old(Suspended)=0, \old(UNLOADED)=0, compFptr=0, compRegistered=0, customIrp=0, DC=2, deviceExtension__Active=7, DeviceObject=-3, DeviceUsageTypePaging=1, Executive=0, IPC=7, Irp=-2, KernelMode=0, lowerDriverReturn=0, MPR1=5, MPR3=6, myStatus=-1073741637, NP=1, pended=0, pirp=-2, routine=0, s=1, setEventCalled=0, SKIP1=3, SKIP2=4, Suspended=5, UNLOADED=0] [L348] CALL, EXPR CdAudioHPCdrDeviceControl(DeviceObject, Irp) VAL [\old(compFptr)=0, \old(compRegistered)=0, \old(customIrp)=0, \old(DC)=0, \old(DeviceObject)=-3, \old(DeviceUsageTypePaging)=0, \old(Executive)=0, \old(IPC)=0, \old(Irp)=-2, \old(KernelMode)=0, \old(lowerDriverReturn)=0, \old(MPR1)=0, \old(MPR3)=0, \old(myStatus)=-1073741637, \old(NP)=0, \old(pended)=0, \old(pirp)=0, \old(routine)=0, \old(s)=1, \old(setEventCalled)=0, \old(SKIP1)=0, \old(SKIP2)=0, \old(Suspended)=0, \old(UNLOADED)=0, compFptr=0, compRegistered=0, customIrp=0, DC=2, DeviceUsageTypePaging=1, Executive=0, IPC=7, KernelMode=0, lowerDriverReturn=0, MPR1=5, MPR3=6, myStatus=-1073741637, NP=1, pended=0, pirp=-2, routine=0, s=1, setEventCalled=0, SKIP1=3, SKIP2=4, Suspended=5, UNLOADED=0] [L1591] int currentIrpStack__Parameters__DeviceIoControl__IoControlCode = __VERIFIER_nondet_int() ; [L1592] int deviceExtension__TargetDeviceObject = __VERIFIER_nondet_int() ; [L1593] int irpSp__Control ; [L1594] int tmp ; [L1595] int tmp___0 ; [L1596] int __cil_tmp8 ; [L1597] int __cil_tmp9 ; [L1598] int __cil_tmp10 ; [L1599] int __cil_tmp11 ; [L1600] int __cil_tmp12 ; [L1604] __cil_tmp8 = 56 [L1605] __cil_tmp9 = 16384 [L1606] __cil_tmp10 = 131072 [L1607] __cil_tmp11 = 147456 [L1608] __cil_tmp12 = 147512 VAL [\old(compFptr)=0, \old(compRegistered)=0, \old(customIrp)=0, \old(DC)=0, \old(DeviceObject)=-3, \old(DeviceUsageTypePaging)=0, \old(Executive)=0, \old(IPC)=0, \old(Irp)=-2, \old(KernelMode)=0, \old(lowerDriverReturn)=0, \old(MPR1)=0, \old(MPR3)=0, \old(myStatus)=-1073741637, \old(NP)=0, \old(pended)=0, \old(pirp)=0, \old(routine)=0, \old(s)=1, \old(setEventCalled)=0, \old(SKIP1)=0, \old(SKIP2)=0, \old(Suspended)=0, \old(UNLOADED)=0, __cil_tmp10=131072, __cil_tmp11=147456, __cil_tmp12=147512, __cil_tmp8=56, __cil_tmp9=16384, compFptr=0, compRegistered=0, currentIrpStack__Parameters__DeviceIoControl__IoControlCode=147512, customIrp=0, DC=2, deviceExtension__TargetDeviceObject=0, DeviceObject=-3, DeviceUsageTypePaging=1, Executive=0, IPC=7, Irp=-2, KernelMode=0, lowerDriverReturn=0, MPR1=5, MPR3=6, myStatus=-1073741637, NP=1, pended=0, pirp=-2, routine=0, s=1, setEventCalled=0, SKIP1=3, SKIP2=4, Suspended=5, UNLOADED=0] [L1609] COND TRUE currentIrpStack__Parameters__DeviceIoControl__IoControlCode == __cil_tmp12 VAL [\old(compFptr)=0, \old(compRegistered)=0, \old(customIrp)=0, \old(DC)=0, \old(DeviceObject)=-3, \old(DeviceUsageTypePaging)=0, \old(Executive)=0, \old(IPC)=0, \old(Irp)=-2, \old(KernelMode)=0, \old(lowerDriverReturn)=0, \old(MPR1)=0, \old(MPR3)=0, \old(myStatus)=-1073741637, \old(NP)=0, \old(pended)=0, \old(pirp)=0, \old(routine)=0, \old(s)=1, \old(setEventCalled)=0, \old(SKIP1)=0, \old(SKIP2)=0, \old(Suspended)=0, \old(UNLOADED)=0, __cil_tmp10=131072, __cil_tmp11=147456, __cil_tmp12=147512, __cil_tmp8=56, __cil_tmp9=16384, compFptr=0, compRegistered=0, currentIrpStack__Parameters__DeviceIoControl__IoControlCode=147512, customIrp=0, DC=2, deviceExtension__TargetDeviceObject=0, DeviceObject=-3, DeviceUsageTypePaging=1, Executive=0, IPC=7, Irp=-2, KernelMode=0, lowerDriverReturn=0, MPR1=5, MPR3=6, myStatus=-1073741637, NP=1, pended=0, pirp=-2, routine=0, s=1, setEventCalled=0, SKIP1=3, SKIP2=4, Suspended=5, UNLOADED=0] [L1610] COND FALSE !(s != NP) VAL [\old(compFptr)=0, \old(compRegistered)=0, \old(customIrp)=0, \old(DC)=0, \old(DeviceObject)=-3, \old(DeviceUsageTypePaging)=0, \old(Executive)=0, \old(IPC)=0, \old(Irp)=-2, \old(KernelMode)=0, \old(lowerDriverReturn)=0, \old(MPR1)=0, \old(MPR3)=0, \old(myStatus)=-1073741637, \old(NP)=0, \old(pended)=0, \old(pirp)=0, \old(routine)=0, \old(s)=1, \old(setEventCalled)=0, \old(SKIP1)=0, \old(SKIP2)=0, \old(Suspended)=0, \old(UNLOADED)=0, __cil_tmp10=131072, __cil_tmp11=147456, __cil_tmp12=147512, __cil_tmp8=56, __cil_tmp9=16384, compFptr=0, compRegistered=0, currentIrpStack__Parameters__DeviceIoControl__IoControlCode=147512, customIrp=0, DC=2, deviceExtension__TargetDeviceObject=0, DeviceObject=-3, DeviceUsageTypePaging=1, Executive=0, IPC=7, Irp=-2, KernelMode=0, lowerDriverReturn=0, MPR1=5, MPR3=6, myStatus=-1073741637, NP=1, pended=0, pirp=-2, routine=0, s=1, setEventCalled=0, SKIP1=3, SKIP2=4, Suspended=5, UNLOADED=0] [L1615] COND FALSE !(compRegistered != 0) [L1620] compRegistered = 1 [L1621] routine = 0 VAL [\old(compFptr)=0, \old(compRegistered)=0, \old(customIrp)=0, \old(DC)=0, \old(DeviceObject)=-3, \old(DeviceUsageTypePaging)=0, \old(Executive)=0, \old(IPC)=0, \old(Irp)=-2, \old(KernelMode)=0, \old(lowerDriverReturn)=0, \old(MPR1)=0, \old(MPR3)=0, \old(myStatus)=-1073741637, \old(NP)=0, \old(pended)=0, \old(pirp)=0, \old(routine)=0, \old(s)=1, \old(setEventCalled)=0, \old(SKIP1)=0, \old(SKIP2)=0, \old(Suspended)=0, \old(UNLOADED)=0, __cil_tmp10=131072, __cil_tmp11=147456, __cil_tmp12=147512, __cil_tmp8=56, __cil_tmp9=16384, compFptr=0, compRegistered=1, currentIrpStack__Parameters__DeviceIoControl__IoControlCode=147512, customIrp=0, DC=2, deviceExtension__TargetDeviceObject=0, DeviceObject=-3, DeviceUsageTypePaging=1, Executive=0, IPC=7, Irp=-2, KernelMode=0, lowerDriverReturn=0, MPR1=5, MPR3=6, myStatus=-1073741637, NP=1, pended=0, pirp=-2, routine=0, s=1, setEventCalled=0, SKIP1=3, SKIP2=4, Suspended=5, UNLOADED=0] [L1625] irpSp__Control = 224 VAL [\old(compFptr)=0, \old(compRegistered)=0, \old(customIrp)=0, \old(DC)=0, \old(DeviceObject)=-3, \old(DeviceUsageTypePaging)=0, \old(Executive)=0, \old(IPC)=0, \old(Irp)=-2, \old(KernelMode)=0, \old(lowerDriverReturn)=0, \old(MPR1)=0, \old(MPR3)=0, \old(myStatus)=-1073741637, \old(NP)=0, \old(pended)=0, \old(pirp)=0, \old(routine)=0, \old(s)=1, \old(setEventCalled)=0, \old(SKIP1)=0, \old(SKIP2)=0, \old(Suspended)=0, \old(UNLOADED)=0, __cil_tmp10=131072, __cil_tmp11=147456, __cil_tmp12=147512, __cil_tmp8=56, __cil_tmp9=16384, compFptr=0, compRegistered=1, currentIrpStack__Parameters__DeviceIoControl__IoControlCode=147512, customIrp=0, DC=2, deviceExtension__TargetDeviceObject=0, DeviceObject=-3, DeviceUsageTypePaging=1, Executive=0, IPC=7, Irp=-2, irpSp__Control=224, KernelMode=0, lowerDriverReturn=0, MPR1=5, MPR3=6, myStatus=-1073741637, NP=1, pended=0, pirp=-2, routine=0, s=1, setEventCalled=0, SKIP1=3, SKIP2=4, Suspended=5, UNLOADED=0] [L1626] CALL, EXPR IofCallDriver(deviceExtension__TargetDeviceObject, Irp) VAL [\old(compFptr)=0, \old(compRegistered)=0, \old(customIrp)=0, \old(DC)=0, \old(DeviceObject)=0, \old(DeviceUsageTypePaging)=0, \old(Executive)=0, \old(IPC)=0, \old(Irp)=-2, \old(KernelMode)=0, \old(lowerDriverReturn)=0, \old(MPR1)=0, \old(MPR3)=0, \old(myStatus)=-1073741637, \old(NP)=0, \old(pended)=0, \old(pirp)=0, \old(routine)=0, \old(s)=1, \old(setEventCalled)=0, \old(SKIP1)=0, \old(SKIP2)=0, \old(Suspended)=0, \old(UNLOADED)=0, compFptr=0, compRegistered=1, customIrp=0, DC=2, DeviceUsageTypePaging=1, Executive=0, IPC=7, KernelMode=0, lowerDriverReturn=0, MPR1=5, MPR3=6, myStatus=-1073741637, NP=1, pended=0, pirp=-2, routine=0, s=1, setEventCalled=0, SKIP1=3, SKIP2=4, Suspended=5, UNLOADED=0] [L1900] int Irp__PendingReturned = __VERIFIER_nondet_int() ; [L1901] int returnVal2 ; [L1902] int compRetStatus ; [L1903] int lcontext = __VERIFIER_nondet_int() ; [L1904] unsigned long __cil_tmp8 ; VAL [\old(compFptr)=0, \old(compRegistered)=0, \old(customIrp)=0, \old(DC)=0, \old(DeviceObject)=0, \old(DeviceUsageTypePaging)=0, \old(Executive)=0, \old(IPC)=0, \old(Irp)=-2, \old(KernelMode)=0, \old(lowerDriverReturn)=0, \old(MPR1)=0, \old(MPR3)=0, \old(myStatus)=-1073741637, \old(NP)=0, \old(pended)=0, \old(pirp)=0, \old(routine)=0, \old(s)=1, \old(setEventCalled)=0, \old(SKIP1)=0, \old(SKIP2)=0, \old(Suspended)=0, \old(UNLOADED)=0, compFptr=0, compRegistered=1, customIrp=0, DC=2, DeviceObject=0, DeviceUsageTypePaging=1, Executive=0, IPC=7, Irp=-2, Irp__PendingReturned=0, KernelMode=0, lcontext=-5, lowerDriverReturn=0, MPR1=5, MPR3=6, myStatus=-1073741637, NP=1, pended=0, pirp=-2, routine=0, s=1, setEventCalled=0, SKIP1=3, SKIP2=4, Suspended=5, UNLOADED=0] [L1907] COND TRUE \read(compRegistered) VAL [\old(compFptr)=0, \old(compRegistered)=0, \old(customIrp)=0, \old(DC)=0, \old(DeviceObject)=0, \old(DeviceUsageTypePaging)=0, \old(Executive)=0, \old(IPC)=0, \old(Irp)=-2, \old(KernelMode)=0, \old(lowerDriverReturn)=0, \old(MPR1)=0, \old(MPR3)=0, \old(myStatus)=-1073741637, \old(NP)=0, \old(pended)=0, \old(pirp)=0, \old(routine)=0, \old(s)=1, \old(setEventCalled)=0, \old(SKIP1)=0, \old(SKIP2)=0, \old(Suspended)=0, \old(UNLOADED)=0, compFptr=0, compRegistered=1, customIrp=0, DC=2, DeviceObject=0, DeviceUsageTypePaging=1, Executive=0, IPC=7, Irp=-2, Irp__PendingReturned=0, KernelMode=0, lcontext=-5, lowerDriverReturn=0, MPR1=5, MPR3=6, myStatus=-1073741637, NP=1, pended=0, pirp=-2, routine=0, s=1, setEventCalled=0, SKIP1=3, SKIP2=4, Suspended=5, UNLOADED=0] [L1908] COND TRUE routine == 0 VAL [\old(compFptr)=0, \old(compRegistered)=0, \old(customIrp)=0, \old(DC)=0, \old(DeviceObject)=0, \old(DeviceUsageTypePaging)=0, \old(Executive)=0, \old(IPC)=0, \old(Irp)=-2, \old(KernelMode)=0, \old(lowerDriverReturn)=0, \old(MPR1)=0, \old(MPR3)=0, \old(myStatus)=-1073741637, \old(NP)=0, \old(pended)=0, \old(pirp)=0, \old(routine)=0, \old(s)=1, \old(setEventCalled)=0, \old(SKIP1)=0, \old(SKIP2)=0, \old(Suspended)=0, \old(UNLOADED)=0, compFptr=0, compRegistered=1, customIrp=0, DC=2, DeviceObject=0, DeviceUsageTypePaging=1, Executive=0, IPC=7, Irp=-2, Irp__PendingReturned=0, KernelMode=0, lcontext=-5, lowerDriverReturn=0, MPR1=5, MPR3=6, myStatus=-1073741637, NP=1, pended=0, pirp=-2, routine=0, s=1, setEventCalled=0, SKIP1=3, SKIP2=4, Suspended=5, UNLOADED=0] [L1910] CALL, EXPR HPCdrCompletion(DeviceObject, Irp, lcontext) VAL [\old(compFptr)=0, \old(compRegistered)=0, \old(Context)=-5, \old(customIrp)=0, \old(DC)=0, \old(DeviceObject)=0, \old(DeviceUsageTypePaging)=0, \old(Executive)=0, \old(IPC)=0, \old(Irp)=-2, \old(KernelMode)=0, \old(lowerDriverReturn)=0, \old(MPR1)=0, \old(MPR3)=0, \old(myStatus)=-1073741637, \old(NP)=0, \old(pended)=0, \old(pirp)=0, \old(routine)=0, \old(s)=1, \old(setEventCalled)=0, \old(SKIP1)=0, \old(SKIP2)=0, \old(Suspended)=0, \old(UNLOADED)=0, compFptr=0, compRegistered=1, customIrp=0, DC=2, DeviceUsageTypePaging=1, Executive=0, IPC=7, KernelMode=0, lowerDriverReturn=0, MPR1=5, MPR3=6, myStatus=-1073741637, NP=1, pended=0, pirp=-2, routine=0, s=1, setEventCalled=0, SKIP1=3, SKIP2=4, Suspended=5, UNLOADED=0] [L1569] int Irp__PendingReturned = __VERIFIER_nondet_int() ; [L1570] int Irp__AssociatedIrp__SystemBuffer = __VERIFIER_nondet_int() ; [L1573] COND TRUE \read(Irp__PendingReturned) VAL [\old(compFptr)=0, \old(compRegistered)=0, \old(Context)=-5, \old(customIrp)=0, \old(DC)=0, \old(DeviceObject)=0, \old(DeviceUsageTypePaging)=0, \old(Executive)=0, \old(IPC)=0, \old(Irp)=-2, \old(KernelMode)=0, \old(lowerDriverReturn)=0, \old(MPR1)=0, \old(MPR3)=0, \old(myStatus)=-1073741637, \old(NP)=0, \old(pended)=0, \old(pirp)=0, \old(routine)=0, \old(s)=1, \old(setEventCalled)=0, \old(SKIP1)=0, \old(SKIP2)=0, \old(Suspended)=0, \old(UNLOADED)=0, compFptr=0, compRegistered=1, Context=-5, customIrp=0, DC=2, DeviceObject=0, DeviceUsageTypePaging=1, Executive=0, IPC=7, Irp=-2, Irp__AssociatedIrp__SystemBuffer=0, Irp__PendingReturned=1, KernelMode=0, lowerDriverReturn=0, MPR1=5, MPR3=6, myStatus=-1073741637, NP=1, pended=0, pirp=-2, routine=0, s=1, setEventCalled=0, SKIP1=3, SKIP2=4, Suspended=5, UNLOADED=0] [L1574] COND TRUE pended == 0 [L1575] pended = 1 VAL [\old(compFptr)=0, \old(compRegistered)=0, \old(Context)=-5, \old(customIrp)=0, \old(DC)=0, \old(DeviceObject)=0, \old(DeviceUsageTypePaging)=0, \old(Executive)=0, \old(IPC)=0, \old(Irp)=-2, \old(KernelMode)=0, \old(lowerDriverReturn)=0, \old(MPR1)=0, \old(MPR3)=0, \old(myStatus)=-1073741637, \old(NP)=0, \old(pended)=0, \old(pirp)=0, \old(routine)=0, \old(s)=1, \old(setEventCalled)=0, \old(SKIP1)=0, \old(SKIP2)=0, \old(Suspended)=0, \old(UNLOADED)=0, compFptr=0, compRegistered=1, Context=-5, customIrp=0, DC=2, DeviceObject=0, DeviceUsageTypePaging=1, Executive=0, IPC=7, Irp=-2, Irp__AssociatedIrp__SystemBuffer=0, Irp__PendingReturned=1, KernelMode=0, lowerDriverReturn=0, MPR1=5, MPR3=6, myStatus=-1073741637, NP=1, pended=1, pirp=-2, routine=0, s=1, setEventCalled=0, SKIP1=3, SKIP2=4, Suspended=5, UNLOADED=0] [L1582] COND FALSE !(myStatus >= 0) VAL [\old(compFptr)=0, \old(compRegistered)=0, \old(Context)=-5, \old(customIrp)=0, \old(DC)=0, \old(DeviceObject)=0, \old(DeviceUsageTypePaging)=0, \old(Executive)=0, \old(IPC)=0, \old(Irp)=-2, \old(KernelMode)=0, \old(lowerDriverReturn)=0, \old(MPR1)=0, \old(MPR3)=0, \old(myStatus)=-1073741637, \old(NP)=0, \old(pended)=0, \old(pirp)=0, \old(routine)=0, \old(s)=1, \old(setEventCalled)=0, \old(SKIP1)=0, \old(SKIP2)=0, \old(Suspended)=0, \old(UNLOADED)=0, compFptr=0, compRegistered=1, Context=-5, customIrp=0, DC=2, DeviceObject=0, DeviceUsageTypePaging=1, Executive=0, IPC=7, Irp=-2, Irp__AssociatedIrp__SystemBuffer=0, Irp__PendingReturned=1, KernelMode=0, lowerDriverReturn=0, MPR1=5, MPR3=6, myStatus=-1073741637, NP=1, pended=1, pirp=-2, routine=0, s=1, setEventCalled=0, SKIP1=3, SKIP2=4, Suspended=5, UNLOADED=0] [L1587] return (myStatus); VAL [\old(compFptr)=0, \old(compRegistered)=0, \old(Context)=-5, \old(customIrp)=0, \old(DC)=0, \old(DeviceObject)=0, \old(DeviceUsageTypePaging)=0, \old(Executive)=0, \old(IPC)=0, \old(Irp)=-2, \old(KernelMode)=0, \old(lowerDriverReturn)=0, \old(MPR1)=0, \old(MPR3)=0, \old(myStatus)=-1073741637, \old(NP)=0, \old(pended)=0, \old(pirp)=0, \old(routine)=0, \old(s)=1, \old(setEventCalled)=0, \old(SKIP1)=0, \old(SKIP2)=0, \old(Suspended)=0, \old(UNLOADED)=0, \result=-1073741637, compFptr=0, compRegistered=1, Context=-5, customIrp=0, DC=2, DeviceObject=0, DeviceUsageTypePaging=1, Executive=0, IPC=7, Irp=-2, Irp__AssociatedIrp__SystemBuffer=0, Irp__PendingReturned=1, KernelMode=0, lowerDriverReturn=0, MPR1=5, MPR3=6, myStatus=-1073741637, NP=1, pended=1, pirp=-2, routine=0, s=1, setEventCalled=0, SKIP1=3, SKIP2=4, Suspended=5, UNLOADED=0] [L1910] RET, EXPR HPCdrCompletion(DeviceObject, Irp, lcontext) VAL [\old(compFptr)=0, \old(compRegistered)=0, \old(customIrp)=0, \old(DC)=0, \old(DeviceObject)=0, \old(DeviceUsageTypePaging)=0, \old(Executive)=0, \old(IPC)=0, \old(Irp)=-2, \old(KernelMode)=0, \old(lowerDriverReturn)=0, \old(MPR1)=0, \old(MPR3)=0, \old(myStatus)=-1073741637, \old(NP)=0, \old(pended)=0, \old(pirp)=0, \old(routine)=0, \old(s)=1, \old(setEventCalled)=0, \old(SKIP1)=0, \old(SKIP2)=0, \old(Suspended)=0, \old(UNLOADED)=0, compFptr=0, compRegistered=1, customIrp=0, DC=2, DeviceObject=0, DeviceUsageTypePaging=1, Executive=0, HPCdrCompletion(DeviceObject, Irp, lcontext)=-1073741637, IPC=7, Irp=-2, Irp__PendingReturned=0, KernelMode=0, lcontext=-5, lowerDriverReturn=0, MPR1=5, MPR3=6, myStatus=-1073741637, NP=1, pended=1, pirp=-2, routine=0, s=1, setEventCalled=0, SKIP1=3, SKIP2=4, Suspended=5, UNLOADED=0] [L1910] compRetStatus = HPCdrCompletion(DeviceObject, Irp, lcontext) [L1920] __cil_tmp8 = (unsigned long )compRetStatus VAL [\old(compFptr)=0, \old(compRegistered)=0, \old(customIrp)=0, \old(DC)=0, \old(DeviceObject)=0, \old(DeviceUsageTypePaging)=0, \old(Executive)=0, \old(IPC)=0, \old(Irp)=-2, \old(KernelMode)=0, \old(lowerDriverReturn)=0, \old(MPR1)=0, \old(MPR3)=0, \old(myStatus)=-1073741637, \old(NP)=0, \old(pended)=0, \old(pirp)=0, \old(routine)=0, \old(s)=1, \old(setEventCalled)=0, \old(SKIP1)=0, \old(SKIP2)=0, \old(Suspended)=0, \old(UNLOADED)=0, __cil_tmp8=3221225659, compFptr=0, compRegistered=1, compRetStatus=-1073741637, customIrp=0, DC=2, DeviceObject=0, DeviceUsageTypePaging=1, Executive=0, IPC=7, Irp=-2, Irp__PendingReturned=0, KernelMode=0, lcontext=-5, lowerDriverReturn=0, MPR1=5, MPR3=6, myStatus=-1073741637, NP=1, pended=1, pirp=-2, routine=0, s=1, setEventCalled=0, SKIP1=3, SKIP2=4, Suspended=5, UNLOADED=0] [L1921] COND FALSE !(__cil_tmp8 == -1073741802) VAL [\old(compFptr)=0, \old(compRegistered)=0, \old(customIrp)=0, \old(DC)=0, \old(DeviceObject)=0, \old(DeviceUsageTypePaging)=0, \old(Executive)=0, \old(IPC)=0, \old(Irp)=-2, \old(KernelMode)=0, \old(lowerDriverReturn)=0, \old(MPR1)=0, \old(MPR3)=0, \old(myStatus)=-1073741637, \old(NP)=0, \old(pended)=0, \old(pirp)=0, \old(routine)=0, \old(s)=1, \old(setEventCalled)=0, \old(SKIP1)=0, \old(SKIP2)=0, \old(Suspended)=0, \old(UNLOADED)=0, __cil_tmp8=3221225659, compFptr=0, compRegistered=1, compRetStatus=-1073741637, customIrp=0, DC=2, DeviceObject=0, DeviceUsageTypePaging=1, Executive=0, IPC=7, Irp=-2, Irp__PendingReturned=0, KernelMode=0, lcontext=-5, lowerDriverReturn=0, MPR1=5, MPR3=6, myStatus=-1073741637, NP=1, pended=1, pirp=-2, routine=0, s=1, setEventCalled=0, SKIP1=3, SKIP2=4, Suspended=5, UNLOADED=0] [L1928] COND FALSE !(\read(Irp__PendingReturned)) [L1931] int tmp_ndt_4; [L1932] tmp_ndt_4 = __VERIFIER_nondet_int() [L1933] COND TRUE tmp_ndt_4 == 0 VAL [\old(compFptr)=0, \old(compRegistered)=0, \old(customIrp)=0, \old(DC)=0, \old(DeviceObject)=0, \old(DeviceUsageTypePaging)=0, \old(Executive)=0, \old(IPC)=0, \old(Irp)=-2, \old(KernelMode)=0, \old(lowerDriverReturn)=0, \old(MPR1)=0, \old(MPR3)=0, \old(myStatus)=-1073741637, \old(NP)=0, \old(pended)=0, \old(pirp)=0, \old(routine)=0, \old(s)=1, \old(setEventCalled)=0, \old(SKIP1)=0, \old(SKIP2)=0, \old(Suspended)=0, \old(UNLOADED)=0, __cil_tmp8=3221225659, compFptr=0, compRegistered=1, compRetStatus=-1073741637, customIrp=0, DC=2, DeviceObject=0, DeviceUsageTypePaging=1, Executive=0, IPC=7, Irp=-2, Irp__PendingReturned=0, KernelMode=0, lcontext=-5, lowerDriverReturn=0, MPR1=5, MPR3=6, myStatus=-1073741637, NP=1, pended=1, pirp=-2, routine=0, s=1, setEventCalled=0, SKIP1=3, SKIP2=4, Suspended=5, tmp_ndt_4=0, UNLOADED=0] [L1944] returnVal2 = 0 VAL [\old(compFptr)=0, \old(compRegistered)=0, \old(customIrp)=0, \old(DC)=0, \old(DeviceObject)=0, \old(DeviceUsageTypePaging)=0, \old(Executive)=0, \old(IPC)=0, \old(Irp)=-2, \old(KernelMode)=0, \old(lowerDriverReturn)=0, \old(MPR1)=0, \old(MPR3)=0, \old(myStatus)=-1073741637, \old(NP)=0, \old(pended)=0, \old(pirp)=0, \old(routine)=0, \old(s)=1, \old(setEventCalled)=0, \old(SKIP1)=0, \old(SKIP2)=0, \old(Suspended)=0, \old(UNLOADED)=0, __cil_tmp8=3221225659, compFptr=0, compRegistered=1, compRetStatus=-1073741637, customIrp=0, DC=2, DeviceObject=0, DeviceUsageTypePaging=1, Executive=0, IPC=7, Irp=-2, Irp__PendingReturned=0, KernelMode=0, lcontext=-5, lowerDriverReturn=0, MPR1=5, MPR3=6, myStatus=-1073741637, NP=1, pended=1, pirp=-2, returnVal2=0, routine=0, s=1, setEventCalled=0, SKIP1=3, SKIP2=4, Suspended=5, tmp_ndt_4=0, UNLOADED=0] [L1958] COND TRUE s == NP [L1959] s = IPC [L1960] lowerDriverReturn = returnVal2 VAL [\old(compFptr)=0, \old(compRegistered)=0, \old(customIrp)=0, \old(DC)=0, \old(DeviceObject)=0, \old(DeviceUsageTypePaging)=0, \old(Executive)=0, \old(IPC)=0, \old(Irp)=-2, \old(KernelMode)=0, \old(lowerDriverReturn)=0, \old(MPR1)=0, \old(MPR3)=0, \old(myStatus)=-1073741637, \old(NP)=0, \old(pended)=0, \old(pirp)=0, \old(routine)=0, \old(s)=1, \old(setEventCalled)=0, \old(SKIP1)=0, \old(SKIP2)=0, \old(Suspended)=0, \old(UNLOADED)=0, __cil_tmp8=3221225659, compFptr=0, compRegistered=1, compRetStatus=-1073741637, customIrp=0, DC=2, DeviceObject=0, DeviceUsageTypePaging=1, Executive=0, IPC=7, Irp=-2, Irp__PendingReturned=0, KernelMode=0, lcontext=-5, lowerDriverReturn=0, MPR1=5, MPR3=6, myStatus=-1073741637, NP=1, pended=1, pirp=-2, returnVal2=0, routine=0, s=7, setEventCalled=0, SKIP1=3, SKIP2=4, Suspended=5, tmp_ndt_4=0, UNLOADED=0] [L1981] return (returnVal2); VAL [\old(compFptr)=0, \old(compRegistered)=0, \old(customIrp)=0, \old(DC)=0, \old(DeviceObject)=0, \old(DeviceUsageTypePaging)=0, \old(Executive)=0, \old(IPC)=0, \old(Irp)=-2, \old(KernelMode)=0, \old(lowerDriverReturn)=0, \old(MPR1)=0, \old(MPR3)=0, \old(myStatus)=-1073741637, \old(NP)=0, \old(pended)=0, \old(pirp)=0, \old(routine)=0, \old(s)=1, \old(setEventCalled)=0, \old(SKIP1)=0, \old(SKIP2)=0, \old(Suspended)=0, \old(UNLOADED)=0, \result=0, __cil_tmp8=3221225659, compFptr=0, compRegistered=1, compRetStatus=-1073741637, customIrp=0, DC=2, DeviceObject=0, DeviceUsageTypePaging=1, Executive=0, IPC=7, Irp=-2, Irp__PendingReturned=0, KernelMode=0, lcontext=-5, lowerDriverReturn=0, MPR1=5, MPR3=6, myStatus=-1073741637, NP=1, pended=1, pirp=-2, returnVal2=0, routine=0, s=7, setEventCalled=0, SKIP1=3, SKIP2=4, Suspended=5, tmp_ndt_4=0, UNLOADED=0] [L1626] RET, EXPR IofCallDriver(deviceExtension__TargetDeviceObject, Irp) VAL [\old(compFptr)=0, \old(compRegistered)=0, \old(customIrp)=0, \old(DC)=0, \old(DeviceObject)=-3, \old(DeviceUsageTypePaging)=0, \old(Executive)=0, \old(IPC)=0, \old(Irp)=-2, \old(KernelMode)=0, \old(lowerDriverReturn)=0, \old(MPR1)=0, \old(MPR3)=0, \old(myStatus)=-1073741637, \old(NP)=0, \old(pended)=0, \old(pirp)=0, \old(routine)=0, \old(s)=1, \old(setEventCalled)=0, \old(SKIP1)=0, \old(SKIP2)=0, \old(Suspended)=0, \old(UNLOADED)=0, __cil_tmp10=131072, __cil_tmp11=147456, __cil_tmp12=147512, __cil_tmp8=56, __cil_tmp9=16384, compFptr=0, compRegistered=1, currentIrpStack__Parameters__DeviceIoControl__IoControlCode=147512, customIrp=0, DC=2, deviceExtension__TargetDeviceObject=0, DeviceObject=-3, DeviceUsageTypePaging=1, Executive=0, IofCallDriver(deviceExtension__TargetDeviceObject, Irp)=0, IPC=7, Irp=-2, irpSp__Control=224, KernelMode=0, lowerDriverReturn=0, MPR1=5, MPR3=6, myStatus=-1073741637, NP=1, pended=1, pirp=-2, routine=0, s=7, setEventCalled=0, SKIP1=3, SKIP2=4, Suspended=5, UNLOADED=0] [L1626] tmp = IofCallDriver(deviceExtension__TargetDeviceObject, Irp) [L1628] return (tmp); VAL [\old(compFptr)=0, \old(compRegistered)=0, \old(customIrp)=0, \old(DC)=0, \old(DeviceObject)=-3, \old(DeviceUsageTypePaging)=0, \old(Executive)=0, \old(IPC)=0, \old(Irp)=-2, \old(KernelMode)=0, \old(lowerDriverReturn)=0, \old(MPR1)=0, \old(MPR3)=0, \old(myStatus)=-1073741637, \old(NP)=0, \old(pended)=0, \old(pirp)=0, \old(routine)=0, \old(s)=1, \old(setEventCalled)=0, \old(SKIP1)=0, \old(SKIP2)=0, \old(Suspended)=0, \old(UNLOADED)=0, \result=0, __cil_tmp10=131072, __cil_tmp11=147456, __cil_tmp12=147512, __cil_tmp8=56, __cil_tmp9=16384, compFptr=0, compRegistered=1, currentIrpStack__Parameters__DeviceIoControl__IoControlCode=147512, customIrp=0, DC=2, deviceExtension__TargetDeviceObject=0, DeviceObject=-3, DeviceUsageTypePaging=1, Executive=0, IPC=7, Irp=-2, irpSp__Control=224, KernelMode=0, lowerDriverReturn=0, MPR1=5, MPR3=6, myStatus=-1073741637, NP=1, pended=1, pirp=-2, routine=0, s=7, setEventCalled=0, SKIP1=3, SKIP2=4, Suspended=5, tmp=0, UNLOADED=0] [L348] RET, EXPR CdAudioHPCdrDeviceControl(DeviceObject, Irp) VAL [\old(compFptr)=0, \old(compRegistered)=0, \old(customIrp)=0, \old(DC)=0, \old(DeviceObject)=-3, \old(DeviceUsageTypePaging)=0, \old(Executive)=0, \old(IPC)=0, \old(Irp)=-2, \old(KernelMode)=0, \old(lowerDriverReturn)=0, \old(MPR1)=0, \old(MPR3)=0, \old(myStatus)=-1073741637, \old(NP)=0, \old(pended)=0, \old(pirp)=0, \old(routine)=0, \old(s)=1, \old(setEventCalled)=0, \old(SKIP1)=0, \old(SKIP2)=0, \old(Suspended)=0, \old(UNLOADED)=0, CdAudioHPCdrDeviceControl(DeviceObject, Irp)=0, compFptr=0, compRegistered=1, customIrp=0, DC=2, deviceExtension__Active=7, DeviceObject=-3, DeviceUsageTypePaging=1, Executive=0, IPC=7, Irp=-2, KernelMode=0, lowerDriverReturn=0, MPR1=5, MPR3=6, myStatus=-1073741637, NP=1, pended=1, pirp=-2, routine=0, s=7, setEventCalled=0, SKIP1=3, SKIP2=4, Suspended=5, UNLOADED=0] [L348] status = CdAudioHPCdrDeviceControl(DeviceObject, Irp) [L363] return (status); VAL [\old(compFptr)=0, \old(compRegistered)=0, \old(customIrp)=0, \old(DC)=0, \old(DeviceObject)=-3, \old(DeviceUsageTypePaging)=0, \old(Executive)=0, \old(IPC)=0, \old(Irp)=-2, \old(KernelMode)=0, \old(lowerDriverReturn)=0, \old(MPR1)=0, \old(MPR3)=0, \old(myStatus)=-1073741637, \old(NP)=0, \old(pended)=0, \old(pirp)=0, \old(routine)=0, \old(s)=1, \old(setEventCalled)=0, \old(SKIP1)=0, \old(SKIP2)=0, \old(Suspended)=0, \old(UNLOADED)=0, \result=0, compFptr=0, compRegistered=1, customIrp=0, DC=2, deviceExtension__Active=7, DeviceObject=-3, DeviceUsageTypePaging=1, Executive=0, IPC=7, Irp=-2, KernelMode=0, lowerDriverReturn=0, MPR1=5, MPR3=6, myStatus=-1073741637, NP=1, pended=1, pirp=-2, routine=0, s=7, setEventCalled=0, SKIP1=3, SKIP2=4, status=0, Suspended=5, UNLOADED=0] [L1798] RET, EXPR CdAudioDeviceControl(devobj, pirp) VAL [\old(compFptr)=0, \old(compRegistered)=0, \old(customIrp)=0, \old(DC)=0, \old(DeviceUsageTypePaging)=0, \old(Executive)=0, \old(IPC)=0, \old(KernelMode)=0, \old(lowerDriverReturn)=0, \old(MPR1)=0, \old(MPR3)=0, \old(myStatus)=0, \old(NP)=0, \old(pended)=0, \old(pirp)=0, \old(routine)=0, \old(s)=0, \old(setEventCalled)=0, \old(SKIP1)=0, \old(SKIP2)=0, \old(Suspended)=0, \old(UNLOADED)=0, CdAudioDeviceControl(devobj, pirp)=0, compFptr=0, compRegistered=1, customIrp=0, d=-4, DC=2, DeviceUsageTypePaging=1, devobj=-3, Executive=0, IPC=7, irp=-2, irp_choice=0, KernelMode=0, lowerDriverReturn=0, MPR1=5, MPR3=6, myStatus=-1073741637, NP=1, pended=1, pirp=-2, pirp__IoStatus__Status=-1073741637, routine=0, s=7, setEventCalled=0, SKIP1=3, SKIP2=4, status=0, Suspended=5, tmp_ndt_1=2, UNLOADED=0, we_should_unload=0] [L1798] status = CdAudioDeviceControl(devobj, pirp) [L1819] COND FALSE !(\read(we_should_unload)) VAL [\old(compFptr)=0, \old(compRegistered)=0, \old(customIrp)=0, \old(DC)=0, \old(DeviceUsageTypePaging)=0, \old(Executive)=0, \old(IPC)=0, \old(KernelMode)=0, \old(lowerDriverReturn)=0, \old(MPR1)=0, \old(MPR3)=0, \old(myStatus)=0, \old(NP)=0, \old(pended)=0, \old(pirp)=0, \old(routine)=0, \old(s)=0, \old(setEventCalled)=0, \old(SKIP1)=0, \old(SKIP2)=0, \old(Suspended)=0, \old(UNLOADED)=0, compFptr=0, compRegistered=1, customIrp=0, d=-4, DC=2, DeviceUsageTypePaging=1, devobj=-3, Executive=0, IPC=7, irp=-2, irp_choice=0, KernelMode=0, lowerDriverReturn=0, MPR1=5, MPR3=6, myStatus=-1073741637, NP=1, pended=1, pirp=-2, pirp__IoStatus__Status=-1073741637, routine=0, s=7, setEventCalled=0, SKIP1=3, SKIP2=4, status=0, Suspended=5, tmp_ndt_1=2, UNLOADED=0, we_should_unload=0] [L1825] COND TRUE pended == 1 VAL [\old(compFptr)=0, \old(compRegistered)=0, \old(customIrp)=0, \old(DC)=0, \old(DeviceUsageTypePaging)=0, \old(Executive)=0, \old(IPC)=0, \old(KernelMode)=0, \old(lowerDriverReturn)=0, \old(MPR1)=0, \old(MPR3)=0, \old(myStatus)=0, \old(NP)=0, \old(pended)=0, \old(pirp)=0, \old(routine)=0, \old(s)=0, \old(setEventCalled)=0, \old(SKIP1)=0, \old(SKIP2)=0, \old(Suspended)=0, \old(UNLOADED)=0, compFptr=0, compRegistered=1, customIrp=0, d=-4, DC=2, DeviceUsageTypePaging=1, devobj=-3, Executive=0, IPC=7, irp=-2, irp_choice=0, KernelMode=0, lowerDriverReturn=0, MPR1=5, MPR3=6, myStatus=-1073741637, NP=1, pended=1, pirp=-2, pirp__IoStatus__Status=-1073741637, routine=0, s=7, setEventCalled=0, SKIP1=3, SKIP2=4, status=0, Suspended=5, tmp_ndt_1=2, UNLOADED=0, we_should_unload=0] [L1826] COND FALSE !(s == NP) VAL [\old(compFptr)=0, \old(compRegistered)=0, \old(customIrp)=0, \old(DC)=0, \old(DeviceUsageTypePaging)=0, \old(Executive)=0, \old(IPC)=0, \old(KernelMode)=0, \old(lowerDriverReturn)=0, \old(MPR1)=0, \old(MPR3)=0, \old(myStatus)=0, \old(NP)=0, \old(pended)=0, \old(pirp)=0, \old(routine)=0, \old(s)=0, \old(setEventCalled)=0, \old(SKIP1)=0, \old(SKIP2)=0, \old(Suspended)=0, \old(UNLOADED)=0, compFptr=0, compRegistered=1, customIrp=0, d=-4, DC=2, DeviceUsageTypePaging=1, devobj=-3, Executive=0, IPC=7, irp=-2, irp_choice=0, KernelMode=0, lowerDriverReturn=0, MPR1=5, MPR3=6, myStatus=-1073741637, NP=1, pended=1, pirp=-2, pirp__IoStatus__Status=-1073741637, routine=0, s=7, setEventCalled=0, SKIP1=3, SKIP2=4, status=0, Suspended=5, tmp_ndt_1=2, UNLOADED=0, we_should_unload=0] [L1833] COND TRUE pended == 1 VAL [\old(compFptr)=0, \old(compRegistered)=0, \old(customIrp)=0, \old(DC)=0, \old(DeviceUsageTypePaging)=0, \old(Executive)=0, \old(IPC)=0, \old(KernelMode)=0, \old(lowerDriverReturn)=0, \old(MPR1)=0, \old(MPR3)=0, \old(myStatus)=0, \old(NP)=0, \old(pended)=0, \old(pirp)=0, \old(routine)=0, \old(s)=0, \old(setEventCalled)=0, \old(SKIP1)=0, \old(SKIP2)=0, \old(Suspended)=0, \old(UNLOADED)=0, compFptr=0, compRegistered=1, customIrp=0, d=-4, DC=2, DeviceUsageTypePaging=1, devobj=-3, Executive=0, IPC=7, irp=-2, irp_choice=0, KernelMode=0, lowerDriverReturn=0, MPR1=5, MPR3=6, myStatus=-1073741637, NP=1, pended=1, pirp=-2, pirp__IoStatus__Status=-1073741637, routine=0, s=7, setEventCalled=0, SKIP1=3, SKIP2=4, status=0, Suspended=5, tmp_ndt_1=2, UNLOADED=0, we_should_unload=0] [L1834] COND FALSE !(s == MPR3) VAL [\old(compFptr)=0, \old(compRegistered)=0, \old(customIrp)=0, \old(DC)=0, \old(DeviceUsageTypePaging)=0, \old(Executive)=0, \old(IPC)=0, \old(KernelMode)=0, \old(lowerDriverReturn)=0, \old(MPR1)=0, \old(MPR3)=0, \old(myStatus)=0, \old(NP)=0, \old(pended)=0, \old(pirp)=0, \old(routine)=0, \old(s)=0, \old(setEventCalled)=0, \old(SKIP1)=0, \old(SKIP2)=0, \old(Suspended)=0, \old(UNLOADED)=0, compFptr=0, compRegistered=1, customIrp=0, d=-4, DC=2, DeviceUsageTypePaging=1, devobj=-3, Executive=0, IPC=7, irp=-2, irp_choice=0, KernelMode=0, lowerDriverReturn=0, MPR1=5, MPR3=6, myStatus=-1073741637, NP=1, pended=1, pirp=-2, pirp__IoStatus__Status=-1073741637, routine=0, s=7, setEventCalled=0, SKIP1=3, SKIP2=4, status=0, Suspended=5, tmp_ndt_1=2, UNLOADED=0, we_should_unload=0] [L1841] COND TRUE s != UNLOADED VAL [\old(compFptr)=0, \old(compRegistered)=0, \old(customIrp)=0, \old(DC)=0, \old(DeviceUsageTypePaging)=0, \old(Executive)=0, \old(IPC)=0, \old(KernelMode)=0, \old(lowerDriverReturn)=0, \old(MPR1)=0, \old(MPR3)=0, \old(myStatus)=0, \old(NP)=0, \old(pended)=0, \old(pirp)=0, \old(routine)=0, \old(s)=0, \old(setEventCalled)=0, \old(SKIP1)=0, \old(SKIP2)=0, \old(Suspended)=0, \old(UNLOADED)=0, compFptr=0, compRegistered=1, customIrp=0, d=-4, DC=2, DeviceUsageTypePaging=1, devobj=-3, Executive=0, IPC=7, irp=-2, irp_choice=0, KernelMode=0, lowerDriverReturn=0, MPR1=5, MPR3=6, myStatus=-1073741637, NP=1, pended=1, pirp=-2, pirp__IoStatus__Status=-1073741637, routine=0, s=7, setEventCalled=0, SKIP1=3, SKIP2=4, status=0, Suspended=5, tmp_ndt_1=2, UNLOADED=0, we_should_unload=0] [L1842] COND TRUE status != -1 VAL [\old(compFptr)=0, \old(compRegistered)=0, \old(customIrp)=0, \old(DC)=0, \old(DeviceUsageTypePaging)=0, \old(Executive)=0, \old(IPC)=0, \old(KernelMode)=0, \old(lowerDriverReturn)=0, \old(MPR1)=0, \old(MPR3)=0, \old(myStatus)=0, \old(NP)=0, \old(pended)=0, \old(pirp)=0, \old(routine)=0, \old(s)=0, \old(setEventCalled)=0, \old(SKIP1)=0, \old(SKIP2)=0, \old(Suspended)=0, \old(UNLOADED)=0, compFptr=0, compRegistered=1, customIrp=0, d=-4, DC=2, DeviceUsageTypePaging=1, devobj=-3, Executive=0, IPC=7, irp=-2, irp_choice=0, KernelMode=0, lowerDriverReturn=0, MPR1=5, MPR3=6, myStatus=-1073741637, NP=1, pended=1, pirp=-2, pirp__IoStatus__Status=-1073741637, routine=0, s=7, setEventCalled=0, SKIP1=3, SKIP2=4, status=0, Suspended=5, tmp_ndt_1=2, UNLOADED=0, we_should_unload=0] [L1843] COND TRUE s != SKIP2 VAL [\old(compFptr)=0, \old(compRegistered)=0, \old(customIrp)=0, \old(DC)=0, \old(DeviceUsageTypePaging)=0, \old(Executive)=0, \old(IPC)=0, \old(KernelMode)=0, \old(lowerDriverReturn)=0, \old(MPR1)=0, \old(MPR3)=0, \old(myStatus)=0, \old(NP)=0, \old(pended)=0, \old(pirp)=0, \old(routine)=0, \old(s)=0, \old(setEventCalled)=0, \old(SKIP1)=0, \old(SKIP2)=0, \old(Suspended)=0, \old(UNLOADED)=0, compFptr=0, compRegistered=1, customIrp=0, d=-4, DC=2, DeviceUsageTypePaging=1, devobj=-3, Executive=0, IPC=7, irp=-2, irp_choice=0, KernelMode=0, lowerDriverReturn=0, MPR1=5, MPR3=6, myStatus=-1073741637, NP=1, pended=1, pirp=-2, pirp__IoStatus__Status=-1073741637, routine=0, s=7, setEventCalled=0, SKIP1=3, SKIP2=4, status=0, Suspended=5, tmp_ndt_1=2, UNLOADED=0, we_should_unload=0] [L1844] COND FALSE !(s != IPC) VAL [\old(compFptr)=0, \old(compRegistered)=0, \old(customIrp)=0, \old(DC)=0, \old(DeviceUsageTypePaging)=0, \old(Executive)=0, \old(IPC)=0, \old(KernelMode)=0, \old(lowerDriverReturn)=0, \old(MPR1)=0, \old(MPR3)=0, \old(myStatus)=0, \old(NP)=0, \old(pended)=0, \old(pirp)=0, \old(routine)=0, \old(s)=0, \old(setEventCalled)=0, \old(SKIP1)=0, \old(SKIP2)=0, \old(Suspended)=0, \old(UNLOADED)=0, compFptr=0, compRegistered=1, customIrp=0, d=-4, DC=2, DeviceUsageTypePaging=1, devobj=-3, Executive=0, IPC=7, irp=-2, irp_choice=0, KernelMode=0, lowerDriverReturn=0, MPR1=5, MPR3=6, myStatus=-1073741637, NP=1, pended=1, pirp=-2, pirp__IoStatus__Status=-1073741637, routine=0, s=7, setEventCalled=0, SKIP1=3, SKIP2=4, status=0, Suspended=5, tmp_ndt_1=2, UNLOADED=0, we_should_unload=0] [L1857] COND FALSE !(pended != 1) VAL [\old(compFptr)=0, \old(compRegistered)=0, \old(customIrp)=0, \old(DC)=0, \old(DeviceUsageTypePaging)=0, \old(Executive)=0, \old(IPC)=0, \old(KernelMode)=0, \old(lowerDriverReturn)=0, \old(MPR1)=0, \old(MPR3)=0, \old(myStatus)=0, \old(NP)=0, \old(pended)=0, \old(pirp)=0, \old(routine)=0, \old(s)=0, \old(setEventCalled)=0, \old(SKIP1)=0, \old(SKIP2)=0, \old(Suspended)=0, \old(UNLOADED)=0, compFptr=0, compRegistered=1, customIrp=0, d=-4, DC=2, DeviceUsageTypePaging=1, devobj=-3, Executive=0, IPC=7, irp=-2, irp_choice=0, KernelMode=0, lowerDriverReturn=0, MPR1=5, MPR3=6, myStatus=-1073741637, NP=1, pended=1, pirp=-2, pirp__IoStatus__Status=-1073741637, routine=0, s=7, setEventCalled=0, SKIP1=3, SKIP2=4, status=0, Suspended=5, tmp_ndt_1=2, UNLOADED=0, we_should_unload=0] [L1869] COND TRUE status != 259 VAL [\old(compFptr)=0, \old(compRegistered)=0, \old(customIrp)=0, \old(DC)=0, \old(DeviceUsageTypePaging)=0, \old(Executive)=0, \old(IPC)=0, \old(KernelMode)=0, \old(lowerDriverReturn)=0, \old(MPR1)=0, \old(MPR3)=0, \old(myStatus)=0, \old(NP)=0, \old(pended)=0, \old(pirp)=0, \old(routine)=0, \old(s)=0, \old(setEventCalled)=0, \old(SKIP1)=0, \old(SKIP2)=0, \old(Suspended)=0, \old(UNLOADED)=0, compFptr=0, compRegistered=1, customIrp=0, d=-4, DC=2, DeviceUsageTypePaging=1, devobj=-3, Executive=0, IPC=7, irp=-2, irp_choice=0, KernelMode=0, lowerDriverReturn=0, MPR1=5, MPR3=6, myStatus=-1073741637, NP=1, pended=1, pirp=-2, pirp__IoStatus__Status=-1073741637, routine=0, s=7, setEventCalled=0, SKIP1=3, SKIP2=4, status=0, Suspended=5, tmp_ndt_1=2, UNLOADED=0, we_should_unload=0] [L1871] CALL errorFn() VAL [\old(compFptr)=0, \old(compRegistered)=0, \old(customIrp)=0, \old(DC)=0, \old(DeviceUsageTypePaging)=0, \old(Executive)=0, \old(IPC)=0, \old(KernelMode)=0, \old(lowerDriverReturn)=0, \old(MPR1)=0, \old(MPR3)=0, \old(myStatus)=0, \old(NP)=0, \old(pended)=0, \old(pirp)=0, \old(routine)=0, \old(s)=0, \old(setEventCalled)=0, \old(SKIP1)=0, \old(SKIP2)=0, \old(Suspended)=0, \old(UNLOADED)=0, compFptr=0, compRegistered=1, customIrp=0, DC=2, DeviceUsageTypePaging=1, Executive=0, IPC=7, KernelMode=0, lowerDriverReturn=0, MPR1=5, MPR3=6, myStatus=-1073741637, NP=1, pended=1, pirp=-2, routine=0, s=7, setEventCalled=0, SKIP1=3, SKIP2=4, Suspended=5, UNLOADED=0] [L59] reach_error() VAL [\old(compFptr)=0, \old(compRegistered)=0, \old(customIrp)=0, \old(DC)=0, \old(DeviceUsageTypePaging)=0, \old(Executive)=0, \old(IPC)=0, \old(KernelMode)=0, \old(lowerDriverReturn)=0, \old(MPR1)=0, \old(MPR3)=0, \old(myStatus)=0, \old(NP)=0, \old(pended)=0, \old(pirp)=0, \old(routine)=0, \old(s)=0, \old(setEventCalled)=0, \old(SKIP1)=0, \old(SKIP2)=0, \old(Suspended)=0, \old(UNLOADED)=0, compFptr=0, compRegistered=1, customIrp=0, DC=2, DeviceUsageTypePaging=1, Executive=0, IPC=7, KernelMode=0, lowerDriverReturn=0, MPR1=5, MPR3=6, myStatus=-1073741637, NP=1, pended=1, pirp=-2, routine=0, s=7, setEventCalled=0, SKIP1=3, SKIP2=4, Suspended=5, UNLOADED=0] - UnprovableResult [Line: 1717]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data CFG has 31 procedures, 521 locations, 2 error locations. Started 1 CEGAR loops. OverallTime: 159051.6ms, OverallIterations: 70, TraceHistogramMax: 2, EmptinessCheckTime: 120.4ms, AutomataDifference: 141370.3ms, DeadEndRemovalTime: 0.0ms, HoareAnnotationTime: 0.0ms, InitialAbstractionConstructionTime: 17.9ms, PartialOrderReductionTime: 0.0ms, HoareTripleCheckerStatistics: 40058 SDtfs, 74308 SDslu, 98915 SDs, 0 SdLazy, 175712 SolverSat, 26281 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 104063.5ms Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 1883 GetRequests, 769 SyntacticMatches, 2 SemanticMatches, 1112 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2773 ImplicationChecksByTransitivity, 23046.4ms Time, 0.0ms BasicInterpolantAutomatonTime, BiggestAbstraction: size=1095occurred in iteration=66, InterpolantAutomatonStates: 913, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0ms DumpTime, AutomataMinimizationStatistics: 756.9ms AutomataMinimizationTime, 69 MinimizatonAttempts, 8926 StatesRemovedByMinimization, 69 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 200.1ms SsaConstructionTime, 591.5ms SatisfiabilityAnalysisTime, 15130.7ms InterpolantComputationTime, 4193 NumberOfCodeBlocks, 4193 NumberOfCodeBlocksAsserted, 71 NumberOfCheckSat, 4050 ConstructedInterpolants, 0 QuantifiedInterpolants, 22435 SizeOfPredicates, 4 NumberOfNonLiveVariables, 871 ConjunctsInSsa, 6 ConjunctsInUnsatCore, 70 InterpolantComputations, 68 PerfectInterpolantSequences, 5/8 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2021-08-27 07:49:55,950 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... ### Bit-precise run ### This is Ultimate 0.2.1-dev-20ed64e [2021-08-27 07:49:57,461 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-08-27 07:49:57,462 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-08-27 07:49:57,495 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-08-27 07:49:57,495 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-08-27 07:49:57,498 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-08-27 07:49:57,499 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-08-27 07:49:57,514 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-08-27 07:49:57,516 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-08-27 07:49:57,520 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-08-27 07:49:57,521 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-08-27 07:49:57,524 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-08-27 07:49:57,525 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-08-27 07:49:57,526 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-08-27 07:49:57,527 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-08-27 07:49:57,528 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-08-27 07:49:57,531 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-08-27 07:49:57,532 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-08-27 07:49:57,532 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-08-27 07:49:57,534 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-08-27 07:49:57,536 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-08-27 07:49:57,537 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-08-27 07:49:57,538 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-08-27 07:49:57,539 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-08-27 07:49:57,542 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-08-27 07:49:57,542 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-08-27 07:49:57,543 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-08-27 07:49:57,543 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-08-27 07:49:57,544 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-08-27 07:49:57,545 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-08-27 07:49:57,545 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-08-27 07:49:57,546 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-08-27 07:49:57,547 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-08-27 07:49:57,547 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-08-27 07:49:57,548 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-08-27 07:49:57,548 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-08-27 07:49:57,549 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-08-27 07:49:57,549 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-08-27 07:49:57,549 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-08-27 07:49:57,550 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-08-27 07:49:57,551 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-08-27 07:49:57,551 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf [2021-08-27 07:49:57,577 INFO L113 SettingsManager]: Loading preferences was successful [2021-08-27 07:49:57,577 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-08-27 07:49:57,578 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-08-27 07:49:57,578 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-08-27 07:49:57,580 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-08-27 07:49:57,580 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-08-27 07:49:57,580 INFO L138 SettingsManager]: * Use SBE=true [2021-08-27 07:49:57,580 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-08-27 07:49:57,580 INFO L138 SettingsManager]: * sizeof long=4 [2021-08-27 07:49:57,580 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2021-08-27 07:49:57,581 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-08-27 07:49:57,581 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-08-27 07:49:57,581 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-08-27 07:49:57,581 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2021-08-27 07:49:57,581 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2021-08-27 07:49:57,582 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2021-08-27 07:49:57,582 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-08-27 07:49:57,582 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2021-08-27 07:49:57,582 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2021-08-27 07:49:57,582 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2021-08-27 07:49:57,582 INFO L138 SettingsManager]: * sizeof long double=12 [2021-08-27 07:49:57,582 INFO L138 SettingsManager]: * Use constant arrays=true [2021-08-27 07:49:57,583 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-08-27 07:49:57,583 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-08-27 07:49:57,583 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-08-27 07:49:57,583 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-08-27 07:49:57,583 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-08-27 07:49:57,583 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-08-27 07:49:57,583 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2021-08-27 07:49:57,584 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2021-08-27 07:49:57,584 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-08-27 07:49:57,584 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2021-08-27 07:49:57,584 INFO L138 SettingsManager]: * Logic for external solver=AUFBV WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release 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 -> 602ea7c33e3d58a05b038901c89b84d09b02e08d [2021-08-27 07:49:57,813 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-08-27 07:49:57,834 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-08-27 07:49:57,836 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-08-27 07:49:57,837 INFO L271 PluginConnector]: Initializing CDTParser... [2021-08-27 07:49:57,838 INFO L275 PluginConnector]: CDTParser initialized [2021-08-27 07:49:57,838 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/ntdrivers-simplified/cdaudio_simpl1.cil-1.c [2021-08-27 07:49:57,889 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0f08d2d48/e419816619354438a9b6b13983113161/FLAG9142b8d99 [2021-08-27 07:49:58,281 INFO L306 CDTParser]: Found 1 translation units. [2021-08-27 07:49:58,282 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ntdrivers-simplified/cdaudio_simpl1.cil-1.c [2021-08-27 07:49:58,296 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0f08d2d48/e419816619354438a9b6b13983113161/FLAG9142b8d99 [2021-08-27 07:49:58,305 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0f08d2d48/e419816619354438a9b6b13983113161 [2021-08-27 07:49:58,309 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-08-27 07:49:58,311 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2021-08-27 07:49:58,312 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-08-27 07:49:58,312 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-08-27 07:49:58,314 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-08-27 07:49:58,315 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.08 07:49:58" (1/1) ... [2021-08-27 07:49:58,316 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5bf36392 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 07:49:58, skipping insertion in model container [2021-08-27 07:49:58,316 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.08 07:49:58" (1/1) ... [2021-08-27 07:49:58,320 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-08-27 07:49:58,369 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-08-27 07:49:58,519 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ntdrivers-simplified/cdaudio_simpl1.cil-1.c[2074,2087] [2021-08-27 07:49:58,644 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-08-27 07:49:58,651 INFO L203 MainTranslator]: Completed pre-run [2021-08-27 07:49:58,673 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ntdrivers-simplified/cdaudio_simpl1.cil-1.c[2074,2087] [2021-08-27 07:49:58,745 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-08-27 07:49:58,772 INFO L208 MainTranslator]: Completed translation [2021-08-27 07:49:58,773 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 07:49:58 WrapperNode [2021-08-27 07:49:58,773 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-08-27 07:49:58,774 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-08-27 07:49:58,774 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-08-27 07:49:58,774 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-08-27 07:49:58,780 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 07:49:58" (1/1) ... [2021-08-27 07:49:58,781 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 07:49:58" (1/1) ... [2021-08-27 07:49:58,806 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 07:49:58" (1/1) ... [2021-08-27 07:49:58,812 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 07:49:58" (1/1) ... [2021-08-27 07:49:58,852 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 07:49:58" (1/1) ... [2021-08-27 07:49:58,859 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 07:49:58" (1/1) ... [2021-08-27 07:49:58,875 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 07:49:58" (1/1) ... [2021-08-27 07:49:58,880 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-08-27 07:49:58,881 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-08-27 07:49:58,881 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-08-27 07:49:58,881 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-08-27 07:49:58,882 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 07:49:58" (1/1) ... [2021-08-27 07:49:58,887 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-08-27 07:49:58,891 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 07:49:58,899 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2021-08-27 07:49:58,920 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2021-08-27 07:49:58,933 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2021-08-27 07:49:58,933 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-08-27 07:49:58,934 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2021-08-27 07:49:58,934 INFO L138 BoogieDeclarations]: Found implementation of procedure errorFn [2021-08-27 07:49:58,934 INFO L138 BoogieDeclarations]: Found implementation of procedure _BLAST_init [2021-08-27 07:49:58,934 INFO L138 BoogieDeclarations]: Found implementation of procedure SendSrbSynchronous [2021-08-27 07:49:58,935 INFO L138 BoogieDeclarations]: Found implementation of procedure CdAudioSignalCompletion [2021-08-27 07:49:58,936 INFO L138 BoogieDeclarations]: Found implementation of procedure CdAudioStartDevice [2021-08-27 07:49:58,936 INFO L138 BoogieDeclarations]: Found implementation of procedure CdAudioPnp [2021-08-27 07:49:58,936 INFO L138 BoogieDeclarations]: Found implementation of procedure CdAudioDeviceControl [2021-08-27 07:49:58,936 INFO L138 BoogieDeclarations]: Found implementation of procedure CdAudioSendToNextDriver [2021-08-27 07:49:58,936 INFO L138 BoogieDeclarations]: Found implementation of procedure CdAudioIsPlayActive [2021-08-27 07:49:58,936 INFO L138 BoogieDeclarations]: Found implementation of procedure CdAudio535DeviceControl [2021-08-27 07:49:58,936 INFO L138 BoogieDeclarations]: Found implementation of procedure AG_SetStatusAndReturn [2021-08-27 07:49:58,937 INFO L138 BoogieDeclarations]: Found implementation of procedure CdAudio435DeviceControl [2021-08-27 07:49:58,937 INFO L138 BoogieDeclarations]: Found implementation of procedure CdAudioAtapiDeviceControl [2021-08-27 07:49:58,937 INFO L138 BoogieDeclarations]: Found implementation of procedure HpCdrProcessLastSession [2021-08-27 07:49:58,937 INFO L138 BoogieDeclarations]: Found implementation of procedure HPCdrCompletion [2021-08-27 07:49:58,937 INFO L138 BoogieDeclarations]: Found implementation of procedure CdAudioHPCdrDeviceControl [2021-08-27 07:49:58,937 INFO L138 BoogieDeclarations]: Found implementation of procedure CdAudioForwardIrpSynchronous [2021-08-27 07:49:58,937 INFO L138 BoogieDeclarations]: Found implementation of procedure CdAudioUnload [2021-08-27 07:49:58,938 INFO L138 BoogieDeclarations]: Found implementation of procedure CdAudioPower [2021-08-27 07:49:58,938 INFO L138 BoogieDeclarations]: Found implementation of procedure stub_driver_init [2021-08-27 07:49:58,938 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2021-08-27 07:49:58,938 INFO L138 BoogieDeclarations]: Found implementation of procedure stubMoreProcessingRequired [2021-08-27 07:49:58,938 INFO L138 BoogieDeclarations]: Found implementation of procedure IofCallDriver [2021-08-27 07:49:58,938 INFO L138 BoogieDeclarations]: Found implementation of procedure IofCompleteRequest [2021-08-27 07:49:58,938 INFO L138 BoogieDeclarations]: Found implementation of procedure KeSetEvent [2021-08-27 07:49:58,939 INFO L138 BoogieDeclarations]: Found implementation of procedure KeWaitForSingleObject [2021-08-27 07:49:58,939 INFO L138 BoogieDeclarations]: Found implementation of procedure PoCallDriver [2021-08-27 07:49:58,939 INFO L138 BoogieDeclarations]: Found implementation of procedure ZwClose [2021-08-27 07:49:58,939 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2021-08-27 07:49:58,939 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2021-08-27 07:49:58,939 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2021-08-27 07:49:58,939 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-08-27 07:49:58,940 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_char [2021-08-27 07:49:58,940 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2021-08-27 07:49:58,940 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_long [2021-08-27 07:49:58,940 INFO L130 BoogieDeclarations]: Found specification of procedure SendSrbSynchronous [2021-08-27 07:49:58,940 INFO L130 BoogieDeclarations]: Found specification of procedure CdAudioSignalCompletion [2021-08-27 07:49:58,940 INFO L130 BoogieDeclarations]: Found specification of procedure CdAudioStartDevice [2021-08-27 07:49:58,940 INFO L130 BoogieDeclarations]: Found specification of procedure CdAudioPnp [2021-08-27 07:49:58,941 INFO L130 BoogieDeclarations]: Found specification of procedure CdAudioDeviceControl [2021-08-27 07:49:58,941 INFO L130 BoogieDeclarations]: Found specification of procedure CdAudioSendToNextDriver [2021-08-27 07:49:58,941 INFO L130 BoogieDeclarations]: Found specification of procedure CdAudioIsPlayActive [2021-08-27 07:49:58,941 INFO L130 BoogieDeclarations]: Found specification of procedure CdAudio535DeviceControl [2021-08-27 07:49:58,942 INFO L130 BoogieDeclarations]: Found specification of procedure AG_SetStatusAndReturn [2021-08-27 07:49:58,942 INFO L130 BoogieDeclarations]: Found specification of procedure CdAudio435DeviceControl [2021-08-27 07:49:58,942 INFO L130 BoogieDeclarations]: Found specification of procedure CdAudioAtapiDeviceControl [2021-08-27 07:49:58,942 INFO L130 BoogieDeclarations]: Found specification of procedure HPCdrCompletion [2021-08-27 07:49:58,942 INFO L130 BoogieDeclarations]: Found specification of procedure CdAudioHPCdrDeviceControl [2021-08-27 07:49:58,942 INFO L130 BoogieDeclarations]: Found specification of procedure CdAudioForwardIrpSynchronous [2021-08-27 07:49:58,943 INFO L130 BoogieDeclarations]: Found specification of procedure CdAudioPower [2021-08-27 07:49:58,943 INFO L130 BoogieDeclarations]: Found specification of procedure IofCallDriver [2021-08-27 07:49:58,943 INFO L130 BoogieDeclarations]: Found specification of procedure KeSetEvent [2021-08-27 07:49:58,943 INFO L130 BoogieDeclarations]: Found specification of procedure KeWaitForSingleObject [2021-08-27 07:49:58,943 INFO L130 BoogieDeclarations]: Found specification of procedure PoCallDriver [2021-08-27 07:49:58,943 INFO L130 BoogieDeclarations]: Found specification of procedure ZwClose [2021-08-27 07:49:58,943 INFO L130 BoogieDeclarations]: Found specification of procedure IofCompleteRequest [2021-08-27 07:49:58,944 INFO L130 BoogieDeclarations]: Found specification of procedure errorFn [2021-08-27 07:49:58,944 INFO L130 BoogieDeclarations]: Found specification of procedure _BLAST_init [2021-08-27 07:49:58,944 INFO L130 BoogieDeclarations]: Found specification of procedure HpCdrProcessLastSession [2021-08-27 07:49:58,945 INFO L130 BoogieDeclarations]: Found specification of procedure CdAudioUnload [2021-08-27 07:49:58,945 INFO L130 BoogieDeclarations]: Found specification of procedure stub_driver_init [2021-08-27 07:49:58,945 INFO L130 BoogieDeclarations]: Found specification of procedure main [2021-08-27 07:49:58,946 INFO L130 BoogieDeclarations]: Found specification of procedure stubMoreProcessingRequired [2021-08-27 07:49:58,946 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2021-08-27 07:49:58,946 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2021-08-27 07:49:58,946 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-08-27 07:49:58,946 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1 [2021-08-27 07:49:58,947 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1 [2021-08-27 07:49:58,947 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-08-27 07:49:59,330 WARN L805 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2021-08-27 07:49:59,375 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##15: assume !false; [2021-08-27 07:49:59,375 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##14: assume false; [2021-08-27 07:49:59,378 WARN L805 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2021-08-27 07:49:59,405 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##18: assume !false; [2021-08-27 07:49:59,405 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##17: assume false; [2021-08-27 07:49:59,418 WARN L805 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2021-08-27 07:49:59,429 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##16: assume !false; [2021-08-27 07:49:59,429 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##15: assume false; [2021-08-27 07:49:59,464 WARN L805 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2021-08-27 07:49:59,487 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##6: assume !false; [2021-08-27 07:49:59,487 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint L305: #res := 0bv32; [2021-08-27 07:49:59,487 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##5: assume false; [2021-08-27 07:49:59,495 WARN L805 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2021-08-27 07:49:59,620 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##21: assume false; [2021-08-27 07:49:59,621 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##22: assume !false; [2021-08-27 07:49:59,621 WARN L805 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2021-08-27 07:49:59,649 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##21: assume !false; [2021-08-27 07:49:59,650 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##20: assume false; [2021-08-27 07:49:59,685 WARN L805 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2021-08-27 07:49:59,705 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##10: assume !false; [2021-08-27 07:49:59,706 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##9: assume false; [2021-08-27 07:49:59,708 WARN L805 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2021-08-27 07:49:59,849 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##26: assume !false; [2021-08-27 07:49:59,849 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##25: assume false; [2021-08-27 07:49:59,858 WARN L805 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2021-08-27 07:49:59,861 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##4: assume !false; [2021-08-27 07:49:59,862 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##3: assume false; [2021-08-27 07:49:59,886 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-08-27 07:49:59,887 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2021-08-27 07:49:59,890 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.08 07:49:59 BoogieIcfgContainer [2021-08-27 07:49:59,891 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-08-27 07:49:59,893 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-08-27 07:49:59,893 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-08-27 07:49:59,895 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-08-27 07:49:59,895 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.08 07:49:58" (1/3) ... [2021-08-27 07:49:59,896 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3bfceb69 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.08 07:49:59, skipping insertion in model container [2021-08-27 07:49:59,896 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 07:49:58" (2/3) ... [2021-08-27 07:49:59,896 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3bfceb69 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.08 07:49:59, skipping insertion in model container [2021-08-27 07:49:59,897 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.08 07:49:59" (3/3) ... [2021-08-27 07:49:59,899 INFO L111 eAbstractionObserver]: Analyzing ICFG cdaudio_simpl1.cil-1.c [2021-08-27 07:49:59,902 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-08-27 07:49:59,902 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2021-08-27 07:49:59,934 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2021-08-27 07:49:59,942 INFO L339 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=false, mConcurrency=FINITE_AUTOMATA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=All, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mLoopAccelerationTechnique=FAST_UPR [2021-08-27 07:49:59,942 INFO L340 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2021-08-27 07:49:59,960 INFO L276 IsEmpty]: Start isEmpty. Operand has 518 states, 383 states have (on average 1.4908616187989556) internal successors, (571), 405 states have internal predecessors, (571), 103 states have call successors, (103), 29 states have call predecessors, (103), 29 states have return successors, (103), 98 states have call predecessors, (103), 103 states have call successors, (103) [2021-08-27 07:49:59,964 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2021-08-27 07:49:59,964 INFO L504 BasicCegarLoop]: Found error trace [2021-08-27 07:49:59,965 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-27 07:49:59,965 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting mainErr0ENSURES_VIOLATIONMEMORY_LEAK === [mainErr0ENSURES_VIOLATIONMEMORY_LEAK, errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2021-08-27 07:49:59,968 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 07:49:59,968 INFO L82 PathProgramCache]: Analyzing trace with hash 633313405, now seen corresponding path program 1 times [2021-08-27 07:49:59,975 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-08-27 07:49:59,975 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1043041500] [2021-08-27 07:49:59,975 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 07:49:59,976 INFO L170 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-08-27 07:49:59,976 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-08-27 07:49:59,977 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-08-27 07:50:00,028 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2021-08-27 07:50:00,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:50:00,209 INFO L263 TraceCheckSpWp]: Trace formula consists of 237 conjuncts, 1 conjunts are in the unsatisfiable core [2021-08-27 07:50:00,212 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-27 07:50:00,307 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 07:50:00,308 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-08-27 07:50:00,357 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 07:50:00,358 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-08-27 07:50:00,358 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1043041500] [2021-08-27 07:50:00,359 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1043041500] provided 2 perfect and 0 imperfect interpolant sequences [2021-08-27 07:50:00,359 INFO L186 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2021-08-27 07:50:00,359 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1, 1] imperfect sequences [] total 1 [2021-08-27 07:50:00,360 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [686952613] [2021-08-27 07:50:00,364 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2021-08-27 07:50:00,365 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-08-27 07:50:00,373 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2021-08-27 07:50:00,373 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2021-08-27 07:50:00,376 INFO L87 Difference]: Start difference. First operand has 518 states, 383 states have (on average 1.4908616187989556) internal successors, (571), 405 states have internal predecessors, (571), 103 states have call successors, (103), 29 states have call predecessors, (103), 29 states have return successors, (103), 98 states have call predecessors, (103), 103 states have call successors, (103) Second operand has 2 states, 1 states have (on average 10.0) internal successors, (10), 2 states have internal predecessors, (10), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2021-08-27 07:50:00,423 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 07:50:00,423 INFO L93 Difference]: Finished difference Result 515 states and 755 transitions. [2021-08-27 07:50:00,424 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2021-08-27 07:50:00,424 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 1 states have (on average 10.0) internal successors, (10), 2 states have internal predecessors, (10), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 15 [2021-08-27 07:50:00,425 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-27 07:50:00,434 INFO L225 Difference]: With dead ends: 515 [2021-08-27 07:50:00,434 INFO L226 Difference]: Without dead ends: 509 [2021-08-27 07:50:00,435 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0ms TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2021-08-27 07:50:00,445 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 509 states. [2021-08-27 07:50:00,483 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 509 to 509. [2021-08-27 07:50:00,485 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 509 states, 378 states have (on average 1.4603174603174602) internal successors, (552), 397 states have internal predecessors, (552), 103 states have call successors, (103), 29 states have call predecessors, (103), 27 states have return successors, (86), 86 states have call predecessors, (86), 86 states have call successors, (86) [2021-08-27 07:50:00,489 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 509 states to 509 states and 741 transitions. [2021-08-27 07:50:00,490 INFO L78 Accepts]: Start accepts. Automaton has 509 states and 741 transitions. Word has length 15 [2021-08-27 07:50:00,490 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-27 07:50:00,490 INFO L470 AbstractCegarLoop]: Abstraction has 509 states and 741 transitions. [2021-08-27 07:50:00,493 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 1 states have (on average 10.0) internal successors, (10), 2 states have internal predecessors, (10), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2021-08-27 07:50:00,494 INFO L276 IsEmpty]: Start isEmpty. Operand 509 states and 741 transitions. [2021-08-27 07:50:00,494 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2021-08-27 07:50:00,494 INFO L504 BasicCegarLoop]: Found error trace [2021-08-27 07:50:00,494 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-27 07:50:00,506 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (2)] Forceful destruction successful, exit code 0 [2021-08-27 07:50:00,704 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-08-27 07:50:00,704 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK === [mainErr0ENSURES_VIOLATIONMEMORY_LEAK, errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2021-08-27 07:50:00,705 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 07:50:00,705 INFO L82 PathProgramCache]: Analyzing trace with hash -1738610777, now seen corresponding path program 1 times [2021-08-27 07:50:00,705 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-08-27 07:50:00,705 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [483780156] [2021-08-27 07:50:00,706 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 07:50:00,706 INFO L170 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-08-27 07:50:00,706 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-08-27 07:50:00,707 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-08-27 07:50:00,724 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2021-08-27 07:50:00,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:50:00,922 INFO L263 TraceCheckSpWp]: Trace formula consists of 243 conjuncts, 2 conjunts are in the unsatisfiable core [2021-08-27 07:50:00,924 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-27 07:50:01,007 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 07:50:01,007 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-08-27 07:50:01,079 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 07:50:01,079 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-08-27 07:50:01,079 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [483780156] [2021-08-27 07:50:01,079 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [483780156] provided 2 perfect and 0 imperfect interpolant sequences [2021-08-27 07:50:01,079 INFO L186 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2021-08-27 07:50:01,079 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2021-08-27 07:50:01,080 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1135947468] [2021-08-27 07:50:01,080 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-08-27 07:50:01,081 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-08-27 07:50:01,081 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-08-27 07:50:01,081 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-27 07:50:01,081 INFO L87 Difference]: Start difference. First operand 509 states and 741 transitions. Second operand has 3 states, 3 states have (on average 4.666666666666667) internal successors, (14), 3 states have internal predecessors, (14), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2021-08-27 07:50:01,168 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 07:50:01,169 INFO L93 Difference]: Finished difference Result 514 states and 747 transitions. [2021-08-27 07:50:01,169 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-08-27 07:50:01,169 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 4.666666666666667) internal successors, (14), 3 states have internal predecessors, (14), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 20 [2021-08-27 07:50:01,169 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-27 07:50:01,171 INFO L225 Difference]: With dead ends: 514 [2021-08-27 07:50:01,172 INFO L226 Difference]: Without dead ends: 509 [2021-08-27 07:50:01,172 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.6ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-27 07:50:01,173 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 509 states. [2021-08-27 07:50:01,187 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 509 to 509. [2021-08-27 07:50:01,187 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 509 states, 378 states have (on average 1.4576719576719577) internal successors, (551), 397 states have internal predecessors, (551), 103 states have call successors, (103), 29 states have call predecessors, (103), 27 states have return successors, (86), 86 states have call predecessors, (86), 86 states have call successors, (86) [2021-08-27 07:50:01,190 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 509 states to 509 states and 740 transitions. [2021-08-27 07:50:01,190 INFO L78 Accepts]: Start accepts. Automaton has 509 states and 740 transitions. Word has length 20 [2021-08-27 07:50:01,190 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-27 07:50:01,190 INFO L470 AbstractCegarLoop]: Abstraction has 509 states and 740 transitions. [2021-08-27 07:50:01,191 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.666666666666667) internal successors, (14), 3 states have internal predecessors, (14), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2021-08-27 07:50:01,191 INFO L276 IsEmpty]: Start isEmpty. Operand 509 states and 740 transitions. [2021-08-27 07:50:01,191 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2021-08-27 07:50:01,191 INFO L504 BasicCegarLoop]: Found error trace [2021-08-27 07:50:01,192 INFO L512 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] [2021-08-27 07:50:01,199 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (3)] Forceful destruction successful, exit code 0 [2021-08-27 07:50:01,393 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-08-27 07:50:01,393 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK === [mainErr0ENSURES_VIOLATIONMEMORY_LEAK, errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2021-08-27 07:50:01,393 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 07:50:01,393 INFO L82 PathProgramCache]: Analyzing trace with hash 1016281706, now seen corresponding path program 1 times [2021-08-27 07:50:01,394 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-08-27 07:50:01,394 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [168427192] [2021-08-27 07:50:01,394 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 07:50:01,394 INFO L170 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-08-27 07:50:01,394 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-08-27 07:50:01,396 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-08-27 07:50:01,403 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2021-08-27 07:50:01,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:50:01,644 INFO L263 TraceCheckSpWp]: Trace formula consists of 295 conjuncts, 5 conjunts are in the unsatisfiable core [2021-08-27 07:50:01,654 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-27 07:50:02,111 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 07:50:02,111 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-08-27 07:50:02,188 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 07:50:02,189 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-08-27 07:50:02,189 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [168427192] [2021-08-27 07:50:02,189 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [168427192] provided 2 perfect and 0 imperfect interpolant sequences [2021-08-27 07:50:02,189 INFO L186 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2021-08-27 07:50:02,189 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 3] imperfect sequences [] total 5 [2021-08-27 07:50:02,189 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1958666571] [2021-08-27 07:50:02,190 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-08-27 07:50:02,190 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-08-27 07:50:02,192 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-08-27 07:50:02,192 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-08-27 07:50:02,192 INFO L87 Difference]: Start difference. First operand 509 states and 740 transitions. Second operand has 5 states, 5 states have (on average 5.6) internal successors, (28), 5 states have internal predecessors, (28), 5 states have call successors, (8), 5 states have call predecessors, (8), 4 states have return successors, (5), 4 states have call predecessors, (5), 2 states have call successors, (5) [2021-08-27 07:50:02,868 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 07:50:02,868 INFO L93 Difference]: Finished difference Result 675 states and 960 transitions. [2021-08-27 07:50:02,869 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-08-27 07:50:02,869 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 5.6) internal successors, (28), 5 states have internal predecessors, (28), 5 states have call successors, (8), 5 states have call predecessors, (8), 4 states have return successors, (5), 4 states have call predecessors, (5), 2 states have call successors, (5) Word has length 25 [2021-08-27 07:50:02,869 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-27 07:50:02,877 INFO L225 Difference]: With dead ends: 675 [2021-08-27 07:50:02,877 INFO L226 Difference]: Without dead ends: 674 [2021-08-27 07:50:02,878 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 46 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 11.0ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-08-27 07:50:02,879 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 674 states. [2021-08-27 07:50:02,893 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 674 to 654. [2021-08-27 07:50:02,894 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 654 states, 494 states have (on average 1.4129554655870444) internal successors, (698), 501 states have internal predecessors, (698), 112 states have call successors, (112), 40 states have call predecessors, (112), 47 states have return successors, (124), 118 states have call predecessors, (124), 99 states have call successors, (124) [2021-08-27 07:50:02,896 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 654 states to 654 states and 934 transitions. [2021-08-27 07:50:02,897 INFO L78 Accepts]: Start accepts. Automaton has 654 states and 934 transitions. Word has length 25 [2021-08-27 07:50:02,897 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-27 07:50:02,897 INFO L470 AbstractCegarLoop]: Abstraction has 654 states and 934 transitions. [2021-08-27 07:50:02,897 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.6) internal successors, (28), 5 states have internal predecessors, (28), 5 states have call successors, (8), 5 states have call predecessors, (8), 4 states have return successors, (5), 4 states have call predecessors, (5), 2 states have call successors, (5) [2021-08-27 07:50:02,897 INFO L276 IsEmpty]: Start isEmpty. Operand 654 states and 934 transitions. [2021-08-27 07:50:02,898 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2021-08-27 07:50:02,898 INFO L504 BasicCegarLoop]: Found error trace [2021-08-27 07:50:02,899 INFO L512 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, 1, 1, 1] [2021-08-27 07:50:02,909 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (4)] Forceful destruction successful, exit code 0 [2021-08-27 07:50:03,107 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-08-27 07:50:03,108 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK === [mainErr0ENSURES_VIOLATIONMEMORY_LEAK, errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2021-08-27 07:50:03,108 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 07:50:03,108 INFO L82 PathProgramCache]: Analyzing trace with hash -1367852756, now seen corresponding path program 1 times [2021-08-27 07:50:03,109 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-08-27 07:50:03,109 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [58716506] [2021-08-27 07:50:03,109 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 07:50:03,109 INFO L170 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-08-27 07:50:03,109 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-08-27 07:50:03,110 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-08-27 07:50:03,111 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2021-08-27 07:50:03,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:50:03,390 INFO L263 TraceCheckSpWp]: Trace formula consists of 351 conjuncts, 11 conjunts are in the unsatisfiable core [2021-08-27 07:50:03,392 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-27 07:50:03,525 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 07:50:03,526 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-08-27 07:50:03,628 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 07:50:03,629 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-08-27 07:50:03,629 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [58716506] [2021-08-27 07:50:03,629 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [58716506] provided 2 perfect and 0 imperfect interpolant sequences [2021-08-27 07:50:03,629 INFO L186 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2021-08-27 07:50:03,629 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2021-08-27 07:50:03,629 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1454774435] [2021-08-27 07:50:03,630 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-08-27 07:50:03,630 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-08-27 07:50:03,630 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-08-27 07:50:03,630 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-27 07:50:03,630 INFO L87 Difference]: Start difference. First operand 654 states and 934 transitions. Second operand has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 3 states have internal predecessors, (19), 3 states have call successors, (8), 3 states have call predecessors, (8), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2021-08-27 07:50:03,655 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 07:50:03,655 INFO L93 Difference]: Finished difference Result 823 states and 1156 transitions. [2021-08-27 07:50:03,656 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-08-27 07:50:03,656 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 3 states have internal predecessors, (19), 3 states have call successors, (8), 3 states have call predecessors, (8), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) Word has length 30 [2021-08-27 07:50:03,656 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-27 07:50:03,659 INFO L225 Difference]: With dead ends: 823 [2021-08-27 07:50:03,659 INFO L226 Difference]: Without dead ends: 823 [2021-08-27 07:50:03,660 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 58 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.8ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-27 07:50:03,660 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 823 states. [2021-08-27 07:50:03,673 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 823 to 769. [2021-08-27 07:50:03,676 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 769 states, 595 states have (on average 1.411764705882353) internal successors, (840), 597 states have internal predecessors, (840), 114 states have call successors, (114), 46 states have call predecessors, (114), 59 states have return successors, (140), 128 states have call predecessors, (140), 104 states have call successors, (140) [2021-08-27 07:50:03,681 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 769 states to 769 states and 1094 transitions. [2021-08-27 07:50:03,681 INFO L78 Accepts]: Start accepts. Automaton has 769 states and 1094 transitions. Word has length 30 [2021-08-27 07:50:03,681 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-27 07:50:03,682 INFO L470 AbstractCegarLoop]: Abstraction has 769 states and 1094 transitions. [2021-08-27 07:50:03,682 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 3 states have internal predecessors, (19), 3 states have call successors, (8), 3 states have call predecessors, (8), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2021-08-27 07:50:03,682 INFO L276 IsEmpty]: Start isEmpty. Operand 769 states and 1094 transitions. [2021-08-27 07:50:03,688 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2021-08-27 07:50:03,688 INFO L504 BasicCegarLoop]: Found error trace [2021-08-27 07:50:03,688 INFO L512 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, 1, 1, 1, 1] [2021-08-27 07:50:03,699 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (5)] Forceful destruction successful, exit code 0 [2021-08-27 07:50:03,888 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-08-27 07:50:03,889 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK === [mainErr0ENSURES_VIOLATIONMEMORY_LEAK, errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2021-08-27 07:50:03,889 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 07:50:03,889 INFO L82 PathProgramCache]: Analyzing trace with hash -1062919399, now seen corresponding path program 1 times [2021-08-27 07:50:03,890 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-08-27 07:50:03,890 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1625671743] [2021-08-27 07:50:03,890 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 07:50:03,890 INFO L170 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-08-27 07:50:03,890 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-08-27 07:50:03,891 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-08-27 07:50:03,892 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2021-08-27 07:50:04,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:50:04,158 INFO L263 TraceCheckSpWp]: Trace formula consists of 327 conjuncts, 8 conjunts are in the unsatisfiable core [2021-08-27 07:50:04,159 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-27 07:50:04,378 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 07:50:04,379 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-08-27 07:50:04,513 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 07:50:04,513 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-08-27 07:50:04,513 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1625671743] [2021-08-27 07:50:04,514 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1625671743] provided 2 perfect and 0 imperfect interpolant sequences [2021-08-27 07:50:04,514 INFO L186 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2021-08-27 07:50:04,515 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5, 5] imperfect sequences [] total 8 [2021-08-27 07:50:04,515 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [345476282] [2021-08-27 07:50:04,515 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2021-08-27 07:50:04,515 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-08-27 07:50:04,516 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-08-27 07:50:04,516 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2021-08-27 07:50:04,516 INFO L87 Difference]: Start difference. First operand 769 states and 1094 transitions. Second operand has 8 states, 8 states have (on average 4.75) internal successors, (38), 8 states have internal predecessors, (38), 6 states have call successors, (10), 5 states have call predecessors, (10), 5 states have return successors, (5), 5 states have call predecessors, (5), 3 states have call successors, (5) [2021-08-27 07:50:05,399 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 07:50:05,399 INFO L93 Difference]: Finished difference Result 910 states and 1290 transitions. [2021-08-27 07:50:05,400 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-08-27 07:50:05,400 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 4.75) internal successors, (38), 8 states have internal predecessors, (38), 6 states have call successors, (10), 5 states have call predecessors, (10), 5 states have return successors, (5), 5 states have call predecessors, (5), 3 states have call successors, (5) Word has length 31 [2021-08-27 07:50:05,400 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-27 07:50:05,403 INFO L225 Difference]: With dead ends: 910 [2021-08-27 07:50:05,403 INFO L226 Difference]: Without dead ends: 910 [2021-08-27 07:50:05,404 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 55 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 51.2ms TimeCoverageRelationStatistics Valid=29, Invalid=43, Unknown=0, NotChecked=0, Total=72 [2021-08-27 07:50:05,404 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 910 states. [2021-08-27 07:50:05,417 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 910 to 815. [2021-08-27 07:50:05,418 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 815 states, 633 states have (on average 1.4060031595576619) internal successors, (890), 635 states have internal predecessors, (890), 118 states have call successors, (118), 50 states have call predecessors, (118), 63 states have return successors, (154), 132 states have call predecessors, (154), 108 states have call successors, (154) [2021-08-27 07:50:05,421 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 815 states to 815 states and 1162 transitions. [2021-08-27 07:50:05,421 INFO L78 Accepts]: Start accepts. Automaton has 815 states and 1162 transitions. Word has length 31 [2021-08-27 07:50:05,421 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-27 07:50:05,421 INFO L470 AbstractCegarLoop]: Abstraction has 815 states and 1162 transitions. [2021-08-27 07:50:05,422 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 4.75) internal successors, (38), 8 states have internal predecessors, (38), 6 states have call successors, (10), 5 states have call predecessors, (10), 5 states have return successors, (5), 5 states have call predecessors, (5), 3 states have call successors, (5) [2021-08-27 07:50:05,422 INFO L276 IsEmpty]: Start isEmpty. Operand 815 states and 1162 transitions. [2021-08-27 07:50:05,423 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2021-08-27 07:50:05,423 INFO L504 BasicCegarLoop]: Found error trace [2021-08-27 07:50:05,423 INFO L512 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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-27 07:50:05,434 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (6)] Forceful destruction successful, exit code 0 [2021-08-27 07:50:05,632 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-08-27 07:50:05,632 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK === [mainErr0ENSURES_VIOLATIONMEMORY_LEAK, errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2021-08-27 07:50:05,633 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 07:50:05,633 INFO L82 PathProgramCache]: Analyzing trace with hash 1821153895, now seen corresponding path program 1 times [2021-08-27 07:50:05,633 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-08-27 07:50:05,633 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [87741257] [2021-08-27 07:50:05,633 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 07:50:05,633 INFO L170 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-08-27 07:50:05,633 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-08-27 07:50:05,634 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-08-27 07:50:05,637 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (7)] Waiting until timeout for monitored process [2021-08-27 07:50:05,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:50:05,913 INFO L263 TraceCheckSpWp]: Trace formula consists of 346 conjuncts, 5 conjunts are in the unsatisfiable core [2021-08-27 07:50:05,914 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-27 07:50:06,080 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 07:50:06,082 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-08-27 07:50:06,196 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 07:50:06,198 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-08-27 07:50:06,199 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [87741257] [2021-08-27 07:50:06,199 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [87741257] provided 2 perfect and 0 imperfect interpolant sequences [2021-08-27 07:50:06,199 INFO L186 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2021-08-27 07:50:06,199 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 3] imperfect sequences [] total 5 [2021-08-27 07:50:06,199 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [491873887] [2021-08-27 07:50:06,200 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-08-27 07:50:06,205 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-08-27 07:50:06,206 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-08-27 07:50:06,206 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-08-27 07:50:06,206 INFO L87 Difference]: Start difference. First operand 815 states and 1162 transitions. Second operand has 5 states, 5 states have (on average 9.2) internal successors, (46), 5 states have internal predecessors, (46), 5 states have call successors, (12), 5 states have call predecessors, (12), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2021-08-27 07:50:06,683 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 07:50:06,683 INFO L93 Difference]: Finished difference Result 814 states and 1159 transitions. [2021-08-27 07:50:06,683 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-08-27 07:50:06,684 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.2) internal successors, (46), 5 states have internal predecessors, (46), 5 states have call successors, (12), 5 states have call predecessors, (12), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 36 [2021-08-27 07:50:06,684 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-27 07:50:06,687 INFO L225 Difference]: With dead ends: 814 [2021-08-27 07:50:06,687 INFO L226 Difference]: Without dead ends: 814 [2021-08-27 07:50:06,687 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 68 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 10.4ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-08-27 07:50:06,687 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 814 states. [2021-08-27 07:50:06,699 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 814 to 814. [2021-08-27 07:50:06,700 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 814 states, 633 states have (on average 1.4028436018957346) internal successors, (888), 634 states have internal predecessors, (888), 117 states have call successors, (117), 50 states have call predecessors, (117), 63 states have return successors, (154), 132 states have call predecessors, (154), 108 states have call successors, (154) [2021-08-27 07:50:06,702 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 814 states to 814 states and 1159 transitions. [2021-08-27 07:50:06,702 INFO L78 Accepts]: Start accepts. Automaton has 814 states and 1159 transitions. Word has length 36 [2021-08-27 07:50:06,703 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-27 07:50:06,703 INFO L470 AbstractCegarLoop]: Abstraction has 814 states and 1159 transitions. [2021-08-27 07:50:06,703 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.2) internal successors, (46), 5 states have internal predecessors, (46), 5 states have call successors, (12), 5 states have call predecessors, (12), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2021-08-27 07:50:06,703 INFO L276 IsEmpty]: Start isEmpty. Operand 814 states and 1159 transitions. [2021-08-27 07:50:06,704 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2021-08-27 07:50:06,704 INFO L504 BasicCegarLoop]: Found error trace [2021-08-27 07:50:06,704 INFO L512 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-27 07:50:06,717 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (7)] Forceful destruction successful, exit code 0 [2021-08-27 07:50:06,917 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-08-27 07:50:06,918 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK === [mainErr0ENSURES_VIOLATIONMEMORY_LEAK, errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2021-08-27 07:50:06,918 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 07:50:06,918 INFO L82 PathProgramCache]: Analyzing trace with hash -591738262, now seen corresponding path program 1 times [2021-08-27 07:50:06,918 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-08-27 07:50:06,918 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2147225501] [2021-08-27 07:50:06,919 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 07:50:06,919 INFO L170 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-08-27 07:50:06,919 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-08-27 07:50:06,919 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-08-27 07:50:06,930 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (8)] Waiting until timeout for monitored process [2021-08-27 07:50:07,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:50:07,262 INFO L263 TraceCheckSpWp]: Trace formula consists of 382 conjuncts, 2 conjunts are in the unsatisfiable core [2021-08-27 07:50:07,264 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-27 07:50:07,393 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 07:50:07,393 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-08-27 07:50:07,496 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 07:50:07,497 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-08-27 07:50:07,497 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2147225501] [2021-08-27 07:50:07,497 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2147225501] provided 2 perfect and 0 imperfect interpolant sequences [2021-08-27 07:50:07,497 INFO L186 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2021-08-27 07:50:07,497 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 4 [2021-08-27 07:50:07,497 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1595647588] [2021-08-27 07:50:07,497 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-08-27 07:50:07,498 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-08-27 07:50:07,498 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-08-27 07:50:07,498 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-08-27 07:50:07,499 INFO L87 Difference]: Start difference. First operand 814 states and 1159 transitions. Second operand has 4 states, 4 states have (on average 7.75) internal successors, (31), 4 states have internal predecessors, (31), 4 states have call successors, (11), 4 states have call predecessors, (11), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2021-08-27 07:50:07,573 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 07:50:07,574 INFO L93 Difference]: Finished difference Result 1008 states and 1397 transitions. [2021-08-27 07:50:07,574 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-08-27 07:50:07,574 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 7.75) internal successors, (31), 4 states have internal predecessors, (31), 4 states have call successors, (11), 4 states have call predecessors, (11), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 39 [2021-08-27 07:50:07,574 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-27 07:50:07,577 INFO L225 Difference]: With dead ends: 1008 [2021-08-27 07:50:07,577 INFO L226 Difference]: Without dead ends: 1008 [2021-08-27 07:50:07,578 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 77 GetRequests, 75 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 7.2ms TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-08-27 07:50:07,578 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1008 states. [2021-08-27 07:50:07,590 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1008 to 828. [2021-08-27 07:50:07,591 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 828 states, 651 states have (on average 1.400921658986175) internal successors, (912), 653 states have internal predecessors, (912), 112 states have call successors, (112), 50 states have call predecessors, (112), 64 states have return successors, (149), 127 states have call predecessors, (149), 103 states have call successors, (149) [2021-08-27 07:50:07,594 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 828 states to 828 states and 1173 transitions. [2021-08-27 07:50:07,594 INFO L78 Accepts]: Start accepts. Automaton has 828 states and 1173 transitions. Word has length 39 [2021-08-27 07:50:07,594 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-27 07:50:07,594 INFO L470 AbstractCegarLoop]: Abstraction has 828 states and 1173 transitions. [2021-08-27 07:50:07,594 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 7.75) internal successors, (31), 4 states have internal predecessors, (31), 4 states have call successors, (11), 4 states have call predecessors, (11), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2021-08-27 07:50:07,594 INFO L276 IsEmpty]: Start isEmpty. Operand 828 states and 1173 transitions. [2021-08-27 07:50:07,596 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2021-08-27 07:50:07,596 INFO L504 BasicCegarLoop]: Found error trace [2021-08-27 07:50:07,596 INFO L512 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-27 07:50:07,613 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (8)] Forceful destruction successful, exit code 0 [2021-08-27 07:50:07,808 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-08-27 07:50:07,809 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK === [mainErr0ENSURES_VIOLATIONMEMORY_LEAK, errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2021-08-27 07:50:07,809 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 07:50:07,809 INFO L82 PathProgramCache]: Analyzing trace with hash -1528077449, now seen corresponding path program 1 times [2021-08-27 07:50:07,809 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-08-27 07:50:07,810 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [304779857] [2021-08-27 07:50:07,810 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 07:50:07,810 INFO L170 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-08-27 07:50:07,810 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-08-27 07:50:07,810 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-08-27 07:50:07,811 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (9)] Waiting until timeout for monitored process [2021-08-27 07:50:08,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:50:08,158 INFO L263 TraceCheckSpWp]: Trace formula consists of 357 conjuncts, 15 conjunts are in the unsatisfiable core [2021-08-27 07:50:08,160 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-27 07:50:08,262 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 07:50:08,262 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-08-27 07:50:08,416 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 07:50:08,416 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-08-27 07:50:08,417 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [304779857] [2021-08-27 07:50:08,417 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [304779857] provided 2 perfect and 0 imperfect interpolant sequences [2021-08-27 07:50:08,418 INFO L186 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2021-08-27 07:50:08,418 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2021-08-27 07:50:08,420 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1688526647] [2021-08-27 07:50:08,421 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-08-27 07:50:08,422 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-08-27 07:50:08,422 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-08-27 07:50:08,422 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-27 07:50:08,422 INFO L87 Difference]: Start difference. First operand 828 states and 1173 transitions. Second operand has 3 states, 3 states have (on average 9.333333333333334) internal successors, (28), 3 states have internal predecessors, (28), 3 states have call successors, (9), 3 states have call predecessors, (9), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2021-08-27 07:50:08,446 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 07:50:08,447 INFO L93 Difference]: Finished difference Result 910 states and 1272 transitions. [2021-08-27 07:50:08,447 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-08-27 07:50:08,447 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 9.333333333333334) internal successors, (28), 3 states have internal predecessors, (28), 3 states have call successors, (9), 3 states have call predecessors, (9), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) Word has length 40 [2021-08-27 07:50:08,447 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-27 07:50:08,450 INFO L225 Difference]: With dead ends: 910 [2021-08-27 07:50:08,450 INFO L226 Difference]: Without dead ends: 910 [2021-08-27 07:50:08,451 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 79 GetRequests, 78 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.7ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-27 07:50:08,451 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 910 states. [2021-08-27 07:50:08,462 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 910 to 854. [2021-08-27 07:50:08,464 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 854 states, 675 states have (on average 1.4103703703703703) internal successors, (952), 686 states have internal predecessors, (952), 114 states have call successors, (114), 53 states have call predecessors, (114), 64 states have return successors, (142), 119 states have call predecessors, (142), 106 states have call successors, (142) [2021-08-27 07:50:08,466 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 854 states to 854 states and 1208 transitions. [2021-08-27 07:50:08,467 INFO L78 Accepts]: Start accepts. Automaton has 854 states and 1208 transitions. Word has length 40 [2021-08-27 07:50:08,467 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-27 07:50:08,467 INFO L470 AbstractCegarLoop]: Abstraction has 854 states and 1208 transitions. [2021-08-27 07:50:08,467 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 9.333333333333334) internal successors, (28), 3 states have internal predecessors, (28), 3 states have call successors, (9), 3 states have call predecessors, (9), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2021-08-27 07:50:08,467 INFO L276 IsEmpty]: Start isEmpty. Operand 854 states and 1208 transitions. [2021-08-27 07:50:08,469 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2021-08-27 07:50:08,469 INFO L504 BasicCegarLoop]: Found error trace [2021-08-27 07:50:08,469 INFO L512 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-27 07:50:08,493 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (9)] Forceful destruction successful, exit code 0 [2021-08-27 07:50:08,678 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-08-27 07:50:08,679 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK === [mainErr0ENSURES_VIOLATIONMEMORY_LEAK, errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2021-08-27 07:50:08,679 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 07:50:08,679 INFO L82 PathProgramCache]: Analyzing trace with hash -751837642, now seen corresponding path program 1 times [2021-08-27 07:50:08,680 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-08-27 07:50:08,680 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1807820560] [2021-08-27 07:50:08,680 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 07:50:08,680 INFO L170 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-08-27 07:50:08,680 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-08-27 07:50:08,681 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-08-27 07:50:08,681 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (10)] Waiting until timeout for monitored process [2021-08-27 07:50:09,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:50:09,040 INFO L263 TraceCheckSpWp]: Trace formula consists of 399 conjuncts, 2 conjunts are in the unsatisfiable core [2021-08-27 07:50:09,042 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-27 07:50:09,166 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 07:50:09,167 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-08-27 07:50:09,288 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 07:50:09,288 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-08-27 07:50:09,288 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1807820560] [2021-08-27 07:50:09,288 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1807820560] provided 2 perfect and 0 imperfect interpolant sequences [2021-08-27 07:50:09,289 INFO L186 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2021-08-27 07:50:09,289 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 4] imperfect sequences [] total 5 [2021-08-27 07:50:09,289 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [778949181] [2021-08-27 07:50:09,289 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-08-27 07:50:09,289 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-08-27 07:50:09,290 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-08-27 07:50:09,290 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2021-08-27 07:50:09,290 INFO L87 Difference]: Start difference. First operand 854 states and 1208 transitions. Second operand has 5 states, 5 states have (on average 8.2) internal successors, (41), 5 states have internal predecessors, (41), 4 states have call successors, (11), 3 states have call predecessors, (11), 3 states have return successors, (5), 2 states have call predecessors, (5), 3 states have call successors, (5) [2021-08-27 07:50:09,613 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 07:50:09,613 INFO L93 Difference]: Finished difference Result 766 states and 1066 transitions. [2021-08-27 07:50:09,614 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-08-27 07:50:09,614 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 8.2) internal successors, (41), 5 states have internal predecessors, (41), 4 states have call successors, (11), 3 states have call predecessors, (11), 3 states have return successors, (5), 2 states have call predecessors, (5), 3 states have call successors, (5) Word has length 47 [2021-08-27 07:50:09,614 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-27 07:50:09,616 INFO L225 Difference]: With dead ends: 766 [2021-08-27 07:50:09,616 INFO L226 Difference]: Without dead ends: 766 [2021-08-27 07:50:09,616 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 93 GetRequests, 90 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 7.0ms TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2021-08-27 07:50:09,617 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 766 states. [2021-08-27 07:50:09,627 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 766 to 732. [2021-08-27 07:50:09,628 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 732 states, 572 states have (on average 1.4038461538461537) internal successors, (803), 583 states have internal predecessors, (803), 106 states have call successors, (106), 46 states have call predecessors, (106), 53 states have return successors, (119), 107 states have call predecessors, (119), 98 states have call successors, (119) [2021-08-27 07:50:09,630 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 732 states to 732 states and 1028 transitions. [2021-08-27 07:50:09,630 INFO L78 Accepts]: Start accepts. Automaton has 732 states and 1028 transitions. Word has length 47 [2021-08-27 07:50:09,630 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-27 07:50:09,630 INFO L470 AbstractCegarLoop]: Abstraction has 732 states and 1028 transitions. [2021-08-27 07:50:09,631 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.2) internal successors, (41), 5 states have internal predecessors, (41), 4 states have call successors, (11), 3 states have call predecessors, (11), 3 states have return successors, (5), 2 states have call predecessors, (5), 3 states have call successors, (5) [2021-08-27 07:50:09,631 INFO L276 IsEmpty]: Start isEmpty. Operand 732 states and 1028 transitions. [2021-08-27 07:50:09,633 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2021-08-27 07:50:09,633 INFO L504 BasicCegarLoop]: Found error trace [2021-08-27 07:50:09,634 INFO L512 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-27 07:50:09,645 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (10)] Forceful destruction successful, exit code 0 [2021-08-27 07:50:09,843 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-08-27 07:50:09,843 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK === [mainErr0ENSURES_VIOLATIONMEMORY_LEAK, errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2021-08-27 07:50:09,844 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 07:50:09,844 INFO L82 PathProgramCache]: Analyzing trace with hash 1459738846, now seen corresponding path program 1 times [2021-08-27 07:50:09,844 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-08-27 07:50:09,844 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [625906057] [2021-08-27 07:50:09,844 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 07:50:09,845 INFO L170 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-08-27 07:50:09,845 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-08-27 07:50:09,845 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-08-27 07:50:09,873 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (11)] Waiting until timeout for monitored process [2021-08-27 07:50:10,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:50:10,227 INFO L263 TraceCheckSpWp]: Trace formula consists of 360 conjuncts, 2 conjunts are in the unsatisfiable core [2021-08-27 07:50:10,228 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-27 07:50:10,328 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 07:50:10,328 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-08-27 07:50:10,435 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 07:50:10,435 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-08-27 07:50:10,435 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [625906057] [2021-08-27 07:50:10,435 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [625906057] provided 2 perfect and 0 imperfect interpolant sequences [2021-08-27 07:50:10,435 INFO L186 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2021-08-27 07:50:10,435 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2021-08-27 07:50:10,435 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1847037657] [2021-08-27 07:50:10,436 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-08-27 07:50:10,436 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-08-27 07:50:10,436 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-08-27 07:50:10,436 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-27 07:50:10,437 INFO L87 Difference]: Start difference. First operand 732 states and 1028 transitions. Second operand has 3 states, 3 states have (on average 12.0) internal successors, (36), 3 states have internal predecessors, (36), 3 states have call successors, (10), 3 states have call predecessors, (10), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2021-08-27 07:50:10,461 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 07:50:10,461 INFO L93 Difference]: Finished difference Result 756 states and 1052 transitions. [2021-08-27 07:50:10,462 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-08-27 07:50:10,462 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 12.0) internal successors, (36), 3 states have internal predecessors, (36), 3 states have call successors, (10), 3 states have call predecessors, (10), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 47 [2021-08-27 07:50:10,462 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-27 07:50:10,464 INFO L225 Difference]: With dead ends: 756 [2021-08-27 07:50:10,465 INFO L226 Difference]: Without dead ends: 756 [2021-08-27 07:50:10,465 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 93 GetRequests, 92 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.1ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-27 07:50:10,465 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 756 states. [2021-08-27 07:50:10,474 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 756 to 731. [2021-08-27 07:50:10,475 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 731 states, 571 states have (on average 1.4010507880910683) internal successors, (800), 582 states have internal predecessors, (800), 106 states have call successors, (106), 46 states have call predecessors, (106), 53 states have return successors, (117), 107 states have call predecessors, (117), 98 states have call successors, (117) [2021-08-27 07:50:10,477 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 731 states to 731 states and 1023 transitions. [2021-08-27 07:50:10,477 INFO L78 Accepts]: Start accepts. Automaton has 731 states and 1023 transitions. Word has length 47 [2021-08-27 07:50:10,477 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-27 07:50:10,478 INFO L470 AbstractCegarLoop]: Abstraction has 731 states and 1023 transitions. [2021-08-27 07:50:10,478 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 12.0) internal successors, (36), 3 states have internal predecessors, (36), 3 states have call successors, (10), 3 states have call predecessors, (10), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2021-08-27 07:50:10,478 INFO L276 IsEmpty]: Start isEmpty. Operand 731 states and 1023 transitions. [2021-08-27 07:50:10,479 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2021-08-27 07:50:10,479 INFO L504 BasicCegarLoop]: Found error trace [2021-08-27 07:50:10,479 INFO L512 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-27 07:50:10,491 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (11)] Forceful destruction successful, exit code 0 [2021-08-27 07:50:10,689 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-08-27 07:50:10,689 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK === [mainErr0ENSURES_VIOLATIONMEMORY_LEAK, errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2021-08-27 07:50:10,690 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 07:50:10,690 INFO L82 PathProgramCache]: Analyzing trace with hash 1711019189, now seen corresponding path program 1 times [2021-08-27 07:50:10,690 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-08-27 07:50:10,690 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1996496881] [2021-08-27 07:50:10,690 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 07:50:10,690 INFO L170 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-08-27 07:50:10,690 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-08-27 07:50:10,691 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-08-27 07:50:10,693 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (12)] Waiting until timeout for monitored process [2021-08-27 07:50:11,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:50:11,076 INFO L263 TraceCheckSpWp]: Trace formula consists of 334 conjuncts, 6 conjunts are in the unsatisfiable core [2021-08-27 07:50:11,078 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-27 07:50:11,357 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 07:50:11,358 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-08-27 07:50:11,638 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 07:50:11,638 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-08-27 07:50:11,638 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1996496881] [2021-08-27 07:50:11,638 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1996496881] provided 2 perfect and 0 imperfect interpolant sequences [2021-08-27 07:50:11,638 INFO L186 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2021-08-27 07:50:11,638 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6, 7] imperfect sequences [] total 11 [2021-08-27 07:50:11,638 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1284706009] [2021-08-27 07:50:11,639 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2021-08-27 07:50:11,639 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-08-27 07:50:11,639 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-08-27 07:50:11,639 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=74, Unknown=0, NotChecked=0, Total=110 [2021-08-27 07:50:11,639 INFO L87 Difference]: Start difference. First operand 731 states and 1023 transitions. Second operand has 11 states, 11 states have (on average 5.363636363636363) internal successors, (59), 11 states have internal predecessors, (59), 6 states have call successors, (10), 5 states have call predecessors, (10), 7 states have return successors, (9), 5 states have call predecessors, (9), 5 states have call successors, (9) [2021-08-27 07:50:12,886 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 07:50:12,886 INFO L93 Difference]: Finished difference Result 1001 states and 1433 transitions. [2021-08-27 07:50:12,887 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2021-08-27 07:50:12,887 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 5.363636363636363) internal successors, (59), 11 states have internal predecessors, (59), 6 states have call successors, (10), 5 states have call predecessors, (10), 7 states have return successors, (9), 5 states have call predecessors, (9), 5 states have call successors, (9) Word has length 48 [2021-08-27 07:50:12,887 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-27 07:50:12,890 INFO L225 Difference]: With dead ends: 1001 [2021-08-27 07:50:12,890 INFO L226 Difference]: Without dead ends: 1001 [2021-08-27 07:50:12,890 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 101 GetRequests, 86 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 137.6ms TimeCoverageRelationStatistics Valid=89, Invalid=183, Unknown=0, NotChecked=0, Total=272 [2021-08-27 07:50:12,891 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1001 states. [2021-08-27 07:50:12,902 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1001 to 794. [2021-08-27 07:50:12,903 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 794 states, 623 states have (on average 1.3948635634028892) internal successors, (869), 635 states have internal predecessors, (869), 110 states have call successors, (110), 49 states have call predecessors, (110), 60 states have return successors, (131), 114 states have call predecessors, (131), 102 states have call successors, (131) [2021-08-27 07:50:12,905 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 794 states to 794 states and 1110 transitions. [2021-08-27 07:50:12,905 INFO L78 Accepts]: Start accepts. Automaton has 794 states and 1110 transitions. Word has length 48 [2021-08-27 07:50:12,905 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-27 07:50:12,905 INFO L470 AbstractCegarLoop]: Abstraction has 794 states and 1110 transitions. [2021-08-27 07:50:12,906 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 5.363636363636363) internal successors, (59), 11 states have internal predecessors, (59), 6 states have call successors, (10), 5 states have call predecessors, (10), 7 states have return successors, (9), 5 states have call predecessors, (9), 5 states have call successors, (9) [2021-08-27 07:50:12,906 INFO L276 IsEmpty]: Start isEmpty. Operand 794 states and 1110 transitions. [2021-08-27 07:50:12,907 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2021-08-27 07:50:12,907 INFO L504 BasicCegarLoop]: Found error trace [2021-08-27 07:50:12,907 INFO L512 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-27 07:50:12,929 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (12)] Forceful destruction successful, exit code 0 [2021-08-27 07:50:13,117 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-08-27 07:50:13,117 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK === [mainErr0ENSURES_VIOLATIONMEMORY_LEAK, errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2021-08-27 07:50:13,117 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 07:50:13,118 INFO L82 PathProgramCache]: Analyzing trace with hash -17559376, now seen corresponding path program 1 times [2021-08-27 07:50:13,118 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-08-27 07:50:13,118 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1299370746] [2021-08-27 07:50:13,118 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 07:50:13,118 INFO L170 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-08-27 07:50:13,118 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-08-27 07:50:13,119 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-08-27 07:50:13,161 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (13)] Waiting until timeout for monitored process [2021-08-27 07:50:13,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:50:13,556 INFO L263 TraceCheckSpWp]: Trace formula consists of 337 conjuncts, 6 conjunts are in the unsatisfiable core [2021-08-27 07:50:13,558 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-27 07:50:13,894 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 07:50:13,895 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-08-27 07:50:14,215 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 07:50:14,216 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-08-27 07:50:14,216 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1299370746] [2021-08-27 07:50:14,216 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1299370746] provided 2 perfect and 0 imperfect interpolant sequences [2021-08-27 07:50:14,216 INFO L186 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2021-08-27 07:50:14,216 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6, 7] imperfect sequences [] total 11 [2021-08-27 07:50:14,216 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1283012569] [2021-08-27 07:50:14,216 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2021-08-27 07:50:14,217 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-08-27 07:50:14,217 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-08-27 07:50:14,217 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=74, Unknown=0, NotChecked=0, Total=110 [2021-08-27 07:50:14,217 INFO L87 Difference]: Start difference. First operand 794 states and 1110 transitions. Second operand has 11 states, 11 states have (on average 5.7272727272727275) internal successors, (63), 11 states have internal predecessors, (63), 6 states have call successors, (10), 5 states have call predecessors, (10), 7 states have return successors, (9), 5 states have call predecessors, (9), 5 states have call successors, (9) [2021-08-27 07:50:15,673 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 07:50:15,674 INFO L93 Difference]: Finished difference Result 914 states and 1318 transitions. [2021-08-27 07:50:15,674 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-08-27 07:50:15,674 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 5.7272727272727275) internal successors, (63), 11 states have internal predecessors, (63), 6 states have call successors, (10), 5 states have call predecessors, (10), 7 states have return successors, (9), 5 states have call predecessors, (9), 5 states have call successors, (9) Word has length 50 [2021-08-27 07:50:15,674 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-27 07:50:15,677 INFO L225 Difference]: With dead ends: 914 [2021-08-27 07:50:15,677 INFO L226 Difference]: Without dead ends: 914 [2021-08-27 07:50:15,678 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 102 GetRequests, 90 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 127.4ms TimeCoverageRelationStatistics Valid=61, Invalid=121, Unknown=0, NotChecked=0, Total=182 [2021-08-27 07:50:15,678 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 914 states. [2021-08-27 07:50:15,709 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 914 to 792. [2021-08-27 07:50:15,711 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 792 states, 621 states have (on average 1.3896940418679549) internal successors, (863), 633 states have internal predecessors, (863), 110 states have call successors, (110), 49 states have call predecessors, (110), 60 states have return successors, (131), 114 states have call predecessors, (131), 102 states have call successors, (131) [2021-08-27 07:50:15,713 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 792 states to 792 states and 1104 transitions. [2021-08-27 07:50:15,713 INFO L78 Accepts]: Start accepts. Automaton has 792 states and 1104 transitions. Word has length 50 [2021-08-27 07:50:15,713 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-27 07:50:15,713 INFO L470 AbstractCegarLoop]: Abstraction has 792 states and 1104 transitions. [2021-08-27 07:50:15,714 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 5.7272727272727275) internal successors, (63), 11 states have internal predecessors, (63), 6 states have call successors, (10), 5 states have call predecessors, (10), 7 states have return successors, (9), 5 states have call predecessors, (9), 5 states have call successors, (9) [2021-08-27 07:50:15,714 INFO L276 IsEmpty]: Start isEmpty. Operand 792 states and 1104 transitions. [2021-08-27 07:50:15,715 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2021-08-27 07:50:15,715 INFO L504 BasicCegarLoop]: Found error trace [2021-08-27 07:50:15,715 INFO L512 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-27 07:50:15,732 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (13)] Forceful destruction successful, exit code 0 [2021-08-27 07:50:15,932 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-08-27 07:50:15,933 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK === [mainErr0ENSURES_VIOLATIONMEMORY_LEAK, errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2021-08-27 07:50:15,933 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 07:50:15,933 INFO L82 PathProgramCache]: Analyzing trace with hash -1865011280, now seen corresponding path program 1 times [2021-08-27 07:50:15,933 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-08-27 07:50:15,933 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1108045910] [2021-08-27 07:50:15,933 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 07:50:15,933 INFO L170 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-08-27 07:50:15,934 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-08-27 07:50:15,934 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-08-27 07:50:15,936 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (14)] Waiting until timeout for monitored process [2021-08-27 07:50:16,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:50:16,417 INFO L263 TraceCheckSpWp]: Trace formula consists of 336 conjuncts, 2 conjunts are in the unsatisfiable core [2021-08-27 07:50:16,425 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-27 07:50:16,543 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 07:50:16,543 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-08-27 07:50:16,705 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 07:50:16,706 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-08-27 07:50:16,706 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1108045910] [2021-08-27 07:50:16,706 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1108045910] provided 2 perfect and 0 imperfect interpolant sequences [2021-08-27 07:50:16,706 INFO L186 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2021-08-27 07:50:16,706 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2021-08-27 07:50:16,706 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2137389851] [2021-08-27 07:50:16,706 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-08-27 07:50:16,706 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-08-27 07:50:16,707 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-08-27 07:50:16,707 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-27 07:50:16,707 INFO L87 Difference]: Start difference. First operand 792 states and 1104 transitions. Second operand has 3 states, 3 states have (on average 12.666666666666666) internal successors, (38), 3 states have internal predecessors, (38), 2 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (5), 2 states have call predecessors, (5), 1 states have call successors, (5) [2021-08-27 07:50:16,797 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 07:50:16,798 INFO L93 Difference]: Finished difference Result 954 states and 1318 transitions. [2021-08-27 07:50:16,798 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-08-27 07:50:16,798 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 12.666666666666666) internal successors, (38), 3 states have internal predecessors, (38), 2 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (5), 2 states have call predecessors, (5), 1 states have call successors, (5) Word has length 50 [2021-08-27 07:50:16,798 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-27 07:50:16,801 INFO L225 Difference]: With dead ends: 954 [2021-08-27 07:50:16,801 INFO L226 Difference]: Without dead ends: 954 [2021-08-27 07:50:16,802 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 99 GetRequests, 98 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.2ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-27 07:50:16,802 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 954 states. [2021-08-27 07:50:16,813 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 954 to 848. [2021-08-27 07:50:16,814 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 848 states, 663 states have (on average 1.3710407239819005) internal successors, (909), 677 states have internal predecessors, (909), 112 states have call successors, (112), 51 states have call predecessors, (112), 72 states have return successors, (143), 126 states have call predecessors, (143), 104 states have call successors, (143) [2021-08-27 07:50:16,817 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 848 states to 848 states and 1164 transitions. [2021-08-27 07:50:16,817 INFO L78 Accepts]: Start accepts. Automaton has 848 states and 1164 transitions. Word has length 50 [2021-08-27 07:50:16,819 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-27 07:50:16,819 INFO L470 AbstractCegarLoop]: Abstraction has 848 states and 1164 transitions. [2021-08-27 07:50:16,819 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 12.666666666666666) internal successors, (38), 3 states have internal predecessors, (38), 2 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (5), 2 states have call predecessors, (5), 1 states have call successors, (5) [2021-08-27 07:50:16,819 INFO L276 IsEmpty]: Start isEmpty. Operand 848 states and 1164 transitions. [2021-08-27 07:50:16,821 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2021-08-27 07:50:16,821 INFO L504 BasicCegarLoop]: Found error trace [2021-08-27 07:50:16,821 INFO L512 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-27 07:50:16,833 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (14)] Forceful destruction successful, exit code 0 [2021-08-27 07:50:17,028 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-08-27 07:50:17,029 INFO L402 AbstractCegarLoop]: === Iteration 14 === Targeting errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK === [mainErr0ENSURES_VIOLATIONMEMORY_LEAK, errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2021-08-27 07:50:17,029 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 07:50:17,029 INFO L82 PathProgramCache]: Analyzing trace with hash -540904097, now seen corresponding path program 1 times [2021-08-27 07:50:17,029 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-08-27 07:50:17,029 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1035725157] [2021-08-27 07:50:17,030 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 07:50:17,030 INFO L170 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-08-27 07:50:17,030 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-08-27 07:50:17,032 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-08-27 07:50:17,034 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (15)] Waiting until timeout for monitored process [2021-08-27 07:50:17,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:50:17,550 INFO L263 TraceCheckSpWp]: Trace formula consists of 370 conjuncts, 3 conjunts are in the unsatisfiable core [2021-08-27 07:50:17,551 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-27 07:50:17,667 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 07:50:17,667 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-08-27 07:50:17,889 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 07:50:17,889 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-08-27 07:50:17,889 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1035725157] [2021-08-27 07:50:17,889 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1035725157] provided 2 perfect and 0 imperfect interpolant sequences [2021-08-27 07:50:17,889 INFO L186 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2021-08-27 07:50:17,889 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 6 [2021-08-27 07:50:17,889 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [565040805] [2021-08-27 07:50:17,889 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-08-27 07:50:17,889 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-08-27 07:50:17,890 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-08-27 07:50:17,890 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2021-08-27 07:50:17,890 INFO L87 Difference]: Start difference. First operand 848 states and 1164 transitions. Second operand has 6 states, 6 states have (on average 7.333333333333333) internal successors, (44), 6 states have internal predecessors, (44), 2 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2021-08-27 07:50:18,063 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 07:50:18,063 INFO L93 Difference]: Finished difference Result 882 states and 1209 transitions. [2021-08-27 07:50:18,064 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-08-27 07:50:18,064 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 7.333333333333333) internal successors, (44), 6 states have internal predecessors, (44), 2 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) Word has length 52 [2021-08-27 07:50:18,064 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-27 07:50:18,070 INFO L225 Difference]: With dead ends: 882 [2021-08-27 07:50:18,071 INFO L226 Difference]: Without dead ends: 882 [2021-08-27 07:50:18,071 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 105 GetRequests, 99 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 24.7ms TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2021-08-27 07:50:18,072 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 882 states. [2021-08-27 07:50:18,082 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 882 to 854. [2021-08-27 07:50:18,083 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 854 states, 669 states have (on average 1.3721973094170403) internal successors, (918), 683 states have internal predecessors, (918), 112 states have call successors, (112), 51 states have call predecessors, (112), 72 states have return successors, (143), 126 states have call predecessors, (143), 104 states have call successors, (143) [2021-08-27 07:50:18,085 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 854 states to 854 states and 1173 transitions. [2021-08-27 07:50:18,085 INFO L78 Accepts]: Start accepts. Automaton has 854 states and 1173 transitions. Word has length 52 [2021-08-27 07:50:18,085 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-27 07:50:18,085 INFO L470 AbstractCegarLoop]: Abstraction has 854 states and 1173 transitions. [2021-08-27 07:50:18,086 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 7.333333333333333) internal successors, (44), 6 states have internal predecessors, (44), 2 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2021-08-27 07:50:18,086 INFO L276 IsEmpty]: Start isEmpty. Operand 854 states and 1173 transitions. [2021-08-27 07:50:18,087 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2021-08-27 07:50:18,087 INFO L504 BasicCegarLoop]: Found error trace [2021-08-27 07:50:18,088 INFO L512 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-27 07:50:18,097 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (15)] Forceful destruction successful, exit code 0 [2021-08-27 07:50:18,297 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-08-27 07:50:18,297 INFO L402 AbstractCegarLoop]: === Iteration 15 === Targeting errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK === [mainErr0ENSURES_VIOLATIONMEMORY_LEAK, errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2021-08-27 07:50:18,298 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 07:50:18,298 INFO L82 PathProgramCache]: Analyzing trace with hash -400355487, now seen corresponding path program 1 times [2021-08-27 07:50:18,298 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-08-27 07:50:18,298 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1972408172] [2021-08-27 07:50:18,298 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 07:50:18,298 INFO L170 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-08-27 07:50:18,298 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-08-27 07:50:18,300 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-08-27 07:50:18,311 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (16)] Waiting until timeout for monitored process [2021-08-27 07:50:18,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:50:18,836 INFO L263 TraceCheckSpWp]: Trace formula consists of 369 conjuncts, 2 conjunts are in the unsatisfiable core [2021-08-27 07:50:18,838 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-27 07:50:18,966 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 07:50:18,966 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-08-27 07:50:19,130 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 07:50:19,130 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-08-27 07:50:19,130 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1972408172] [2021-08-27 07:50:19,130 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1972408172] provided 2 perfect and 0 imperfect interpolant sequences [2021-08-27 07:50:19,130 INFO L186 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2021-08-27 07:50:19,130 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2021-08-27 07:50:19,130 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [522292758] [2021-08-27 07:50:19,130 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-08-27 07:50:19,131 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-08-27 07:50:19,131 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-08-27 07:50:19,131 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-27 07:50:19,131 INFO L87 Difference]: Start difference. First operand 854 states and 1173 transitions. Second operand has 3 states, 3 states have (on average 12.666666666666666) internal successors, (38), 3 states have internal predecessors, (38), 2 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (6), 2 states have call predecessors, (6), 1 states have call successors, (6) [2021-08-27 07:50:19,193 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 07:50:19,193 INFO L93 Difference]: Finished difference Result 877 states and 1199 transitions. [2021-08-27 07:50:19,196 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-08-27 07:50:19,197 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 12.666666666666666) internal successors, (38), 3 states have internal predecessors, (38), 2 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (6), 2 states have call predecessors, (6), 1 states have call successors, (6) Word has length 52 [2021-08-27 07:50:19,197 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-27 07:50:19,199 INFO L225 Difference]: With dead ends: 877 [2021-08-27 07:50:19,200 INFO L226 Difference]: Without dead ends: 877 [2021-08-27 07:50:19,200 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 103 GetRequests, 102 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.1ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-27 07:50:19,201 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 877 states. [2021-08-27 07:50:19,210 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 877 to 873. [2021-08-27 07:50:19,211 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 873 states, 685 states have (on average 1.3693430656934307) internal successors, (938), 700 states have internal predecessors, (938), 113 states have call successors, (113), 52 states have call predecessors, (113), 74 states have return successors, (145), 128 states have call predecessors, (145), 105 states have call successors, (145) [2021-08-27 07:50:19,213 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 873 states to 873 states and 1196 transitions. [2021-08-27 07:50:19,214 INFO L78 Accepts]: Start accepts. Automaton has 873 states and 1196 transitions. Word has length 52 [2021-08-27 07:50:19,214 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-27 07:50:19,214 INFO L470 AbstractCegarLoop]: Abstraction has 873 states and 1196 transitions. [2021-08-27 07:50:19,214 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 12.666666666666666) internal successors, (38), 3 states have internal predecessors, (38), 2 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (6), 2 states have call predecessors, (6), 1 states have call successors, (6) [2021-08-27 07:50:19,214 INFO L276 IsEmpty]: Start isEmpty. Operand 873 states and 1196 transitions. [2021-08-27 07:50:19,216 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2021-08-27 07:50:19,216 INFO L504 BasicCegarLoop]: Found error trace [2021-08-27 07:50:19,216 INFO L512 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-27 07:50:19,229 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (16)] Forceful destruction successful, exit code 0 [2021-08-27 07:50:19,426 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-08-27 07:50:19,426 INFO L402 AbstractCegarLoop]: === Iteration 16 === Targeting errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK === [mainErr0ENSURES_VIOLATIONMEMORY_LEAK, errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2021-08-27 07:50:19,426 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 07:50:19,426 INFO L82 PathProgramCache]: Analyzing trace with hash 1037319808, now seen corresponding path program 1 times [2021-08-27 07:50:19,426 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-08-27 07:50:19,426 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [303168362] [2021-08-27 07:50:19,427 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 07:50:19,427 INFO L170 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-08-27 07:50:19,427 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-08-27 07:50:19,427 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-08-27 07:50:19,428 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (17)] Waiting until timeout for monitored process [2021-08-27 07:50:19,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:50:19,974 INFO L263 TraceCheckSpWp]: Trace formula consists of 375 conjuncts, 8 conjunts are in the unsatisfiable core [2021-08-27 07:50:19,975 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-27 07:50:20,161 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 07:50:20,161 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-08-27 07:50:20,403 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 07:50:20,403 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-08-27 07:50:20,403 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [303168362] [2021-08-27 07:50:20,404 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [303168362] provided 2 perfect and 0 imperfect interpolant sequences [2021-08-27 07:50:20,404 INFO L186 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2021-08-27 07:50:20,404 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7, 7] imperfect sequences [] total 12 [2021-08-27 07:50:20,404 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [673644545] [2021-08-27 07:50:20,404 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2021-08-27 07:50:20,404 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-08-27 07:50:20,405 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-08-27 07:50:20,405 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=104, Unknown=0, NotChecked=0, Total=132 [2021-08-27 07:50:20,405 INFO L87 Difference]: Start difference. First operand 873 states and 1196 transitions. Second operand has 12 states, 12 states have (on average 5.583333333333333) internal successors, (67), 10 states have internal predecessors, (67), 4 states have call successors, (16), 4 states have call predecessors, (16), 5 states have return successors, (8), 6 states have call predecessors, (8), 4 states have call successors, (8) [2021-08-27 07:50:21,255 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 07:50:21,255 INFO L93 Difference]: Finished difference Result 1555 states and 2148 transitions. [2021-08-27 07:50:21,256 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2021-08-27 07:50:21,256 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 5.583333333333333) internal successors, (67), 10 states have internal predecessors, (67), 4 states have call successors, (16), 4 states have call predecessors, (16), 5 states have return successors, (8), 6 states have call predecessors, (8), 4 states have call successors, (8) Word has length 54 [2021-08-27 07:50:21,256 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-27 07:50:21,261 INFO L225 Difference]: With dead ends: 1555 [2021-08-27 07:50:21,261 INFO L226 Difference]: Without dead ends: 1555 [2021-08-27 07:50:21,261 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 116 GetRequests, 97 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 58 ImplicationChecksByTransitivity, 156.7ms TimeCoverageRelationStatistics Valid=85, Invalid=335, Unknown=0, NotChecked=0, Total=420 [2021-08-27 07:50:21,262 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1555 states. [2021-08-27 07:50:21,281 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1555 to 1345. [2021-08-27 07:50:21,284 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1345 states, 1056 states have (on average 1.3806818181818181) internal successors, (1458), 1090 states have internal predecessors, (1458), 176 states have call successors, (176), 84 states have call predecessors, (176), 112 states have return successors, (236), 176 states have call predecessors, (236), 168 states have call successors, (236) [2021-08-27 07:50:21,286 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1345 states to 1345 states and 1870 transitions. [2021-08-27 07:50:21,286 INFO L78 Accepts]: Start accepts. Automaton has 1345 states and 1870 transitions. Word has length 54 [2021-08-27 07:50:21,287 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-27 07:50:21,287 INFO L470 AbstractCegarLoop]: Abstraction has 1345 states and 1870 transitions. [2021-08-27 07:50:21,287 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 5.583333333333333) internal successors, (67), 10 states have internal predecessors, (67), 4 states have call successors, (16), 4 states have call predecessors, (16), 5 states have return successors, (8), 6 states have call predecessors, (8), 4 states have call successors, (8) [2021-08-27 07:50:21,287 INFO L276 IsEmpty]: Start isEmpty. Operand 1345 states and 1870 transitions. [2021-08-27 07:50:21,289 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2021-08-27 07:50:21,290 INFO L504 BasicCegarLoop]: Found error trace [2021-08-27 07:50:21,290 INFO L512 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-27 07:50:21,301 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (17)] Forceful destruction successful, exit code 0 [2021-08-27 07:50:21,500 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-08-27 07:50:21,500 INFO L402 AbstractCegarLoop]: === Iteration 17 === Targeting errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK === [mainErr0ENSURES_VIOLATIONMEMORY_LEAK, errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2021-08-27 07:50:21,501 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 07:50:21,501 INFO L82 PathProgramCache]: Analyzing trace with hash -219767481, now seen corresponding path program 1 times [2021-08-27 07:50:21,501 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-08-27 07:50:21,501 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [575283658] [2021-08-27 07:50:21,501 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 07:50:21,501 INFO L170 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-08-27 07:50:21,501 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-08-27 07:50:21,502 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-08-27 07:50:21,504 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (18)] Waiting until timeout for monitored process [2021-08-27 07:50:22,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:50:22,118 INFO L263 TraceCheckSpWp]: Trace formula consists of 410 conjuncts, 2 conjunts are in the unsatisfiable core [2021-08-27 07:50:22,120 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-27 07:50:22,242 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 07:50:22,242 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-08-27 07:50:22,379 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 07:50:22,379 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-08-27 07:50:22,380 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [575283658] [2021-08-27 07:50:22,380 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [575283658] provided 2 perfect and 0 imperfect interpolant sequences [2021-08-27 07:50:22,380 INFO L186 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2021-08-27 07:50:22,380 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2021-08-27 07:50:22,380 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1758724433] [2021-08-27 07:50:22,380 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-08-27 07:50:22,380 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-08-27 07:50:22,381 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-08-27 07:50:22,381 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-27 07:50:22,381 INFO L87 Difference]: Start difference. First operand 1345 states and 1870 transitions. Second operand has 3 states, 3 states have (on average 12.666666666666666) internal successors, (38), 3 states have internal predecessors, (38), 2 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (6), 2 states have call predecessors, (6), 1 states have call successors, (6) [2021-08-27 07:50:22,441 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 07:50:22,441 INFO L93 Difference]: Finished difference Result 1342 states and 1863 transitions. [2021-08-27 07:50:22,445 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-08-27 07:50:22,445 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 12.666666666666666) internal successors, (38), 3 states have internal predecessors, (38), 2 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (6), 2 states have call predecessors, (6), 1 states have call successors, (6) Word has length 56 [2021-08-27 07:50:22,445 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-27 07:50:22,449 INFO L225 Difference]: With dead ends: 1342 [2021-08-27 07:50:22,449 INFO L226 Difference]: Without dead ends: 1342 [2021-08-27 07:50:22,450 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 111 GetRequests, 110 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.1ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-27 07:50:22,450 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1342 states. [2021-08-27 07:50:22,467 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1342 to 1342. [2021-08-27 07:50:22,469 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1342 states, 1054 states have (on average 1.3776091081593929) internal successors, (1452), 1087 states have internal predecessors, (1452), 175 states have call successors, (175), 84 states have call predecessors, (175), 112 states have return successors, (236), 176 states have call predecessors, (236), 168 states have call successors, (236) [2021-08-27 07:50:22,472 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1342 states to 1342 states and 1863 transitions. [2021-08-27 07:50:22,472 INFO L78 Accepts]: Start accepts. Automaton has 1342 states and 1863 transitions. Word has length 56 [2021-08-27 07:50:22,472 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-27 07:50:22,472 INFO L470 AbstractCegarLoop]: Abstraction has 1342 states and 1863 transitions. [2021-08-27 07:50:22,473 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 12.666666666666666) internal successors, (38), 3 states have internal predecessors, (38), 2 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (6), 2 states have call predecessors, (6), 1 states have call successors, (6) [2021-08-27 07:50:22,473 INFO L276 IsEmpty]: Start isEmpty. Operand 1342 states and 1863 transitions. [2021-08-27 07:50:22,475 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2021-08-27 07:50:22,475 INFO L504 BasicCegarLoop]: Found error trace [2021-08-27 07:50:22,475 INFO L512 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-27 07:50:22,503 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (18)] Forceful destruction successful, exit code 0 [2021-08-27 07:50:22,690 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 18 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-08-27 07:50:22,691 INFO L402 AbstractCegarLoop]: === Iteration 18 === Targeting errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK === [mainErr0ENSURES_VIOLATIONMEMORY_LEAK, errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2021-08-27 07:50:22,691 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 07:50:22,691 INFO L82 PathProgramCache]: Analyzing trace with hash -1536910814, now seen corresponding path program 1 times [2021-08-27 07:50:22,691 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-08-27 07:50:22,691 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1921736670] [2021-08-27 07:50:22,691 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 07:50:22,692 INFO L170 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-08-27 07:50:22,692 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-08-27 07:50:22,692 INFO L229 MonitoredProcess]: Starting monitored process 19 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-08-27 07:50:22,698 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (19)] Waiting until timeout for monitored process [2021-08-27 07:50:23,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:50:23,283 INFO L263 TraceCheckSpWp]: Trace formula consists of 337 conjuncts, 9 conjunts are in the unsatisfiable core [2021-08-27 07:50:23,286 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-27 07:50:23,519 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 07:50:23,519 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-08-27 07:50:23,784 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 07:50:23,784 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-08-27 07:50:23,784 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1921736670] [2021-08-27 07:50:23,785 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1921736670] provided 2 perfect and 0 imperfect interpolant sequences [2021-08-27 07:50:23,785 INFO L186 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2021-08-27 07:50:23,785 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9, 8] imperfect sequences [] total 15 [2021-08-27 07:50:23,787 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [96239212] [2021-08-27 07:50:23,788 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2021-08-27 07:50:23,788 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-08-27 07:50:23,789 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2021-08-27 07:50:23,789 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=176, Unknown=0, NotChecked=0, Total=210 [2021-08-27 07:50:23,789 INFO L87 Difference]: Start difference. First operand 1342 states and 1863 transitions. Second operand has 15 states, 15 states have (on average 3.8) internal successors, (57), 11 states have internal predecessors, (57), 2 states have call successors, (7), 2 states have call predecessors, (7), 5 states have return successors, (7), 5 states have call predecessors, (7), 1 states have call successors, (7) [2021-08-27 07:50:23,946 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 07:50:23,946 INFO L93 Difference]: Finished difference Result 1375 states and 1899 transitions. [2021-08-27 07:50:23,946 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2021-08-27 07:50:23,946 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 3.8) internal successors, (57), 11 states have internal predecessors, (57), 2 states have call successors, (7), 2 states have call predecessors, (7), 5 states have return successors, (7), 5 states have call predecessors, (7), 1 states have call successors, (7) Word has length 51 [2021-08-27 07:50:23,947 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-27 07:50:23,950 INFO L225 Difference]: With dead ends: 1375 [2021-08-27 07:50:23,950 INFO L226 Difference]: Without dead ends: 1352 [2021-08-27 07:50:23,951 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 103 GetRequests, 88 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 125.8ms TimeCoverageRelationStatistics Valid=46, Invalid=226, Unknown=0, NotChecked=0, Total=272 [2021-08-27 07:50:23,952 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1352 states. [2021-08-27 07:50:23,971 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1352 to 1348. [2021-08-27 07:50:23,973 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1348 states, 1059 states have (on average 1.3758262511803587) internal successors, (1457), 1093 states have internal predecessors, (1457), 176 states have call successors, (176), 84 states have call predecessors, (176), 112 states have return successors, (237), 177 states have call predecessors, (237), 169 states have call successors, (237) [2021-08-27 07:50:23,975 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1348 states to 1348 states and 1870 transitions. [2021-08-27 07:50:23,975 INFO L78 Accepts]: Start accepts. Automaton has 1348 states and 1870 transitions. Word has length 51 [2021-08-27 07:50:23,975 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-27 07:50:23,975 INFO L470 AbstractCegarLoop]: Abstraction has 1348 states and 1870 transitions. [2021-08-27 07:50:23,975 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 3.8) internal successors, (57), 11 states have internal predecessors, (57), 2 states have call successors, (7), 2 states have call predecessors, (7), 5 states have return successors, (7), 5 states have call predecessors, (7), 1 states have call successors, (7) [2021-08-27 07:50:23,976 INFO L276 IsEmpty]: Start isEmpty. Operand 1348 states and 1870 transitions. [2021-08-27 07:50:23,980 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2021-08-27 07:50:23,980 INFO L504 BasicCegarLoop]: Found error trace [2021-08-27 07:50:23,980 INFO L512 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-27 07:50:23,998 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (19)] Forceful destruction successful, exit code 0 [2021-08-27 07:50:24,190 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 19 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-08-27 07:50:24,190 INFO L402 AbstractCegarLoop]: === Iteration 19 === Targeting errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK === [mainErr0ENSURES_VIOLATIONMEMORY_LEAK, errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2021-08-27 07:50:24,191 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 07:50:24,191 INFO L82 PathProgramCache]: Analyzing trace with hash 917468979, now seen corresponding path program 1 times [2021-08-27 07:50:24,191 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-08-27 07:50:24,191 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [894292447] [2021-08-27 07:50:24,191 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 07:50:24,191 INFO L170 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-08-27 07:50:24,191 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-08-27 07:50:24,192 INFO L229 MonitoredProcess]: Starting monitored process 20 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-08-27 07:50:24,197 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (20)] Waiting until timeout for monitored process [2021-08-27 07:50:24,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:50:24,833 INFO L263 TraceCheckSpWp]: Trace formula consists of 370 conjuncts, 4 conjunts are in the unsatisfiable core [2021-08-27 07:50:24,834 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-27 07:50:25,123 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 07:50:25,123 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-08-27 07:50:25,280 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 07:50:25,280 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-08-27 07:50:25,280 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [894292447] [2021-08-27 07:50:25,280 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [894292447] provided 2 perfect and 0 imperfect interpolant sequences [2021-08-27 07:50:25,280 INFO L186 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2021-08-27 07:50:25,280 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 6 [2021-08-27 07:50:25,280 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1714569300] [2021-08-27 07:50:25,281 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-08-27 07:50:25,281 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-08-27 07:50:25,281 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-08-27 07:50:25,281 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2021-08-27 07:50:25,281 INFO L87 Difference]: Start difference. First operand 1348 states and 1870 transitions. Second operand has 6 states, 6 states have (on average 12.166666666666666) internal successors, (73), 6 states have internal predecessors, (73), 4 states have call successors, (12), 3 states have call predecessors, (12), 3 states have return successors, (11), 3 states have call predecessors, (11), 3 states have call successors, (11) [2021-08-27 07:50:25,722 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 07:50:25,722 INFO L93 Difference]: Finished difference Result 1361 states and 1881 transitions. [2021-08-27 07:50:25,723 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-08-27 07:50:25,723 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 12.166666666666666) internal successors, (73), 6 states have internal predecessors, (73), 4 states have call successors, (12), 3 states have call predecessors, (12), 3 states have return successors, (11), 3 states have call predecessors, (11), 3 states have call successors, (11) Word has length 53 [2021-08-27 07:50:25,723 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-27 07:50:25,726 INFO L225 Difference]: With dead ends: 1361 [2021-08-27 07:50:25,726 INFO L226 Difference]: Without dead ends: 1329 [2021-08-27 07:50:25,726 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 108 GetRequests, 102 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 27.2ms TimeCoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2021-08-27 07:50:25,727 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1329 states. [2021-08-27 07:50:25,742 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1329 to 1321. [2021-08-27 07:50:25,743 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1321 states, 1037 states have (on average 1.3799421407907426) internal successors, (1431), 1070 states have internal predecessors, (1431), 173 states have call successors, (173), 82 states have call predecessors, (173), 110 states have return successors, (234), 174 states have call predecessors, (234), 166 states have call successors, (234) [2021-08-27 07:50:25,745 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1321 states to 1321 states and 1838 transitions. [2021-08-27 07:50:25,745 INFO L78 Accepts]: Start accepts. Automaton has 1321 states and 1838 transitions. Word has length 53 [2021-08-27 07:50:25,745 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-27 07:50:25,746 INFO L470 AbstractCegarLoop]: Abstraction has 1321 states and 1838 transitions. [2021-08-27 07:50:25,746 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 12.166666666666666) internal successors, (73), 6 states have internal predecessors, (73), 4 states have call successors, (12), 3 states have call predecessors, (12), 3 states have return successors, (11), 3 states have call predecessors, (11), 3 states have call successors, (11) [2021-08-27 07:50:25,746 INFO L276 IsEmpty]: Start isEmpty. Operand 1321 states and 1838 transitions. [2021-08-27 07:50:25,748 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2021-08-27 07:50:25,748 INFO L504 BasicCegarLoop]: Found error trace [2021-08-27 07:50:25,748 INFO L512 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-27 07:50:25,760 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (20)] Forceful destruction successful, exit code 0 [2021-08-27 07:50:25,958 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 20 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-08-27 07:50:25,958 INFO L402 AbstractCegarLoop]: === Iteration 20 === Targeting errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK === [mainErr0ENSURES_VIOLATIONMEMORY_LEAK, errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2021-08-27 07:50:25,959 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 07:50:25,959 INFO L82 PathProgramCache]: Analyzing trace with hash 2039712262, now seen corresponding path program 1 times [2021-08-27 07:50:25,959 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-08-27 07:50:25,959 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [284833427] [2021-08-27 07:50:25,959 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 07:50:25,959 INFO L170 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-08-27 07:50:25,959 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-08-27 07:50:25,960 INFO L229 MonitoredProcess]: Starting monitored process 21 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-08-27 07:50:25,971 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (21)] Waiting until timeout for monitored process [2021-08-27 07:50:26,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:50:26,659 INFO L263 TraceCheckSpWp]: Trace formula consists of 371 conjuncts, 4 conjunts are in the unsatisfiable core [2021-08-27 07:50:26,661 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-27 07:50:26,958 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 07:50:26,959 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-08-27 07:50:27,114 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 07:50:27,114 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-08-27 07:50:27,114 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [284833427] [2021-08-27 07:50:27,114 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [284833427] provided 2 perfect and 0 imperfect interpolant sequences [2021-08-27 07:50:27,114 INFO L186 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2021-08-27 07:50:27,114 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 6 [2021-08-27 07:50:27,115 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2114172652] [2021-08-27 07:50:27,115 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-08-27 07:50:27,115 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-08-27 07:50:27,115 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-08-27 07:50:27,115 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2021-08-27 07:50:27,116 INFO L87 Difference]: Start difference. First operand 1321 states and 1838 transitions. Second operand has 6 states, 6 states have (on average 12.5) internal successors, (75), 6 states have internal predecessors, (75), 4 states have call successors, (12), 3 states have call predecessors, (12), 3 states have return successors, (11), 3 states have call predecessors, (11), 3 states have call successors, (11) [2021-08-27 07:50:27,735 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 07:50:27,736 INFO L93 Difference]: Finished difference Result 1515 states and 2117 transitions. [2021-08-27 07:50:27,736 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-08-27 07:50:27,736 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 12.5) internal successors, (75), 6 states have internal predecessors, (75), 4 states have call successors, (12), 3 states have call predecessors, (12), 3 states have return successors, (11), 3 states have call predecessors, (11), 3 states have call successors, (11) Word has length 54 [2021-08-27 07:50:27,737 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-27 07:50:27,740 INFO L225 Difference]: With dead ends: 1515 [2021-08-27 07:50:27,740 INFO L226 Difference]: Without dead ends: 1513 [2021-08-27 07:50:27,741 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 110 GetRequests, 104 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 34.3ms TimeCoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2021-08-27 07:50:27,741 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1513 states. [2021-08-27 07:50:27,757 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1513 to 1314. [2021-08-27 07:50:27,769 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1314 states, 1031 states have (on average 1.3743937924345295) internal successors, (1417), 1063 states have internal predecessors, (1417), 172 states have call successors, (172), 82 states have call predecessors, (172), 110 states have return successors, (234), 174 states have call predecessors, (234), 166 states have call successors, (234) [2021-08-27 07:50:27,776 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1314 states to 1314 states and 1823 transitions. [2021-08-27 07:50:27,776 INFO L78 Accepts]: Start accepts. Automaton has 1314 states and 1823 transitions. Word has length 54 [2021-08-27 07:50:27,777 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-27 07:50:27,777 INFO L470 AbstractCegarLoop]: Abstraction has 1314 states and 1823 transitions. [2021-08-27 07:50:27,777 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 12.5) internal successors, (75), 6 states have internal predecessors, (75), 4 states have call successors, (12), 3 states have call predecessors, (12), 3 states have return successors, (11), 3 states have call predecessors, (11), 3 states have call successors, (11) [2021-08-27 07:50:27,778 INFO L276 IsEmpty]: Start isEmpty. Operand 1314 states and 1823 transitions. [2021-08-27 07:50:27,780 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2021-08-27 07:50:27,781 INFO L504 BasicCegarLoop]: Found error trace [2021-08-27 07:50:27,781 INFO L512 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-27 07:50:27,794 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (21)] Forceful destruction successful, exit code 0 [2021-08-27 07:50:27,992 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 21 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-08-27 07:50:27,992 INFO L402 AbstractCegarLoop]: === Iteration 21 === Targeting errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK === [mainErr0ENSURES_VIOLATIONMEMORY_LEAK, errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2021-08-27 07:50:27,992 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 07:50:27,992 INFO L82 PathProgramCache]: Analyzing trace with hash 1364295162, now seen corresponding path program 1 times [2021-08-27 07:50:27,993 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-08-27 07:50:27,993 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1425390485] [2021-08-27 07:50:27,993 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 07:50:27,993 INFO L170 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-08-27 07:50:27,993 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-08-27 07:50:27,994 INFO L229 MonitoredProcess]: Starting monitored process 22 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-08-27 07:50:27,995 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (22)] Waiting until timeout for monitored process [2021-08-27 07:50:28,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:50:28,719 INFO L263 TraceCheckSpWp]: Trace formula consists of 370 conjuncts, 8 conjunts are in the unsatisfiable core [2021-08-27 07:50:28,720 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-27 07:50:28,989 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 07:50:28,989 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-08-27 07:50:29,277 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 07:50:29,278 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-08-27 07:50:29,278 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1425390485] [2021-08-27 07:50:29,278 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1425390485] provided 2 perfect and 0 imperfect interpolant sequences [2021-08-27 07:50:29,278 INFO L186 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2021-08-27 07:50:29,278 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9, 9] imperfect sequences [] total 16 [2021-08-27 07:50:29,278 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [606457510] [2021-08-27 07:50:29,279 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2021-08-27 07:50:29,279 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-08-27 07:50:29,279 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2021-08-27 07:50:29,279 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=204, Unknown=0, NotChecked=0, Total=240 [2021-08-27 07:50:29,279 INFO L87 Difference]: Start difference. First operand 1314 states and 1823 transitions. Second operand has 16 states, 16 states have (on average 3.875) internal successors, (62), 12 states have internal predecessors, (62), 4 states have call successors, (9), 2 states have call predecessors, (9), 5 states have return successors, (9), 7 states have call predecessors, (9), 3 states have call successors, (9) [2021-08-27 07:50:29,659 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 07:50:29,659 INFO L93 Difference]: Finished difference Result 1377 states and 1903 transitions. [2021-08-27 07:50:29,660 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2021-08-27 07:50:29,660 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 3.875) internal successors, (62), 12 states have internal predecessors, (62), 4 states have call successors, (9), 2 states have call predecessors, (9), 5 states have return successors, (9), 7 states have call predecessors, (9), 3 states have call successors, (9) Word has length 55 [2021-08-27 07:50:29,661 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-27 07:50:29,664 INFO L225 Difference]: With dead ends: 1377 [2021-08-27 07:50:29,664 INFO L226 Difference]: Without dead ends: 1257 [2021-08-27 07:50:29,665 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 113 GetRequests, 95 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 159.4ms TimeCoverageRelationStatistics Valid=58, Invalid=322, Unknown=0, NotChecked=0, Total=380 [2021-08-27 07:50:29,665 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1257 states. [2021-08-27 07:50:29,680 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1257 to 1252. [2021-08-27 07:50:29,681 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1252 states, 983 states have (on average 1.3326551373346898) internal successors, (1310), 1014 states have internal predecessors, (1310), 158 states have call successors, (158), 82 states have call predecessors, (158), 110 states have return successors, (220), 161 states have call predecessors, (220), 152 states have call successors, (220) [2021-08-27 07:50:29,683 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1252 states to 1252 states and 1688 transitions. [2021-08-27 07:50:29,684 INFO L78 Accepts]: Start accepts. Automaton has 1252 states and 1688 transitions. Word has length 55 [2021-08-27 07:50:29,684 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-27 07:50:29,684 INFO L470 AbstractCegarLoop]: Abstraction has 1252 states and 1688 transitions. [2021-08-27 07:50:29,685 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 3.875) internal successors, (62), 12 states have internal predecessors, (62), 4 states have call successors, (9), 2 states have call predecessors, (9), 5 states have return successors, (9), 7 states have call predecessors, (9), 3 states have call successors, (9) [2021-08-27 07:50:29,685 INFO L276 IsEmpty]: Start isEmpty. Operand 1252 states and 1688 transitions. [2021-08-27 07:50:29,688 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2021-08-27 07:50:29,688 INFO L504 BasicCegarLoop]: Found error trace [2021-08-27 07:50:29,688 INFO L512 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-27 07:50:29,700 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (22)] Forceful destruction successful, exit code 0 [2021-08-27 07:50:29,898 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 22 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-08-27 07:50:29,899 INFO L402 AbstractCegarLoop]: === Iteration 22 === Targeting errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK === [mainErr0ENSURES_VIOLATIONMEMORY_LEAK, errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2021-08-27 07:50:29,899 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 07:50:29,899 INFO L82 PathProgramCache]: Analyzing trace with hash 149703456, now seen corresponding path program 1 times [2021-08-27 07:50:29,899 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-08-27 07:50:29,899 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [896023504] [2021-08-27 07:50:29,899 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 07:50:29,899 INFO L170 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-08-27 07:50:29,899 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-08-27 07:50:29,900 INFO L229 MonitoredProcess]: Starting monitored process 23 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-08-27 07:50:29,903 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (23)] Waiting until timeout for monitored process [2021-08-27 07:50:30,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:50:30,669 INFO L263 TraceCheckSpWp]: Trace formula consists of 370 conjuncts, 12 conjunts are in the unsatisfiable core [2021-08-27 07:50:30,670 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-27 07:50:30,935 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 07:50:30,936 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-08-27 07:50:31,330 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 07:50:31,330 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-08-27 07:50:31,330 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [896023504] [2021-08-27 07:50:31,331 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [896023504] provided 2 perfect and 0 imperfect interpolant sequences [2021-08-27 07:50:31,331 INFO L186 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2021-08-27 07:50:31,331 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11, 10] imperfect sequences [] total 19 [2021-08-27 07:50:31,331 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [786643476] [2021-08-27 07:50:31,331 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2021-08-27 07:50:31,331 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-08-27 07:50:31,331 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2021-08-27 07:50:31,332 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=298, Unknown=0, NotChecked=0, Total=342 [2021-08-27 07:50:31,332 INFO L87 Difference]: Start difference. First operand 1252 states and 1688 transitions. Second operand has 19 states, 19 states have (on average 3.263157894736842) internal successors, (62), 13 states have internal predecessors, (62), 2 states have call successors, (8), 2 states have call predecessors, (8), 7 states have return successors, (9), 7 states have call predecessors, (9), 1 states have call successors, (9) [2021-08-27 07:50:31,732 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 07:50:31,732 INFO L93 Difference]: Finished difference Result 1332 states and 1786 transitions. [2021-08-27 07:50:31,735 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2021-08-27 07:50:31,735 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 3.263157894736842) internal successors, (62), 13 states have internal predecessors, (62), 2 states have call successors, (8), 2 states have call predecessors, (8), 7 states have return successors, (9), 7 states have call predecessors, (9), 1 states have call successors, (9) Word has length 56 [2021-08-27 07:50:31,735 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-27 07:50:31,739 INFO L225 Difference]: With dead ends: 1332 [2021-08-27 07:50:31,739 INFO L226 Difference]: Without dead ends: 1296 [2021-08-27 07:50:31,739 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 113 GetRequests, 94 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 198.0ms TimeCoverageRelationStatistics Valid=56, Invalid=364, Unknown=0, NotChecked=0, Total=420 [2021-08-27 07:50:31,740 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1296 states. [2021-08-27 07:50:31,754 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1296 to 1254. [2021-08-27 07:50:31,755 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1254 states, 987 states have (on average 1.331306990881459) internal successors, (1314), 1018 states have internal predecessors, (1314), 156 states have call successors, (156), 82 states have call predecessors, (156), 110 states have return successors, (218), 159 states have call predecessors, (218), 150 states have call successors, (218) [2021-08-27 07:50:31,757 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1254 states to 1254 states and 1688 transitions. [2021-08-27 07:50:31,758 INFO L78 Accepts]: Start accepts. Automaton has 1254 states and 1688 transitions. Word has length 56 [2021-08-27 07:50:31,758 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-27 07:50:31,758 INFO L470 AbstractCegarLoop]: Abstraction has 1254 states and 1688 transitions. [2021-08-27 07:50:31,758 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 3.263157894736842) internal successors, (62), 13 states have internal predecessors, (62), 2 states have call successors, (8), 2 states have call predecessors, (8), 7 states have return successors, (9), 7 states have call predecessors, (9), 1 states have call successors, (9) [2021-08-27 07:50:31,758 INFO L276 IsEmpty]: Start isEmpty. Operand 1254 states and 1688 transitions. [2021-08-27 07:50:31,760 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2021-08-27 07:50:31,760 INFO L504 BasicCegarLoop]: Found error trace [2021-08-27 07:50:31,760 INFO L512 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-27 07:50:31,773 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (23)] Forceful destruction successful, exit code 0 [2021-08-27 07:50:31,965 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 23 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-08-27 07:50:31,965 INFO L402 AbstractCegarLoop]: === Iteration 23 === Targeting errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK === [mainErr0ENSURES_VIOLATIONMEMORY_LEAK, errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2021-08-27 07:50:31,965 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 07:50:31,965 INFO L82 PathProgramCache]: Analyzing trace with hash -1617706055, now seen corresponding path program 1 times [2021-08-27 07:50:31,965 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-08-27 07:50:31,965 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [991157467] [2021-08-27 07:50:31,965 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 07:50:31,965 INFO L170 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-08-27 07:50:31,966 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-08-27 07:50:31,966 INFO L229 MonitoredProcess]: Starting monitored process 24 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-08-27 07:50:31,977 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (24)] Waiting until timeout for monitored process [2021-08-27 07:50:32,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:50:32,750 INFO L263 TraceCheckSpWp]: Trace formula consists of 369 conjuncts, 12 conjunts are in the unsatisfiable core [2021-08-27 07:50:32,751 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-27 07:50:33,040 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 07:50:33,040 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-08-27 07:50:33,414 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 07:50:33,415 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-08-27 07:50:33,415 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [991157467] [2021-08-27 07:50:33,415 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [991157467] provided 2 perfect and 0 imperfect interpolant sequences [2021-08-27 07:50:33,415 INFO L186 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2021-08-27 07:50:33,415 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11, 10] imperfect sequences [] total 19 [2021-08-27 07:50:33,415 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1477583684] [2021-08-27 07:50:33,415 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2021-08-27 07:50:33,415 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-08-27 07:50:33,416 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2021-08-27 07:50:33,416 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=298, Unknown=0, NotChecked=0, Total=342 [2021-08-27 07:50:33,416 INFO L87 Difference]: Start difference. First operand 1254 states and 1688 transitions. Second operand has 19 states, 19 states have (on average 3.210526315789474) internal successors, (61), 13 states have internal predecessors, (61), 2 states have call successors, (8), 2 states have call predecessors, (8), 7 states have return successors, (9), 7 states have call predecessors, (9), 1 states have call successors, (9) [2021-08-27 07:50:33,758 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 07:50:33,758 INFO L93 Difference]: Finished difference Result 1323 states and 1771 transitions. [2021-08-27 07:50:33,764 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2021-08-27 07:50:33,764 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 3.210526315789474) internal successors, (61), 13 states have internal predecessors, (61), 2 states have call successors, (8), 2 states have call predecessors, (8), 7 states have return successors, (9), 7 states have call predecessors, (9), 1 states have call successors, (9) Word has length 55 [2021-08-27 07:50:33,764 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-27 07:50:33,768 INFO L225 Difference]: With dead ends: 1323 [2021-08-27 07:50:33,768 INFO L226 Difference]: Without dead ends: 1287 [2021-08-27 07:50:33,768 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 111 GetRequests, 92 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 206.9ms TimeCoverageRelationStatistics Valid=56, Invalid=364, Unknown=0, NotChecked=0, Total=420 [2021-08-27 07:50:33,769 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1287 states. [2021-08-27 07:50:33,789 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1287 to 1245. [2021-08-27 07:50:33,790 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1245 states, 982 states have (on average 1.3309572301425663) internal successors, (1307), 1012 states have internal predecessors, (1307), 154 states have call successors, (154), 82 states have call predecessors, (154), 108 states have return successors, (214), 156 states have call predecessors, (214), 148 states have call successors, (214) [2021-08-27 07:50:33,792 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1245 states to 1245 states and 1675 transitions. [2021-08-27 07:50:33,792 INFO L78 Accepts]: Start accepts. Automaton has 1245 states and 1675 transitions. Word has length 55 [2021-08-27 07:50:33,792 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-27 07:50:33,793 INFO L470 AbstractCegarLoop]: Abstraction has 1245 states and 1675 transitions. [2021-08-27 07:50:33,793 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 3.210526315789474) internal successors, (61), 13 states have internal predecessors, (61), 2 states have call successors, (8), 2 states have call predecessors, (8), 7 states have return successors, (9), 7 states have call predecessors, (9), 1 states have call successors, (9) [2021-08-27 07:50:33,793 INFO L276 IsEmpty]: Start isEmpty. Operand 1245 states and 1675 transitions. [2021-08-27 07:50:33,795 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2021-08-27 07:50:33,795 INFO L504 BasicCegarLoop]: Found error trace [2021-08-27 07:50:33,796 INFO L512 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-27 07:50:33,808 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (24)] Forceful destruction successful, exit code 0 [2021-08-27 07:50:34,006 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 24 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-08-27 07:50:34,006 INFO L402 AbstractCegarLoop]: === Iteration 24 === Targeting errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK === [mainErr0ENSURES_VIOLATIONMEMORY_LEAK, errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2021-08-27 07:50:34,006 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 07:50:34,007 INFO L82 PathProgramCache]: Analyzing trace with hash 209841830, now seen corresponding path program 1 times [2021-08-27 07:50:34,007 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-08-27 07:50:34,007 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1121637032] [2021-08-27 07:50:34,007 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 07:50:34,007 INFO L170 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-08-27 07:50:34,007 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-08-27 07:50:34,008 INFO L229 MonitoredProcess]: Starting monitored process 25 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-08-27 07:50:34,008 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (25)] Waiting until timeout for monitored process [2021-08-27 07:50:34,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:50:34,869 INFO L263 TraceCheckSpWp]: Trace formula consists of 428 conjuncts, 5 conjunts are in the unsatisfiable core [2021-08-27 07:50:34,871 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-27 07:50:35,057 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 07:50:35,057 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-08-27 07:50:35,229 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 07:50:35,230 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-08-27 07:50:35,230 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1121637032] [2021-08-27 07:50:35,230 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1121637032] provided 2 perfect and 0 imperfect interpolant sequences [2021-08-27 07:50:35,230 INFO L186 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2021-08-27 07:50:35,230 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6, 6] imperfect sequences [] total 6 [2021-08-27 07:50:35,230 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2093059211] [2021-08-27 07:50:35,231 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-08-27 07:50:35,231 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-08-27 07:50:35,231 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-08-27 07:50:35,231 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-08-27 07:50:35,231 INFO L87 Difference]: Start difference. First operand 1245 states and 1675 transitions. Second operand has 6 states, 6 states have (on average 7.166666666666667) internal successors, (43), 5 states have internal predecessors, (43), 2 states have call successors, (12), 2 states have call predecessors, (12), 3 states have return successors, (6), 3 states have call predecessors, (6), 1 states have call successors, (6) [2021-08-27 07:50:35,255 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 07:50:35,255 INFO L93 Difference]: Finished difference Result 1231 states and 1653 transitions. [2021-08-27 07:50:35,256 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-08-27 07:50:35,256 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 7.166666666666667) internal successors, (43), 5 states have internal predecessors, (43), 2 states have call successors, (12), 2 states have call predecessors, (12), 3 states have return successors, (6), 3 states have call predecessors, (6), 1 states have call successors, (6) Word has length 61 [2021-08-27 07:50:35,256 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-27 07:50:35,259 INFO L225 Difference]: With dead ends: 1231 [2021-08-27 07:50:35,259 INFO L226 Difference]: Without dead ends: 1231 [2021-08-27 07:50:35,260 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 122 GetRequests, 117 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 38.7ms TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2021-08-27 07:50:35,260 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1231 states. [2021-08-27 07:50:35,275 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1231 to 1231. [2021-08-27 07:50:35,276 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1231 states, 968 states have (on average 1.3274793388429753) internal successors, (1285), 998 states have internal predecessors, (1285), 154 states have call successors, (154), 82 states have call predecessors, (154), 108 states have return successors, (214), 156 states have call predecessors, (214), 148 states have call successors, (214) [2021-08-27 07:50:35,279 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1231 states to 1231 states and 1653 transitions. [2021-08-27 07:50:35,279 INFO L78 Accepts]: Start accepts. Automaton has 1231 states and 1653 transitions. Word has length 61 [2021-08-27 07:50:35,279 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-27 07:50:35,279 INFO L470 AbstractCegarLoop]: Abstraction has 1231 states and 1653 transitions. [2021-08-27 07:50:35,280 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 7.166666666666667) internal successors, (43), 5 states have internal predecessors, (43), 2 states have call successors, (12), 2 states have call predecessors, (12), 3 states have return successors, (6), 3 states have call predecessors, (6), 1 states have call successors, (6) [2021-08-27 07:50:35,280 INFO L276 IsEmpty]: Start isEmpty. Operand 1231 states and 1653 transitions. [2021-08-27 07:50:35,282 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2021-08-27 07:50:35,282 INFO L504 BasicCegarLoop]: Found error trace [2021-08-27 07:50:35,282 INFO L512 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-27 07:50:35,297 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (25)] Forceful destruction successful, exit code 0 [2021-08-27 07:50:35,493 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 25 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-08-27 07:50:35,494 INFO L402 AbstractCegarLoop]: === Iteration 25 === Targeting errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK === [mainErr0ENSURES_VIOLATIONMEMORY_LEAK, errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2021-08-27 07:50:35,494 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 07:50:35,494 INFO L82 PathProgramCache]: Analyzing trace with hash 288909415, now seen corresponding path program 1 times [2021-08-27 07:50:35,494 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-08-27 07:50:35,494 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [581129764] [2021-08-27 07:50:35,494 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 07:50:35,495 INFO L170 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-08-27 07:50:35,495 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-08-27 07:50:35,495 INFO L229 MonitoredProcess]: Starting monitored process 26 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-08-27 07:50:35,496 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (26)] Waiting until timeout for monitored process [2021-08-27 07:50:36,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:50:36,400 INFO L263 TraceCheckSpWp]: Trace formula consists of 404 conjuncts, 5 conjunts are in the unsatisfiable core [2021-08-27 07:50:36,402 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-27 07:50:36,522 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 07:50:36,523 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-08-27 07:50:36,761 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 07:50:36,761 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-08-27 07:50:36,761 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [581129764] [2021-08-27 07:50:36,761 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [581129764] provided 2 perfect and 0 imperfect interpolant sequences [2021-08-27 07:50:36,761 INFO L186 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2021-08-27 07:50:36,761 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5, 5] imperfect sequences [] total 7 [2021-08-27 07:50:36,761 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [73341851] [2021-08-27 07:50:36,761 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-08-27 07:50:36,762 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-08-27 07:50:36,762 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-08-27 07:50:36,762 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2021-08-27 07:50:36,762 INFO L87 Difference]: Start difference. First operand 1231 states and 1653 transitions. Second operand has 7 states, 5 states have (on average 9.2) internal successors, (46), 7 states have internal predecessors, (46), 5 states have call successors, (10), 2 states have call predecessors, (10), 3 states have return successors, (8), 3 states have call predecessors, (8), 4 states have call successors, (8) [2021-08-27 07:50:36,879 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 07:50:36,879 INFO L93 Difference]: Finished difference Result 1251 states and 1684 transitions. [2021-08-27 07:50:36,879 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-08-27 07:50:36,879 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 5 states have (on average 9.2) internal successors, (46), 7 states have internal predecessors, (46), 5 states have call successors, (10), 2 states have call predecessors, (10), 3 states have return successors, (8), 3 states have call predecessors, (8), 4 states have call successors, (8) Word has length 59 [2021-08-27 07:50:36,879 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-27 07:50:36,890 INFO L225 Difference]: With dead ends: 1251 [2021-08-27 07:50:36,890 INFO L226 Difference]: Without dead ends: 1251 [2021-08-27 07:50:36,890 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 118 GetRequests, 112 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 24.6ms TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2021-08-27 07:50:36,891 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1251 states. [2021-08-27 07:50:36,900 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1251 to 1243. [2021-08-27 07:50:36,901 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1243 states, 976 states have (on average 1.3278688524590163) internal successors, (1296), 1009 states have internal predecessors, (1296), 157 states have call successors, (157), 82 states have call predecessors, (157), 109 states have return successors, (220), 157 states have call predecessors, (220), 151 states have call successors, (220) [2021-08-27 07:50:36,903 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1243 states to 1243 states and 1673 transitions. [2021-08-27 07:50:36,903 INFO L78 Accepts]: Start accepts. Automaton has 1243 states and 1673 transitions. Word has length 59 [2021-08-27 07:50:36,903 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-27 07:50:36,903 INFO L470 AbstractCegarLoop]: Abstraction has 1243 states and 1673 transitions. [2021-08-27 07:50:36,903 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 5 states have (on average 9.2) internal successors, (46), 7 states have internal predecessors, (46), 5 states have call successors, (10), 2 states have call predecessors, (10), 3 states have return successors, (8), 3 states have call predecessors, (8), 4 states have call successors, (8) [2021-08-27 07:50:36,903 INFO L276 IsEmpty]: Start isEmpty. Operand 1243 states and 1673 transitions. [2021-08-27 07:50:36,905 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2021-08-27 07:50:36,905 INFO L504 BasicCegarLoop]: Found error trace [2021-08-27 07:50:36,905 INFO L512 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-27 07:50:36,916 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (26)] Forceful destruction successful, exit code 0 [2021-08-27 07:50:37,115 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 26 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-08-27 07:50:37,116 INFO L402 AbstractCegarLoop]: === Iteration 26 === Targeting errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK === [mainErr0ENSURES_VIOLATIONMEMORY_LEAK, errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2021-08-27 07:50:37,116 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 07:50:37,116 INFO L82 PathProgramCache]: Analyzing trace with hash 990509289, now seen corresponding path program 1 times [2021-08-27 07:50:37,116 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-08-27 07:50:37,116 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1552022392] [2021-08-27 07:50:37,116 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 07:50:37,116 INFO L170 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-08-27 07:50:37,116 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-08-27 07:50:37,117 INFO L229 MonitoredProcess]: Starting monitored process 27 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-08-27 07:50:37,117 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (27)] Waiting until timeout for monitored process [2021-08-27 07:50:38,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:50:38,011 INFO L263 TraceCheckSpWp]: Trace formula consists of 404 conjuncts, 13 conjunts are in the unsatisfiable core [2021-08-27 07:50:38,014 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-27 07:50:38,256 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 07:50:38,257 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-08-27 07:50:38,720 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 07:50:38,721 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-08-27 07:50:38,721 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1552022392] [2021-08-27 07:50:38,721 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1552022392] provided 2 perfect and 0 imperfect interpolant sequences [2021-08-27 07:50:38,721 INFO L186 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2021-08-27 07:50:38,722 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12, 12] imperfect sequences [] total 22 [2021-08-27 07:50:38,722 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1568508714] [2021-08-27 07:50:38,722 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2021-08-27 07:50:38,722 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-08-27 07:50:38,722 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2021-08-27 07:50:38,722 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=411, Unknown=0, NotChecked=0, Total=462 [2021-08-27 07:50:38,723 INFO L87 Difference]: Start difference. First operand 1243 states and 1673 transitions. Second operand has 22 states, 20 states have (on average 3.3) internal successors, (66), 16 states have internal predecessors, (66), 6 states have call successors, (11), 2 states have call predecessors, (11), 7 states have return successors, (11), 9 states have call predecessors, (11), 5 states have call successors, (11) [2021-08-27 07:50:39,162 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 07:50:39,162 INFO L93 Difference]: Finished difference Result 1292 states and 1735 transitions. [2021-08-27 07:50:39,163 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2021-08-27 07:50:39,163 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 20 states have (on average 3.3) internal successors, (66), 16 states have internal predecessors, (66), 6 states have call successors, (11), 2 states have call predecessors, (11), 7 states have return successors, (11), 9 states have call predecessors, (11), 5 states have call successors, (11) Word has length 59 [2021-08-27 07:50:39,163 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-27 07:50:39,166 INFO L225 Difference]: With dead ends: 1292 [2021-08-27 07:50:39,166 INFO L226 Difference]: Without dead ends: 1241 [2021-08-27 07:50:39,166 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 124 GetRequests, 97 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 66 ImplicationChecksByTransitivity, 323.0ms TimeCoverageRelationStatistics Valid=90, Invalid=722, Unknown=0, NotChecked=0, Total=812 [2021-08-27 07:50:39,167 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1241 states. [2021-08-27 07:50:39,178 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1241 to 1238. [2021-08-27 07:50:39,179 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1238 states, 971 states have (on average 1.2996910401647785) internal successors, (1262), 1004 states have internal predecessors, (1262), 157 states have call successors, (157), 82 states have call predecessors, (157), 109 states have return successors, (220), 157 states have call predecessors, (220), 151 states have call successors, (220) [2021-08-27 07:50:39,181 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1238 states to 1238 states and 1639 transitions. [2021-08-27 07:50:39,181 INFO L78 Accepts]: Start accepts. Automaton has 1238 states and 1639 transitions. Word has length 59 [2021-08-27 07:50:39,181 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-27 07:50:39,181 INFO L470 AbstractCegarLoop]: Abstraction has 1238 states and 1639 transitions. [2021-08-27 07:50:39,181 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 20 states have (on average 3.3) internal successors, (66), 16 states have internal predecessors, (66), 6 states have call successors, (11), 2 states have call predecessors, (11), 7 states have return successors, (11), 9 states have call predecessors, (11), 5 states have call successors, (11) [2021-08-27 07:50:39,181 INFO L276 IsEmpty]: Start isEmpty. Operand 1238 states and 1639 transitions. [2021-08-27 07:50:39,183 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2021-08-27 07:50:39,183 INFO L504 BasicCegarLoop]: Found error trace [2021-08-27 07:50:39,184 INFO L512 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-27 07:50:39,196 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (27)] Forceful destruction successful, exit code 0 [2021-08-27 07:50:39,396 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 27 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-08-27 07:50:39,397 INFO L402 AbstractCegarLoop]: === Iteration 27 === Targeting errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK === [mainErr0ENSURES_VIOLATIONMEMORY_LEAK, errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2021-08-27 07:50:39,397 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 07:50:39,397 INFO L82 PathProgramCache]: Analyzing trace with hash 846257089, now seen corresponding path program 1 times [2021-08-27 07:50:39,397 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-08-27 07:50:39,397 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1386599842] [2021-08-27 07:50:39,397 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 07:50:39,397 INFO L170 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-08-27 07:50:39,398 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-08-27 07:50:39,398 INFO L229 MonitoredProcess]: Starting monitored process 28 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-08-27 07:50:39,399 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (28)] Waiting until timeout for monitored process [2021-08-27 07:50:40,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:50:40,317 INFO L263 TraceCheckSpWp]: Trace formula consists of 363 conjuncts, 12 conjunts are in the unsatisfiable core [2021-08-27 07:50:40,318 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-27 07:50:40,578 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 07:50:40,578 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-08-27 07:50:41,076 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 07:50:41,076 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-08-27 07:50:41,076 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1386599842] [2021-08-27 07:50:41,076 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1386599842] provided 2 perfect and 0 imperfect interpolant sequences [2021-08-27 07:50:41,076 INFO L186 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2021-08-27 07:50:41,076 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12, 11] imperfect sequences [] total 21 [2021-08-27 07:50:41,076 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2009467198] [2021-08-27 07:50:41,076 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2021-08-27 07:50:41,076 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-08-27 07:50:41,077 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2021-08-27 07:50:41,077 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=371, Unknown=0, NotChecked=0, Total=420 [2021-08-27 07:50:41,077 INFO L87 Difference]: Start difference. First operand 1238 states and 1639 transitions. Second operand has 21 states, 21 states have (on average 3.0952380952380953) internal successors, (65), 15 states have internal predecessors, (65), 2 states have call successors, (8), 2 states have call predecessors, (8), 7 states have return successors, (9), 7 states have call predecessors, (9), 1 states have call successors, (9) [2021-08-27 07:50:41,478 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 07:50:41,478 INFO L93 Difference]: Finished difference Result 1314 states and 1727 transitions. [2021-08-27 07:50:41,478 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2021-08-27 07:50:41,479 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 21 states have (on average 3.0952380952380953) internal successors, (65), 15 states have internal predecessors, (65), 2 states have call successors, (8), 2 states have call predecessors, (8), 7 states have return successors, (9), 7 states have call predecessors, (9), 1 states have call successors, (9) Word has length 58 [2021-08-27 07:50:41,479 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-27 07:50:41,481 INFO L225 Difference]: With dead ends: 1314 [2021-08-27 07:50:41,481 INFO L226 Difference]: Without dead ends: 1272 [2021-08-27 07:50:41,482 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 119 GetRequests, 96 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 62 ImplicationChecksByTransitivity, 252.2ms TimeCoverageRelationStatistics Valid=72, Invalid=528, Unknown=0, NotChecked=0, Total=600 [2021-08-27 07:50:41,482 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1272 states. [2021-08-27 07:50:41,493 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1272 to 1232. [2021-08-27 07:50:41,495 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1232 states, 967 states have (on average 1.2988624612202688) internal successors, (1256), 1000 states have internal predecessors, (1256), 155 states have call successors, (155), 82 states have call predecessors, (155), 109 states have return successors, (218), 155 states have call predecessors, (218), 149 states have call successors, (218) [2021-08-27 07:50:41,496 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1232 states to 1232 states and 1629 transitions. [2021-08-27 07:50:41,496 INFO L78 Accepts]: Start accepts. Automaton has 1232 states and 1629 transitions. Word has length 58 [2021-08-27 07:50:41,497 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-27 07:50:41,497 INFO L470 AbstractCegarLoop]: Abstraction has 1232 states and 1629 transitions. [2021-08-27 07:50:41,497 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 21 states have (on average 3.0952380952380953) internal successors, (65), 15 states have internal predecessors, (65), 2 states have call successors, (8), 2 states have call predecessors, (8), 7 states have return successors, (9), 7 states have call predecessors, (9), 1 states have call successors, (9) [2021-08-27 07:50:41,497 INFO L276 IsEmpty]: Start isEmpty. Operand 1232 states and 1629 transitions. [2021-08-27 07:50:41,499 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2021-08-27 07:50:41,499 INFO L504 BasicCegarLoop]: Found error trace [2021-08-27 07:50:41,499 INFO L512 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-27 07:50:41,511 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (28)] Forceful destruction successful, exit code 0 [2021-08-27 07:50:41,708 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 28 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-08-27 07:50:41,709 INFO L402 AbstractCegarLoop]: === Iteration 28 === Targeting errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK === [mainErr0ENSURES_VIOLATIONMEMORY_LEAK, errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2021-08-27 07:50:41,709 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 07:50:41,709 INFO L82 PathProgramCache]: Analyzing trace with hash 1230874093, now seen corresponding path program 1 times [2021-08-27 07:50:41,709 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-08-27 07:50:41,709 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1584968350] [2021-08-27 07:50:41,709 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 07:50:41,710 INFO L170 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-08-27 07:50:41,710 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-08-27 07:50:41,710 INFO L229 MonitoredProcess]: Starting monitored process 29 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-08-27 07:50:41,711 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (29)] Waiting until timeout for monitored process [2021-08-27 07:50:42,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:50:42,652 INFO L263 TraceCheckSpWp]: Trace formula consists of 389 conjuncts, 3 conjunts are in the unsatisfiable core [2021-08-27 07:50:42,654 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-27 07:50:42,785 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 07:50:42,786 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-08-27 07:50:42,964 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 07:50:42,964 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-08-27 07:50:42,964 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1584968350] [2021-08-27 07:50:42,964 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1584968350] provided 2 perfect and 0 imperfect interpolant sequences [2021-08-27 07:50:42,964 INFO L186 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2021-08-27 07:50:42,965 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 5 [2021-08-27 07:50:42,965 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2020833283] [2021-08-27 07:50:42,965 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-08-27 07:50:42,965 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-08-27 07:50:42,965 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-08-27 07:50:42,965 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-08-27 07:50:42,965 INFO L87 Difference]: Start difference. First operand 1232 states and 1629 transitions. Second operand has 5 states, 5 states have (on average 9.8) internal successors, (49), 5 states have internal predecessors, (49), 2 states have call successors, (10), 2 states have call predecessors, (10), 3 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2021-08-27 07:50:43,082 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 07:50:43,082 INFO L93 Difference]: Finished difference Result 1308 states and 1757 transitions. [2021-08-27 07:50:43,082 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-08-27 07:50:43,082 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.8) internal successors, (49), 5 states have internal predecessors, (49), 2 states have call successors, (10), 2 states have call predecessors, (10), 3 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) Word has length 60 [2021-08-27 07:50:43,082 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-27 07:50:43,085 INFO L225 Difference]: With dead ends: 1308 [2021-08-27 07:50:43,085 INFO L226 Difference]: Without dead ends: 1308 [2021-08-27 07:50:43,085 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 120 GetRequests, 116 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 13.4ms TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2021-08-27 07:50:43,086 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1308 states. [2021-08-27 07:50:43,107 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1308 to 1246. [2021-08-27 07:50:43,109 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1246 states, 977 states have (on average 1.2998976458546572) internal successors, (1270), 1012 states have internal predecessors, (1270), 157 states have call successors, (157), 82 states have call predecessors, (157), 111 states have return successors, (232), 157 states have call predecessors, (232), 151 states have call successors, (232) [2021-08-27 07:50:43,111 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1246 states to 1246 states and 1659 transitions. [2021-08-27 07:50:43,111 INFO L78 Accepts]: Start accepts. Automaton has 1246 states and 1659 transitions. Word has length 60 [2021-08-27 07:50:43,111 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-27 07:50:43,111 INFO L470 AbstractCegarLoop]: Abstraction has 1246 states and 1659 transitions. [2021-08-27 07:50:43,111 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.8) internal successors, (49), 5 states have internal predecessors, (49), 2 states have call successors, (10), 2 states have call predecessors, (10), 3 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2021-08-27 07:50:43,111 INFO L276 IsEmpty]: Start isEmpty. Operand 1246 states and 1659 transitions. [2021-08-27 07:50:43,113 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2021-08-27 07:50:43,113 INFO L504 BasicCegarLoop]: Found error trace [2021-08-27 07:50:43,113 INFO L512 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-27 07:50:43,126 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (29)] Forceful destruction successful, exit code 0 [2021-08-27 07:50:43,324 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 29 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-08-27 07:50:43,324 INFO L402 AbstractCegarLoop]: === Iteration 29 === Targeting errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK === [mainErr0ENSURES_VIOLATIONMEMORY_LEAK, errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2021-08-27 07:50:43,324 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 07:50:43,325 INFO L82 PathProgramCache]: Analyzing trace with hash 1490114989, now seen corresponding path program 1 times [2021-08-27 07:50:43,325 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-08-27 07:50:43,325 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [187490792] [2021-08-27 07:50:43,325 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 07:50:43,325 INFO L170 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-08-27 07:50:43,325 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-08-27 07:50:43,326 INFO L229 MonitoredProcess]: Starting monitored process 30 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-08-27 07:50:43,326 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (30)] Waiting until timeout for monitored process [2021-08-27 07:50:44,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:50:44,315 INFO L263 TraceCheckSpWp]: Trace formula consists of 387 conjuncts, 10 conjunts are in the unsatisfiable core [2021-08-27 07:50:44,316 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-27 07:50:44,501 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 07:50:44,501 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-08-27 07:50:44,827 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 07:50:44,827 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-08-27 07:50:44,827 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [187490792] [2021-08-27 07:50:44,827 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [187490792] provided 2 perfect and 0 imperfect interpolant sequences [2021-08-27 07:50:44,827 INFO L186 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2021-08-27 07:50:44,827 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11, 11] imperfect sequences [] total 20 [2021-08-27 07:50:44,828 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [403006867] [2021-08-27 07:50:44,829 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2021-08-27 07:50:44,829 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-08-27 07:50:44,829 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2021-08-27 07:50:44,829 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=334, Unknown=0, NotChecked=0, Total=380 [2021-08-27 07:50:44,830 INFO L87 Difference]: Start difference. First operand 1246 states and 1659 transitions. Second operand has 20 states, 20 states have (on average 3.25) internal successors, (65), 14 states have internal predecessors, (65), 4 states have call successors, (10), 2 states have call predecessors, (10), 7 states have return successors, (11), 9 states have call predecessors, (11), 3 states have call successors, (11) [2021-08-27 07:50:44,993 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 07:50:44,993 INFO L93 Difference]: Finished difference Result 1312 states and 1768 transitions. [2021-08-27 07:50:44,994 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2021-08-27 07:50:44,994 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 20 states have (on average 3.25) internal successors, (65), 14 states have internal predecessors, (65), 4 states have call successors, (10), 2 states have call predecessors, (10), 7 states have return successors, (11), 9 states have call predecessors, (11), 3 states have call successors, (11) Word has length 60 [2021-08-27 07:50:44,994 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-27 07:50:44,996 INFO L225 Difference]: With dead ends: 1312 [2021-08-27 07:50:44,996 INFO L226 Difference]: Without dead ends: 1268 [2021-08-27 07:50:44,997 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 123 GetRequests, 101 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 194.1ms TimeCoverageRelationStatistics Valid=68, Invalid=484, Unknown=0, NotChecked=0, Total=552 [2021-08-27 07:50:44,997 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1268 states. [2021-08-27 07:50:45,019 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1268 to 1252. [2021-08-27 07:50:45,020 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1252 states, 980 states have (on average 1.2979591836734694) internal successors, (1272), 1019 states have internal predecessors, (1272), 156 states have call successors, (156), 82 states have call predecessors, (156), 115 states have return successors, (261), 156 states have call predecessors, (261), 150 states have call successors, (261) [2021-08-27 07:50:45,021 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1252 states to 1252 states and 1689 transitions. [2021-08-27 07:50:45,022 INFO L78 Accepts]: Start accepts. Automaton has 1252 states and 1689 transitions. Word has length 60 [2021-08-27 07:50:45,022 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-27 07:50:45,022 INFO L470 AbstractCegarLoop]: Abstraction has 1252 states and 1689 transitions. [2021-08-27 07:50:45,022 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 3.25) internal successors, (65), 14 states have internal predecessors, (65), 4 states have call successors, (10), 2 states have call predecessors, (10), 7 states have return successors, (11), 9 states have call predecessors, (11), 3 states have call successors, (11) [2021-08-27 07:50:45,022 INFO L276 IsEmpty]: Start isEmpty. Operand 1252 states and 1689 transitions. [2021-08-27 07:50:45,024 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2021-08-27 07:50:45,024 INFO L504 BasicCegarLoop]: Found error trace [2021-08-27 07:50:45,024 INFO L512 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-27 07:50:45,036 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (30)] Ended with exit code 0 [2021-08-27 07:50:45,235 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 30 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-08-27 07:50:45,235 INFO L402 AbstractCegarLoop]: === Iteration 30 === Targeting errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK === [mainErr0ENSURES_VIOLATIONMEMORY_LEAK, errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2021-08-27 07:50:45,235 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 07:50:45,235 INFO L82 PathProgramCache]: Analyzing trace with hash 207330224, now seen corresponding path program 1 times [2021-08-27 07:50:45,236 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-08-27 07:50:45,236 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [362051461] [2021-08-27 07:50:45,236 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 07:50:45,236 INFO L170 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-08-27 07:50:45,236 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-08-27 07:50:45,237 INFO L229 MonitoredProcess]: Starting monitored process 31 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-08-27 07:50:45,237 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (31)] Waiting until timeout for monitored process [2021-08-27 07:50:46,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:50:46,269 INFO L263 TraceCheckSpWp]: Trace formula consists of 443 conjuncts, 6 conjunts are in the unsatisfiable core [2021-08-27 07:50:46,270 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-27 07:50:46,461 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 07:50:46,461 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-08-27 07:50:46,675 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 07:50:46,676 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-08-27 07:50:46,676 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [362051461] [2021-08-27 07:50:46,676 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [362051461] provided 2 perfect and 0 imperfect interpolant sequences [2021-08-27 07:50:46,676 INFO L186 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2021-08-27 07:50:46,676 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5, 5] imperfect sequences [] total 7 [2021-08-27 07:50:46,676 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [964401660] [2021-08-27 07:50:46,676 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-08-27 07:50:46,676 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-08-27 07:50:46,677 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-08-27 07:50:46,677 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2021-08-27 07:50:46,677 INFO L87 Difference]: Start difference. First operand 1252 states and 1689 transitions. Second operand has 7 states, 7 states have (on average 12.285714285714286) internal successors, (86), 7 states have internal predecessors, (86), 4 states have call successors, (19), 6 states have call predecessors, (19), 5 states have return successors, (14), 4 states have call predecessors, (14), 4 states have call successors, (14) [2021-08-27 07:50:47,216 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 07:50:47,220 INFO L93 Difference]: Finished difference Result 1230 states and 1629 transitions. [2021-08-27 07:50:47,220 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-08-27 07:50:47,220 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 12.285714285714286) internal successors, (86), 7 states have internal predecessors, (86), 4 states have call successors, (19), 6 states have call predecessors, (19), 5 states have return successors, (14), 4 states have call predecessors, (14), 4 states have call successors, (14) Word has length 77 [2021-08-27 07:50:47,221 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-27 07:50:47,223 INFO L225 Difference]: With dead ends: 1230 [2021-08-27 07:50:47,223 INFO L226 Difference]: Without dead ends: 1230 [2021-08-27 07:50:47,223 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 155 GetRequests, 149 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 23.1ms TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2021-08-27 07:50:47,224 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1230 states. [2021-08-27 07:50:47,236 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1230 to 1230. [2021-08-27 07:50:47,238 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1230 states, 962 states have (on average 1.2869022869022868) internal successors, (1238), 999 states have internal predecessors, (1238), 154 states have call successors, (154), 82 states have call predecessors, (154), 113 states have return successors, (237), 154 states have call predecessors, (237), 148 states have call successors, (237) [2021-08-27 07:50:47,240 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1230 states to 1230 states and 1629 transitions. [2021-08-27 07:50:47,240 INFO L78 Accepts]: Start accepts. Automaton has 1230 states and 1629 transitions. Word has length 77 [2021-08-27 07:50:47,240 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-27 07:50:47,240 INFO L470 AbstractCegarLoop]: Abstraction has 1230 states and 1629 transitions. [2021-08-27 07:50:47,240 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 12.285714285714286) internal successors, (86), 7 states have internal predecessors, (86), 4 states have call successors, (19), 6 states have call predecessors, (19), 5 states have return successors, (14), 4 states have call predecessors, (14), 4 states have call successors, (14) [2021-08-27 07:50:47,240 INFO L276 IsEmpty]: Start isEmpty. Operand 1230 states and 1629 transitions. [2021-08-27 07:50:47,242 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2021-08-27 07:50:47,242 INFO L504 BasicCegarLoop]: Found error trace [2021-08-27 07:50:47,243 INFO L512 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-27 07:50:47,257 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (31)] Forceful destruction successful, exit code 0 [2021-08-27 07:50:47,455 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 31 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-08-27 07:50:47,455 INFO L402 AbstractCegarLoop]: === Iteration 31 === Targeting errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK === [mainErr0ENSURES_VIOLATIONMEMORY_LEAK, errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2021-08-27 07:50:47,455 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 07:50:47,455 INFO L82 PathProgramCache]: Analyzing trace with hash -211177249, now seen corresponding path program 1 times [2021-08-27 07:50:47,455 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-08-27 07:50:47,455 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [652215265] [2021-08-27 07:50:47,456 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 07:50:47,456 INFO L170 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-08-27 07:50:47,456 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-08-27 07:50:47,456 INFO L229 MonitoredProcess]: Starting monitored process 32 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-08-27 07:50:47,480 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (32)] Waiting until timeout for monitored process [2021-08-27 07:50:48,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:50:48,531 INFO L263 TraceCheckSpWp]: Trace formula consists of 442 conjuncts, 4 conjunts are in the unsatisfiable core [2021-08-27 07:50:48,533 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-27 07:50:48,955 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 07:50:48,955 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-08-27 07:50:49,210 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 07:50:49,210 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-08-27 07:50:49,211 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [652215265] [2021-08-27 07:50:49,211 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [652215265] provided 2 perfect and 0 imperfect interpolant sequences [2021-08-27 07:50:49,211 INFO L186 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2021-08-27 07:50:49,211 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 5] imperfect sequences [] total 7 [2021-08-27 07:50:49,211 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1321100592] [2021-08-27 07:50:49,211 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-08-27 07:50:49,211 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-08-27 07:50:49,212 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-08-27 07:50:49,212 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2021-08-27 07:50:49,212 INFO L87 Difference]: Start difference. First operand 1230 states and 1629 transitions. Second operand has 7 states, 7 states have (on average 14.714285714285714) internal successors, (103), 7 states have internal predecessors, (103), 4 states have call successors, (21), 4 states have call predecessors, (21), 7 states have return successors, (15), 6 states have call predecessors, (15), 3 states have call successors, (15) [2021-08-27 07:50:49,724 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 07:50:49,724 INFO L93 Difference]: Finished difference Result 1244 states and 1641 transitions. [2021-08-27 07:50:49,724 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-08-27 07:50:49,724 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 14.714285714285714) internal successors, (103), 7 states have internal predecessors, (103), 4 states have call successors, (21), 4 states have call predecessors, (21), 7 states have return successors, (15), 6 states have call predecessors, (15), 3 states have call successors, (15) Word has length 78 [2021-08-27 07:50:49,725 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-27 07:50:49,734 INFO L225 Difference]: With dead ends: 1244 [2021-08-27 07:50:49,734 INFO L226 Difference]: Without dead ends: 1244 [2021-08-27 07:50:49,734 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 156 GetRequests, 150 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 35.7ms TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2021-08-27 07:50:49,735 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1244 states. [2021-08-27 07:50:49,749 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1244 to 1230. [2021-08-27 07:50:49,750 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1230 states, 962 states have (on average 1.2827442827442828) internal successors, (1234), 999 states have internal predecessors, (1234), 154 states have call successors, (154), 82 states have call predecessors, (154), 113 states have return successors, (237), 154 states have call predecessors, (237), 148 states have call successors, (237) [2021-08-27 07:50:49,752 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1230 states to 1230 states and 1625 transitions. [2021-08-27 07:50:49,753 INFO L78 Accepts]: Start accepts. Automaton has 1230 states and 1625 transitions. Word has length 78 [2021-08-27 07:50:49,753 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-27 07:50:49,753 INFO L470 AbstractCegarLoop]: Abstraction has 1230 states and 1625 transitions. [2021-08-27 07:50:49,753 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 14.714285714285714) internal successors, (103), 7 states have internal predecessors, (103), 4 states have call successors, (21), 4 states have call predecessors, (21), 7 states have return successors, (15), 6 states have call predecessors, (15), 3 states have call successors, (15) [2021-08-27 07:50:49,753 INFO L276 IsEmpty]: Start isEmpty. Operand 1230 states and 1625 transitions. [2021-08-27 07:50:49,755 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2021-08-27 07:50:49,755 INFO L504 BasicCegarLoop]: Found error trace [2021-08-27 07:50:49,756 INFO L512 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-27 07:50:49,767 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (32)] Forceful destruction successful, exit code 0 [2021-08-27 07:50:49,967 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 32 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-08-27 07:50:49,967 INFO L402 AbstractCegarLoop]: === Iteration 32 === Targeting errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK === [mainErr0ENSURES_VIOLATIONMEMORY_LEAK, errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2021-08-27 07:50:49,967 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 07:50:49,968 INFO L82 PathProgramCache]: Analyzing trace with hash -230207487, now seen corresponding path program 1 times [2021-08-27 07:50:49,968 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-08-27 07:50:49,968 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1692968807] [2021-08-27 07:50:49,968 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 07:50:49,968 INFO L170 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-08-27 07:50:49,968 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-08-27 07:50:49,969 INFO L229 MonitoredProcess]: Starting monitored process 33 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-08-27 07:50:49,970 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (33)] Waiting until timeout for monitored process [2021-08-27 07:50:51,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:50:51,132 INFO L263 TraceCheckSpWp]: Trace formula consists of 426 conjuncts, 13 conjunts are in the unsatisfiable core [2021-08-27 07:50:51,133 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-27 07:50:51,355 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 07:50:51,356 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-08-27 07:50:51,828 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 07:50:51,829 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-08-27 07:50:51,829 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1692968807] [2021-08-27 07:50:51,829 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1692968807] provided 2 perfect and 0 imperfect interpolant sequences [2021-08-27 07:50:51,829 INFO L186 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2021-08-27 07:50:51,830 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12, 12] imperfect sequences [] total 22 [2021-08-27 07:50:51,830 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1900518616] [2021-08-27 07:50:51,830 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2021-08-27 07:50:51,830 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-08-27 07:50:51,831 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2021-08-27 07:50:51,831 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=411, Unknown=0, NotChecked=0, Total=462 [2021-08-27 07:50:51,831 INFO L87 Difference]: Start difference. First operand 1230 states and 1625 transitions. Second operand has 22 states, 20 states have (on average 3.6) internal successors, (72), 16 states have internal predecessors, (72), 6 states have call successors, (12), 2 states have call predecessors, (12), 7 states have return successors, (12), 9 states have call predecessors, (12), 5 states have call successors, (12) [2021-08-27 07:50:52,269 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 07:50:52,270 INFO L93 Difference]: Finished difference Result 1254 states and 1654 transitions. [2021-08-27 07:50:52,270 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2021-08-27 07:50:52,270 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 20 states have (on average 3.6) internal successors, (72), 16 states have internal predecessors, (72), 6 states have call successors, (12), 2 states have call predecessors, (12), 7 states have return successors, (12), 9 states have call predecessors, (12), 5 states have call successors, (12) Word has length 67 [2021-08-27 07:50:52,270 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-27 07:50:52,272 INFO L225 Difference]: With dead ends: 1254 [2021-08-27 07:50:52,272 INFO L226 Difference]: Without dead ends: 1233 [2021-08-27 07:50:52,273 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 137 GetRequests, 113 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 51 ImplicationChecksByTransitivity, 241.9ms TimeCoverageRelationStatistics Valid=75, Invalid=575, Unknown=0, NotChecked=0, Total=650 [2021-08-27 07:50:52,273 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1233 states. [2021-08-27 07:50:52,284 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1233 to 1228. [2021-08-27 07:50:52,285 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1228 states, 961 states have (on average 1.2809573361082207) internal successors, (1231), 998 states have internal predecessors, (1231), 153 states have call successors, (153), 82 states have call predecessors, (153), 113 states have return successors, (236), 153 states have call predecessors, (236), 147 states have call successors, (236) [2021-08-27 07:50:52,287 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1228 states to 1228 states and 1620 transitions. [2021-08-27 07:50:52,288 INFO L78 Accepts]: Start accepts. Automaton has 1228 states and 1620 transitions. Word has length 67 [2021-08-27 07:50:52,288 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-27 07:50:52,288 INFO L470 AbstractCegarLoop]: Abstraction has 1228 states and 1620 transitions. [2021-08-27 07:50:52,288 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 20 states have (on average 3.6) internal successors, (72), 16 states have internal predecessors, (72), 6 states have call successors, (12), 2 states have call predecessors, (12), 7 states have return successors, (12), 9 states have call predecessors, (12), 5 states have call successors, (12) [2021-08-27 07:50:52,288 INFO L276 IsEmpty]: Start isEmpty. Operand 1228 states and 1620 transitions. [2021-08-27 07:50:52,290 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2021-08-27 07:50:52,290 INFO L504 BasicCegarLoop]: Found error trace [2021-08-27 07:50:52,290 INFO L512 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-27 07:50:52,305 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (33)] Forceful destruction successful, exit code 0 [2021-08-27 07:50:52,502 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 33 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-08-27 07:50:52,503 INFO L402 AbstractCegarLoop]: === Iteration 33 === Targeting errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK === [mainErr0ENSURES_VIOLATIONMEMORY_LEAK, errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2021-08-27 07:50:52,503 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 07:50:52,503 INFO L82 PathProgramCache]: Analyzing trace with hash -1443858433, now seen corresponding path program 1 times [2021-08-27 07:50:52,504 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-08-27 07:50:52,504 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1809631551] [2021-08-27 07:50:52,504 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 07:50:52,504 INFO L170 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-08-27 07:50:52,504 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-08-27 07:50:52,505 INFO L229 MonitoredProcess]: Starting monitored process 34 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-08-27 07:50:52,506 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (34)] Waiting until timeout for monitored process [2021-08-27 07:50:53,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:50:53,675 INFO L263 TraceCheckSpWp]: Trace formula consists of 415 conjuncts, 13 conjunts are in the unsatisfiable core [2021-08-27 07:50:53,677 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-27 07:50:53,880 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 07:50:53,880 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-08-27 07:50:54,358 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 07:50:54,359 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-08-27 07:50:54,359 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1809631551] [2021-08-27 07:50:54,359 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1809631551] provided 2 perfect and 0 imperfect interpolant sequences [2021-08-27 07:50:54,360 INFO L186 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2021-08-27 07:50:54,360 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12, 12] imperfect sequences [] total 22 [2021-08-27 07:50:54,360 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [192195196] [2021-08-27 07:50:54,360 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2021-08-27 07:50:54,360 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-08-27 07:50:54,360 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2021-08-27 07:50:54,361 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=411, Unknown=0, NotChecked=0, Total=462 [2021-08-27 07:50:54,361 INFO L87 Difference]: Start difference. First operand 1228 states and 1620 transitions. Second operand has 22 states, 20 states have (on average 3.5) internal successors, (70), 16 states have internal predecessors, (70), 6 states have call successors, (11), 2 states have call predecessors, (11), 7 states have return successors, (11), 9 states have call predecessors, (11), 5 states have call successors, (11) [2021-08-27 07:50:54,617 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 07:50:54,617 INFO L93 Difference]: Finished difference Result 1250 states and 1646 transitions. [2021-08-27 07:50:54,617 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2021-08-27 07:50:54,618 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 20 states have (on average 3.5) internal successors, (70), 16 states have internal predecessors, (70), 6 states have call successors, (11), 2 states have call predecessors, (11), 7 states have return successors, (11), 9 states have call predecessors, (11), 5 states have call successors, (11) Word has length 63 [2021-08-27 07:50:54,618 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-27 07:50:54,620 INFO L225 Difference]: With dead ends: 1250 [2021-08-27 07:50:54,620 INFO L226 Difference]: Without dead ends: 1229 [2021-08-27 07:50:54,621 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 129 GetRequests, 105 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 51 ImplicationChecksByTransitivity, 248.3ms TimeCoverageRelationStatistics Valid=75, Invalid=575, Unknown=0, NotChecked=0, Total=650 [2021-08-27 07:50:54,622 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1229 states. [2021-08-27 07:50:54,633 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1229 to 1226. [2021-08-27 07:50:54,634 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1226 states, 960 states have (on average 1.2791666666666666) internal successors, (1228), 997 states have internal predecessors, (1228), 152 states have call successors, (152), 82 states have call predecessors, (152), 113 states have return successors, (235), 152 states have call predecessors, (235), 146 states have call successors, (235) [2021-08-27 07:50:54,635 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1226 states to 1226 states and 1615 transitions. [2021-08-27 07:50:54,635 INFO L78 Accepts]: Start accepts. Automaton has 1226 states and 1615 transitions. Word has length 63 [2021-08-27 07:50:54,636 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-27 07:50:54,636 INFO L470 AbstractCegarLoop]: Abstraction has 1226 states and 1615 transitions. [2021-08-27 07:50:54,636 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 20 states have (on average 3.5) internal successors, (70), 16 states have internal predecessors, (70), 6 states have call successors, (11), 2 states have call predecessors, (11), 7 states have return successors, (11), 9 states have call predecessors, (11), 5 states have call successors, (11) [2021-08-27 07:50:54,636 INFO L276 IsEmpty]: Start isEmpty. Operand 1226 states and 1615 transitions. [2021-08-27 07:50:54,638 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2021-08-27 07:50:54,638 INFO L504 BasicCegarLoop]: Found error trace [2021-08-27 07:50:54,638 INFO L512 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-27 07:50:54,653 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (34)] Forceful destruction successful, exit code 0 [2021-08-27 07:50:54,849 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 34 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-08-27 07:50:54,849 INFO L402 AbstractCegarLoop]: === Iteration 34 === Targeting errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK === [mainErr0ENSURES_VIOLATIONMEMORY_LEAK, errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2021-08-27 07:50:54,850 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 07:50:54,850 INFO L82 PathProgramCache]: Analyzing trace with hash 854796416, now seen corresponding path program 1 times [2021-08-27 07:50:54,850 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-08-27 07:50:54,850 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1709590466] [2021-08-27 07:50:54,850 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 07:50:54,850 INFO L170 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-08-27 07:50:54,850 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-08-27 07:50:54,852 INFO L229 MonitoredProcess]: Starting monitored process 35 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-08-27 07:50:54,852 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (35)] Waiting until timeout for monitored process [2021-08-27 07:50:56,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:50:56,071 INFO L263 TraceCheckSpWp]: Trace formula consists of 414 conjuncts, 13 conjunts are in the unsatisfiable core [2021-08-27 07:50:56,072 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-27 07:50:56,277 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 07:50:56,277 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-08-27 07:50:56,730 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 07:50:56,731 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-08-27 07:50:56,731 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1709590466] [2021-08-27 07:50:56,731 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1709590466] provided 2 perfect and 0 imperfect interpolant sequences [2021-08-27 07:50:56,731 INFO L186 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2021-08-27 07:50:56,731 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12, 12] imperfect sequences [] total 22 [2021-08-27 07:50:56,731 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [638105693] [2021-08-27 07:50:56,732 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2021-08-27 07:50:56,732 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-08-27 07:50:56,732 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2021-08-27 07:50:56,732 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=411, Unknown=0, NotChecked=0, Total=462 [2021-08-27 07:50:56,733 INFO L87 Difference]: Start difference. First operand 1226 states and 1615 transitions. Second operand has 22 states, 20 states have (on average 3.45) internal successors, (69), 16 states have internal predecessors, (69), 6 states have call successors, (11), 2 states have call predecessors, (11), 7 states have return successors, (11), 9 states have call predecessors, (11), 5 states have call successors, (11) [2021-08-27 07:50:56,987 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 07:50:56,987 INFO L93 Difference]: Finished difference Result 1250 states and 1644 transitions. [2021-08-27 07:50:56,988 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2021-08-27 07:50:56,988 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 20 states have (on average 3.45) internal successors, (69), 16 states have internal predecessors, (69), 6 states have call successors, (11), 2 states have call predecessors, (11), 7 states have return successors, (11), 9 states have call predecessors, (11), 5 states have call successors, (11) Word has length 62 [2021-08-27 07:50:56,988 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-27 07:50:56,990 INFO L225 Difference]: With dead ends: 1250 [2021-08-27 07:50:56,991 INFO L226 Difference]: Without dead ends: 1229 [2021-08-27 07:50:56,991 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 127 GetRequests, 103 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 51 ImplicationChecksByTransitivity, 239.6ms TimeCoverageRelationStatistics Valid=75, Invalid=575, Unknown=0, NotChecked=0, Total=650 [2021-08-27 07:50:56,991 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1229 states. [2021-08-27 07:50:57,002 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1229 to 1224. [2021-08-27 07:50:57,003 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1224 states, 959 states have (on average 1.2773722627737227) internal successors, (1225), 996 states have internal predecessors, (1225), 151 states have call successors, (151), 82 states have call predecessors, (151), 113 states have return successors, (234), 151 states have call predecessors, (234), 145 states have call successors, (234) [2021-08-27 07:50:57,004 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1224 states to 1224 states and 1610 transitions. [2021-08-27 07:50:57,005 INFO L78 Accepts]: Start accepts. Automaton has 1224 states and 1610 transitions. Word has length 62 [2021-08-27 07:50:57,006 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-27 07:50:57,006 INFO L470 AbstractCegarLoop]: Abstraction has 1224 states and 1610 transitions. [2021-08-27 07:50:57,006 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 20 states have (on average 3.45) internal successors, (69), 16 states have internal predecessors, (69), 6 states have call successors, (11), 2 states have call predecessors, (11), 7 states have return successors, (11), 9 states have call predecessors, (11), 5 states have call successors, (11) [2021-08-27 07:50:57,007 INFO L276 IsEmpty]: Start isEmpty. Operand 1224 states and 1610 transitions. [2021-08-27 07:50:57,008 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2021-08-27 07:50:57,008 INFO L504 BasicCegarLoop]: Found error trace [2021-08-27 07:50:57,008 INFO L512 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-27 07:50:57,022 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (35)] Forceful destruction successful, exit code 0 [2021-08-27 07:50:57,220 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 35 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-08-27 07:50:57,220 INFO L402 AbstractCegarLoop]: === Iteration 35 === Targeting errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK === [mainErr0ENSURES_VIOLATIONMEMORY_LEAK, errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2021-08-27 07:50:57,220 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 07:50:57,221 INFO L82 PathProgramCache]: Analyzing trace with hash -136722259, now seen corresponding path program 1 times [2021-08-27 07:50:57,221 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-08-27 07:50:57,221 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1242055717] [2021-08-27 07:50:57,221 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 07:50:57,221 INFO L170 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-08-27 07:50:57,221 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-08-27 07:50:57,222 INFO L229 MonitoredProcess]: Starting monitored process 36 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-08-27 07:50:57,222 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (36)] Waiting until timeout for monitored process [2021-08-27 07:50:58,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:50:58,445 INFO L263 TraceCheckSpWp]: Trace formula consists of 390 conjuncts, 15 conjunts are in the unsatisfiable core [2021-08-27 07:50:58,447 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-27 07:50:58,786 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 07:50:58,787 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-08-27 07:50:59,333 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 07:50:59,334 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-08-27 07:50:59,334 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1242055717] [2021-08-27 07:50:59,334 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1242055717] provided 2 perfect and 0 imperfect interpolant sequences [2021-08-27 07:50:59,334 INFO L186 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2021-08-27 07:50:59,334 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14, 13] imperfect sequences [] total 25 [2021-08-27 07:50:59,334 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1526313112] [2021-08-27 07:50:59,334 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2021-08-27 07:50:59,334 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-08-27 07:50:59,335 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2021-08-27 07:50:59,335 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=541, Unknown=0, NotChecked=0, Total=600 [2021-08-27 07:50:59,335 INFO L87 Difference]: Start difference. First operand 1224 states and 1610 transitions. Second operand has 25 states, 25 states have (on average 2.76) internal successors, (69), 17 states have internal predecessors, (69), 2 states have call successors, (9), 2 states have call predecessors, (9), 9 states have return successors, (11), 9 states have call predecessors, (11), 1 states have call successors, (11) [2021-08-27 07:50:59,754 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 07:50:59,754 INFO L93 Difference]: Finished difference Result 1300 states and 1696 transitions. [2021-08-27 07:50:59,754 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2021-08-27 07:50:59,754 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 25 states have (on average 2.76) internal successors, (69), 17 states have internal predecessors, (69), 2 states have call successors, (9), 2 states have call predecessors, (9), 9 states have return successors, (11), 9 states have call predecessors, (11), 1 states have call successors, (11) Word has length 62 [2021-08-27 07:50:59,755 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-27 07:50:59,757 INFO L225 Difference]: With dead ends: 1300 [2021-08-27 07:50:59,757 INFO L226 Difference]: Without dead ends: 1248 [2021-08-27 07:50:59,757 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 127 GetRequests, 100 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 85 ImplicationChecksByTransitivity, 322.9ms TimeCoverageRelationStatistics Valid=82, Invalid=730, Unknown=0, NotChecked=0, Total=812 [2021-08-27 07:50:59,758 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1248 states. [2021-08-27 07:50:59,770 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1248 to 1214. [2021-08-27 07:50:59,771 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1214 states, 953 states have (on average 1.2770199370409234) internal successors, (1217), 990 states have internal predecessors, (1217), 149 states have call successors, (149), 82 states have call predecessors, (149), 111 states have return successors, (230), 147 states have call predecessors, (230), 143 states have call successors, (230) [2021-08-27 07:50:59,773 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1214 states to 1214 states and 1596 transitions. [2021-08-27 07:50:59,773 INFO L78 Accepts]: Start accepts. Automaton has 1214 states and 1596 transitions. Word has length 62 [2021-08-27 07:50:59,773 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-27 07:50:59,774 INFO L470 AbstractCegarLoop]: Abstraction has 1214 states and 1596 transitions. [2021-08-27 07:50:59,774 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 25 states have (on average 2.76) internal successors, (69), 17 states have internal predecessors, (69), 2 states have call successors, (9), 2 states have call predecessors, (9), 9 states have return successors, (11), 9 states have call predecessors, (11), 1 states have call successors, (11) [2021-08-27 07:50:59,774 INFO L276 IsEmpty]: Start isEmpty. Operand 1214 states and 1596 transitions. [2021-08-27 07:50:59,776 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2021-08-27 07:50:59,776 INFO L504 BasicCegarLoop]: Found error trace [2021-08-27 07:50:59,776 INFO L512 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-27 07:50:59,789 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (36)] Forceful destruction successful, exit code 0 [2021-08-27 07:50:59,984 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 36 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-08-27 07:50:59,985 INFO L402 AbstractCegarLoop]: === Iteration 36 === Targeting errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK === [mainErr0ENSURES_VIOLATIONMEMORY_LEAK, errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2021-08-27 07:50:59,985 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 07:50:59,985 INFO L82 PathProgramCache]: Analyzing trace with hash -2028961323, now seen corresponding path program 1 times [2021-08-27 07:50:59,985 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-08-27 07:50:59,985 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1227195647] [2021-08-27 07:50:59,985 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 07:50:59,985 INFO L170 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-08-27 07:50:59,985 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-08-27 07:50:59,987 INFO L229 MonitoredProcess]: Starting monitored process 37 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-08-27 07:50:59,989 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (37)] Waiting until timeout for monitored process [2021-08-27 07:51:01,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:51:01,267 INFO L263 TraceCheckSpWp]: Trace formula consists of 389 conjuncts, 2 conjunts are in the unsatisfiable core [2021-08-27 07:51:01,268 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-27 07:51:01,383 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 07:51:01,383 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-08-27 07:51:01,529 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 07:51:01,529 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-08-27 07:51:01,530 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1227195647] [2021-08-27 07:51:01,530 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1227195647] provided 2 perfect and 0 imperfect interpolant sequences [2021-08-27 07:51:01,530 INFO L186 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2021-08-27 07:51:01,530 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2021-08-27 07:51:01,530 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1906616965] [2021-08-27 07:51:01,530 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-08-27 07:51:01,530 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-08-27 07:51:01,531 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-08-27 07:51:01,531 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-27 07:51:01,531 INFO L87 Difference]: Start difference. First operand 1214 states and 1596 transitions. Second operand has 3 states, 3 states have (on average 16.666666666666668) internal successors, (50), 3 states have internal predecessors, (50), 2 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2021-08-27 07:51:01,543 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 07:51:01,543 INFO L93 Difference]: Finished difference Result 1120 states and 1432 transitions. [2021-08-27 07:51:01,544 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-08-27 07:51:01,544 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 16.666666666666668) internal successors, (50), 3 states have internal predecessors, (50), 2 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) Word has length 63 [2021-08-27 07:51:01,544 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-27 07:51:01,546 INFO L225 Difference]: With dead ends: 1120 [2021-08-27 07:51:01,546 INFO L226 Difference]: Without dead ends: 1112 [2021-08-27 07:51:01,546 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 125 GetRequests, 124 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.7ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-27 07:51:01,546 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1112 states. [2021-08-27 07:51:01,557 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1112 to 987. [2021-08-27 07:51:01,557 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 987 states, 778 states have (on average 1.263496143958869) internal successors, (983), 801 states have internal predecessors, (983), 114 states have call successors, (114), 71 states have call predecessors, (114), 94 states have return successors, (150), 120 states have call predecessors, (150), 108 states have call successors, (150) [2021-08-27 07:51:01,560 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 987 states to 987 states and 1247 transitions. [2021-08-27 07:51:01,560 INFO L78 Accepts]: Start accepts. Automaton has 987 states and 1247 transitions. Word has length 63 [2021-08-27 07:51:01,561 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-27 07:51:01,561 INFO L470 AbstractCegarLoop]: Abstraction has 987 states and 1247 transitions. [2021-08-27 07:51:01,561 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 16.666666666666668) internal successors, (50), 3 states have internal predecessors, (50), 2 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2021-08-27 07:51:01,561 INFO L276 IsEmpty]: Start isEmpty. Operand 987 states and 1247 transitions. [2021-08-27 07:51:01,562 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2021-08-27 07:51:01,562 INFO L504 BasicCegarLoop]: Found error trace [2021-08-27 07:51:01,563 INFO L512 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-27 07:51:01,576 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (37)] Forceful destruction successful, exit code 0 [2021-08-27 07:51:01,781 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 37 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-08-27 07:51:01,781 INFO L402 AbstractCegarLoop]: === Iteration 37 === Targeting errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK === [mainErr0ENSURES_VIOLATIONMEMORY_LEAK, errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2021-08-27 07:51:01,781 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 07:51:01,781 INFO L82 PathProgramCache]: Analyzing trace with hash -2040120255, now seen corresponding path program 1 times [2021-08-27 07:51:01,782 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-08-27 07:51:01,782 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1053363071] [2021-08-27 07:51:01,782 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 07:51:01,782 INFO L170 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-08-27 07:51:01,782 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-08-27 07:51:01,783 INFO L229 MonitoredProcess]: Starting monitored process 38 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-08-27 07:51:01,783 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (38)] Waiting until timeout for monitored process [2021-08-27 07:51:03,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:51:03,102 INFO L263 TraceCheckSpWp]: Trace formula consists of 469 conjuncts, 15 conjunts are in the unsatisfiable core [2021-08-27 07:51:03,103 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-27 07:51:03,420 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 07:51:03,421 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-08-27 07:51:03,979 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 07:51:03,979 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-08-27 07:51:03,979 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1053363071] [2021-08-27 07:51:03,979 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1053363071] provided 2 perfect and 0 imperfect interpolant sequences [2021-08-27 07:51:03,979 INFO L186 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2021-08-27 07:51:03,979 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14, 13] imperfect sequences [] total 25 [2021-08-27 07:51:03,980 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1979683925] [2021-08-27 07:51:03,980 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2021-08-27 07:51:03,980 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-08-27 07:51:03,980 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2021-08-27 07:51:03,981 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=541, Unknown=0, NotChecked=0, Total=600 [2021-08-27 07:51:03,981 INFO L87 Difference]: Start difference. First operand 987 states and 1247 transitions. Second operand has 25 states, 25 states have (on average 3.16) internal successors, (79), 17 states have internal predecessors, (79), 2 states have call successors, (9), 2 states have call predecessors, (9), 9 states have return successors, (11), 9 states have call predecessors, (11), 1 states have call successors, (11) [2021-08-27 07:51:04,402 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 07:51:04,403 INFO L93 Difference]: Finished difference Result 1069 states and 1337 transitions. [2021-08-27 07:51:04,403 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2021-08-27 07:51:04,403 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 25 states have (on average 3.16) internal successors, (79), 17 states have internal predecessors, (79), 2 states have call successors, (9), 2 states have call predecessors, (9), 9 states have return successors, (11), 9 states have call predecessors, (11), 1 states have call successors, (11) Word has length 72 [2021-08-27 07:51:04,404 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-27 07:51:04,406 INFO L225 Difference]: With dead ends: 1069 [2021-08-27 07:51:04,406 INFO L226 Difference]: Without dead ends: 1017 [2021-08-27 07:51:04,406 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 147 GetRequests, 120 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 85 ImplicationChecksByTransitivity, 330.4ms TimeCoverageRelationStatistics Valid=82, Invalid=730, Unknown=0, NotChecked=0, Total=812 [2021-08-27 07:51:04,407 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1017 states. [2021-08-27 07:51:04,414 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1017 to 983. [2021-08-27 07:51:04,415 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 983 states, 776 states have (on average 1.2615979381443299) internal successors, (979), 799 states have internal predecessors, (979), 112 states have call successors, (112), 71 states have call predecessors, (112), 94 states have return successors, (148), 118 states have call predecessors, (148), 106 states have call successors, (148) [2021-08-27 07:51:04,416 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 983 states to 983 states and 1239 transitions. [2021-08-27 07:51:04,417 INFO L78 Accepts]: Start accepts. Automaton has 983 states and 1239 transitions. Word has length 72 [2021-08-27 07:51:04,417 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-27 07:51:04,417 INFO L470 AbstractCegarLoop]: Abstraction has 983 states and 1239 transitions. [2021-08-27 07:51:04,417 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 25 states have (on average 3.16) internal successors, (79), 17 states have internal predecessors, (79), 2 states have call successors, (9), 2 states have call predecessors, (9), 9 states have return successors, (11), 9 states have call predecessors, (11), 1 states have call successors, (11) [2021-08-27 07:51:04,417 INFO L276 IsEmpty]: Start isEmpty. Operand 983 states and 1239 transitions. [2021-08-27 07:51:04,418 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2021-08-27 07:51:04,419 INFO L504 BasicCegarLoop]: Found error trace [2021-08-27 07:51:04,419 INFO L512 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-27 07:51:04,432 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (38)] Ended with exit code 0 [2021-08-27 07:51:04,631 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 38 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-08-27 07:51:04,631 INFO L402 AbstractCegarLoop]: === Iteration 38 === Targeting errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK === [mainErr0ENSURES_VIOLATIONMEMORY_LEAK, errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2021-08-27 07:51:04,631 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 07:51:04,632 INFO L82 PathProgramCache]: Analyzing trace with hash -317898980, now seen corresponding path program 1 times [2021-08-27 07:51:04,632 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-08-27 07:51:04,632 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2122787883] [2021-08-27 07:51:04,632 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 07:51:04,632 INFO L170 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-08-27 07:51:04,632 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-08-27 07:51:04,633 INFO L229 MonitoredProcess]: Starting monitored process 39 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-08-27 07:51:04,634 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (39)] Waiting until timeout for monitored process [2021-08-27 07:51:05,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:51:05,992 INFO L263 TraceCheckSpWp]: Trace formula consists of 390 conjuncts, 15 conjunts are in the unsatisfiable core [2021-08-27 07:51:05,993 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-27 07:51:06,310 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 07:51:06,310 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-08-27 07:51:06,855 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 07:51:06,856 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-08-27 07:51:06,856 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2122787883] [2021-08-27 07:51:06,856 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2122787883] provided 2 perfect and 0 imperfect interpolant sequences [2021-08-27 07:51:06,856 INFO L186 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2021-08-27 07:51:06,856 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14, 13] imperfect sequences [] total 25 [2021-08-27 07:51:06,856 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1869982939] [2021-08-27 07:51:06,856 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2021-08-27 07:51:06,857 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-08-27 07:51:06,857 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2021-08-27 07:51:06,857 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=541, Unknown=0, NotChecked=0, Total=600 [2021-08-27 07:51:06,857 INFO L87 Difference]: Start difference. First operand 983 states and 1239 transitions. Second operand has 25 states, 25 states have (on average 2.8) internal successors, (70), 17 states have internal predecessors, (70), 2 states have call successors, (9), 2 states have call predecessors, (9), 9 states have return successors, (11), 9 states have call predecessors, (11), 1 states have call successors, (11) [2021-08-27 07:51:07,262 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 07:51:07,262 INFO L93 Difference]: Finished difference Result 1059 states and 1321 transitions. [2021-08-27 07:51:07,263 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2021-08-27 07:51:07,263 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 25 states have (on average 2.8) internal successors, (70), 17 states have internal predecessors, (70), 2 states have call successors, (9), 2 states have call predecessors, (9), 9 states have return successors, (11), 9 states have call predecessors, (11), 1 states have call successors, (11) Word has length 63 [2021-08-27 07:51:07,263 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-27 07:51:07,265 INFO L225 Difference]: With dead ends: 1059 [2021-08-27 07:51:07,265 INFO L226 Difference]: Without dead ends: 1007 [2021-08-27 07:51:07,265 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 129 GetRequests, 102 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 85 ImplicationChecksByTransitivity, 351.8ms TimeCoverageRelationStatistics Valid=82, Invalid=730, Unknown=0, NotChecked=0, Total=812 [2021-08-27 07:51:07,266 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1007 states. [2021-08-27 07:51:07,273 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1007 to 973. [2021-08-27 07:51:07,274 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 973 states, 770 states have (on average 1.261038961038961) internal successors, (971), 793 states have internal predecessors, (971), 110 states have call successors, (110), 71 states have call predecessors, (110), 92 states have return successors, (144), 114 states have call predecessors, (144), 104 states have call successors, (144) [2021-08-27 07:51:07,275 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 973 states to 973 states and 1225 transitions. [2021-08-27 07:51:07,275 INFO L78 Accepts]: Start accepts. Automaton has 973 states and 1225 transitions. Word has length 63 [2021-08-27 07:51:07,275 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-27 07:51:07,275 INFO L470 AbstractCegarLoop]: Abstraction has 973 states and 1225 transitions. [2021-08-27 07:51:07,276 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 25 states have (on average 2.8) internal successors, (70), 17 states have internal predecessors, (70), 2 states have call successors, (9), 2 states have call predecessors, (9), 9 states have return successors, (11), 9 states have call predecessors, (11), 1 states have call successors, (11) [2021-08-27 07:51:07,276 INFO L276 IsEmpty]: Start isEmpty. Operand 973 states and 1225 transitions. [2021-08-27 07:51:07,277 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2021-08-27 07:51:07,277 INFO L504 BasicCegarLoop]: Found error trace [2021-08-27 07:51:07,277 INFO L512 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-27 07:51:07,288 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (39)] Ended with exit code 0 [2021-08-27 07:51:07,485 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 39 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-08-27 07:51:07,485 INFO L402 AbstractCegarLoop]: === Iteration 39 === Targeting errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK === [mainErr0ENSURES_VIOLATIONMEMORY_LEAK, errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2021-08-27 07:51:07,485 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 07:51:07,485 INFO L82 PathProgramCache]: Analyzing trace with hash -988186886, now seen corresponding path program 1 times [2021-08-27 07:51:07,486 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-08-27 07:51:07,486 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1050407692] [2021-08-27 07:51:07,486 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 07:51:07,486 INFO L170 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-08-27 07:51:07,486 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-08-27 07:51:07,487 INFO L229 MonitoredProcess]: Starting monitored process 40 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-08-27 07:51:07,488 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (40)] Waiting until timeout for monitored process [2021-08-27 07:51:08,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:51:08,883 INFO L263 TraceCheckSpWp]: Trace formula consists of 444 conjuncts, 4 conjunts are in the unsatisfiable core [2021-08-27 07:51:08,885 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-27 07:51:09,064 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 07:51:09,064 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-08-27 07:51:09,256 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 07:51:09,256 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-08-27 07:51:09,256 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1050407692] [2021-08-27 07:51:09,256 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1050407692] provided 2 perfect and 0 imperfect interpolant sequences [2021-08-27 07:51:09,256 INFO L186 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2021-08-27 07:51:09,256 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2021-08-27 07:51:09,256 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1527236082] [2021-08-27 07:51:09,256 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-08-27 07:51:09,256 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-08-27 07:51:09,257 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-08-27 07:51:09,257 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-27 07:51:09,257 INFO L87 Difference]: Start difference. First operand 973 states and 1225 transitions. Second operand has 3 states, 3 states have (on average 20.333333333333332) internal successors, (61), 3 states have internal predecessors, (61), 3 states have call successors, (14), 3 states have call predecessors, (14), 2 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) [2021-08-27 07:51:09,275 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 07:51:09,275 INFO L93 Difference]: Finished difference Result 1054 states and 1323 transitions. [2021-08-27 07:51:09,276 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-08-27 07:51:09,276 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 20.333333333333332) internal successors, (61), 3 states have internal predecessors, (61), 3 states have call successors, (14), 3 states have call predecessors, (14), 2 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) Word has length 80 [2021-08-27 07:51:09,276 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-27 07:51:09,278 INFO L225 Difference]: With dead ends: 1054 [2021-08-27 07:51:09,278 INFO L226 Difference]: Without dead ends: 1054 [2021-08-27 07:51:09,278 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 159 GetRequests, 158 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.7ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-27 07:51:09,279 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1054 states. [2021-08-27 07:51:09,286 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1054 to 1030. [2021-08-27 07:51:09,287 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1030 states, 816 states have (on average 1.2659313725490196) internal successors, (1033), 838 states have internal predecessors, (1033), 114 states have call successors, (114), 76 states have call predecessors, (114), 99 states have return successors, (151), 121 states have call predecessors, (151), 109 states have call successors, (151) [2021-08-27 07:51:09,288 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1030 states to 1030 states and 1298 transitions. [2021-08-27 07:51:09,288 INFO L78 Accepts]: Start accepts. Automaton has 1030 states and 1298 transitions. Word has length 80 [2021-08-27 07:51:09,288 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-27 07:51:09,289 INFO L470 AbstractCegarLoop]: Abstraction has 1030 states and 1298 transitions. [2021-08-27 07:51:09,289 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 20.333333333333332) internal successors, (61), 3 states have internal predecessors, (61), 3 states have call successors, (14), 3 states have call predecessors, (14), 2 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) [2021-08-27 07:51:09,289 INFO L276 IsEmpty]: Start isEmpty. Operand 1030 states and 1298 transitions. [2021-08-27 07:51:09,290 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2021-08-27 07:51:09,290 INFO L504 BasicCegarLoop]: Found error trace [2021-08-27 07:51:09,290 INFO L512 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-27 07:51:09,304 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (40)] Ended with exit code 0 [2021-08-27 07:51:09,491 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 40 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-08-27 07:51:09,491 INFO L402 AbstractCegarLoop]: === Iteration 40 === Targeting errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK === [mainErr0ENSURES_VIOLATIONMEMORY_LEAK, errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2021-08-27 07:51:09,491 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 07:51:09,491 INFO L82 PathProgramCache]: Analyzing trace with hash 1151296709, now seen corresponding path program 1 times [2021-08-27 07:51:09,491 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-08-27 07:51:09,491 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1079321834] [2021-08-27 07:51:09,492 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 07:51:09,492 INFO L170 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-08-27 07:51:09,492 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-08-27 07:51:09,492 INFO L229 MonitoredProcess]: Starting monitored process 41 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-08-27 07:51:09,493 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (41)] Waiting until timeout for monitored process [2021-08-27 07:51:10,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:51:10,926 INFO L263 TraceCheckSpWp]: Trace formula consists of 422 conjuncts, 13 conjunts are in the unsatisfiable core [2021-08-27 07:51:10,927 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-27 07:51:11,151 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 07:51:11,152 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-08-27 07:51:11,647 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 07:51:11,648 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-08-27 07:51:11,648 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1079321834] [2021-08-27 07:51:11,648 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1079321834] provided 2 perfect and 0 imperfect interpolant sequences [2021-08-27 07:51:11,648 INFO L186 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2021-08-27 07:51:11,648 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12, 12] imperfect sequences [] total 22 [2021-08-27 07:51:11,648 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [289186476] [2021-08-27 07:51:11,648 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2021-08-27 07:51:11,649 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-08-27 07:51:11,649 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2021-08-27 07:51:11,649 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=411, Unknown=0, NotChecked=0, Total=462 [2021-08-27 07:51:11,649 INFO L87 Difference]: Start difference. First operand 1030 states and 1298 transitions. Second operand has 22 states, 20 states have (on average 3.55) internal successors, (71), 16 states have internal predecessors, (71), 6 states have call successors, (12), 2 states have call predecessors, (12), 7 states have return successors, (12), 9 states have call predecessors, (12), 5 states have call successors, (12) [2021-08-27 07:51:11,865 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 07:51:11,866 INFO L93 Difference]: Finished difference Result 1052 states and 1324 transitions. [2021-08-27 07:51:11,866 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2021-08-27 07:51:11,866 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 20 states have (on average 3.55) internal successors, (71), 16 states have internal predecessors, (71), 6 states have call successors, (12), 2 states have call predecessors, (12), 7 states have return successors, (12), 9 states have call predecessors, (12), 5 states have call successors, (12) Word has length 66 [2021-08-27 07:51:11,866 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-27 07:51:11,868 INFO L225 Difference]: With dead ends: 1052 [2021-08-27 07:51:11,868 INFO L226 Difference]: Without dead ends: 1031 [2021-08-27 07:51:11,869 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 135 GetRequests, 111 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 51 ImplicationChecksByTransitivity, 248.0ms TimeCoverageRelationStatistics Valid=75, Invalid=575, Unknown=0, NotChecked=0, Total=650 [2021-08-27 07:51:11,869 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1031 states. [2021-08-27 07:51:11,879 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1031 to 1028. [2021-08-27 07:51:11,880 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1028 states, 815 states have (on average 1.2650306748466258) internal successors, (1031), 837 states have internal predecessors, (1031), 113 states have call successors, (113), 76 states have call predecessors, (113), 99 states have return successors, (150), 120 states have call predecessors, (150), 108 states have call successors, (150) [2021-08-27 07:51:11,881 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1028 states to 1028 states and 1294 transitions. [2021-08-27 07:51:11,881 INFO L78 Accepts]: Start accepts. Automaton has 1028 states and 1294 transitions. Word has length 66 [2021-08-27 07:51:11,881 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-27 07:51:11,881 INFO L470 AbstractCegarLoop]: Abstraction has 1028 states and 1294 transitions. [2021-08-27 07:51:11,882 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 20 states have (on average 3.55) internal successors, (71), 16 states have internal predecessors, (71), 6 states have call successors, (12), 2 states have call predecessors, (12), 7 states have return successors, (12), 9 states have call predecessors, (12), 5 states have call successors, (12) [2021-08-27 07:51:11,882 INFO L276 IsEmpty]: Start isEmpty. Operand 1028 states and 1294 transitions. [2021-08-27 07:51:11,883 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2021-08-27 07:51:11,883 INFO L504 BasicCegarLoop]: Found error trace [2021-08-27 07:51:11,883 INFO L512 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-27 07:51:11,898 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (41)] Forceful destruction successful, exit code 0 [2021-08-27 07:51:12,096 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 41 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-08-27 07:51:12,096 INFO L402 AbstractCegarLoop]: === Iteration 41 === Targeting errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK === [mainErr0ENSURES_VIOLATIONMEMORY_LEAK, errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2021-08-27 07:51:12,096 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 07:51:12,096 INFO L82 PathProgramCache]: Analyzing trace with hash 466171422, now seen corresponding path program 1 times [2021-08-27 07:51:12,097 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-08-27 07:51:12,097 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1133059851] [2021-08-27 07:51:12,097 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 07:51:12,097 INFO L170 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-08-27 07:51:12,097 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-08-27 07:51:12,098 INFO L229 MonitoredProcess]: Starting monitored process 42 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-08-27 07:51:12,100 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (42)] Waiting until timeout for monitored process [2021-08-27 07:51:13,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:51:13,583 INFO L263 TraceCheckSpWp]: Trace formula consists of 415 conjuncts, 4 conjunts are in the unsatisfiable core [2021-08-27 07:51:13,584 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-27 07:51:13,721 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 07:51:13,722 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-08-27 07:51:13,910 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 07:51:13,910 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-08-27 07:51:13,910 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1133059851] [2021-08-27 07:51:13,910 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1133059851] provided 2 perfect and 0 imperfect interpolant sequences [2021-08-27 07:51:13,911 INFO L186 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2021-08-27 07:51:13,911 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5, 5] imperfect sequences [] total 8 [2021-08-27 07:51:13,911 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1563833361] [2021-08-27 07:51:13,911 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2021-08-27 07:51:13,911 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-08-27 07:51:13,911 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-08-27 07:51:13,911 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2021-08-27 07:51:13,911 INFO L87 Difference]: Start difference. First operand 1028 states and 1294 transitions. Second operand has 8 states, 8 states have (on average 7.0) internal successors, (56), 6 states have internal predecessors, (56), 2 states have call successors, (10), 2 states have call predecessors, (10), 4 states have return successors, (9), 4 states have call predecessors, (9), 2 states have call successors, (9) [2021-08-27 07:51:13,951 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 07:51:13,951 INFO L93 Difference]: Finished difference Result 1022 states and 1284 transitions. [2021-08-27 07:51:13,951 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-08-27 07:51:13,951 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 7.0) internal successors, (56), 6 states have internal predecessors, (56), 2 states have call successors, (10), 2 states have call predecessors, (10), 4 states have return successors, (9), 4 states have call predecessors, (9), 2 states have call successors, (9) Word has length 65 [2021-08-27 07:51:13,951 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-27 07:51:13,953 INFO L225 Difference]: With dead ends: 1022 [2021-08-27 07:51:13,953 INFO L226 Difference]: Without dead ends: 1022 [2021-08-27 07:51:13,953 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 129 GetRequests, 123 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 21.7ms TimeCoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2021-08-27 07:51:13,954 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1022 states. [2021-08-27 07:51:13,969 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1022 to 1022. [2021-08-27 07:51:13,970 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1022 states, 810 states have (on average 1.262962962962963) internal successors, (1023), 832 states have internal predecessors, (1023), 112 states have call successors, (112), 76 states have call predecessors, (112), 99 states have return successors, (149), 119 states have call predecessors, (149), 107 states have call successors, (149) [2021-08-27 07:51:13,971 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1022 states to 1022 states and 1284 transitions. [2021-08-27 07:51:13,971 INFO L78 Accepts]: Start accepts. Automaton has 1022 states and 1284 transitions. Word has length 65 [2021-08-27 07:51:13,971 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-27 07:51:13,971 INFO L470 AbstractCegarLoop]: Abstraction has 1022 states and 1284 transitions. [2021-08-27 07:51:13,972 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 7.0) internal successors, (56), 6 states have internal predecessors, (56), 2 states have call successors, (10), 2 states have call predecessors, (10), 4 states have return successors, (9), 4 states have call predecessors, (9), 2 states have call successors, (9) [2021-08-27 07:51:13,972 INFO L276 IsEmpty]: Start isEmpty. Operand 1022 states and 1284 transitions. [2021-08-27 07:51:13,973 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2021-08-27 07:51:13,973 INFO L504 BasicCegarLoop]: Found error trace [2021-08-27 07:51:13,973 INFO L512 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-27 07:51:13,985 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (42)] Ended with exit code 0 [2021-08-27 07:51:14,173 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 42 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-08-27 07:51:14,174 INFO L402 AbstractCegarLoop]: === Iteration 42 === Targeting errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK === [mainErr0ENSURES_VIOLATIONMEMORY_LEAK, errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2021-08-27 07:51:14,174 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 07:51:14,174 INFO L82 PathProgramCache]: Analyzing trace with hash 618839343, now seen corresponding path program 1 times [2021-08-27 07:51:14,175 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-08-27 07:51:14,175 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1974711021] [2021-08-27 07:51:14,175 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 07:51:14,175 INFO L170 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-08-27 07:51:14,175 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-08-27 07:51:14,176 INFO L229 MonitoredProcess]: Starting monitored process 43 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-08-27 07:51:14,177 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (43)] Waiting until timeout for monitored process [2021-08-27 07:51:15,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:51:15,675 INFO L263 TraceCheckSpWp]: Trace formula consists of 419 conjuncts, 4 conjunts are in the unsatisfiable core [2021-08-27 07:51:15,679 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-27 07:51:15,813 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 07:51:15,813 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-08-27 07:51:15,992 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 07:51:15,993 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-08-27 07:51:15,993 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1974711021] [2021-08-27 07:51:15,993 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1974711021] provided 2 perfect and 0 imperfect interpolant sequences [2021-08-27 07:51:15,993 INFO L186 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2021-08-27 07:51:15,993 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5, 5] imperfect sequences [] total 8 [2021-08-27 07:51:15,993 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1043727632] [2021-08-27 07:51:15,993 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2021-08-27 07:51:15,993 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-08-27 07:51:15,993 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-08-27 07:51:15,994 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2021-08-27 07:51:15,994 INFO L87 Difference]: Start difference. First operand 1022 states and 1284 transitions. Second operand has 8 states, 8 states have (on average 7.25) internal successors, (58), 6 states have internal predecessors, (58), 2 states have call successors, (10), 2 states have call predecessors, (10), 4 states have return successors, (9), 4 states have call predecessors, (9), 2 states have call successors, (9) [2021-08-27 07:51:16,026 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 07:51:16,026 INFO L93 Difference]: Finished difference Result 1022 states and 1283 transitions. [2021-08-27 07:51:16,026 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-08-27 07:51:16,026 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 7.25) internal successors, (58), 6 states have internal predecessors, (58), 2 states have call successors, (10), 2 states have call predecessors, (10), 4 states have return successors, (9), 4 states have call predecessors, (9), 2 states have call successors, (9) Word has length 67 [2021-08-27 07:51:16,026 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-27 07:51:16,028 INFO L225 Difference]: With dead ends: 1022 [2021-08-27 07:51:16,028 INFO L226 Difference]: Without dead ends: 1017 [2021-08-27 07:51:16,028 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 133 GetRequests, 127 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 21.1ms TimeCoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2021-08-27 07:51:16,029 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1017 states. [2021-08-27 07:51:16,036 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1017 to 1017. [2021-08-27 07:51:16,037 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1017 states, 806 states have (on average 1.2617866004962779) internal successors, (1017), 828 states have internal predecessors, (1017), 111 states have call successors, (111), 76 states have call predecessors, (111), 99 states have return successors, (148), 118 states have call predecessors, (148), 106 states have call successors, (148) [2021-08-27 07:51:16,038 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1017 states to 1017 states and 1276 transitions. [2021-08-27 07:51:16,038 INFO L78 Accepts]: Start accepts. Automaton has 1017 states and 1276 transitions. Word has length 67 [2021-08-27 07:51:16,039 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-27 07:51:16,039 INFO L470 AbstractCegarLoop]: Abstraction has 1017 states and 1276 transitions. [2021-08-27 07:51:16,039 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 7.25) internal successors, (58), 6 states have internal predecessors, (58), 2 states have call successors, (10), 2 states have call predecessors, (10), 4 states have return successors, (9), 4 states have call predecessors, (9), 2 states have call successors, (9) [2021-08-27 07:51:16,039 INFO L276 IsEmpty]: Start isEmpty. Operand 1017 states and 1276 transitions. [2021-08-27 07:51:16,040 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2021-08-27 07:51:16,040 INFO L504 BasicCegarLoop]: Found error trace [2021-08-27 07:51:16,040 INFO L512 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-27 07:51:16,052 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (43)] Forceful destruction successful, exit code 0 [2021-08-27 07:51:16,252 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 43 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-08-27 07:51:16,257 INFO L402 AbstractCegarLoop]: === Iteration 43 === Targeting errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK === [mainErr0ENSURES_VIOLATIONMEMORY_LEAK, errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2021-08-27 07:51:16,257 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 07:51:16,257 INFO L82 PathProgramCache]: Analyzing trace with hash -601739544, now seen corresponding path program 1 times [2021-08-27 07:51:16,257 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-08-27 07:51:16,258 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1039427277] [2021-08-27 07:51:16,258 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 07:51:16,258 INFO L170 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-08-27 07:51:16,258 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-08-27 07:51:16,258 INFO L229 MonitoredProcess]: Starting monitored process 44 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-08-27 07:51:16,259 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (44)] Waiting until timeout for monitored process [2021-08-27 07:51:17,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:51:17,750 INFO L263 TraceCheckSpWp]: Trace formula consists of 389 conjuncts, 4 conjunts are in the unsatisfiable core [2021-08-27 07:51:17,752 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-27 07:51:18,103 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 07:51:18,104 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-08-27 07:51:18,379 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 07:51:18,379 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-08-27 07:51:18,380 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1039427277] [2021-08-27 07:51:18,380 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1039427277] provided 2 perfect and 0 imperfect interpolant sequences [2021-08-27 07:51:18,380 INFO L186 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2021-08-27 07:51:18,381 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5, 5] imperfect sequences [] total 8 [2021-08-27 07:51:18,381 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [91195483] [2021-08-27 07:51:18,381 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2021-08-27 07:51:18,381 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-08-27 07:51:18,382 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-08-27 07:51:18,382 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2021-08-27 07:51:18,382 INFO L87 Difference]: Start difference. First operand 1017 states and 1276 transitions. Second operand has 8 states, 8 states have (on average 12.125) internal successors, (97), 8 states have internal predecessors, (97), 4 states have call successors, (14), 3 states have call predecessors, (14), 5 states have return successors, (13), 7 states have call predecessors, (13), 3 states have call successors, (13) [2021-08-27 07:51:18,726 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 07:51:18,727 INFO L93 Difference]: Finished difference Result 1025 states and 1280 transitions. [2021-08-27 07:51:18,727 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-08-27 07:51:18,727 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 12.125) internal successors, (97), 8 states have internal predecessors, (97), 4 states have call successors, (14), 3 states have call predecessors, (14), 5 states have return successors, (13), 7 states have call predecessors, (13), 3 states have call successors, (13) Word has length 68 [2021-08-27 07:51:18,727 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-27 07:51:18,729 INFO L225 Difference]: With dead ends: 1025 [2021-08-27 07:51:18,729 INFO L226 Difference]: Without dead ends: 1025 [2021-08-27 07:51:18,729 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 136 GetRequests, 129 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 39.1ms TimeCoverageRelationStatistics Valid=29, Invalid=43, Unknown=0, NotChecked=0, Total=72 [2021-08-27 07:51:18,730 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1025 states. [2021-08-27 07:51:18,737 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1025 to 1017. [2021-08-27 07:51:18,738 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1017 states, 806 states have (on average 1.2593052109181142) internal successors, (1015), 828 states have internal predecessors, (1015), 111 states have call successors, (111), 76 states have call predecessors, (111), 99 states have return successors, (148), 118 states have call predecessors, (148), 106 states have call successors, (148) [2021-08-27 07:51:18,739 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1017 states to 1017 states and 1274 transitions. [2021-08-27 07:51:18,740 INFO L78 Accepts]: Start accepts. Automaton has 1017 states and 1274 transitions. Word has length 68 [2021-08-27 07:51:18,740 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-27 07:51:18,740 INFO L470 AbstractCegarLoop]: Abstraction has 1017 states and 1274 transitions. [2021-08-27 07:51:18,740 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 12.125) internal successors, (97), 8 states have internal predecessors, (97), 4 states have call successors, (14), 3 states have call predecessors, (14), 5 states have return successors, (13), 7 states have call predecessors, (13), 3 states have call successors, (13) [2021-08-27 07:51:18,740 INFO L276 IsEmpty]: Start isEmpty. Operand 1017 states and 1274 transitions. [2021-08-27 07:51:18,741 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2021-08-27 07:51:18,741 INFO L504 BasicCegarLoop]: Found error trace [2021-08-27 07:51:18,742 INFO L512 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-27 07:51:18,761 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (44)] Forceful destruction successful, exit code 0 [2021-08-27 07:51:18,954 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 44 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-08-27 07:51:18,954 INFO L402 AbstractCegarLoop]: === Iteration 44 === Targeting errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK === [mainErr0ENSURES_VIOLATIONMEMORY_LEAK, errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2021-08-27 07:51:18,954 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 07:51:18,954 INFO L82 PathProgramCache]: Analyzing trace with hash -275884697, now seen corresponding path program 1 times [2021-08-27 07:51:18,954 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-08-27 07:51:18,955 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1651906267] [2021-08-27 07:51:18,955 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 07:51:18,955 INFO L170 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-08-27 07:51:18,955 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-08-27 07:51:18,956 INFO L229 MonitoredProcess]: Starting monitored process 45 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-08-27 07:51:18,957 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (45)] Waiting until timeout for monitored process [2021-08-27 07:51:20,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:51:20,539 INFO L263 TraceCheckSpWp]: Trace formula consists of 435 conjuncts, 2 conjunts are in the unsatisfiable core [2021-08-27 07:51:20,540 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-27 07:51:20,691 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 07:51:20,691 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-08-27 07:51:20,875 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 07:51:20,875 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-08-27 07:51:20,875 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1651906267] [2021-08-27 07:51:20,876 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1651906267] provided 2 perfect and 0 imperfect interpolant sequences [2021-08-27 07:51:20,876 INFO L186 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2021-08-27 07:51:20,876 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 4 [2021-08-27 07:51:20,876 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [809576151] [2021-08-27 07:51:20,876 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-08-27 07:51:20,876 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-08-27 07:51:20,876 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-08-27 07:51:20,876 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-08-27 07:51:20,877 INFO L87 Difference]: Start difference. First operand 1017 states and 1274 transitions. Second operand has 4 states, 4 states have (on average 13.0) internal successors, (52), 4 states have internal predecessors, (52), 2 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (9), 2 states have call predecessors, (9), 1 states have call successors, (9) [2021-08-27 07:51:20,885 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 07:51:20,885 INFO L93 Difference]: Finished difference Result 1017 states and 1270 transitions. [2021-08-27 07:51:20,885 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-08-27 07:51:20,885 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 13.0) internal successors, (52), 4 states have internal predecessors, (52), 2 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (9), 2 states have call predecessors, (9), 1 states have call successors, (9) Word has length 72 [2021-08-27 07:51:20,885 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-27 07:51:20,887 INFO L225 Difference]: With dead ends: 1017 [2021-08-27 07:51:20,887 INFO L226 Difference]: Without dead ends: 1017 [2021-08-27 07:51:20,888 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 143 GetRequests, 141 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 4.1ms TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-08-27 07:51:20,888 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1017 states. [2021-08-27 07:51:20,895 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1017 to 1017. [2021-08-27 07:51:20,895 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1017 states, 806 states have (on average 1.2543424317617866) internal successors, (1011), 828 states have internal predecessors, (1011), 111 states have call successors, (111), 76 states have call predecessors, (111), 99 states have return successors, (148), 118 states have call predecessors, (148), 106 states have call successors, (148) [2021-08-27 07:51:20,896 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1017 states to 1017 states and 1270 transitions. [2021-08-27 07:51:20,897 INFO L78 Accepts]: Start accepts. Automaton has 1017 states and 1270 transitions. Word has length 72 [2021-08-27 07:51:20,897 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-27 07:51:20,897 INFO L470 AbstractCegarLoop]: Abstraction has 1017 states and 1270 transitions. [2021-08-27 07:51:20,897 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.0) internal successors, (52), 4 states have internal predecessors, (52), 2 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (9), 2 states have call predecessors, (9), 1 states have call successors, (9) [2021-08-27 07:51:20,897 INFO L276 IsEmpty]: Start isEmpty. Operand 1017 states and 1270 transitions. [2021-08-27 07:51:20,898 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2021-08-27 07:51:20,898 INFO L504 BasicCegarLoop]: Found error trace [2021-08-27 07:51:20,898 INFO L512 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-27 07:51:20,913 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (45)] Forceful destruction successful, exit code 0 [2021-08-27 07:51:21,113 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 45 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-08-27 07:51:21,113 INFO L402 AbstractCegarLoop]: === Iteration 45 === Targeting errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK === [mainErr0ENSURES_VIOLATIONMEMORY_LEAK, errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2021-08-27 07:51:21,113 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 07:51:21,113 INFO L82 PathProgramCache]: Analyzing trace with hash -2137250320, now seen corresponding path program 1 times [2021-08-27 07:51:21,114 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-08-27 07:51:21,114 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1139942672] [2021-08-27 07:51:21,114 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 07:51:21,114 INFO L170 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-08-27 07:51:21,114 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-08-27 07:51:21,114 INFO L229 MonitoredProcess]: Starting monitored process 46 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-08-27 07:51:21,115 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (46)] Waiting until timeout for monitored process [2021-08-27 07:51:22,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:51:22,758 INFO L263 TraceCheckSpWp]: Trace formula consists of 456 conjuncts, 7 conjunts are in the unsatisfiable core [2021-08-27 07:51:22,759 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-27 07:51:22,925 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 07:51:22,926 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-08-27 07:51:23,216 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 07:51:23,216 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-08-27 07:51:23,217 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1139942672] [2021-08-27 07:51:23,217 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1139942672] provided 2 perfect and 0 imperfect interpolant sequences [2021-08-27 07:51:23,217 INFO L186 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2021-08-27 07:51:23,217 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7, 7] imperfect sequences [] total 11 [2021-08-27 07:51:23,217 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [536185024] [2021-08-27 07:51:23,217 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2021-08-27 07:51:23,217 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-08-27 07:51:23,217 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-08-27 07:51:23,217 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2021-08-27 07:51:23,217 INFO L87 Difference]: Start difference. First operand 1017 states and 1270 transitions. Second operand has 11 states, 11 states have (on average 5.454545454545454) internal successors, (60), 9 states have internal predecessors, (60), 5 states have call successors, (12), 2 states have call predecessors, (12), 5 states have return successors, (11), 5 states have call predecessors, (11), 4 states have call successors, (11) [2021-08-27 07:51:23,287 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 07:51:23,288 INFO L93 Difference]: Finished difference Result 1023 states and 1277 transitions. [2021-08-27 07:51:23,288 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-08-27 07:51:23,288 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 5.454545454545454) internal successors, (60), 9 states have internal predecessors, (60), 5 states have call successors, (12), 2 states have call predecessors, (12), 5 states have return successors, (11), 5 states have call predecessors, (11), 4 states have call successors, (11) Word has length 74 [2021-08-27 07:51:23,288 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-27 07:51:23,290 INFO L225 Difference]: With dead ends: 1023 [2021-08-27 07:51:23,290 INFO L226 Difference]: Without dead ends: 1023 [2021-08-27 07:51:23,290 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 148 GetRequests, 138 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 52.3ms TimeCoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2021-08-27 07:51:23,290 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1023 states. [2021-08-27 07:51:23,296 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1023 to 1017. [2021-08-27 07:51:23,297 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1017 states, 806 states have (on average 1.2543424317617866) internal successors, (1011), 828 states have internal predecessors, (1011), 111 states have call successors, (111), 76 states have call predecessors, (111), 99 states have return successors, (147), 118 states have call predecessors, (147), 106 states have call successors, (147) [2021-08-27 07:51:23,298 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1017 states to 1017 states and 1269 transitions. [2021-08-27 07:51:23,298 INFO L78 Accepts]: Start accepts. Automaton has 1017 states and 1269 transitions. Word has length 74 [2021-08-27 07:51:23,298 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-27 07:51:23,298 INFO L470 AbstractCegarLoop]: Abstraction has 1017 states and 1269 transitions. [2021-08-27 07:51:23,298 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 5.454545454545454) internal successors, (60), 9 states have internal predecessors, (60), 5 states have call successors, (12), 2 states have call predecessors, (12), 5 states have return successors, (11), 5 states have call predecessors, (11), 4 states have call successors, (11) [2021-08-27 07:51:23,298 INFO L276 IsEmpty]: Start isEmpty. Operand 1017 states and 1269 transitions. [2021-08-27 07:51:23,299 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2021-08-27 07:51:23,299 INFO L504 BasicCegarLoop]: Found error trace [2021-08-27 07:51:23,299 INFO L512 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-27 07:51:23,312 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (46)] Forceful destruction successful, exit code 0 [2021-08-27 07:51:23,500 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 46 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-08-27 07:51:23,500 INFO L402 AbstractCegarLoop]: === Iteration 46 === Targeting errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK === [mainErr0ENSURES_VIOLATIONMEMORY_LEAK, errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2021-08-27 07:51:23,500 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 07:51:23,501 INFO L82 PathProgramCache]: Analyzing trace with hash -151974564, now seen corresponding path program 1 times [2021-08-27 07:51:23,501 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-08-27 07:51:23,501 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [254920421] [2021-08-27 07:51:23,501 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 07:51:23,501 INFO L170 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-08-27 07:51:23,501 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-08-27 07:51:23,504 INFO L229 MonitoredProcess]: Starting monitored process 47 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-08-27 07:51:23,504 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (47)] Waiting until timeout for monitored process [2021-08-27 07:51:25,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:51:25,173 INFO L263 TraceCheckSpWp]: Trace formula consists of 459 conjuncts, 7 conjunts are in the unsatisfiable core [2021-08-27 07:51:25,174 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-27 07:51:25,326 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 07:51:25,326 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-08-27 07:51:25,596 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 07:51:25,596 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-08-27 07:51:25,596 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [254920421] [2021-08-27 07:51:25,596 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [254920421] provided 2 perfect and 0 imperfect interpolant sequences [2021-08-27 07:51:25,596 INFO L186 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2021-08-27 07:51:25,597 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7, 7] imperfect sequences [] total 11 [2021-08-27 07:51:25,597 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [336603427] [2021-08-27 07:51:25,597 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2021-08-27 07:51:25,597 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-08-27 07:51:25,597 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-08-27 07:51:25,597 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2021-08-27 07:51:25,597 INFO L87 Difference]: Start difference. First operand 1017 states and 1269 transitions. Second operand has 11 states, 9 states have (on average 6.333333333333333) internal successors, (57), 9 states have internal predecessors, (57), 5 states have call successors, (11), 2 states have call predecessors, (11), 5 states have return successors, (10), 5 states have call predecessors, (10), 4 states have call successors, (10) [2021-08-27 07:51:25,672 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 07:51:25,673 INFO L93 Difference]: Finished difference Result 1023 states and 1276 transitions. [2021-08-27 07:51:25,673 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-08-27 07:51:25,673 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 9 states have (on average 6.333333333333333) internal successors, (57), 9 states have internal predecessors, (57), 5 states have call successors, (11), 2 states have call predecessors, (11), 5 states have return successors, (10), 5 states have call predecessors, (10), 4 states have call successors, (10) Word has length 70 [2021-08-27 07:51:25,673 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-27 07:51:25,675 INFO L225 Difference]: With dead ends: 1023 [2021-08-27 07:51:25,675 INFO L226 Difference]: Without dead ends: 1023 [2021-08-27 07:51:25,675 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 140 GetRequests, 130 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 52.6ms TimeCoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2021-08-27 07:51:25,675 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1023 states. [2021-08-27 07:51:25,682 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1023 to 1016. [2021-08-27 07:51:25,683 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1016 states, 806 states have (on average 1.2543424317617866) internal successors, (1011), 827 states have internal predecessors, (1011), 110 states have call successors, (110), 76 states have call predecessors, (110), 99 states have return successors, (145), 118 states have call predecessors, (145), 105 states have call successors, (145) [2021-08-27 07:51:25,684 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1016 states to 1016 states and 1266 transitions. [2021-08-27 07:51:25,684 INFO L78 Accepts]: Start accepts. Automaton has 1016 states and 1266 transitions. Word has length 70 [2021-08-27 07:51:25,684 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-27 07:51:25,684 INFO L470 AbstractCegarLoop]: Abstraction has 1016 states and 1266 transitions. [2021-08-27 07:51:25,685 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 9 states have (on average 6.333333333333333) internal successors, (57), 9 states have internal predecessors, (57), 5 states have call successors, (11), 2 states have call predecessors, (11), 5 states have return successors, (10), 5 states have call predecessors, (10), 4 states have call successors, (10) [2021-08-27 07:51:25,685 INFO L276 IsEmpty]: Start isEmpty. Operand 1016 states and 1266 transitions. [2021-08-27 07:51:25,686 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2021-08-27 07:51:25,686 INFO L504 BasicCegarLoop]: Found error trace [2021-08-27 07:51:25,686 INFO L512 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-27 07:51:25,699 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (47)] Forceful destruction successful, exit code 0 [2021-08-27 07:51:25,895 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 47 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-08-27 07:51:25,895 INFO L402 AbstractCegarLoop]: === Iteration 47 === Targeting errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK === [mainErr0ENSURES_VIOLATIONMEMORY_LEAK, errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2021-08-27 07:51:25,895 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 07:51:25,895 INFO L82 PathProgramCache]: Analyzing trace with hash 549625310, now seen corresponding path program 1 times [2021-08-27 07:51:25,895 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-08-27 07:51:25,896 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1416325891] [2021-08-27 07:51:25,896 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 07:51:25,896 INFO L170 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-08-27 07:51:25,896 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-08-27 07:51:25,896 INFO L229 MonitoredProcess]: Starting monitored process 48 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-08-27 07:51:25,897 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (48)] Waiting until timeout for monitored process [2021-08-27 07:51:27,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:51:27,621 INFO L263 TraceCheckSpWp]: Trace formula consists of 459 conjuncts, 15 conjunts are in the unsatisfiable core [2021-08-27 07:51:27,624 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-27 07:51:27,863 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 07:51:27,864 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-08-27 07:51:28,397 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 07:51:28,397 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-08-27 07:51:28,397 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1416325891] [2021-08-27 07:51:28,397 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1416325891] provided 2 perfect and 0 imperfect interpolant sequences [2021-08-27 07:51:28,397 INFO L186 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2021-08-27 07:51:28,397 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14, 14] imperfect sequences [] total 26 [2021-08-27 07:51:28,398 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2098172706] [2021-08-27 07:51:28,398 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2021-08-27 07:51:28,398 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-08-27 07:51:28,398 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2021-08-27 07:51:28,398 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=589, Unknown=0, NotChecked=0, Total=650 [2021-08-27 07:51:28,398 INFO L87 Difference]: Start difference. First operand 1016 states and 1266 transitions. Second operand has 26 states, 24 states have (on average 3.2083333333333335) internal successors, (77), 18 states have internal predecessors, (77), 6 states have call successors, (12), 2 states have call predecessors, (12), 9 states have return successors, (13), 11 states have call predecessors, (13), 5 states have call successors, (13) [2021-08-27 07:51:28,677 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 07:51:28,677 INFO L93 Difference]: Finished difference Result 1040 states and 1295 transitions. [2021-08-27 07:51:28,677 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2021-08-27 07:51:28,678 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 24 states have (on average 3.2083333333333335) internal successors, (77), 18 states have internal predecessors, (77), 6 states have call successors, (12), 2 states have call predecessors, (12), 9 states have return successors, (13), 11 states have call predecessors, (13), 5 states have call successors, (13) Word has length 70 [2021-08-27 07:51:28,678 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-27 07:51:28,679 INFO L225 Difference]: With dead ends: 1040 [2021-08-27 07:51:28,679 INFO L226 Difference]: Without dead ends: 1016 [2021-08-27 07:51:28,680 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 143 GetRequests, 115 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 72 ImplicationChecksByTransitivity, 304.6ms TimeCoverageRelationStatistics Valid=85, Invalid=785, Unknown=0, NotChecked=0, Total=870 [2021-08-27 07:51:28,680 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1016 states. [2021-08-27 07:51:28,703 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1016 to 1013. [2021-08-27 07:51:28,704 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1013 states, 804 states have (on average 1.2524875621890548) internal successors, (1007), 825 states have internal predecessors, (1007), 109 states have call successors, (109), 76 states have call predecessors, (109), 99 states have return successors, (144), 117 states have call predecessors, (144), 104 states have call successors, (144) [2021-08-27 07:51:28,705 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1013 states to 1013 states and 1260 transitions. [2021-08-27 07:51:28,705 INFO L78 Accepts]: Start accepts. Automaton has 1013 states and 1260 transitions. Word has length 70 [2021-08-27 07:51:28,705 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-27 07:51:28,705 INFO L470 AbstractCegarLoop]: Abstraction has 1013 states and 1260 transitions. [2021-08-27 07:51:28,706 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 24 states have (on average 3.2083333333333335) internal successors, (77), 18 states have internal predecessors, (77), 6 states have call successors, (12), 2 states have call predecessors, (12), 9 states have return successors, (13), 11 states have call predecessors, (13), 5 states have call successors, (13) [2021-08-27 07:51:28,706 INFO L276 IsEmpty]: Start isEmpty. Operand 1013 states and 1260 transitions. [2021-08-27 07:51:28,707 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2021-08-27 07:51:28,707 INFO L504 BasicCegarLoop]: Found error trace [2021-08-27 07:51:28,707 INFO L512 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-27 07:51:28,720 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (48)] Forceful destruction successful, exit code 0 [2021-08-27 07:51:28,919 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 48 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-08-27 07:51:28,919 INFO L402 AbstractCegarLoop]: === Iteration 48 === Targeting errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK === [mainErr0ENSURES_VIOLATIONMEMORY_LEAK, errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2021-08-27 07:51:28,919 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 07:51:28,919 INFO L82 PathProgramCache]: Analyzing trace with hash 251959398, now seen corresponding path program 1 times [2021-08-27 07:51:28,920 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-08-27 07:51:28,920 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1828506309] [2021-08-27 07:51:28,920 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 07:51:28,920 INFO L170 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-08-27 07:51:28,920 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-08-27 07:51:28,921 INFO L229 MonitoredProcess]: Starting monitored process 49 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-08-27 07:51:28,922 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (49)] Waiting until timeout for monitored process [2021-08-27 07:51:30,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:51:30,669 INFO L263 TraceCheckSpWp]: Trace formula consists of 471 conjuncts, 15 conjunts are in the unsatisfiable core [2021-08-27 07:51:30,671 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-27 07:51:30,998 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 07:51:30,998 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-08-27 07:51:31,531 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 07:51:31,531 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-08-27 07:51:31,531 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1828506309] [2021-08-27 07:51:31,531 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1828506309] provided 2 perfect and 0 imperfect interpolant sequences [2021-08-27 07:51:31,531 INFO L186 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2021-08-27 07:51:31,532 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14, 13] imperfect sequences [] total 25 [2021-08-27 07:51:31,532 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1173677180] [2021-08-27 07:51:31,532 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2021-08-27 07:51:31,532 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-08-27 07:51:31,532 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2021-08-27 07:51:31,532 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=541, Unknown=0, NotChecked=0, Total=600 [2021-08-27 07:51:31,533 INFO L87 Difference]: Start difference. First operand 1013 states and 1260 transitions. Second operand has 25 states, 25 states have (on average 3.04) internal successors, (76), 17 states have internal predecessors, (76), 2 states have call successors, (9), 2 states have call predecessors, (9), 9 states have return successors, (11), 9 states have call predecessors, (11), 1 states have call successors, (11) [2021-08-27 07:51:31,918 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 07:51:31,919 INFO L93 Difference]: Finished difference Result 1089 states and 1340 transitions. [2021-08-27 07:51:31,919 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2021-08-27 07:51:31,919 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 25 states have (on average 3.04) internal successors, (76), 17 states have internal predecessors, (76), 2 states have call successors, (9), 2 states have call predecessors, (9), 9 states have return successors, (11), 9 states have call predecessors, (11), 1 states have call successors, (11) Word has length 69 [2021-08-27 07:51:31,919 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-27 07:51:31,921 INFO L225 Difference]: With dead ends: 1089 [2021-08-27 07:51:31,921 INFO L226 Difference]: Without dead ends: 1023 [2021-08-27 07:51:31,921 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 141 GetRequests, 114 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 85 ImplicationChecksByTransitivity, 315.8ms TimeCoverageRelationStatistics Valid=82, Invalid=730, Unknown=0, NotChecked=0, Total=812 [2021-08-27 07:51:31,921 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1023 states. [2021-08-27 07:51:31,928 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1023 to 986. [2021-08-27 07:51:31,928 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 986 states, 783 states have (on average 1.251596424010217) internal successors, (980), 804 states have internal predecessors, (980), 105 states have call successors, (105), 76 states have call predecessors, (105), 97 states have return successors, (138), 111 states have call predecessors, (138), 100 states have call successors, (138) [2021-08-27 07:51:31,929 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 986 states to 986 states and 1223 transitions. [2021-08-27 07:51:31,930 INFO L78 Accepts]: Start accepts. Automaton has 986 states and 1223 transitions. Word has length 69 [2021-08-27 07:51:31,930 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-27 07:51:31,930 INFO L470 AbstractCegarLoop]: Abstraction has 986 states and 1223 transitions. [2021-08-27 07:51:31,930 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 25 states have (on average 3.04) internal successors, (76), 17 states have internal predecessors, (76), 2 states have call successors, (9), 2 states have call predecessors, (9), 9 states have return successors, (11), 9 states have call predecessors, (11), 1 states have call successors, (11) [2021-08-27 07:51:31,930 INFO L276 IsEmpty]: Start isEmpty. Operand 986 states and 1223 transitions. [2021-08-27 07:51:31,931 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2021-08-27 07:51:31,931 INFO L504 BasicCegarLoop]: Found error trace [2021-08-27 07:51:31,931 INFO L512 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-27 07:51:31,943 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (49)] Forceful destruction successful, exit code 0 [2021-08-27 07:51:32,136 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 49 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-08-27 07:51:32,137 INFO L402 AbstractCegarLoop]: === Iteration 49 === Targeting errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK === [mainErr0ENSURES_VIOLATIONMEMORY_LEAK, errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2021-08-27 07:51:32,137 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 07:51:32,137 INFO L82 PathProgramCache]: Analyzing trace with hash -836181127, now seen corresponding path program 1 times [2021-08-27 07:51:32,137 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-08-27 07:51:32,137 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2097977484] [2021-08-27 07:51:32,138 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 07:51:32,138 INFO L170 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-08-27 07:51:32,138 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-08-27 07:51:32,138 INFO L229 MonitoredProcess]: Starting monitored process 50 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-08-27 07:51:32,140 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (50)] Waiting until timeout for monitored process [2021-08-27 07:51:33,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:51:33,928 INFO L263 TraceCheckSpWp]: Trace formula consists of 444 conjuncts, 5 conjunts are in the unsatisfiable core [2021-08-27 07:51:33,930 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-27 07:51:34,077 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 07:51:34,077 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-08-27 07:51:34,282 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 07:51:34,282 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-08-27 07:51:34,282 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2097977484] [2021-08-27 07:51:34,282 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2097977484] provided 2 perfect and 0 imperfect interpolant sequences [2021-08-27 07:51:34,282 INFO L186 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2021-08-27 07:51:34,282 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6, 6] imperfect sequences [] total 10 [2021-08-27 07:51:34,282 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [732501440] [2021-08-27 07:51:34,283 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2021-08-27 07:51:34,283 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-08-27 07:51:34,283 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-08-27 07:51:34,283 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2021-08-27 07:51:34,283 INFO L87 Difference]: Start difference. First operand 986 states and 1223 transitions. Second operand has 10 states, 10 states have (on average 6.1) internal successors, (61), 8 states have internal predecessors, (61), 2 states have call successors, (10), 2 states have call predecessors, (10), 4 states have return successors, (9), 4 states have call predecessors, (9), 2 states have call successors, (9) [2021-08-27 07:51:34,363 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 07:51:34,363 INFO L93 Difference]: Finished difference Result 991 states and 1229 transitions. [2021-08-27 07:51:34,363 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-08-27 07:51:34,364 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 6.1) internal successors, (61), 8 states have internal predecessors, (61), 2 states have call successors, (10), 2 states have call predecessors, (10), 4 states have return successors, (9), 4 states have call predecessors, (9), 2 states have call successors, (9) Word has length 69 [2021-08-27 07:51:34,364 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-27 07:51:34,365 INFO L225 Difference]: With dead ends: 991 [2021-08-27 07:51:34,365 INFO L226 Difference]: Without dead ends: 991 [2021-08-27 07:51:34,365 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 139 GetRequests, 129 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 48.9ms TimeCoverageRelationStatistics Valid=32, Invalid=100, Unknown=0, NotChecked=0, Total=132 [2021-08-27 07:51:34,366 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 991 states. [2021-08-27 07:51:34,379 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 991 to 984. [2021-08-27 07:51:34,380 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 984 states, 781 states have (on average 1.2509603072983355) internal successors, (977), 802 states have internal predecessors, (977), 105 states have call successors, (105), 76 states have call predecessors, (105), 97 states have return successors, (138), 111 states have call predecessors, (138), 100 states have call successors, (138) [2021-08-27 07:51:34,381 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 984 states to 984 states and 1220 transitions. [2021-08-27 07:51:34,381 INFO L78 Accepts]: Start accepts. Automaton has 984 states and 1220 transitions. Word has length 69 [2021-08-27 07:51:34,381 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-27 07:51:34,381 INFO L470 AbstractCegarLoop]: Abstraction has 984 states and 1220 transitions. [2021-08-27 07:51:34,382 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 6.1) internal successors, (61), 8 states have internal predecessors, (61), 2 states have call successors, (10), 2 states have call predecessors, (10), 4 states have return successors, (9), 4 states have call predecessors, (9), 2 states have call successors, (9) [2021-08-27 07:51:34,382 INFO L276 IsEmpty]: Start isEmpty. Operand 984 states and 1220 transitions. [2021-08-27 07:51:34,383 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2021-08-27 07:51:34,383 INFO L504 BasicCegarLoop]: Found error trace [2021-08-27 07:51:34,383 INFO L512 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-27 07:51:34,397 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (50)] Forceful destruction successful, exit code 0 [2021-08-27 07:51:34,592 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 50 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-08-27 07:51:34,593 INFO L402 AbstractCegarLoop]: === Iteration 50 === Targeting errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK === [mainErr0ENSURES_VIOLATIONMEMORY_LEAK, errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2021-08-27 07:51:34,593 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 07:51:34,593 INFO L82 PathProgramCache]: Analyzing trace with hash -911925131, now seen corresponding path program 1 times [2021-08-27 07:51:34,593 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-08-27 07:51:34,593 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [564532239] [2021-08-27 07:51:34,593 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 07:51:34,593 INFO L170 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-08-27 07:51:34,593 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-08-27 07:51:34,594 INFO L229 MonitoredProcess]: Starting monitored process 51 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-08-27 07:51:34,595 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (51)] Waiting until timeout for monitored process [2021-08-27 07:51:36,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:51:36,443 INFO L263 TraceCheckSpWp]: Trace formula consists of 441 conjuncts, 10 conjunts are in the unsatisfiable core [2021-08-27 07:51:36,445 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-27 07:51:36,719 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 07:51:36,719 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-08-27 07:51:37,041 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 07:51:37,041 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-08-27 07:51:37,042 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [564532239] [2021-08-27 07:51:37,042 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [564532239] provided 2 perfect and 0 imperfect interpolant sequences [2021-08-27 07:51:37,042 INFO L186 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2021-08-27 07:51:37,042 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11, 11] imperfect sequences [] total 20 [2021-08-27 07:51:37,042 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2075466025] [2021-08-27 07:51:37,042 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2021-08-27 07:51:37,042 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-08-27 07:51:37,042 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2021-08-27 07:51:37,043 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=334, Unknown=0, NotChecked=0, Total=380 [2021-08-27 07:51:37,043 INFO L87 Difference]: Start difference. First operand 984 states and 1220 transitions. Second operand has 20 states, 20 states have (on average 3.8) internal successors, (76), 14 states have internal predecessors, (76), 4 states have call successors, (10), 2 states have call predecessors, (10), 7 states have return successors, (11), 9 states have call predecessors, (11), 3 states have call successors, (11) [2021-08-27 07:51:37,156 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 07:51:37,156 INFO L93 Difference]: Finished difference Result 1008 states and 1248 transitions. [2021-08-27 07:51:37,156 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2021-08-27 07:51:37,156 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 20 states have (on average 3.8) internal successors, (76), 14 states have internal predecessors, (76), 4 states have call successors, (10), 2 states have call predecessors, (10), 7 states have return successors, (11), 9 states have call predecessors, (11), 3 states have call successors, (11) Word has length 69 [2021-08-27 07:51:37,156 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-27 07:51:37,158 INFO L225 Difference]: With dead ends: 1008 [2021-08-27 07:51:37,158 INFO L226 Difference]: Without dead ends: 981 [2021-08-27 07:51:37,158 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 139 GetRequests, 119 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 161.3ms TimeCoverageRelationStatistics Valid=58, Invalid=404, Unknown=0, NotChecked=0, Total=462 [2021-08-27 07:51:37,158 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 981 states. [2021-08-27 07:51:37,165 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 981 to 981. [2021-08-27 07:51:37,165 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 981 states, 779 states have (on average 1.2490372272143775) internal successors, (973), 800 states have internal predecessors, (973), 104 states have call successors, (104), 76 states have call predecessors, (104), 97 states have return successors, (137), 110 states have call predecessors, (137), 99 states have call successors, (137) [2021-08-27 07:51:37,167 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 981 states to 981 states and 1214 transitions. [2021-08-27 07:51:37,167 INFO L78 Accepts]: Start accepts. Automaton has 981 states and 1214 transitions. Word has length 69 [2021-08-27 07:51:37,167 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-27 07:51:37,167 INFO L470 AbstractCegarLoop]: Abstraction has 981 states and 1214 transitions. [2021-08-27 07:51:37,167 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 3.8) internal successors, (76), 14 states have internal predecessors, (76), 4 states have call successors, (10), 2 states have call predecessors, (10), 7 states have return successors, (11), 9 states have call predecessors, (11), 3 states have call successors, (11) [2021-08-27 07:51:37,167 INFO L276 IsEmpty]: Start isEmpty. Operand 981 states and 1214 transitions. [2021-08-27 07:51:37,168 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2021-08-27 07:51:37,168 INFO L504 BasicCegarLoop]: Found error trace [2021-08-27 07:51:37,169 INFO L512 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-27 07:51:37,182 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (51)] Ended with exit code 0 [2021-08-27 07:51:37,382 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 51 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-08-27 07:51:37,382 INFO L402 AbstractCegarLoop]: === Iteration 51 === Targeting errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK === [mainErr0ENSURES_VIOLATIONMEMORY_LEAK, errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2021-08-27 07:51:37,382 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 07:51:37,382 INFO L82 PathProgramCache]: Analyzing trace with hash 1842649898, now seen corresponding path program 1 times [2021-08-27 07:51:37,382 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-08-27 07:51:37,382 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1325961950] [2021-08-27 07:51:37,382 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 07:51:37,382 INFO L170 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-08-27 07:51:37,383 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-08-27 07:51:37,384 INFO L229 MonitoredProcess]: Starting monitored process 52 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-08-27 07:51:37,386 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (52)] Waiting until timeout for monitored process [2021-08-27 07:51:39,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:51:39,229 INFO L263 TraceCheckSpWp]: Trace formula consists of 433 conjuncts, 4 conjunts are in the unsatisfiable core [2021-08-27 07:51:39,231 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-27 07:51:39,367 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 07:51:39,367 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-08-27 07:51:39,573 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 07:51:39,574 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-08-27 07:51:39,574 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1325961950] [2021-08-27 07:51:39,574 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1325961950] provided 2 perfect and 0 imperfect interpolant sequences [2021-08-27 07:51:39,574 INFO L186 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2021-08-27 07:51:39,574 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5, 5] imperfect sequences [] total 8 [2021-08-27 07:51:39,574 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1828798898] [2021-08-27 07:51:39,574 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2021-08-27 07:51:39,574 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-08-27 07:51:39,574 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-08-27 07:51:39,575 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2021-08-27 07:51:39,575 INFO L87 Difference]: Start difference. First operand 981 states and 1214 transitions. Second operand has 8 states, 8 states have (on average 7.5) internal successors, (60), 6 states have internal predecessors, (60), 2 states have call successors, (10), 2 states have call predecessors, (10), 4 states have return successors, (9), 4 states have call predecessors, (9), 2 states have call successors, (9) [2021-08-27 07:51:39,596 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 07:51:39,597 INFO L93 Difference]: Finished difference Result 981 states and 1213 transitions. [2021-08-27 07:51:39,597 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-08-27 07:51:39,597 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 7.5) internal successors, (60), 6 states have internal predecessors, (60), 2 states have call successors, (10), 2 states have call predecessors, (10), 4 states have return successors, (9), 4 states have call predecessors, (9), 2 states have call successors, (9) Word has length 69 [2021-08-27 07:51:39,597 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-27 07:51:39,598 INFO L225 Difference]: With dead ends: 981 [2021-08-27 07:51:39,599 INFO L226 Difference]: Without dead ends: 976 [2021-08-27 07:51:39,599 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 137 GetRequests, 131 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 21.5ms TimeCoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2021-08-27 07:51:39,599 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 976 states. [2021-08-27 07:51:39,605 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 976 to 976. [2021-08-27 07:51:39,606 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 976 states, 775 states have (on average 1.247741935483871) internal successors, (967), 796 states have internal predecessors, (967), 103 states have call successors, (103), 76 states have call predecessors, (103), 97 states have return successors, (136), 109 states have call predecessors, (136), 98 states have call successors, (136) [2021-08-27 07:51:39,607 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 976 states to 976 states and 1206 transitions. [2021-08-27 07:51:39,607 INFO L78 Accepts]: Start accepts. Automaton has 976 states and 1206 transitions. Word has length 69 [2021-08-27 07:51:39,607 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-27 07:51:39,607 INFO L470 AbstractCegarLoop]: Abstraction has 976 states and 1206 transitions. [2021-08-27 07:51:39,607 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 7.5) internal successors, (60), 6 states have internal predecessors, (60), 2 states have call successors, (10), 2 states have call predecessors, (10), 4 states have return successors, (9), 4 states have call predecessors, (9), 2 states have call successors, (9) [2021-08-27 07:51:39,607 INFO L276 IsEmpty]: Start isEmpty. Operand 976 states and 1206 transitions. [2021-08-27 07:51:39,608 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2021-08-27 07:51:39,609 INFO L504 BasicCegarLoop]: Found error trace [2021-08-27 07:51:39,609 INFO L512 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-27 07:51:39,622 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (52)] Forceful destruction successful, exit code 0 [2021-08-27 07:51:39,831 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 52 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-08-27 07:51:39,831 INFO L402 AbstractCegarLoop]: === Iteration 52 === Targeting errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK === [mainErr0ENSURES_VIOLATIONMEMORY_LEAK, errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2021-08-27 07:51:39,831 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 07:51:39,831 INFO L82 PathProgramCache]: Analyzing trace with hash -2114383891, now seen corresponding path program 1 times [2021-08-27 07:51:39,831 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-08-27 07:51:39,831 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [689475428] [2021-08-27 07:51:39,832 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 07:51:39,832 INFO L170 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-08-27 07:51:39,832 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-08-27 07:51:39,832 INFO L229 MonitoredProcess]: Starting monitored process 53 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-08-27 07:51:39,833 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (53)] Waiting until timeout for monitored process [2021-08-27 07:51:41,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:51:41,701 INFO L263 TraceCheckSpWp]: Trace formula consists of 390 conjuncts, 12 conjunts are in the unsatisfiable core [2021-08-27 07:51:41,702 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-27 07:51:41,981 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 07:51:41,981 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-08-27 07:51:42,356 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 07:51:42,357 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-08-27 07:51:42,357 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [689475428] [2021-08-27 07:51:42,357 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [689475428] provided 2 perfect and 0 imperfect interpolant sequences [2021-08-27 07:51:42,357 INFO L186 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2021-08-27 07:51:42,357 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12, 11] imperfect sequences [] total 21 [2021-08-27 07:51:42,357 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1602089282] [2021-08-27 07:51:42,357 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2021-08-27 07:51:42,357 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-08-27 07:51:42,357 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2021-08-27 07:51:42,358 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=371, Unknown=0, NotChecked=0, Total=420 [2021-08-27 07:51:42,358 INFO L87 Difference]: Start difference. First operand 976 states and 1206 transitions. Second operand has 21 states, 21 states have (on average 3.4761904761904763) internal successors, (73), 15 states have internal predecessors, (73), 2 states have call successors, (9), 2 states have call predecessors, (9), 7 states have return successors, (10), 7 states have call predecessors, (10), 1 states have call successors, (10) [2021-08-27 07:51:42,678 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 07:51:42,678 INFO L93 Difference]: Finished difference Result 1060 states and 1294 transitions. [2021-08-27 07:51:42,678 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2021-08-27 07:51:42,678 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 21 states have (on average 3.4761904761904763) internal successors, (73), 15 states have internal predecessors, (73), 2 states have call successors, (9), 2 states have call predecessors, (9), 7 states have return successors, (10), 7 states have call predecessors, (10), 1 states have call successors, (10) Word has length 69 [2021-08-27 07:51:42,679 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-27 07:51:42,680 INFO L225 Difference]: With dead ends: 1060 [2021-08-27 07:51:42,680 INFO L226 Difference]: Without dead ends: 921 [2021-08-27 07:51:42,680 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 141 GetRequests, 118 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 62 ImplicationChecksByTransitivity, 247.4ms TimeCoverageRelationStatistics Valid=72, Invalid=528, Unknown=0, NotChecked=0, Total=600 [2021-08-27 07:51:42,680 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 921 states. [2021-08-27 07:51:42,686 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 921 to 909. [2021-08-27 07:51:42,686 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 909 states, 720 states have (on average 1.2444444444444445) internal successors, (896), 738 states have internal predecessors, (896), 101 states have call successors, (101), 74 states have call predecessors, (101), 87 states have return successors, (126), 100 states have call predecessors, (126), 96 states have call successors, (126) [2021-08-27 07:51:42,687 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 909 states to 909 states and 1123 transitions. [2021-08-27 07:51:42,687 INFO L78 Accepts]: Start accepts. Automaton has 909 states and 1123 transitions. Word has length 69 [2021-08-27 07:51:42,687 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-27 07:51:42,688 INFO L470 AbstractCegarLoop]: Abstraction has 909 states and 1123 transitions. [2021-08-27 07:51:42,688 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 21 states have (on average 3.4761904761904763) internal successors, (73), 15 states have internal predecessors, (73), 2 states have call successors, (9), 2 states have call predecessors, (9), 7 states have return successors, (10), 7 states have call predecessors, (10), 1 states have call successors, (10) [2021-08-27 07:51:42,688 INFO L276 IsEmpty]: Start isEmpty. Operand 909 states and 1123 transitions. [2021-08-27 07:51:42,689 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2021-08-27 07:51:42,689 INFO L504 BasicCegarLoop]: Found error trace [2021-08-27 07:51:42,689 INFO L512 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-27 07:51:42,703 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (53)] Forceful destruction successful, exit code 0 [2021-08-27 07:51:42,901 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 53 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-08-27 07:51:42,902 INFO L402 AbstractCegarLoop]: === Iteration 53 === Targeting errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK === [mainErr0ENSURES_VIOLATIONMEMORY_LEAK, errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2021-08-27 07:51:42,902 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 07:51:42,902 INFO L82 PathProgramCache]: Analyzing trace with hash 1733287926, now seen corresponding path program 1 times [2021-08-27 07:51:42,902 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-08-27 07:51:42,902 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1663137930] [2021-08-27 07:51:42,902 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 07:51:42,902 INFO L170 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-08-27 07:51:42,902 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-08-27 07:51:42,904 INFO L229 MonitoredProcess]: Starting monitored process 54 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-08-27 07:51:42,915 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (54)] Waiting until timeout for monitored process [2021-08-27 07:51:44,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:51:44,833 INFO L263 TraceCheckSpWp]: Trace formula consists of 446 conjuncts, 4 conjunts are in the unsatisfiable core [2021-08-27 07:51:44,835 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-27 07:51:44,969 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 07:51:44,969 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-08-27 07:51:45,181 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 07:51:45,181 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-08-27 07:51:45,181 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1663137930] [2021-08-27 07:51:45,182 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1663137930] provided 2 perfect and 0 imperfect interpolant sequences [2021-08-27 07:51:45,182 INFO L186 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2021-08-27 07:51:45,182 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5, 5] imperfect sequences [] total 8 [2021-08-27 07:51:45,182 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [260739381] [2021-08-27 07:51:45,182 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2021-08-27 07:51:45,182 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-08-27 07:51:45,182 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-08-27 07:51:45,182 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2021-08-27 07:51:45,182 INFO L87 Difference]: Start difference. First operand 909 states and 1123 transitions. Second operand has 8 states, 8 states have (on average 8.125) internal successors, (65), 6 states have internal predecessors, (65), 2 states have call successors, (12), 2 states have call predecessors, (12), 4 states have return successors, (11), 4 states have call predecessors, (11), 2 states have call successors, (11) [2021-08-27 07:51:45,212 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 07:51:45,212 INFO L93 Difference]: Finished difference Result 912 states and 1126 transitions. [2021-08-27 07:51:45,212 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-08-27 07:51:45,212 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 8.125) internal successors, (65), 6 states have internal predecessors, (65), 2 states have call successors, (12), 2 states have call predecessors, (12), 4 states have return successors, (11), 4 states have call predecessors, (11), 2 states have call successors, (11) Word has length 71 [2021-08-27 07:51:45,212 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-27 07:51:45,214 INFO L225 Difference]: With dead ends: 912 [2021-08-27 07:51:45,214 INFO L226 Difference]: Without dead ends: 905 [2021-08-27 07:51:45,214 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 141 GetRequests, 135 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 21.8ms TimeCoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2021-08-27 07:51:45,214 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 905 states. [2021-08-27 07:51:45,219 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 905 to 902. [2021-08-27 07:51:45,220 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 902 states, 714 states have (on average 1.2450980392156863) internal successors, (889), 732 states have internal predecessors, (889), 100 states have call successors, (100), 74 states have call predecessors, (100), 87 states have return successors, (124), 99 states have call predecessors, (124), 95 states have call successors, (124) [2021-08-27 07:51:45,221 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 902 states to 902 states and 1113 transitions. [2021-08-27 07:51:45,221 INFO L78 Accepts]: Start accepts. Automaton has 902 states and 1113 transitions. Word has length 71 [2021-08-27 07:51:45,221 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-27 07:51:45,221 INFO L470 AbstractCegarLoop]: Abstraction has 902 states and 1113 transitions. [2021-08-27 07:51:45,221 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 8.125) internal successors, (65), 6 states have internal predecessors, (65), 2 states have call successors, (12), 2 states have call predecessors, (12), 4 states have return successors, (11), 4 states have call predecessors, (11), 2 states have call successors, (11) [2021-08-27 07:51:45,221 INFO L276 IsEmpty]: Start isEmpty. Operand 902 states and 1113 transitions. [2021-08-27 07:51:45,222 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2021-08-27 07:51:45,222 INFO L504 BasicCegarLoop]: Found error trace [2021-08-27 07:51:45,222 INFO L512 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-27 07:51:45,236 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (54)] Ended with exit code 0 [2021-08-27 07:51:45,424 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 54 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-08-27 07:51:45,425 INFO L402 AbstractCegarLoop]: === Iteration 54 === Targeting errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK === [mainErr0ENSURES_VIOLATIONMEMORY_LEAK, errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2021-08-27 07:51:45,425 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 07:51:45,425 INFO L82 PathProgramCache]: Analyzing trace with hash -1853047052, now seen corresponding path program 1 times [2021-08-27 07:51:45,425 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-08-27 07:51:45,425 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [727533864] [2021-08-27 07:51:45,425 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 07:51:45,425 INFO L170 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-08-27 07:51:45,425 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-08-27 07:51:45,426 INFO L229 MonitoredProcess]: Starting monitored process 55 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-08-27 07:51:45,427 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (55)] Waiting until timeout for monitored process [2021-08-27 07:51:47,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:51:47,383 INFO L263 TraceCheckSpWp]: Trace formula consists of 454 conjuncts, 15 conjunts are in the unsatisfiable core [2021-08-27 07:51:47,385 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-27 07:51:47,636 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 07:51:47,636 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-08-27 07:51:48,237 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 07:51:48,237 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-08-27 07:51:48,237 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [727533864] [2021-08-27 07:51:48,237 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [727533864] provided 2 perfect and 0 imperfect interpolant sequences [2021-08-27 07:51:48,237 INFO L186 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2021-08-27 07:51:48,237 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14, 14] imperfect sequences [] total 26 [2021-08-27 07:51:48,237 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [792839560] [2021-08-27 07:51:48,237 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2021-08-27 07:51:48,237 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-08-27 07:51:48,238 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2021-08-27 07:51:48,238 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=589, Unknown=0, NotChecked=0, Total=650 [2021-08-27 07:51:48,238 INFO L87 Difference]: Start difference. First operand 902 states and 1113 transitions. Second operand has 26 states, 26 states have (on average 3.076923076923077) internal successors, (80), 18 states have internal predecessors, (80), 6 states have call successors, (13), 2 states have call predecessors, (13), 9 states have return successors, (14), 11 states have call predecessors, (14), 5 states have call successors, (14) [2021-08-27 07:51:48,458 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 07:51:48,458 INFO L93 Difference]: Finished difference Result 924 states and 1139 transitions. [2021-08-27 07:51:48,459 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2021-08-27 07:51:48,459 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 26 states have (on average 3.076923076923077) internal successors, (80), 18 states have internal predecessors, (80), 6 states have call successors, (13), 2 states have call predecessors, (13), 9 states have return successors, (14), 11 states have call predecessors, (14), 5 states have call successors, (14) Word has length 74 [2021-08-27 07:51:48,459 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-27 07:51:48,460 INFO L225 Difference]: With dead ends: 924 [2021-08-27 07:51:48,460 INFO L226 Difference]: Without dead ends: 894 [2021-08-27 07:51:48,460 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 151 GetRequests, 123 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 72 ImplicationChecksByTransitivity, 325.0ms TimeCoverageRelationStatistics Valid=85, Invalid=785, Unknown=0, NotChecked=0, Total=870 [2021-08-27 07:51:48,461 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 894 states. [2021-08-27 07:51:48,466 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 894 to 891. [2021-08-27 07:51:48,466 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 891 states, 707 states have (on average 1.2446958981612446) internal successors, (880), 724 states have internal predecessors, (880), 96 states have call successors, (96), 74 states have call predecessors, (96), 87 states have return successors, (119), 96 states have call predecessors, (119), 91 states have call successors, (119) [2021-08-27 07:51:48,467 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 891 states to 891 states and 1095 transitions. [2021-08-27 07:51:48,467 INFO L78 Accepts]: Start accepts. Automaton has 891 states and 1095 transitions. Word has length 74 [2021-08-27 07:51:48,467 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-27 07:51:48,467 INFO L470 AbstractCegarLoop]: Abstraction has 891 states and 1095 transitions. [2021-08-27 07:51:48,467 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 26 states have (on average 3.076923076923077) internal successors, (80), 18 states have internal predecessors, (80), 6 states have call successors, (13), 2 states have call predecessors, (13), 9 states have return successors, (14), 11 states have call predecessors, (14), 5 states have call successors, (14) [2021-08-27 07:51:48,467 INFO L276 IsEmpty]: Start isEmpty. Operand 891 states and 1095 transitions. [2021-08-27 07:51:48,468 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2021-08-27 07:51:48,468 INFO L504 BasicCegarLoop]: Found error trace [2021-08-27 07:51:48,468 INFO L512 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-27 07:51:48,481 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (55)] Forceful destruction successful, exit code 0 [2021-08-27 07:51:48,668 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 55 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-08-27 07:51:48,669 INFO L402 AbstractCegarLoop]: === Iteration 55 === Targeting errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK === [mainErr0ENSURES_VIOLATIONMEMORY_LEAK, errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2021-08-27 07:51:48,669 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 07:51:48,669 INFO L82 PathProgramCache]: Analyzing trace with hash -554123113, now seen corresponding path program 1 times [2021-08-27 07:51:48,669 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-08-27 07:51:48,669 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1802607916] [2021-08-27 07:51:48,670 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 07:51:48,670 INFO L170 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-08-27 07:51:48,670 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-08-27 07:51:48,670 INFO L229 MonitoredProcess]: Starting monitored process 56 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-08-27 07:51:48,671 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (56)] Waiting until timeout for monitored process [2021-08-27 07:51:50,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:51:50,690 INFO L263 TraceCheckSpWp]: Trace formula consists of 456 conjuncts, 4 conjunts are in the unsatisfiable core [2021-08-27 07:51:50,691 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-27 07:51:50,834 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 07:51:50,834 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-08-27 07:51:51,032 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 07:51:51,032 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-08-27 07:51:51,032 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1802607916] [2021-08-27 07:51:51,032 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1802607916] provided 2 perfect and 0 imperfect interpolant sequences [2021-08-27 07:51:51,032 INFO L186 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2021-08-27 07:51:51,032 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5, 5] imperfect sequences [] total 8 [2021-08-27 07:51:51,032 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [70711518] [2021-08-27 07:51:51,032 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2021-08-27 07:51:51,032 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-08-27 07:51:51,033 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-08-27 07:51:51,033 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2021-08-27 07:51:51,033 INFO L87 Difference]: Start difference. First operand 891 states and 1095 transitions. Second operand has 8 states, 8 states have (on average 8.125) internal successors, (65), 6 states have internal predecessors, (65), 2 states have call successors, (12), 2 states have call predecessors, (12), 4 states have return successors, (11), 4 states have call predecessors, (11), 2 states have call successors, (11) [2021-08-27 07:51:51,055 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 07:51:51,055 INFO L93 Difference]: Finished difference Result 894 states and 1098 transitions. [2021-08-27 07:51:51,056 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-08-27 07:51:51,056 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 8.125) internal successors, (65), 6 states have internal predecessors, (65), 2 states have call successors, (12), 2 states have call predecessors, (12), 4 states have return successors, (11), 4 states have call predecessors, (11), 2 states have call successors, (11) Word has length 71 [2021-08-27 07:51:51,056 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-27 07:51:51,057 INFO L225 Difference]: With dead ends: 894 [2021-08-27 07:51:51,057 INFO L226 Difference]: Without dead ends: 888 [2021-08-27 07:51:51,057 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 141 GetRequests, 135 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 21.2ms TimeCoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2021-08-27 07:51:51,057 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 888 states. [2021-08-27 07:51:51,063 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 888 to 885. [2021-08-27 07:51:51,063 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 885 states, 702 states have (on average 1.245014245014245) internal successors, (874), 719 states have internal predecessors, (874), 95 states have call successors, (95), 74 states have call predecessors, (95), 87 states have return successors, (118), 95 states have call predecessors, (118), 90 states have call successors, (118) [2021-08-27 07:51:51,064 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 885 states to 885 states and 1087 transitions. [2021-08-27 07:51:51,064 INFO L78 Accepts]: Start accepts. Automaton has 885 states and 1087 transitions. Word has length 71 [2021-08-27 07:51:51,064 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-27 07:51:51,064 INFO L470 AbstractCegarLoop]: Abstraction has 885 states and 1087 transitions. [2021-08-27 07:51:51,064 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 8.125) internal successors, (65), 6 states have internal predecessors, (65), 2 states have call successors, (12), 2 states have call predecessors, (12), 4 states have return successors, (11), 4 states have call predecessors, (11), 2 states have call successors, (11) [2021-08-27 07:51:51,064 INFO L276 IsEmpty]: Start isEmpty. Operand 885 states and 1087 transitions. [2021-08-27 07:51:51,065 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2021-08-27 07:51:51,065 INFO L504 BasicCegarLoop]: Found error trace [2021-08-27 07:51:51,065 INFO L512 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-27 07:51:51,090 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (56)] Forceful destruction successful, exit code 0 [2021-08-27 07:51:51,280 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 56 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-08-27 07:51:51,280 INFO L402 AbstractCegarLoop]: === Iteration 56 === Targeting errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK === [mainErr0ENSURES_VIOLATIONMEMORY_LEAK, errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2021-08-27 07:51:51,280 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 07:51:51,280 INFO L82 PathProgramCache]: Analyzing trace with hash 893345963, now seen corresponding path program 1 times [2021-08-27 07:51:51,280 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-08-27 07:51:51,280 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [130485860] [2021-08-27 07:51:51,281 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 07:51:51,281 INFO L170 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-08-27 07:51:51,281 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-08-27 07:51:51,281 INFO L229 MonitoredProcess]: Starting monitored process 57 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-08-27 07:51:51,282 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (57)] Waiting until timeout for monitored process [2021-08-27 07:51:53,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:51:53,320 INFO L263 TraceCheckSpWp]: Trace formula consists of 393 conjuncts, 2 conjunts are in the unsatisfiable core [2021-08-27 07:51:53,321 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-27 07:51:53,457 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 07:51:53,458 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-08-27 07:51:53,616 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 07:51:53,617 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-08-27 07:51:53,617 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [130485860] [2021-08-27 07:51:53,617 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [130485860] provided 2 perfect and 0 imperfect interpolant sequences [2021-08-27 07:51:53,619 INFO L186 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2021-08-27 07:51:53,619 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2021-08-27 07:51:53,619 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [813604019] [2021-08-27 07:51:53,619 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-08-27 07:51:53,620 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-08-27 07:51:53,620 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-08-27 07:51:53,620 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-27 07:51:53,620 INFO L87 Difference]: Start difference. First operand 885 states and 1087 transitions. Second operand has 3 states, 3 states have (on average 18.333333333333332) internal successors, (55), 3 states have internal predecessors, (55), 2 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) [2021-08-27 07:51:53,637 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 07:51:53,638 INFO L93 Difference]: Finished difference Result 893 states and 1093 transitions. [2021-08-27 07:51:53,638 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-08-27 07:51:53,638 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 18.333333333333332) internal successors, (55), 3 states have internal predecessors, (55), 2 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) Word has length 71 [2021-08-27 07:51:53,638 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-27 07:51:53,639 INFO L225 Difference]: With dead ends: 893 [2021-08-27 07:51:53,639 INFO L226 Difference]: Without dead ends: 887 [2021-08-27 07:51:53,639 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 141 GetRequests, 140 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.6ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-27 07:51:53,640 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 887 states. [2021-08-27 07:51:53,645 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 887 to 885. [2021-08-27 07:51:53,645 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 885 states, 702 states have (on average 1.2421652421652423) internal successors, (872), 719 states have internal predecessors, (872), 95 states have call successors, (95), 74 states have call predecessors, (95), 87 states have return successors, (118), 95 states have call predecessors, (118), 90 states have call successors, (118) [2021-08-27 07:51:53,646 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 885 states to 885 states and 1085 transitions. [2021-08-27 07:51:53,646 INFO L78 Accepts]: Start accepts. Automaton has 885 states and 1085 transitions. Word has length 71 [2021-08-27 07:51:53,647 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-27 07:51:53,647 INFO L470 AbstractCegarLoop]: Abstraction has 885 states and 1085 transitions. [2021-08-27 07:51:53,647 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 18.333333333333332) internal successors, (55), 3 states have internal predecessors, (55), 2 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) [2021-08-27 07:51:53,647 INFO L276 IsEmpty]: Start isEmpty. Operand 885 states and 1085 transitions. [2021-08-27 07:51:53,648 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2021-08-27 07:51:53,648 INFO L504 BasicCegarLoop]: Found error trace [2021-08-27 07:51:53,648 INFO L512 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-27 07:51:53,663 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (57)] Forceful destruction successful, exit code 0 [2021-08-27 07:51:53,848 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 57 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-08-27 07:51:53,848 INFO L402 AbstractCegarLoop]: === Iteration 57 === Targeting errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK === [mainErr0ENSURES_VIOLATIONMEMORY_LEAK, errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2021-08-27 07:51:53,849 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 07:51:53,849 INFO L82 PathProgramCache]: Analyzing trace with hash -1686968112, now seen corresponding path program 1 times [2021-08-27 07:51:53,849 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-08-27 07:51:53,849 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1753685342] [2021-08-27 07:51:53,849 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 07:51:53,849 INFO L170 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-08-27 07:51:53,849 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-08-27 07:51:53,850 INFO L229 MonitoredProcess]: Starting monitored process 58 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-08-27 07:51:53,850 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (58)] Waiting until timeout for monitored process [2021-08-27 07:51:55,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:51:55,919 INFO L263 TraceCheckSpWp]: Trace formula consists of 459 conjuncts, 7 conjunts are in the unsatisfiable core [2021-08-27 07:51:55,920 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-27 07:51:56,086 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 07:51:56,086 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-08-27 07:51:56,407 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 07:51:56,407 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-08-27 07:51:56,407 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1753685342] [2021-08-27 07:51:56,407 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1753685342] provided 2 perfect and 0 imperfect interpolant sequences [2021-08-27 07:51:56,407 INFO L186 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2021-08-27 07:51:56,407 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7, 7] imperfect sequences [] total 11 [2021-08-27 07:51:56,407 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1224853202] [2021-08-27 07:51:56,408 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2021-08-27 07:51:56,408 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-08-27 07:51:56,408 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-08-27 07:51:56,408 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2021-08-27 07:51:56,408 INFO L87 Difference]: Start difference. First operand 885 states and 1085 transitions. Second operand has 11 states, 11 states have (on average 5.909090909090909) internal successors, (65), 9 states have internal predecessors, (65), 5 states have call successors, (12), 2 states have call predecessors, (12), 5 states have return successors, (11), 5 states have call predecessors, (11), 4 states have call successors, (11) [2021-08-27 07:51:56,459 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 07:51:56,460 INFO L93 Difference]: Finished difference Result 880 states and 1075 transitions. [2021-08-27 07:51:56,460 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-08-27 07:51:56,460 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 5.909090909090909) internal successors, (65), 9 states have internal predecessors, (65), 5 states have call successors, (12), 2 states have call predecessors, (12), 5 states have return successors, (11), 5 states have call predecessors, (11), 4 states have call successors, (11) Word has length 77 [2021-08-27 07:51:56,460 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-27 07:51:56,461 INFO L225 Difference]: With dead ends: 880 [2021-08-27 07:51:56,461 INFO L226 Difference]: Without dead ends: 875 [2021-08-27 07:51:56,461 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 154 GetRequests, 144 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 53.3ms TimeCoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2021-08-27 07:51:56,462 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 875 states. [2021-08-27 07:51:56,466 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 875 to 873. [2021-08-27 07:51:56,467 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 873 states, 693 states have (on average 1.2380952380952381) internal successors, (858), 708 states have internal predecessors, (858), 93 states have call successors, (93), 74 states have call predecessors, (93), 86 states have return successors, (115), 94 states have call predecessors, (115), 88 states have call successors, (115) [2021-08-27 07:51:56,468 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 873 states to 873 states and 1066 transitions. [2021-08-27 07:51:56,468 INFO L78 Accepts]: Start accepts. Automaton has 873 states and 1066 transitions. Word has length 77 [2021-08-27 07:51:56,468 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-27 07:51:56,468 INFO L470 AbstractCegarLoop]: Abstraction has 873 states and 1066 transitions. [2021-08-27 07:51:56,468 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 5.909090909090909) internal successors, (65), 9 states have internal predecessors, (65), 5 states have call successors, (12), 2 states have call predecessors, (12), 5 states have return successors, (11), 5 states have call predecessors, (11), 4 states have call successors, (11) [2021-08-27 07:51:56,468 INFO L276 IsEmpty]: Start isEmpty. Operand 873 states and 1066 transitions. [2021-08-27 07:51:56,469 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2021-08-27 07:51:56,469 INFO L504 BasicCegarLoop]: Found error trace [2021-08-27 07:51:56,469 INFO L512 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-27 07:51:56,483 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (58)] Ended with exit code 0 [2021-08-27 07:51:56,669 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 58 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-08-27 07:51:56,669 INFO L402 AbstractCegarLoop]: === Iteration 58 === Targeting errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK === [mainErr0ENSURES_VIOLATIONMEMORY_LEAK, errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2021-08-27 07:51:56,670 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 07:51:56,670 INFO L82 PathProgramCache]: Analyzing trace with hash 1269742682, now seen corresponding path program 1 times [2021-08-27 07:51:56,670 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-08-27 07:51:56,670 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1125606816] [2021-08-27 07:51:56,670 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 07:51:56,670 INFO L170 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-08-27 07:51:56,670 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-08-27 07:51:56,671 INFO L229 MonitoredProcess]: Starting monitored process 59 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-08-27 07:51:56,671 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (59)] Waiting until timeout for monitored process [2021-08-27 07:51:58,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:51:58,844 INFO L263 TraceCheckSpWp]: Trace formula consists of 450 conjuncts, 4 conjunts are in the unsatisfiable core [2021-08-27 07:51:58,845 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-27 07:51:58,985 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 07:51:58,985 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-08-27 07:51:59,181 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 07:51:59,182 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-08-27 07:51:59,182 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1125606816] [2021-08-27 07:51:59,182 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1125606816] provided 2 perfect and 0 imperfect interpolant sequences [2021-08-27 07:51:59,182 INFO L186 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2021-08-27 07:51:59,182 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5, 5] imperfect sequences [] total 8 [2021-08-27 07:51:59,182 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1014640233] [2021-08-27 07:51:59,182 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2021-08-27 07:51:59,182 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-08-27 07:51:59,182 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-08-27 07:51:59,182 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2021-08-27 07:51:59,182 INFO L87 Difference]: Start difference. First operand 873 states and 1066 transitions. Second operand has 8 states, 8 states have (on average 8.375) internal successors, (67), 6 states have internal predecessors, (67), 2 states have call successors, (12), 2 states have call predecessors, (12), 4 states have return successors, (11), 4 states have call predecessors, (11), 2 states have call successors, (11) [2021-08-27 07:51:59,199 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 07:51:59,199 INFO L93 Difference]: Finished difference Result 870 states and 1060 transitions. [2021-08-27 07:51:59,199 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-08-27 07:51:59,199 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 8.375) internal successors, (67), 6 states have internal predecessors, (67), 2 states have call successors, (12), 2 states have call predecessors, (12), 4 states have return successors, (11), 4 states have call predecessors, (11), 2 states have call successors, (11) Word has length 73 [2021-08-27 07:51:59,199 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-27 07:51:59,200 INFO L225 Difference]: With dead ends: 870 [2021-08-27 07:51:59,200 INFO L226 Difference]: Without dead ends: 859 [2021-08-27 07:51:59,200 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 145 GetRequests, 139 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 21.3ms TimeCoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2021-08-27 07:51:59,201 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 859 states. [2021-08-27 07:51:59,205 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 859 to 859. [2021-08-27 07:51:59,206 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 859 states, 681 states have (on average 1.2334801762114538) internal successors, (840), 696 states have internal predecessors, (840), 91 states have call successors, (91), 74 states have call predecessors, (91), 86 states have return successors, (113), 92 states have call predecessors, (113), 86 states have call successors, (113) [2021-08-27 07:51:59,207 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 859 states to 859 states and 1044 transitions. [2021-08-27 07:51:59,207 INFO L78 Accepts]: Start accepts. Automaton has 859 states and 1044 transitions. Word has length 73 [2021-08-27 07:51:59,207 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-27 07:51:59,207 INFO L470 AbstractCegarLoop]: Abstraction has 859 states and 1044 transitions. [2021-08-27 07:51:59,207 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 8.375) internal successors, (67), 6 states have internal predecessors, (67), 2 states have call successors, (12), 2 states have call predecessors, (12), 4 states have return successors, (11), 4 states have call predecessors, (11), 2 states have call successors, (11) [2021-08-27 07:51:59,207 INFO L276 IsEmpty]: Start isEmpty. Operand 859 states and 1044 transitions. [2021-08-27 07:51:59,208 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2021-08-27 07:51:59,208 INFO L504 BasicCegarLoop]: Found error trace [2021-08-27 07:51:59,208 INFO L512 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-27 07:51:59,221 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (59)] Forceful destruction successful, exit code 0 [2021-08-27 07:51:59,408 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 59 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-08-27 07:51:59,409 INFO L402 AbstractCegarLoop]: === Iteration 59 === Targeting errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK === [mainErr0ENSURES_VIOLATIONMEMORY_LEAK, errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2021-08-27 07:51:59,409 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 07:51:59,409 INFO L82 PathProgramCache]: Analyzing trace with hash -731464723, now seen corresponding path program 1 times [2021-08-27 07:51:59,409 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-08-27 07:51:59,412 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1853667967] [2021-08-27 07:51:59,412 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 07:51:59,412 INFO L170 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-08-27 07:51:59,412 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-08-27 07:51:59,412 INFO L229 MonitoredProcess]: Starting monitored process 60 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-08-27 07:51:59,413 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (60)] Waiting until timeout for monitored process [2021-08-27 07:52:01,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:52:01,543 INFO L263 TraceCheckSpWp]: Trace formula consists of 441 conjuncts, 4 conjunts are in the unsatisfiable core [2021-08-27 07:52:01,544 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-27 07:52:01,698 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 07:52:01,698 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-08-27 07:52:01,893 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 07:52:01,893 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-08-27 07:52:01,893 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1853667967] [2021-08-27 07:52:01,894 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1853667967] provided 2 perfect and 0 imperfect interpolant sequences [2021-08-27 07:52:01,894 INFO L186 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2021-08-27 07:52:01,894 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5, 5] imperfect sequences [] total 8 [2021-08-27 07:52:01,894 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1926327924] [2021-08-27 07:52:01,894 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2021-08-27 07:52:01,894 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-08-27 07:52:01,894 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-08-27 07:52:01,894 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2021-08-27 07:52:01,894 INFO L87 Difference]: Start difference. First operand 859 states and 1044 transitions. Second operand has 8 states, 8 states have (on average 8.0) internal successors, (64), 6 states have internal predecessors, (64), 2 states have call successors, (10), 2 states have call predecessors, (10), 4 states have return successors, (9), 4 states have call predecessors, (9), 2 states have call successors, (9) [2021-08-27 07:52:01,914 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 07:52:01,914 INFO L93 Difference]: Finished difference Result 857 states and 1040 transitions. [2021-08-27 07:52:01,915 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-08-27 07:52:01,915 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 8.0) internal successors, (64), 6 states have internal predecessors, (64), 2 states have call successors, (10), 2 states have call predecessors, (10), 4 states have return successors, (9), 4 states have call predecessors, (9), 2 states have call successors, (9) Word has length 73 [2021-08-27 07:52:01,915 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-27 07:52:01,916 INFO L225 Difference]: With dead ends: 857 [2021-08-27 07:52:01,916 INFO L226 Difference]: Without dead ends: 851 [2021-08-27 07:52:01,916 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 145 GetRequests, 139 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 20.9ms TimeCoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2021-08-27 07:52:01,916 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 851 states. [2021-08-27 07:52:01,921 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 851 to 851. [2021-08-27 07:52:01,921 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 851 states, 674 states have (on average 1.231454005934718) internal successors, (830), 689 states have internal predecessors, (830), 90 states have call successors, (90), 74 states have call predecessors, (90), 86 states have return successors, (111), 91 states have call predecessors, (111), 85 states have call successors, (111) [2021-08-27 07:52:01,922 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 851 states to 851 states and 1031 transitions. [2021-08-27 07:52:01,923 INFO L78 Accepts]: Start accepts. Automaton has 851 states and 1031 transitions. Word has length 73 [2021-08-27 07:52:01,923 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-27 07:52:01,923 INFO L470 AbstractCegarLoop]: Abstraction has 851 states and 1031 transitions. [2021-08-27 07:52:01,923 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 8.0) internal successors, (64), 6 states have internal predecessors, (64), 2 states have call successors, (10), 2 states have call predecessors, (10), 4 states have return successors, (9), 4 states have call predecessors, (9), 2 states have call successors, (9) [2021-08-27 07:52:01,923 INFO L276 IsEmpty]: Start isEmpty. Operand 851 states and 1031 transitions. [2021-08-27 07:52:01,924 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2021-08-27 07:52:01,924 INFO L504 BasicCegarLoop]: Found error trace [2021-08-27 07:52:01,924 INFO L512 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-27 07:52:01,940 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (60)] Forceful destruction successful, exit code 0 [2021-08-27 07:52:02,137 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 60 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-08-27 07:52:02,137 INFO L402 AbstractCegarLoop]: === Iteration 60 === Targeting errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK === [mainErr0ENSURES_VIOLATIONMEMORY_LEAK, errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2021-08-27 07:52:02,137 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 07:52:02,137 INFO L82 PathProgramCache]: Analyzing trace with hash -586736919, now seen corresponding path program 1 times [2021-08-27 07:52:02,137 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-08-27 07:52:02,137 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [670637052] [2021-08-27 07:52:02,137 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 07:52:02,137 INFO L170 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-08-27 07:52:02,137 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-08-27 07:52:02,139 INFO L229 MonitoredProcess]: Starting monitored process 61 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-08-27 07:52:02,140 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (61)] Waiting until timeout for monitored process [2021-08-27 07:52:04,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-27 07:52:04,319 INFO L354 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-08-27 07:52:04,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-27 07:52:04,606 INFO L133 FreeRefinementEngine]: Strategy WOLF found a feasible trace [2021-08-27 07:52:04,606 INFO L626 BasicCegarLoop]: Counterexample is feasible [2021-08-27 07:52:04,607 INFO L764 garLoopResultBuilder]: Registering result UNSAFE for location errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK [2021-08-27 07:52:04,608 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr0ENSURES_VIOLATIONMEMORY_LEAK [2021-08-27 07:52:04,624 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (61)] Forceful destruction successful, exit code 0 [2021-08-27 07:52:04,822 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 61 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-08-27 07:52:04,826 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2021-08-27 07:52:04,933 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 27.08 07:52:04 BoogieIcfgContainer [2021-08-27 07:52:04,935 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-08-27 07:52:04,935 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2021-08-27 07:52:04,936 INFO L271 PluginConnector]: Initializing Witness Printer... [2021-08-27 07:52:04,936 INFO L275 PluginConnector]: Witness Printer initialized [2021-08-27 07:52:04,936 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.08 07:49:59" (3/4) ... [2021-08-27 07:52:04,950 INFO L140 WitnessPrinter]: No result that supports witness generation found [2021-08-27 07:52:04,951 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2021-08-27 07:52:04,952 INFO L168 Benchmark]: Toolchain (without parser) took 126640.42 ms. Allocated memory was 56.6 MB in the beginning and 809.5 MB in the end (delta: 752.9 MB). Free memory was 33.0 MB in the beginning and 730.7 MB in the end (delta: -697.7 MB). Peak memory consumption was 53.4 MB. Max. memory is 16.1 GB. [2021-08-27 07:52:04,954 INFO L168 Benchmark]: CDTParser took 0.15 ms. Allocated memory is still 56.6 MB. Free memory was 38.2 MB in the beginning and 38.2 MB in the end (delta: 44.6 kB). There was no memory consumed. Max. memory is 16.1 GB. [2021-08-27 07:52:04,955 INFO L168 Benchmark]: CACSL2BoogieTranslator took 461.25 ms. Allocated memory was 56.6 MB in the beginning and 69.2 MB in the end (delta: 12.6 MB). Free memory was 32.8 MB in the beginning and 47.9 MB in the end (delta: -15.1 MB). Peak memory consumption was 18.0 MB. Max. memory is 16.1 GB. [2021-08-27 07:52:04,955 INFO L168 Benchmark]: Boogie Preprocessor took 106.80 ms. Allocated memory is still 69.2 MB. Free memory was 47.9 MB in the beginning and 42.6 MB in the end (delta: 5.2 MB). Peak memory consumption was 4.2 MB. Max. memory is 16.1 GB. [2021-08-27 07:52:04,955 INFO L168 Benchmark]: RCFGBuilder took 1009.70 ms. Allocated memory was 69.2 MB in the beginning and 104.9 MB in the end (delta: 35.7 MB). Free memory was 42.6 MB in the beginning and 48.7 MB in the end (delta: -6.1 MB). Peak memory consumption was 38.0 MB. Max. memory is 16.1 GB. [2021-08-27 07:52:04,955 INFO L168 Benchmark]: TraceAbstraction took 125042.00 ms. Allocated memory was 104.9 MB in the beginning and 809.5 MB in the end (delta: 704.6 MB). Free memory was 48.0 MB in the beginning and 731.8 MB in the end (delta: -683.8 MB). Peak memory consumption was 493.6 MB. Max. memory is 16.1 GB. [2021-08-27 07:52:04,956 INFO L168 Benchmark]: Witness Printer took 15.22 ms. Allocated memory is still 809.5 MB. Free memory was 731.8 MB in the beginning and 730.7 MB in the end (delta: 1.0 MB). There was no memory consumed. Max. memory is 16.1 GB. [2021-08-27 07:52:04,957 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.15 ms. Allocated memory is still 56.6 MB. Free memory was 38.2 MB in the beginning and 38.2 MB in the end (delta: 44.6 kB). There was no memory consumed. Max. memory is 16.1 GB. * CACSL2BoogieTranslator took 461.25 ms. Allocated memory was 56.6 MB in the beginning and 69.2 MB in the end (delta: 12.6 MB). Free memory was 32.8 MB in the beginning and 47.9 MB in the end (delta: -15.1 MB). Peak memory consumption was 18.0 MB. Max. memory is 16.1 GB. * Boogie Preprocessor took 106.80 ms. Allocated memory is still 69.2 MB. Free memory was 47.9 MB in the beginning and 42.6 MB in the end (delta: 5.2 MB). Peak memory consumption was 4.2 MB. Max. memory is 16.1 GB. * RCFGBuilder took 1009.70 ms. Allocated memory was 69.2 MB in the beginning and 104.9 MB in the end (delta: 35.7 MB). Free memory was 42.6 MB in the beginning and 48.7 MB in the end (delta: -6.1 MB). Peak memory consumption was 38.0 MB. Max. memory is 16.1 GB. * TraceAbstraction took 125042.00 ms. Allocated memory was 104.9 MB in the beginning and 809.5 MB in the end (delta: 704.6 MB). Free memory was 48.0 MB in the beginning and 731.8 MB in the end (delta: -683.8 MB). Peak memory consumption was 493.6 MB. Max. memory is 16.1 GB. * Witness Printer took 15.22 ms. Allocated memory is still 809.5 MB. Free memory was 731.8 MB in the beginning and 730.7 MB in the end (delta: 1.0 MB). There was no memory consumed. Max. memory is 16.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0ms ErrorAutomatonConstructionTimeTotal, 0.0ms FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0ms ErrorAutomatonConstructionTimeAvg, 0.0ms ErrorAutomatonDifferenceTimeAvg, 0.0ms ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 59]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: overapproximation of memtrack at line 59. Possible FailurePath: [L32] int s ; [L33] int UNLOADED ; [L34] int NP ; [L35] int DC ; [L36] int SKIP1 ; [L37] int SKIP2 ; [L38] int MPR1 ; [L39] int MPR3 ; [L40] int IPC ; [L41] int pended ; [L42] int compFptr ; [L43] int compRegistered ; [L44] int lowerDriverReturn ; [L45] int setEventCalled ; [L46] int customIrp ; [L47] int routine ; [L48] int myStatus ; [L49] int pirp ; [L50] int Executive ; [L51] int Suspended ; [L52] int KernelMode ; [L53] int DeviceUsageTypePaging ; VAL [\old(compFptr)=29, \old(compRegistered)=10, \old(customIrp)=37, \old(DC)=19, \old(DeviceUsageTypePaging)=26, \old(Executive)=22, \old(IPC)=35, \old(KernelMode)=18, \old(lowerDriverReturn)=20, \old(MPR1)=38, \old(MPR3)=33, \old(myStatus)=8, \old(NP)=36, \old(pended)=34, \old(pirp)=15, \old(routine)=21, \old(s)=24, \old(setEventCalled)=31, \old(SKIP1)=17, \old(SKIP2)=28, \old(Suspended)=9, \old(UNLOADED)=14, compFptr=0, compRegistered=0, customIrp=0, DC=0, DeviceUsageTypePaging=0, Executive=0, IPC=0, KernelMode=0, lowerDriverReturn=0, MPR1=0, MPR3=0, myStatus=0, NP=0, pended=0, pirp=0, routine=0, s=0, setEventCalled=0, SKIP1=0, SKIP2=0, Suspended=0, UNLOADED=0] [L1718] int pirp__IoStatus__Status ; [L1719] int d = __VERIFIER_nondet_int() ; [L1720] int status = __VERIFIER_nondet_int() ; [L1721] int irp = __VERIFIER_nondet_int() ; [L1722] int we_should_unload = __VERIFIER_nondet_int() ; [L1723] int irp_choice = __VERIFIER_nondet_int() ; [L1724] int devobj = __VERIFIER_nondet_int() ; [L1725] int __cil_tmp9 ; [L1730] s = 0 [L1731] UNLOADED = 0 [L1732] NP = 0 [L1733] DC = 0 [L1734] SKIP1 = 0 [L1735] SKIP2 = 0 [L1736] MPR1 = 0 [L1737] MPR3 = 0 [L1738] IPC = 0 [L1739] pended = 0 [L1740] compFptr = 0 [L1741] compRegistered = 0 [L1742] lowerDriverReturn = 0 [L1743] setEventCalled = 0 [L1744] customIrp = 0 [L1745] routine = 0 [L1746] myStatus = 0 [L1747] pirp = 0 [L1748] Executive = 0 [L1749] Suspended = 5 [L1750] KernelMode = 0 [L1751] DeviceUsageTypePaging = 1 [L1754] pirp = irp VAL [\old(compFptr)=0, \old(compRegistered)=0, \old(customIrp)=0, \old(DC)=0, \old(DeviceUsageTypePaging)=0, \old(Executive)=0, \old(IPC)=0, \old(KernelMode)=0, \old(lowerDriverReturn)=0, \old(MPR1)=0, \old(MPR3)=0, \old(myStatus)=0, \old(NP)=0, \old(pended)=0, \old(pirp)=0, \old(routine)=0, \old(s)=0, \old(setEventCalled)=0, \old(SKIP1)=0, \old(SKIP2)=0, \old(Suspended)=0, \old(UNLOADED)=0, compFptr=0, compRegistered=0, customIrp=0, d=40, DC=0, DeviceUsageTypePaging=1, devobj=42, Executive=0, IPC=0, irp=41, irp_choice=0, KernelMode=0, lowerDriverReturn=0, MPR1=0, MPR3=0, myStatus=0, NP=0, pended=0, pirp=41, routine=0, s=0, setEventCalled=0, SKIP1=0, SKIP2=0, status=0, Suspended=5, UNLOADED=0, we_should_unload=0] [L1755] CALL _BLAST_init() VAL [\old(compFptr)=0, \old(compRegistered)=0, \old(customIrp)=0, \old(DC)=0, \old(DeviceUsageTypePaging)=0, \old(Executive)=0, \old(IPC)=0, \old(KernelMode)=0, \old(lowerDriverReturn)=0, \old(MPR1)=0, \old(MPR3)=0, \old(myStatus)=0, \old(NP)=0, \old(pended)=0, \old(pirp)=0, \old(routine)=0, \old(s)=0, \old(setEventCalled)=0, \old(SKIP1)=0, \old(SKIP2)=0, \old(Suspended)=0, \old(UNLOADED)=0, compFptr=0, compRegistered=0, customIrp=0, DC=0, DeviceUsageTypePaging=1, Executive=0, IPC=0, KernelMode=0, lowerDriverReturn=0, MPR1=0, MPR3=0, myStatus=0, NP=0, pended=0, pirp=41, routine=0, s=0, setEventCalled=0, SKIP1=0, SKIP2=0, Suspended=5, UNLOADED=0] [L67] UNLOADED = 0 [L68] NP = 1 [L69] DC = 2 [L70] SKIP1 = 3 [L71] SKIP2 = 4 [L72] MPR1 = 5 [L73] MPR3 = 6 [L74] IPC = 7 [L75] s = UNLOADED [L76] pended = 0 [L77] compFptr = 0 [L78] compRegistered = 0 [L79] lowerDriverReturn = 0 [L80] setEventCalled = 0 [L81] customIrp = 0 VAL [\old(compFptr)=0, \old(compRegistered)=0, \old(customIrp)=0, \old(DC)=0, \old(DeviceUsageTypePaging)=0, \old(Executive)=0, \old(IPC)=0, \old(KernelMode)=0, \old(lowerDriverReturn)=0, \old(MPR1)=0, \old(MPR3)=0, \old(myStatus)=0, \old(NP)=0, \old(pended)=0, \old(pirp)=0, \old(routine)=0, \old(s)=0, \old(setEventCalled)=0, \old(SKIP1)=0, \old(SKIP2)=0, \old(Suspended)=0, \old(UNLOADED)=0, compFptr=0, compRegistered=0, customIrp=0, DC=2, DeviceUsageTypePaging=1, Executive=0, IPC=7, KernelMode=0, lowerDriverReturn=0, MPR1=5, MPR3=6, myStatus=0, NP=1, pended=0, pirp=41, routine=0, s=0, setEventCalled=0, SKIP1=3, SKIP2=4, Suspended=5, UNLOADED=0] [L1755] RET _BLAST_init() VAL [\old(compFptr)=0, \old(compRegistered)=0, \old(customIrp)=0, \old(DC)=0, \old(DeviceUsageTypePaging)=0, \old(Executive)=0, \old(IPC)=0, \old(KernelMode)=0, \old(lowerDriverReturn)=0, \old(MPR1)=0, \old(MPR3)=0, \old(myStatus)=0, \old(NP)=0, \old(pended)=0, \old(pirp)=0, \old(routine)=0, \old(s)=0, \old(setEventCalled)=0, \old(SKIP1)=0, \old(SKIP2)=0, \old(Suspended)=0, \old(UNLOADED)=0, compFptr=0, compRegistered=0, customIrp=0, d=40, DC=2, DeviceUsageTypePaging=1, devobj=42, Executive=0, IPC=7, irp=41, irp_choice=0, KernelMode=0, lowerDriverReturn=0, MPR1=5, MPR3=6, myStatus=0, NP=1, pended=0, pirp=41, routine=0, s=0, setEventCalled=0, SKIP1=3, SKIP2=4, status=0, Suspended=5, UNLOADED=0, we_should_unload=0] [L1757] COND TRUE status >= 0 [L1758] s = NP [L1759] customIrp = 0 [L1760] setEventCalled = customIrp [L1761] lowerDriverReturn = setEventCalled [L1762] compRegistered = lowerDriverReturn [L1763] compFptr = compRegistered [L1764] pended = compFptr [L1765] pirp__IoStatus__Status = 0 [L1766] myStatus = 0 VAL [\old(compFptr)=0, \old(compRegistered)=0, \old(customIrp)=0, \old(DC)=0, \old(DeviceUsageTypePaging)=0, \old(Executive)=0, \old(IPC)=0, \old(KernelMode)=0, \old(lowerDriverReturn)=0, \old(MPR1)=0, \old(MPR3)=0, \old(myStatus)=0, \old(NP)=0, \old(pended)=0, \old(pirp)=0, \old(routine)=0, \old(s)=0, \old(setEventCalled)=0, \old(SKIP1)=0, \old(SKIP2)=0, \old(Suspended)=0, \old(UNLOADED)=0, compFptr=0, compRegistered=0, customIrp=0, d=40, DC=2, DeviceUsageTypePaging=1, devobj=42, Executive=0, IPC=7, irp=41, irp_choice=0, KernelMode=0, lowerDriverReturn=0, MPR1=5, MPR3=6, myStatus=0, NP=1, pended=0, pirp=41, pirp__IoStatus__Status=0, routine=0, s=1, setEventCalled=0, SKIP1=3, SKIP2=4, status=0, Suspended=5, UNLOADED=0, we_should_unload=0] [L1767] COND TRUE irp_choice == 0 [L1768] pirp__IoStatus__Status = -1073741637 [L1769] myStatus = -1073741637 VAL [\old(compFptr)=0, \old(compRegistered)=0, \old(customIrp)=0, \old(DC)=0, \old(DeviceUsageTypePaging)=0, \old(Executive)=0, \old(IPC)=0, \old(KernelMode)=0, \old(lowerDriverReturn)=0, \old(MPR1)=0, \old(MPR3)=0, \old(myStatus)=0, \old(NP)=0, \old(pended)=0, \old(pirp)=0, \old(routine)=0, \old(s)=0, \old(setEventCalled)=0, \old(SKIP1)=0, \old(SKIP2)=0, \old(Suspended)=0, \old(UNLOADED)=0, compFptr=0, compRegistered=0, customIrp=0, d=40, DC=2, DeviceUsageTypePaging=1, devobj=42, Executive=0, IPC=7, irp=41, irp_choice=0, KernelMode=0, lowerDriverReturn=0, MPR1=5, MPR3=6, myStatus=3221225659, NP=1, pended=0, pirp=41, pirp__IoStatus__Status=3221225659, routine=0, s=1, setEventCalled=0, SKIP1=3, SKIP2=4, status=0, Suspended=5, UNLOADED=0, we_should_unload=0] [L1772] CALL stub_driver_init() VAL [\old(compFptr)=0, \old(compRegistered)=0, \old(customIrp)=0, \old(DC)=0, \old(DeviceUsageTypePaging)=0, \old(Executive)=0, \old(IPC)=0, \old(KernelMode)=0, \old(lowerDriverReturn)=0, \old(MPR1)=0, \old(MPR3)=0, \old(myStatus)=0, \old(NP)=0, \old(pended)=0, \old(pirp)=0, \old(routine)=0, \old(s)=1, \old(setEventCalled)=0, \old(SKIP1)=0, \old(SKIP2)=0, \old(Suspended)=0, \old(UNLOADED)=0, compFptr=0, compRegistered=0, customIrp=0, DC=2, DeviceUsageTypePaging=1, Executive=0, IPC=7, KernelMode=0, lowerDriverReturn=0, MPR1=5, MPR3=6, myStatus=3221225659, NP=1, pended=0, pirp=41, routine=0, s=1, setEventCalled=0, SKIP1=3, SKIP2=4, Suspended=5, UNLOADED=0] [L1707] s = NP [L1708] customIrp = 0 [L1709] setEventCalled = customIrp [L1710] lowerDriverReturn = setEventCalled [L1711] compRegistered = lowerDriverReturn [L1712] compFptr = compRegistered [L1713] pended = compFptr VAL [\old(compFptr)=0, \old(compRegistered)=0, \old(customIrp)=0, \old(DC)=0, \old(DeviceUsageTypePaging)=0, \old(Executive)=0, \old(IPC)=0, \old(KernelMode)=0, \old(lowerDriverReturn)=0, \old(MPR1)=0, \old(MPR3)=0, \old(myStatus)=0, \old(NP)=0, \old(pended)=0, \old(pirp)=0, \old(routine)=0, \old(s)=1, \old(setEventCalled)=0, \old(SKIP1)=0, \old(SKIP2)=0, \old(Suspended)=0, \old(UNLOADED)=0, compFptr=0, compRegistered=0, customIrp=0, DC=2, DeviceUsageTypePaging=1, Executive=0, IPC=7, KernelMode=0, lowerDriverReturn=0, MPR1=5, MPR3=6, myStatus=3221225659, NP=1, pended=0, pirp=41, routine=0, s=1, setEventCalled=0, SKIP1=3, SKIP2=4, Suspended=5, UNLOADED=0] [L1772] RET stub_driver_init() VAL [\old(compFptr)=0, \old(compRegistered)=0, \old(customIrp)=0, \old(DC)=0, \old(DeviceUsageTypePaging)=0, \old(Executive)=0, \old(IPC)=0, \old(KernelMode)=0, \old(lowerDriverReturn)=0, \old(MPR1)=0, \old(MPR3)=0, \old(myStatus)=0, \old(NP)=0, \old(pended)=0, \old(pirp)=0, \old(routine)=0, \old(s)=0, \old(setEventCalled)=0, \old(SKIP1)=0, \old(SKIP2)=0, \old(Suspended)=0, \old(UNLOADED)=0, compFptr=0, compRegistered=0, customIrp=0, d=40, DC=2, DeviceUsageTypePaging=1, devobj=42, Executive=0, IPC=7, irp=41, irp_choice=0, KernelMode=0, lowerDriverReturn=0, MPR1=5, MPR3=6, myStatus=3221225659, NP=1, pended=0, pirp=41, pirp__IoStatus__Status=3221225659, routine=0, s=1, setEventCalled=0, SKIP1=3, SKIP2=4, status=0, Suspended=5, UNLOADED=0, we_should_unload=0] [L1775] COND FALSE !(status < 0) [L1779] int tmp_ndt_1; [L1780] tmp_ndt_1 = __VERIFIER_nondet_int() [L1781] COND TRUE tmp_ndt_1 == 2 VAL [\old(compFptr)=0, \old(compRegistered)=0, \old(customIrp)=0, \old(DC)=0, \old(DeviceUsageTypePaging)=0, \old(Executive)=0, \old(IPC)=0, \old(KernelMode)=0, \old(lowerDriverReturn)=0, \old(MPR1)=0, \old(MPR3)=0, \old(myStatus)=0, \old(NP)=0, \old(pended)=0, \old(pirp)=0, \old(routine)=0, \old(s)=0, \old(setEventCalled)=0, \old(SKIP1)=0, \old(SKIP2)=0, \old(Suspended)=0, \old(UNLOADED)=0, compFptr=0, compRegistered=0, customIrp=0, d=40, DC=2, DeviceUsageTypePaging=1, devobj=42, Executive=0, IPC=7, irp=41, irp_choice=0, KernelMode=0, lowerDriverReturn=0, MPR1=5, MPR3=6, myStatus=3221225659, NP=1, pended=0, pirp=41, pirp__IoStatus__Status=3221225659, routine=0, s=1, setEventCalled=0, SKIP1=3, SKIP2=4, status=0, Suspended=5, tmp_ndt_1=2, UNLOADED=0, we_should_unload=0] [L1798] CALL, EXPR CdAudioDeviceControl(devobj, pirp) VAL [\old(compFptr)=0, \old(compRegistered)=0, \old(customIrp)=0, \old(DC)=0, \old(DeviceObject)=42, \old(DeviceUsageTypePaging)=0, \old(Executive)=0, \old(IPC)=0, \old(Irp)=41, \old(KernelMode)=0, \old(lowerDriverReturn)=0, \old(MPR1)=0, \old(MPR3)=0, \old(myStatus)=3221225659, \old(NP)=0, \old(pended)=0, \old(pirp)=0, \old(routine)=0, \old(s)=1, \old(setEventCalled)=0, \old(SKIP1)=0, \old(SKIP2)=0, \old(Suspended)=0, \old(UNLOADED)=0, compFptr=0, compRegistered=0, customIrp=0, DC=2, DeviceUsageTypePaging=1, Executive=0, IPC=7, KernelMode=0, lowerDriverReturn=0, MPR1=5, MPR3=6, myStatus=3221225659, NP=1, pended=0, pirp=41, routine=0, s=1, setEventCalled=0, SKIP1=3, SKIP2=4, Suspended=5, UNLOADED=0] [L313] int deviceExtension__Active = __VERIFIER_nondet_int() ; [L314] int status ; VAL [\old(compFptr)=0, \old(compRegistered)=0, \old(customIrp)=0, \old(DC)=0, \old(DeviceObject)=42, \old(DeviceUsageTypePaging)=0, \old(Executive)=0, \old(IPC)=0, \old(Irp)=41, \old(KernelMode)=0, \old(lowerDriverReturn)=0, \old(MPR1)=0, \old(MPR3)=0, \old(myStatus)=3221225659, \old(NP)=0, \old(pended)=0, \old(pirp)=0, \old(routine)=0, \old(s)=1, \old(setEventCalled)=0, \old(SKIP1)=0, \old(SKIP2)=0, \old(Suspended)=0, \old(UNLOADED)=0, compFptr=0, compRegistered=0, customIrp=0, DC=2, deviceExtension__Active=7, DeviceObject=42, DeviceUsageTypePaging=1, Executive=0, IPC=7, Irp=41, KernelMode=0, lowerDriverReturn=0, MPR1=5, MPR3=6, myStatus=3221225659, NP=1, pended=0, pirp=41, routine=0, s=1, setEventCalled=0, SKIP1=3, SKIP2=4, Suspended=5, UNLOADED=0] [L317] COND FALSE !(deviceExtension__Active == 2) VAL [\old(compFptr)=0, \old(compRegistered)=0, \old(customIrp)=0, \old(DC)=0, \old(DeviceObject)=42, \old(DeviceUsageTypePaging)=0, \old(Executive)=0, \old(IPC)=0, \old(Irp)=41, \old(KernelMode)=0, \old(lowerDriverReturn)=0, \old(MPR1)=0, \old(MPR3)=0, \old(myStatus)=3221225659, \old(NP)=0, \old(pended)=0, \old(pirp)=0, \old(routine)=0, \old(s)=1, \old(setEventCalled)=0, \old(SKIP1)=0, \old(SKIP2)=0, \old(Suspended)=0, \old(UNLOADED)=0, compFptr=0, compRegistered=0, customIrp=0, DC=2, deviceExtension__Active=7, DeviceObject=42, DeviceUsageTypePaging=1, Executive=0, IPC=7, Irp=41, KernelMode=0, lowerDriverReturn=0, MPR1=5, MPR3=6, myStatus=3221225659, NP=1, pended=0, pirp=41, routine=0, s=1, setEventCalled=0, SKIP1=3, SKIP2=4, Suspended=5, UNLOADED=0] [L320] COND FALSE !(deviceExtension__Active == 3) VAL [\old(compFptr)=0, \old(compRegistered)=0, \old(customIrp)=0, \old(DC)=0, \old(DeviceObject)=42, \old(DeviceUsageTypePaging)=0, \old(Executive)=0, \old(IPC)=0, \old(Irp)=41, \old(KernelMode)=0, \old(lowerDriverReturn)=0, \old(MPR1)=0, \old(MPR3)=0, \old(myStatus)=3221225659, \old(NP)=0, \old(pended)=0, \old(pirp)=0, \old(routine)=0, \old(s)=1, \old(setEventCalled)=0, \old(SKIP1)=0, \old(SKIP2)=0, \old(Suspended)=0, \old(UNLOADED)=0, compFptr=0, compRegistered=0, customIrp=0, DC=2, deviceExtension__Active=7, DeviceObject=42, DeviceUsageTypePaging=1, Executive=0, IPC=7, Irp=41, KernelMode=0, lowerDriverReturn=0, MPR1=5, MPR3=6, myStatus=3221225659, NP=1, pended=0, pirp=41, routine=0, s=1, setEventCalled=0, SKIP1=3, SKIP2=4, Suspended=5, UNLOADED=0] [L323] COND FALSE !(deviceExtension__Active == 1) VAL [\old(compFptr)=0, \old(compRegistered)=0, \old(customIrp)=0, \old(DC)=0, \old(DeviceObject)=42, \old(DeviceUsageTypePaging)=0, \old(Executive)=0, \old(IPC)=0, \old(Irp)=41, \old(KernelMode)=0, \old(lowerDriverReturn)=0, \old(MPR1)=0, \old(MPR3)=0, \old(myStatus)=3221225659, \old(NP)=0, \old(pended)=0, \old(pirp)=0, \old(routine)=0, \old(s)=1, \old(setEventCalled)=0, \old(SKIP1)=0, \old(SKIP2)=0, \old(Suspended)=0, \old(UNLOADED)=0, compFptr=0, compRegistered=0, customIrp=0, DC=2, deviceExtension__Active=7, DeviceObject=42, DeviceUsageTypePaging=1, Executive=0, IPC=7, Irp=41, KernelMode=0, lowerDriverReturn=0, MPR1=5, MPR3=6, myStatus=3221225659, NP=1, pended=0, pirp=41, routine=0, s=1, setEventCalled=0, SKIP1=3, SKIP2=4, Suspended=5, UNLOADED=0] [L326] COND TRUE deviceExtension__Active == 7 VAL [\old(compFptr)=0, \old(compRegistered)=0, \old(customIrp)=0, \old(DC)=0, \old(DeviceObject)=42, \old(DeviceUsageTypePaging)=0, \old(Executive)=0, \old(IPC)=0, \old(Irp)=41, \old(KernelMode)=0, \old(lowerDriverReturn)=0, \old(MPR1)=0, \old(MPR3)=0, \old(myStatus)=3221225659, \old(NP)=0, \old(pended)=0, \old(pirp)=0, \old(routine)=0, \old(s)=1, \old(setEventCalled)=0, \old(SKIP1)=0, \old(SKIP2)=0, \old(Suspended)=0, \old(UNLOADED)=0, compFptr=0, compRegistered=0, customIrp=0, DC=2, deviceExtension__Active=7, DeviceObject=42, DeviceUsageTypePaging=1, Executive=0, IPC=7, Irp=41, KernelMode=0, lowerDriverReturn=0, MPR1=5, MPR3=6, myStatus=3221225659, NP=1, pended=0, pirp=41, routine=0, s=1, setEventCalled=0, SKIP1=3, SKIP2=4, Suspended=5, UNLOADED=0] [L348] CALL, EXPR CdAudioHPCdrDeviceControl(DeviceObject, Irp) VAL [\old(compFptr)=0, \old(compRegistered)=0, \old(customIrp)=0, \old(DC)=0, \old(DeviceObject)=42, \old(DeviceUsageTypePaging)=0, \old(Executive)=0, \old(IPC)=0, \old(Irp)=41, \old(KernelMode)=0, \old(lowerDriverReturn)=0, \old(MPR1)=0, \old(MPR3)=0, \old(myStatus)=3221225659, \old(NP)=0, \old(pended)=0, \old(pirp)=0, \old(routine)=0, \old(s)=1, \old(setEventCalled)=0, \old(SKIP1)=0, \old(SKIP2)=0, \old(Suspended)=0, \old(UNLOADED)=0, compFptr=0, compRegistered=0, customIrp=0, DC=2, DeviceUsageTypePaging=1, Executive=0, IPC=7, KernelMode=0, lowerDriverReturn=0, MPR1=5, MPR3=6, myStatus=3221225659, NP=1, pended=0, pirp=41, routine=0, s=1, setEventCalled=0, SKIP1=3, SKIP2=4, Suspended=5, UNLOADED=0] [L1591] int currentIrpStack__Parameters__DeviceIoControl__IoControlCode = __VERIFIER_nondet_int() ; [L1592] int deviceExtension__TargetDeviceObject = __VERIFIER_nondet_int() ; [L1593] int irpSp__Control ; [L1594] int tmp ; [L1595] int tmp___0 ; [L1596] int __cil_tmp8 ; [L1597] int __cil_tmp9 ; [L1598] int __cil_tmp10 ; [L1599] int __cil_tmp11 ; [L1600] int __cil_tmp12 ; [L1604] __cil_tmp8 = 56 [L1605] __cil_tmp9 = 16384 [L1606] __cil_tmp10 = 131072 [L1607] __cil_tmp11 = 147456 [L1608] __cil_tmp12 = 147512 VAL [\old(compFptr)=0, \old(compRegistered)=0, \old(customIrp)=0, \old(DC)=0, \old(DeviceObject)=42, \old(DeviceUsageTypePaging)=0, \old(Executive)=0, \old(IPC)=0, \old(Irp)=41, \old(KernelMode)=0, \old(lowerDriverReturn)=0, \old(MPR1)=0, \old(MPR3)=0, \old(myStatus)=3221225659, \old(NP)=0, \old(pended)=0, \old(pirp)=0, \old(routine)=0, \old(s)=1, \old(setEventCalled)=0, \old(SKIP1)=0, \old(SKIP2)=0, \old(Suspended)=0, \old(UNLOADED)=0, __cil_tmp10=131072, __cil_tmp11=147456, __cil_tmp12=147512, __cil_tmp8=56, __cil_tmp9=16384, compFptr=0, compRegistered=0, currentIrpStack__Parameters__DeviceIoControl__IoControlCode=147512, customIrp=0, DC=2, deviceExtension__TargetDeviceObject=43, DeviceObject=42, DeviceUsageTypePaging=1, Executive=0, IPC=7, Irp=41, KernelMode=0, lowerDriverReturn=0, MPR1=5, MPR3=6, myStatus=3221225659, NP=1, pended=0, pirp=41, routine=0, s=1, setEventCalled=0, SKIP1=3, SKIP2=4, Suspended=5, UNLOADED=0] [L1609] COND TRUE currentIrpStack__Parameters__DeviceIoControl__IoControlCode == __cil_tmp12 VAL [\old(compFptr)=0, \old(compRegistered)=0, \old(customIrp)=0, \old(DC)=0, \old(DeviceObject)=42, \old(DeviceUsageTypePaging)=0, \old(Executive)=0, \old(IPC)=0, \old(Irp)=41, \old(KernelMode)=0, \old(lowerDriverReturn)=0, \old(MPR1)=0, \old(MPR3)=0, \old(myStatus)=3221225659, \old(NP)=0, \old(pended)=0, \old(pirp)=0, \old(routine)=0, \old(s)=1, \old(setEventCalled)=0, \old(SKIP1)=0, \old(SKIP2)=0, \old(Suspended)=0, \old(UNLOADED)=0, __cil_tmp10=131072, __cil_tmp11=147456, __cil_tmp12=147512, __cil_tmp8=56, __cil_tmp9=16384, compFptr=0, compRegistered=0, currentIrpStack__Parameters__DeviceIoControl__IoControlCode=147512, customIrp=0, DC=2, deviceExtension__TargetDeviceObject=43, DeviceObject=42, DeviceUsageTypePaging=1, Executive=0, IPC=7, Irp=41, KernelMode=0, lowerDriverReturn=0, MPR1=5, MPR3=6, myStatus=3221225659, NP=1, pended=0, pirp=41, routine=0, s=1, setEventCalled=0, SKIP1=3, SKIP2=4, Suspended=5, UNLOADED=0] [L1610] COND FALSE !(s != NP) VAL [\old(compFptr)=0, \old(compRegistered)=0, \old(customIrp)=0, \old(DC)=0, \old(DeviceObject)=42, \old(DeviceUsageTypePaging)=0, \old(Executive)=0, \old(IPC)=0, \old(Irp)=41, \old(KernelMode)=0, \old(lowerDriverReturn)=0, \old(MPR1)=0, \old(MPR3)=0, \old(myStatus)=3221225659, \old(NP)=0, \old(pended)=0, \old(pirp)=0, \old(routine)=0, \old(s)=1, \old(setEventCalled)=0, \old(SKIP1)=0, \old(SKIP2)=0, \old(Suspended)=0, \old(UNLOADED)=0, __cil_tmp10=131072, __cil_tmp11=147456, __cil_tmp12=147512, __cil_tmp8=56, __cil_tmp9=16384, compFptr=0, compRegistered=0, currentIrpStack__Parameters__DeviceIoControl__IoControlCode=147512, customIrp=0, DC=2, deviceExtension__TargetDeviceObject=43, DeviceObject=42, DeviceUsageTypePaging=1, Executive=0, IPC=7, Irp=41, KernelMode=0, lowerDriverReturn=0, MPR1=5, MPR3=6, myStatus=3221225659, NP=1, pended=0, pirp=41, routine=0, s=1, setEventCalled=0, SKIP1=3, SKIP2=4, Suspended=5, UNLOADED=0] [L1615] COND FALSE !(compRegistered != 0) [L1620] compRegistered = 1 [L1621] routine = 0 VAL [\old(compFptr)=0, \old(compRegistered)=0, \old(customIrp)=0, \old(DC)=0, \old(DeviceObject)=42, \old(DeviceUsageTypePaging)=0, \old(Executive)=0, \old(IPC)=0, \old(Irp)=41, \old(KernelMode)=0, \old(lowerDriverReturn)=0, \old(MPR1)=0, \old(MPR3)=0, \old(myStatus)=3221225659, \old(NP)=0, \old(pended)=0, \old(pirp)=0, \old(routine)=0, \old(s)=1, \old(setEventCalled)=0, \old(SKIP1)=0, \old(SKIP2)=0, \old(Suspended)=0, \old(UNLOADED)=0, __cil_tmp10=131072, __cil_tmp11=147456, __cil_tmp12=147512, __cil_tmp8=56, __cil_tmp9=16384, compFptr=0, compRegistered=1, currentIrpStack__Parameters__DeviceIoControl__IoControlCode=147512, customIrp=0, DC=2, deviceExtension__TargetDeviceObject=43, DeviceObject=42, DeviceUsageTypePaging=1, Executive=0, IPC=7, Irp=41, KernelMode=0, lowerDriverReturn=0, MPR1=5, MPR3=6, myStatus=3221225659, NP=1, pended=0, pirp=41, routine=0, s=1, setEventCalled=0, SKIP1=3, SKIP2=4, Suspended=5, UNLOADED=0] [L1625] irpSp__Control = 224 VAL [\old(compFptr)=0, \old(compRegistered)=0, \old(customIrp)=0, \old(DC)=0, \old(DeviceObject)=42, \old(DeviceUsageTypePaging)=0, \old(Executive)=0, \old(IPC)=0, \old(Irp)=41, \old(KernelMode)=0, \old(lowerDriverReturn)=0, \old(MPR1)=0, \old(MPR3)=0, \old(myStatus)=3221225659, \old(NP)=0, \old(pended)=0, \old(pirp)=0, \old(routine)=0, \old(s)=1, \old(setEventCalled)=0, \old(SKIP1)=0, \old(SKIP2)=0, \old(Suspended)=0, \old(UNLOADED)=0, __cil_tmp10=131072, __cil_tmp11=147456, __cil_tmp12=147512, __cil_tmp8=56, __cil_tmp9=16384, compFptr=0, compRegistered=1, currentIrpStack__Parameters__DeviceIoControl__IoControlCode=147512, customIrp=0, DC=2, deviceExtension__TargetDeviceObject=43, DeviceObject=42, DeviceUsageTypePaging=1, Executive=0, IPC=7, Irp=41, irpSp__Control=224, KernelMode=0, lowerDriverReturn=0, MPR1=5, MPR3=6, myStatus=3221225659, NP=1, pended=0, pirp=41, routine=0, s=1, setEventCalled=0, SKIP1=3, SKIP2=4, Suspended=5, UNLOADED=0] [L1626] CALL, EXPR IofCallDriver(deviceExtension__TargetDeviceObject, Irp) VAL [\old(compFptr)=0, \old(compRegistered)=0, \old(customIrp)=0, \old(DC)=0, \old(DeviceObject)=43, \old(DeviceUsageTypePaging)=0, \old(Executive)=0, \old(IPC)=0, \old(Irp)=41, \old(KernelMode)=0, \old(lowerDriverReturn)=0, \old(MPR1)=0, \old(MPR3)=0, \old(myStatus)=3221225659, \old(NP)=0, \old(pended)=0, \old(pirp)=0, \old(routine)=0, \old(s)=1, \old(setEventCalled)=0, \old(SKIP1)=0, \old(SKIP2)=0, \old(Suspended)=0, \old(UNLOADED)=0, compFptr=0, compRegistered=1, customIrp=0, DC=2, DeviceUsageTypePaging=1, Executive=0, IPC=7, KernelMode=0, lowerDriverReturn=0, MPR1=5, MPR3=6, myStatus=3221225659, NP=1, pended=0, pirp=41, routine=0, s=1, setEventCalled=0, SKIP1=3, SKIP2=4, Suspended=5, UNLOADED=0] [L1900] int Irp__PendingReturned = __VERIFIER_nondet_int() ; [L1901] int returnVal2 ; [L1902] int compRetStatus ; [L1903] int lcontext = __VERIFIER_nondet_int() ; [L1904] unsigned long __cil_tmp8 ; VAL [\old(compFptr)=0, \old(compRegistered)=0, \old(customIrp)=0, \old(DC)=0, \old(DeviceObject)=43, \old(DeviceUsageTypePaging)=0, \old(Executive)=0, \old(IPC)=0, \old(Irp)=41, \old(KernelMode)=0, \old(lowerDriverReturn)=0, \old(MPR1)=0, \old(MPR3)=0, \old(myStatus)=3221225659, \old(NP)=0, \old(pended)=0, \old(pirp)=0, \old(routine)=0, \old(s)=1, \old(setEventCalled)=0, \old(SKIP1)=0, \old(SKIP2)=0, \old(Suspended)=0, \old(UNLOADED)=0, compFptr=0, compRegistered=1, customIrp=0, DC=2, DeviceObject=43, DeviceUsageTypePaging=1, Executive=0, IPC=7, Irp=41, Irp__PendingReturned=0, KernelMode=0, lcontext=44, lowerDriverReturn=0, MPR1=5, MPR3=6, myStatus=3221225659, NP=1, pended=0, pirp=41, routine=0, s=1, setEventCalled=0, SKIP1=3, SKIP2=4, Suspended=5, UNLOADED=0] [L1907] COND TRUE \read(compRegistered) VAL [\old(compFptr)=0, \old(compRegistered)=0, \old(customIrp)=0, \old(DC)=0, \old(DeviceObject)=43, \old(DeviceUsageTypePaging)=0, \old(Executive)=0, \old(IPC)=0, \old(Irp)=41, \old(KernelMode)=0, \old(lowerDriverReturn)=0, \old(MPR1)=0, \old(MPR3)=0, \old(myStatus)=3221225659, \old(NP)=0, \old(pended)=0, \old(pirp)=0, \old(routine)=0, \old(s)=1, \old(setEventCalled)=0, \old(SKIP1)=0, \old(SKIP2)=0, \old(Suspended)=0, \old(UNLOADED)=0, compFptr=0, compRegistered=1, customIrp=0, DC=2, DeviceObject=43, DeviceUsageTypePaging=1, Executive=0, IPC=7, Irp=41, Irp__PendingReturned=0, KernelMode=0, lcontext=44, lowerDriverReturn=0, MPR1=5, MPR3=6, myStatus=3221225659, NP=1, pended=0, pirp=41, routine=0, s=1, setEventCalled=0, SKIP1=3, SKIP2=4, Suspended=5, UNLOADED=0] [L1908] COND TRUE routine == 0 VAL [\old(compFptr)=0, \old(compRegistered)=0, \old(customIrp)=0, \old(DC)=0, \old(DeviceObject)=43, \old(DeviceUsageTypePaging)=0, \old(Executive)=0, \old(IPC)=0, \old(Irp)=41, \old(KernelMode)=0, \old(lowerDriverReturn)=0, \old(MPR1)=0, \old(MPR3)=0, \old(myStatus)=3221225659, \old(NP)=0, \old(pended)=0, \old(pirp)=0, \old(routine)=0, \old(s)=1, \old(setEventCalled)=0, \old(SKIP1)=0, \old(SKIP2)=0, \old(Suspended)=0, \old(UNLOADED)=0, compFptr=0, compRegistered=1, customIrp=0, DC=2, DeviceObject=43, DeviceUsageTypePaging=1, Executive=0, IPC=7, Irp=41, Irp__PendingReturned=0, KernelMode=0, lcontext=44, lowerDriverReturn=0, MPR1=5, MPR3=6, myStatus=3221225659, NP=1, pended=0, pirp=41, routine=0, s=1, setEventCalled=0, SKIP1=3, SKIP2=4, Suspended=5, UNLOADED=0] [L1910] CALL, EXPR HPCdrCompletion(DeviceObject, Irp, lcontext) VAL [\old(compFptr)=0, \old(compRegistered)=0, \old(Context)=44, \old(customIrp)=0, \old(DC)=0, \old(DeviceObject)=43, \old(DeviceUsageTypePaging)=0, \old(Executive)=0, \old(IPC)=0, \old(Irp)=41, \old(KernelMode)=0, \old(lowerDriverReturn)=0, \old(MPR1)=0, \old(MPR3)=0, \old(myStatus)=3221225659, \old(NP)=0, \old(pended)=0, \old(pirp)=0, \old(routine)=0, \old(s)=1, \old(setEventCalled)=0, \old(SKIP1)=0, \old(SKIP2)=0, \old(Suspended)=0, \old(UNLOADED)=0, compFptr=0, compRegistered=1, customIrp=0, DC=2, DeviceUsageTypePaging=1, Executive=0, IPC=7, KernelMode=0, lowerDriverReturn=0, MPR1=5, MPR3=6, myStatus=3221225659, NP=1, pended=0, pirp=41, routine=0, s=1, setEventCalled=0, SKIP1=3, SKIP2=4, Suspended=5, UNLOADED=0] [L1569] int Irp__PendingReturned = __VERIFIER_nondet_int() ; [L1570] int Irp__AssociatedIrp__SystemBuffer = __VERIFIER_nondet_int() ; [L1573] COND TRUE \read(Irp__PendingReturned) VAL [\old(compFptr)=0, \old(compRegistered)=0, \old(Context)=44, \old(customIrp)=0, \old(DC)=0, \old(DeviceObject)=43, \old(DeviceUsageTypePaging)=0, \old(Executive)=0, \old(IPC)=0, \old(Irp)=41, \old(KernelMode)=0, \old(lowerDriverReturn)=0, \old(MPR1)=0, \old(MPR3)=0, \old(myStatus)=3221225659, \old(NP)=0, \old(pended)=0, \old(pirp)=0, \old(routine)=0, \old(s)=1, \old(setEventCalled)=0, \old(SKIP1)=0, \old(SKIP2)=0, \old(Suspended)=0, \old(UNLOADED)=0, compFptr=0, compRegistered=1, Context=44, customIrp=0, DC=2, DeviceObject=43, DeviceUsageTypePaging=1, Executive=0, IPC=7, Irp=41, Irp__AssociatedIrp__SystemBuffer=45, Irp__PendingReturned=2147483648, KernelMode=0, lowerDriverReturn=0, MPR1=5, MPR3=6, myStatus=3221225659, NP=1, pended=0, pirp=41, routine=0, s=1, setEventCalled=0, SKIP1=3, SKIP2=4, Suspended=5, UNLOADED=0] [L1574] COND TRUE pended == 0 [L1575] pended = 1 VAL [\old(compFptr)=0, \old(compRegistered)=0, \old(Context)=44, \old(customIrp)=0, \old(DC)=0, \old(DeviceObject)=43, \old(DeviceUsageTypePaging)=0, \old(Executive)=0, \old(IPC)=0, \old(Irp)=41, \old(KernelMode)=0, \old(lowerDriverReturn)=0, \old(MPR1)=0, \old(MPR3)=0, \old(myStatus)=3221225659, \old(NP)=0, \old(pended)=0, \old(pirp)=0, \old(routine)=0, \old(s)=1, \old(setEventCalled)=0, \old(SKIP1)=0, \old(SKIP2)=0, \old(Suspended)=0, \old(UNLOADED)=0, compFptr=0, compRegistered=1, Context=44, customIrp=0, DC=2, DeviceObject=43, DeviceUsageTypePaging=1, Executive=0, IPC=7, Irp=41, Irp__AssociatedIrp__SystemBuffer=45, Irp__PendingReturned=2147483648, KernelMode=0, lowerDriverReturn=0, MPR1=5, MPR3=6, myStatus=3221225659, NP=1, pended=1, pirp=41, routine=0, s=1, setEventCalled=0, SKIP1=3, SKIP2=4, Suspended=5, UNLOADED=0] [L1582] COND FALSE !(myStatus >= 0) VAL [\old(compFptr)=0, \old(compRegistered)=0, \old(Context)=44, \old(customIrp)=0, \old(DC)=0, \old(DeviceObject)=43, \old(DeviceUsageTypePaging)=0, \old(Executive)=0, \old(IPC)=0, \old(Irp)=41, \old(KernelMode)=0, \old(lowerDriverReturn)=0, \old(MPR1)=0, \old(MPR3)=0, \old(myStatus)=3221225659, \old(NP)=0, \old(pended)=0, \old(pirp)=0, \old(routine)=0, \old(s)=1, \old(setEventCalled)=0, \old(SKIP1)=0, \old(SKIP2)=0, \old(Suspended)=0, \old(UNLOADED)=0, compFptr=0, compRegistered=1, Context=44, customIrp=0, DC=2, DeviceObject=43, DeviceUsageTypePaging=1, Executive=0, IPC=7, Irp=41, Irp__AssociatedIrp__SystemBuffer=45, Irp__PendingReturned=2147483648, KernelMode=0, lowerDriverReturn=0, MPR1=5, MPR3=6, myStatus=3221225659, NP=1, pended=1, pirp=41, routine=0, s=1, setEventCalled=0, SKIP1=3, SKIP2=4, Suspended=5, UNLOADED=0] [L1587] return (myStatus); VAL [\old(compFptr)=0, \old(compRegistered)=0, \old(Context)=44, \old(customIrp)=0, \old(DC)=0, \old(DeviceObject)=43, \old(DeviceUsageTypePaging)=0, \old(Executive)=0, \old(IPC)=0, \old(Irp)=41, \old(KernelMode)=0, \old(lowerDriverReturn)=0, \old(MPR1)=0, \old(MPR3)=0, \old(myStatus)=3221225659, \old(NP)=0, \old(pended)=0, \old(pirp)=0, \old(routine)=0, \old(s)=1, \old(setEventCalled)=0, \old(SKIP1)=0, \old(SKIP2)=0, \old(Suspended)=0, \old(UNLOADED)=0, \result=-1073741637, compFptr=0, compRegistered=1, Context=44, customIrp=0, DC=2, DeviceObject=43, DeviceUsageTypePaging=1, Executive=0, IPC=7, Irp=41, Irp__AssociatedIrp__SystemBuffer=45, Irp__PendingReturned=2147483648, KernelMode=0, lowerDriverReturn=0, MPR1=5, MPR3=6, myStatus=3221225659, NP=1, pended=1, pirp=41, routine=0, s=1, setEventCalled=0, SKIP1=3, SKIP2=4, Suspended=5, UNLOADED=0] [L1910] RET, EXPR HPCdrCompletion(DeviceObject, Irp, lcontext) VAL [\old(compFptr)=0, \old(compRegistered)=0, \old(customIrp)=0, \old(DC)=0, \old(DeviceObject)=43, \old(DeviceUsageTypePaging)=0, \old(Executive)=0, \old(IPC)=0, \old(Irp)=41, \old(KernelMode)=0, \old(lowerDriverReturn)=0, \old(MPR1)=0, \old(MPR3)=0, \old(myStatus)=3221225659, \old(NP)=0, \old(pended)=0, \old(pirp)=0, \old(routine)=0, \old(s)=1, \old(setEventCalled)=0, \old(SKIP1)=0, \old(SKIP2)=0, \old(Suspended)=0, \old(UNLOADED)=0, compFptr=0, compRegistered=1, customIrp=0, DC=2, DeviceObject=43, DeviceUsageTypePaging=1, Executive=0, HPCdrCompletion(DeviceObject, Irp, lcontext)=-1073741637, IPC=7, Irp=41, Irp__PendingReturned=0, KernelMode=0, lcontext=44, lowerDriverReturn=0, MPR1=5, MPR3=6, myStatus=3221225659, NP=1, pended=1, pirp=41, routine=0, s=1, setEventCalled=0, SKIP1=3, SKIP2=4, Suspended=5, UNLOADED=0] [L1910] compRetStatus = HPCdrCompletion(DeviceObject, Irp, lcontext) [L1920] __cil_tmp8 = (unsigned long )compRetStatus VAL [\old(compFptr)=0, \old(compRegistered)=0, \old(customIrp)=0, \old(DC)=0, \old(DeviceObject)=43, \old(DeviceUsageTypePaging)=0, \old(Executive)=0, \old(IPC)=0, \old(Irp)=41, \old(KernelMode)=0, \old(lowerDriverReturn)=0, \old(MPR1)=0, \old(MPR3)=0, \old(myStatus)=3221225659, \old(NP)=0, \old(pended)=0, \old(pirp)=0, \old(routine)=0, \old(s)=1, \old(setEventCalled)=0, \old(SKIP1)=0, \old(SKIP2)=0, \old(Suspended)=0, \old(UNLOADED)=0, __cil_tmp8=3221225659, compFptr=0, compRegistered=1, compRetStatus=3221225659, customIrp=0, DC=2, DeviceObject=43, DeviceUsageTypePaging=1, Executive=0, IPC=7, Irp=41, Irp__PendingReturned=0, KernelMode=0, lcontext=44, lowerDriverReturn=0, MPR1=5, MPR3=6, myStatus=3221225659, NP=1, pended=1, pirp=41, routine=0, s=1, setEventCalled=0, SKIP1=3, SKIP2=4, Suspended=5, UNLOADED=0] [L1921] COND FALSE !(__cil_tmp8 == -1073741802) VAL [\old(compFptr)=0, \old(compRegistered)=0, \old(customIrp)=0, \old(DC)=0, \old(DeviceObject)=43, \old(DeviceUsageTypePaging)=0, \old(Executive)=0, \old(IPC)=0, \old(Irp)=41, \old(KernelMode)=0, \old(lowerDriverReturn)=0, \old(MPR1)=0, \old(MPR3)=0, \old(myStatus)=3221225659, \old(NP)=0, \old(pended)=0, \old(pirp)=0, \old(routine)=0, \old(s)=1, \old(setEventCalled)=0, \old(SKIP1)=0, \old(SKIP2)=0, \old(Suspended)=0, \old(UNLOADED)=0, __cil_tmp8=3221225659, compFptr=0, compRegistered=1, compRetStatus=3221225659, customIrp=0, DC=2, DeviceObject=43, DeviceUsageTypePaging=1, Executive=0, IPC=7, Irp=41, Irp__PendingReturned=0, KernelMode=0, lcontext=44, lowerDriverReturn=0, MPR1=5, MPR3=6, myStatus=3221225659, NP=1, pended=1, pirp=41, routine=0, s=1, setEventCalled=0, SKIP1=3, SKIP2=4, Suspended=5, UNLOADED=0] [L1928] COND FALSE !(\read(Irp__PendingReturned)) [L1931] int tmp_ndt_4; [L1932] tmp_ndt_4 = __VERIFIER_nondet_int() [L1933] COND TRUE tmp_ndt_4 == 0 VAL [\old(compFptr)=0, \old(compRegistered)=0, \old(customIrp)=0, \old(DC)=0, \old(DeviceObject)=43, \old(DeviceUsageTypePaging)=0, \old(Executive)=0, \old(IPC)=0, \old(Irp)=41, \old(KernelMode)=0, \old(lowerDriverReturn)=0, \old(MPR1)=0, \old(MPR3)=0, \old(myStatus)=3221225659, \old(NP)=0, \old(pended)=0, \old(pirp)=0, \old(routine)=0, \old(s)=1, \old(setEventCalled)=0, \old(SKIP1)=0, \old(SKIP2)=0, \old(Suspended)=0, \old(UNLOADED)=0, __cil_tmp8=3221225659, compFptr=0, compRegistered=1, compRetStatus=3221225659, customIrp=0, DC=2, DeviceObject=43, DeviceUsageTypePaging=1, Executive=0, IPC=7, Irp=41, Irp__PendingReturned=0, KernelMode=0, lcontext=44, lowerDriverReturn=0, MPR1=5, MPR3=6, myStatus=3221225659, NP=1, pended=1, pirp=41, routine=0, s=1, setEventCalled=0, SKIP1=3, SKIP2=4, Suspended=5, tmp_ndt_4=0, UNLOADED=0] [L1944] returnVal2 = 0 VAL [\old(compFptr)=0, \old(compRegistered)=0, \old(customIrp)=0, \old(DC)=0, \old(DeviceObject)=43, \old(DeviceUsageTypePaging)=0, \old(Executive)=0, \old(IPC)=0, \old(Irp)=41, \old(KernelMode)=0, \old(lowerDriverReturn)=0, \old(MPR1)=0, \old(MPR3)=0, \old(myStatus)=3221225659, \old(NP)=0, \old(pended)=0, \old(pirp)=0, \old(routine)=0, \old(s)=1, \old(setEventCalled)=0, \old(SKIP1)=0, \old(SKIP2)=0, \old(Suspended)=0, \old(UNLOADED)=0, __cil_tmp8=3221225659, compFptr=0, compRegistered=1, compRetStatus=3221225659, customIrp=0, DC=2, DeviceObject=43, DeviceUsageTypePaging=1, Executive=0, IPC=7, Irp=41, Irp__PendingReturned=0, KernelMode=0, lcontext=44, lowerDriverReturn=0, MPR1=5, MPR3=6, myStatus=3221225659, NP=1, pended=1, pirp=41, returnVal2=0, routine=0, s=1, setEventCalled=0, SKIP1=3, SKIP2=4, Suspended=5, tmp_ndt_4=0, UNLOADED=0] [L1958] COND TRUE s == NP [L1959] s = IPC [L1960] lowerDriverReturn = returnVal2 VAL [\old(compFptr)=0, \old(compRegistered)=0, \old(customIrp)=0, \old(DC)=0, \old(DeviceObject)=43, \old(DeviceUsageTypePaging)=0, \old(Executive)=0, \old(IPC)=0, \old(Irp)=41, \old(KernelMode)=0, \old(lowerDriverReturn)=0, \old(MPR1)=0, \old(MPR3)=0, \old(myStatus)=3221225659, \old(NP)=0, \old(pended)=0, \old(pirp)=0, \old(routine)=0, \old(s)=1, \old(setEventCalled)=0, \old(SKIP1)=0, \old(SKIP2)=0, \old(Suspended)=0, \old(UNLOADED)=0, __cil_tmp8=3221225659, compFptr=0, compRegistered=1, compRetStatus=3221225659, customIrp=0, DC=2, DeviceObject=43, DeviceUsageTypePaging=1, Executive=0, IPC=7, Irp=41, Irp__PendingReturned=0, KernelMode=0, lcontext=44, lowerDriverReturn=0, MPR1=5, MPR3=6, myStatus=3221225659, NP=1, pended=1, pirp=41, returnVal2=0, routine=0, s=7, setEventCalled=0, SKIP1=3, SKIP2=4, Suspended=5, tmp_ndt_4=0, UNLOADED=0] [L1981] return (returnVal2); VAL [\old(compFptr)=0, \old(compRegistered)=0, \old(customIrp)=0, \old(DC)=0, \old(DeviceObject)=43, \old(DeviceUsageTypePaging)=0, \old(Executive)=0, \old(IPC)=0, \old(Irp)=41, \old(KernelMode)=0, \old(lowerDriverReturn)=0, \old(MPR1)=0, \old(MPR3)=0, \old(myStatus)=3221225659, \old(NP)=0, \old(pended)=0, \old(pirp)=0, \old(routine)=0, \old(s)=1, \old(setEventCalled)=0, \old(SKIP1)=0, \old(SKIP2)=0, \old(Suspended)=0, \old(UNLOADED)=0, \result=0, __cil_tmp8=3221225659, compFptr=0, compRegistered=1, compRetStatus=3221225659, customIrp=0, DC=2, DeviceObject=43, DeviceUsageTypePaging=1, Executive=0, IPC=7, Irp=41, Irp__PendingReturned=0, KernelMode=0, lcontext=44, lowerDriverReturn=0, MPR1=5, MPR3=6, myStatus=3221225659, NP=1, pended=1, pirp=41, returnVal2=0, routine=0, s=7, setEventCalled=0, SKIP1=3, SKIP2=4, Suspended=5, tmp_ndt_4=0, UNLOADED=0] [L1626] RET, EXPR IofCallDriver(deviceExtension__TargetDeviceObject, Irp) VAL [\old(compFptr)=0, \old(compRegistered)=0, \old(customIrp)=0, \old(DC)=0, \old(DeviceObject)=42, \old(DeviceUsageTypePaging)=0, \old(Executive)=0, \old(IPC)=0, \old(Irp)=41, \old(KernelMode)=0, \old(lowerDriverReturn)=0, \old(MPR1)=0, \old(MPR3)=0, \old(myStatus)=3221225659, \old(NP)=0, \old(pended)=0, \old(pirp)=0, \old(routine)=0, \old(s)=1, \old(setEventCalled)=0, \old(SKIP1)=0, \old(SKIP2)=0, \old(Suspended)=0, \old(UNLOADED)=0, __cil_tmp10=131072, __cil_tmp11=147456, __cil_tmp12=147512, __cil_tmp8=56, __cil_tmp9=16384, compFptr=0, compRegistered=1, currentIrpStack__Parameters__DeviceIoControl__IoControlCode=147512, customIrp=0, DC=2, deviceExtension__TargetDeviceObject=43, DeviceObject=42, DeviceUsageTypePaging=1, Executive=0, IofCallDriver(deviceExtension__TargetDeviceObject, Irp)=0, IPC=7, Irp=41, irpSp__Control=224, KernelMode=0, lowerDriverReturn=0, MPR1=5, MPR3=6, myStatus=3221225659, NP=1, pended=1, pirp=41, routine=0, s=7, setEventCalled=0, SKIP1=3, SKIP2=4, Suspended=5, UNLOADED=0] [L1626] tmp = IofCallDriver(deviceExtension__TargetDeviceObject, Irp) [L1628] return (tmp); VAL [\old(compFptr)=0, \old(compRegistered)=0, \old(customIrp)=0, \old(DC)=0, \old(DeviceObject)=42, \old(DeviceUsageTypePaging)=0, \old(Executive)=0, \old(IPC)=0, \old(Irp)=41, \old(KernelMode)=0, \old(lowerDriverReturn)=0, \old(MPR1)=0, \old(MPR3)=0, \old(myStatus)=3221225659, \old(NP)=0, \old(pended)=0, \old(pirp)=0, \old(routine)=0, \old(s)=1, \old(setEventCalled)=0, \old(SKIP1)=0, \old(SKIP2)=0, \old(Suspended)=0, \old(UNLOADED)=0, \result=0, __cil_tmp10=131072, __cil_tmp11=147456, __cil_tmp12=147512, __cil_tmp8=56, __cil_tmp9=16384, compFptr=0, compRegistered=1, currentIrpStack__Parameters__DeviceIoControl__IoControlCode=147512, customIrp=0, DC=2, deviceExtension__TargetDeviceObject=43, DeviceObject=42, DeviceUsageTypePaging=1, Executive=0, IPC=7, Irp=41, irpSp__Control=224, KernelMode=0, lowerDriverReturn=0, MPR1=5, MPR3=6, myStatus=3221225659, NP=1, pended=1, pirp=41, routine=0, s=7, setEventCalled=0, SKIP1=3, SKIP2=4, Suspended=5, tmp=0, UNLOADED=0] [L348] RET, EXPR CdAudioHPCdrDeviceControl(DeviceObject, Irp) VAL [\old(compFptr)=0, \old(compRegistered)=0, \old(customIrp)=0, \old(DC)=0, \old(DeviceObject)=42, \old(DeviceUsageTypePaging)=0, \old(Executive)=0, \old(IPC)=0, \old(Irp)=41, \old(KernelMode)=0, \old(lowerDriverReturn)=0, \old(MPR1)=0, \old(MPR3)=0, \old(myStatus)=3221225659, \old(NP)=0, \old(pended)=0, \old(pirp)=0, \old(routine)=0, \old(s)=1, \old(setEventCalled)=0, \old(SKIP1)=0, \old(SKIP2)=0, \old(Suspended)=0, \old(UNLOADED)=0, CdAudioHPCdrDeviceControl(DeviceObject, Irp)=0, compFptr=0, compRegistered=1, customIrp=0, DC=2, deviceExtension__Active=7, DeviceObject=42, DeviceUsageTypePaging=1, Executive=0, IPC=7, Irp=41, KernelMode=0, lowerDriverReturn=0, MPR1=5, MPR3=6, myStatus=3221225659, NP=1, pended=1, pirp=41, routine=0, s=7, setEventCalled=0, SKIP1=3, SKIP2=4, Suspended=5, UNLOADED=0] [L348] status = CdAudioHPCdrDeviceControl(DeviceObject, Irp) [L363] return (status); VAL [\old(compFptr)=0, \old(compRegistered)=0, \old(customIrp)=0, \old(DC)=0, \old(DeviceObject)=42, \old(DeviceUsageTypePaging)=0, \old(Executive)=0, \old(IPC)=0, \old(Irp)=41, \old(KernelMode)=0, \old(lowerDriverReturn)=0, \old(MPR1)=0, \old(MPR3)=0, \old(myStatus)=3221225659, \old(NP)=0, \old(pended)=0, \old(pirp)=0, \old(routine)=0, \old(s)=1, \old(setEventCalled)=0, \old(SKIP1)=0, \old(SKIP2)=0, \old(Suspended)=0, \old(UNLOADED)=0, \result=0, compFptr=0, compRegistered=1, customIrp=0, DC=2, deviceExtension__Active=7, DeviceObject=42, DeviceUsageTypePaging=1, Executive=0, IPC=7, Irp=41, KernelMode=0, lowerDriverReturn=0, MPR1=5, MPR3=6, myStatus=3221225659, NP=1, pended=1, pirp=41, routine=0, s=7, setEventCalled=0, SKIP1=3, SKIP2=4, status=0, Suspended=5, UNLOADED=0] [L1798] RET, EXPR CdAudioDeviceControl(devobj, pirp) VAL [\old(compFptr)=0, \old(compRegistered)=0, \old(customIrp)=0, \old(DC)=0, \old(DeviceUsageTypePaging)=0, \old(Executive)=0, \old(IPC)=0, \old(KernelMode)=0, \old(lowerDriverReturn)=0, \old(MPR1)=0, \old(MPR3)=0, \old(myStatus)=0, \old(NP)=0, \old(pended)=0, \old(pirp)=0, \old(routine)=0, \old(s)=0, \old(setEventCalled)=0, \old(SKIP1)=0, \old(SKIP2)=0, \old(Suspended)=0, \old(UNLOADED)=0, CdAudioDeviceControl(devobj, pirp)=0, compFptr=0, compRegistered=1, customIrp=0, d=40, DC=2, DeviceUsageTypePaging=1, devobj=42, Executive=0, IPC=7, irp=41, irp_choice=0, KernelMode=0, lowerDriverReturn=0, MPR1=5, MPR3=6, myStatus=3221225659, NP=1, pended=1, pirp=41, pirp__IoStatus__Status=3221225659, routine=0, s=7, setEventCalled=0, SKIP1=3, SKIP2=4, status=0, Suspended=5, tmp_ndt_1=2, UNLOADED=0, we_should_unload=0] [L1798] status = CdAudioDeviceControl(devobj, pirp) [L1819] COND FALSE !(\read(we_should_unload)) VAL [\old(compFptr)=0, \old(compRegistered)=0, \old(customIrp)=0, \old(DC)=0, \old(DeviceUsageTypePaging)=0, \old(Executive)=0, \old(IPC)=0, \old(KernelMode)=0, \old(lowerDriverReturn)=0, \old(MPR1)=0, \old(MPR3)=0, \old(myStatus)=0, \old(NP)=0, \old(pended)=0, \old(pirp)=0, \old(routine)=0, \old(s)=0, \old(setEventCalled)=0, \old(SKIP1)=0, \old(SKIP2)=0, \old(Suspended)=0, \old(UNLOADED)=0, compFptr=0, compRegistered=1, customIrp=0, d=40, DC=2, DeviceUsageTypePaging=1, devobj=42, Executive=0, IPC=7, irp=41, irp_choice=0, KernelMode=0, lowerDriverReturn=0, MPR1=5, MPR3=6, myStatus=3221225659, NP=1, pended=1, pirp=41, pirp__IoStatus__Status=3221225659, routine=0, s=7, setEventCalled=0, SKIP1=3, SKIP2=4, status=0, Suspended=5, tmp_ndt_1=2, UNLOADED=0, we_should_unload=0] [L1825] COND TRUE pended == 1 VAL [\old(compFptr)=0, \old(compRegistered)=0, \old(customIrp)=0, \old(DC)=0, \old(DeviceUsageTypePaging)=0, \old(Executive)=0, \old(IPC)=0, \old(KernelMode)=0, \old(lowerDriverReturn)=0, \old(MPR1)=0, \old(MPR3)=0, \old(myStatus)=0, \old(NP)=0, \old(pended)=0, \old(pirp)=0, \old(routine)=0, \old(s)=0, \old(setEventCalled)=0, \old(SKIP1)=0, \old(SKIP2)=0, \old(Suspended)=0, \old(UNLOADED)=0, compFptr=0, compRegistered=1, customIrp=0, d=40, DC=2, DeviceUsageTypePaging=1, devobj=42, Executive=0, IPC=7, irp=41, irp_choice=0, KernelMode=0, lowerDriverReturn=0, MPR1=5, MPR3=6, myStatus=3221225659, NP=1, pended=1, pirp=41, pirp__IoStatus__Status=3221225659, routine=0, s=7, setEventCalled=0, SKIP1=3, SKIP2=4, status=0, Suspended=5, tmp_ndt_1=2, UNLOADED=0, we_should_unload=0] [L1826] COND FALSE !(s == NP) VAL [\old(compFptr)=0, \old(compRegistered)=0, \old(customIrp)=0, \old(DC)=0, \old(DeviceUsageTypePaging)=0, \old(Executive)=0, \old(IPC)=0, \old(KernelMode)=0, \old(lowerDriverReturn)=0, \old(MPR1)=0, \old(MPR3)=0, \old(myStatus)=0, \old(NP)=0, \old(pended)=0, \old(pirp)=0, \old(routine)=0, \old(s)=0, \old(setEventCalled)=0, \old(SKIP1)=0, \old(SKIP2)=0, \old(Suspended)=0, \old(UNLOADED)=0, compFptr=0, compRegistered=1, customIrp=0, d=40, DC=2, DeviceUsageTypePaging=1, devobj=42, Executive=0, IPC=7, irp=41, irp_choice=0, KernelMode=0, lowerDriverReturn=0, MPR1=5, MPR3=6, myStatus=3221225659, NP=1, pended=1, pirp=41, pirp__IoStatus__Status=3221225659, routine=0, s=7, setEventCalled=0, SKIP1=3, SKIP2=4, status=0, Suspended=5, tmp_ndt_1=2, UNLOADED=0, we_should_unload=0] [L1833] COND TRUE pended == 1 VAL [\old(compFptr)=0, \old(compRegistered)=0, \old(customIrp)=0, \old(DC)=0, \old(DeviceUsageTypePaging)=0, \old(Executive)=0, \old(IPC)=0, \old(KernelMode)=0, \old(lowerDriverReturn)=0, \old(MPR1)=0, \old(MPR3)=0, \old(myStatus)=0, \old(NP)=0, \old(pended)=0, \old(pirp)=0, \old(routine)=0, \old(s)=0, \old(setEventCalled)=0, \old(SKIP1)=0, \old(SKIP2)=0, \old(Suspended)=0, \old(UNLOADED)=0, compFptr=0, compRegistered=1, customIrp=0, d=40, DC=2, DeviceUsageTypePaging=1, devobj=42, Executive=0, IPC=7, irp=41, irp_choice=0, KernelMode=0, lowerDriverReturn=0, MPR1=5, MPR3=6, myStatus=3221225659, NP=1, pended=1, pirp=41, pirp__IoStatus__Status=3221225659, routine=0, s=7, setEventCalled=0, SKIP1=3, SKIP2=4, status=0, Suspended=5, tmp_ndt_1=2, UNLOADED=0, we_should_unload=0] [L1834] COND FALSE !(s == MPR3) VAL [\old(compFptr)=0, \old(compRegistered)=0, \old(customIrp)=0, \old(DC)=0, \old(DeviceUsageTypePaging)=0, \old(Executive)=0, \old(IPC)=0, \old(KernelMode)=0, \old(lowerDriverReturn)=0, \old(MPR1)=0, \old(MPR3)=0, \old(myStatus)=0, \old(NP)=0, \old(pended)=0, \old(pirp)=0, \old(routine)=0, \old(s)=0, \old(setEventCalled)=0, \old(SKIP1)=0, \old(SKIP2)=0, \old(Suspended)=0, \old(UNLOADED)=0, compFptr=0, compRegistered=1, customIrp=0, d=40, DC=2, DeviceUsageTypePaging=1, devobj=42, Executive=0, IPC=7, irp=41, irp_choice=0, KernelMode=0, lowerDriverReturn=0, MPR1=5, MPR3=6, myStatus=3221225659, NP=1, pended=1, pirp=41, pirp__IoStatus__Status=3221225659, routine=0, s=7, setEventCalled=0, SKIP1=3, SKIP2=4, status=0, Suspended=5, tmp_ndt_1=2, UNLOADED=0, we_should_unload=0] [L1841] COND TRUE s != UNLOADED VAL [\old(compFptr)=0, \old(compRegistered)=0, \old(customIrp)=0, \old(DC)=0, \old(DeviceUsageTypePaging)=0, \old(Executive)=0, \old(IPC)=0, \old(KernelMode)=0, \old(lowerDriverReturn)=0, \old(MPR1)=0, \old(MPR3)=0, \old(myStatus)=0, \old(NP)=0, \old(pended)=0, \old(pirp)=0, \old(routine)=0, \old(s)=0, \old(setEventCalled)=0, \old(SKIP1)=0, \old(SKIP2)=0, \old(Suspended)=0, \old(UNLOADED)=0, compFptr=0, compRegistered=1, customIrp=0, d=40, DC=2, DeviceUsageTypePaging=1, devobj=42, Executive=0, IPC=7, irp=41, irp_choice=0, KernelMode=0, lowerDriverReturn=0, MPR1=5, MPR3=6, myStatus=3221225659, NP=1, pended=1, pirp=41, pirp__IoStatus__Status=3221225659, routine=0, s=7, setEventCalled=0, SKIP1=3, SKIP2=4, status=0, Suspended=5, tmp_ndt_1=2, UNLOADED=0, we_should_unload=0] [L1842] COND TRUE status != -1 VAL [\old(compFptr)=0, \old(compRegistered)=0, \old(customIrp)=0, \old(DC)=0, \old(DeviceUsageTypePaging)=0, \old(Executive)=0, \old(IPC)=0, \old(KernelMode)=0, \old(lowerDriverReturn)=0, \old(MPR1)=0, \old(MPR3)=0, \old(myStatus)=0, \old(NP)=0, \old(pended)=0, \old(pirp)=0, \old(routine)=0, \old(s)=0, \old(setEventCalled)=0, \old(SKIP1)=0, \old(SKIP2)=0, \old(Suspended)=0, \old(UNLOADED)=0, compFptr=0, compRegistered=1, customIrp=0, d=40, DC=2, DeviceUsageTypePaging=1, devobj=42, Executive=0, IPC=7, irp=41, irp_choice=0, KernelMode=0, lowerDriverReturn=0, MPR1=5, MPR3=6, myStatus=3221225659, NP=1, pended=1, pirp=41, pirp__IoStatus__Status=3221225659, routine=0, s=7, setEventCalled=0, SKIP1=3, SKIP2=4, status=0, Suspended=5, tmp_ndt_1=2, UNLOADED=0, we_should_unload=0] [L1843] COND TRUE s != SKIP2 VAL [\old(compFptr)=0, \old(compRegistered)=0, \old(customIrp)=0, \old(DC)=0, \old(DeviceUsageTypePaging)=0, \old(Executive)=0, \old(IPC)=0, \old(KernelMode)=0, \old(lowerDriverReturn)=0, \old(MPR1)=0, \old(MPR3)=0, \old(myStatus)=0, \old(NP)=0, \old(pended)=0, \old(pirp)=0, \old(routine)=0, \old(s)=0, \old(setEventCalled)=0, \old(SKIP1)=0, \old(SKIP2)=0, \old(Suspended)=0, \old(UNLOADED)=0, compFptr=0, compRegistered=1, customIrp=0, d=40, DC=2, DeviceUsageTypePaging=1, devobj=42, Executive=0, IPC=7, irp=41, irp_choice=0, KernelMode=0, lowerDriverReturn=0, MPR1=5, MPR3=6, myStatus=3221225659, NP=1, pended=1, pirp=41, pirp__IoStatus__Status=3221225659, routine=0, s=7, setEventCalled=0, SKIP1=3, SKIP2=4, status=0, Suspended=5, tmp_ndt_1=2, UNLOADED=0, we_should_unload=0] [L1844] COND FALSE !(s != IPC) VAL [\old(compFptr)=0, \old(compRegistered)=0, \old(customIrp)=0, \old(DC)=0, \old(DeviceUsageTypePaging)=0, \old(Executive)=0, \old(IPC)=0, \old(KernelMode)=0, \old(lowerDriverReturn)=0, \old(MPR1)=0, \old(MPR3)=0, \old(myStatus)=0, \old(NP)=0, \old(pended)=0, \old(pirp)=0, \old(routine)=0, \old(s)=0, \old(setEventCalled)=0, \old(SKIP1)=0, \old(SKIP2)=0, \old(Suspended)=0, \old(UNLOADED)=0, compFptr=0, compRegistered=1, customIrp=0, d=40, DC=2, DeviceUsageTypePaging=1, devobj=42, Executive=0, IPC=7, irp=41, irp_choice=0, KernelMode=0, lowerDriverReturn=0, MPR1=5, MPR3=6, myStatus=3221225659, NP=1, pended=1, pirp=41, pirp__IoStatus__Status=3221225659, routine=0, s=7, setEventCalled=0, SKIP1=3, SKIP2=4, status=0, Suspended=5, tmp_ndt_1=2, UNLOADED=0, we_should_unload=0] [L1857] COND FALSE !(pended != 1) VAL [\old(compFptr)=0, \old(compRegistered)=0, \old(customIrp)=0, \old(DC)=0, \old(DeviceUsageTypePaging)=0, \old(Executive)=0, \old(IPC)=0, \old(KernelMode)=0, \old(lowerDriverReturn)=0, \old(MPR1)=0, \old(MPR3)=0, \old(myStatus)=0, \old(NP)=0, \old(pended)=0, \old(pirp)=0, \old(routine)=0, \old(s)=0, \old(setEventCalled)=0, \old(SKIP1)=0, \old(SKIP2)=0, \old(Suspended)=0, \old(UNLOADED)=0, compFptr=0, compRegistered=1, customIrp=0, d=40, DC=2, DeviceUsageTypePaging=1, devobj=42, Executive=0, IPC=7, irp=41, irp_choice=0, KernelMode=0, lowerDriverReturn=0, MPR1=5, MPR3=6, myStatus=3221225659, NP=1, pended=1, pirp=41, pirp__IoStatus__Status=3221225659, routine=0, s=7, setEventCalled=0, SKIP1=3, SKIP2=4, status=0, Suspended=5, tmp_ndt_1=2, UNLOADED=0, we_should_unload=0] [L1869] COND TRUE status != 259 VAL [\old(compFptr)=0, \old(compRegistered)=0, \old(customIrp)=0, \old(DC)=0, \old(DeviceUsageTypePaging)=0, \old(Executive)=0, \old(IPC)=0, \old(KernelMode)=0, \old(lowerDriverReturn)=0, \old(MPR1)=0, \old(MPR3)=0, \old(myStatus)=0, \old(NP)=0, \old(pended)=0, \old(pirp)=0, \old(routine)=0, \old(s)=0, \old(setEventCalled)=0, \old(SKIP1)=0, \old(SKIP2)=0, \old(Suspended)=0, \old(UNLOADED)=0, compFptr=0, compRegistered=1, customIrp=0, d=40, DC=2, DeviceUsageTypePaging=1, devobj=42, Executive=0, IPC=7, irp=41, irp_choice=0, KernelMode=0, lowerDriverReturn=0, MPR1=5, MPR3=6, myStatus=3221225659, NP=1, pended=1, pirp=41, pirp__IoStatus__Status=3221225659, routine=0, s=7, setEventCalled=0, SKIP1=3, SKIP2=4, status=0, Suspended=5, tmp_ndt_1=2, UNLOADED=0, we_should_unload=0] [L1871] CALL errorFn() VAL [\old(compFptr)=0, \old(compRegistered)=0, \old(customIrp)=0, \old(DC)=0, \old(DeviceUsageTypePaging)=0, \old(Executive)=0, \old(IPC)=0, \old(KernelMode)=0, \old(lowerDriverReturn)=0, \old(MPR1)=0, \old(MPR3)=0, \old(myStatus)=0, \old(NP)=0, \old(pended)=0, \old(pirp)=0, \old(routine)=0, \old(s)=0, \old(setEventCalled)=0, \old(SKIP1)=0, \old(SKIP2)=0, \old(Suspended)=0, \old(UNLOADED)=0, compFptr=0, compRegistered=1, customIrp=0, DC=2, DeviceUsageTypePaging=1, Executive=0, IPC=7, KernelMode=0, lowerDriverReturn=0, MPR1=5, MPR3=6, myStatus=3221225659, NP=1, pended=1, pirp=41, routine=0, s=7, setEventCalled=0, SKIP1=3, SKIP2=4, Suspended=5, UNLOADED=0] [L59] reach_error() VAL [\old(compFptr)=0, \old(compRegistered)=0, \old(customIrp)=0, \old(DC)=0, \old(DeviceUsageTypePaging)=0, \old(Executive)=0, \old(IPC)=0, \old(KernelMode)=0, \old(lowerDriverReturn)=0, \old(MPR1)=0, \old(MPR3)=0, \old(myStatus)=0, \old(NP)=0, \old(pended)=0, \old(pirp)=0, \old(routine)=0, \old(s)=0, \old(setEventCalled)=0, \old(SKIP1)=0, \old(SKIP2)=0, \old(Suspended)=0, \old(UNLOADED)=0, compFptr=0, compRegistered=1, customIrp=0, DC=2, DeviceUsageTypePaging=1, Executive=0, IPC=7, KernelMode=0, lowerDriverReturn=0, MPR1=5, MPR3=6, myStatus=3221225659, NP=1, pended=1, pirp=41, routine=0, s=7, setEventCalled=0, SKIP1=3, SKIP2=4, Suspended=5, UNLOADED=0] - UnprovableResult [Line: 1717]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data CFG has 31 procedures, 521 locations, 2 error locations. Started 1 CEGAR loops. OverallTime: 124891.9ms, OverallIterations: 60, TraceHistogramMax: 2, EmptinessCheckTime: 107.5ms, AutomataDifference: 16113.3ms, DeadEndRemovalTime: 0.0ms, HoareAnnotationTime: 0.0ms, InitialAbstractionConstructionTime: 13.9ms, PartialOrderReductionTime: 0.0ms, HoareTripleCheckerStatistics: 33694 SDtfs, 18038 SDslu, 185880 SDs, 0 SdLazy, 13897 SolverSat, 2853 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 10739.6ms Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 6985 GetRequests, 6329 SyntacticMatches, 0 SemanticMatches, 656 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1289 ImplicationChecksByTransitivity, 5950.0ms Time, 0.0ms BasicInterpolantAutomatonTime, BiggestAbstraction: size=1348occurred in iteration=18, InterpolantAutomatonStates: 569, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0ms DumpTime, AutomataMinimizationStatistics: 921.8ms AutomataMinimizationTime, 59 MinimizatonAttempts, 1944 StatesRemovedByMinimization, 46 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 1834.5ms SsaConstructionTime, 5355.9ms SatisfiabilityAnalysisTime, 28634.3ms InterpolantComputationTime, 3540 NumberOfCodeBlocks, 3540 NumberOfCodeBlocksAsserted, 60 NumberOfCheckSat, 6816 ConstructedInterpolants, 0 QuantifiedInterpolants, 14463 SizeOfPredicates, 132 NumberOfNonLiveVariables, 23344 ConjunctsInSsa, 421 ConjunctsInUnsatCore, 118 InterpolantComputations, 118 PerfectInterpolantSequences, 22/22 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2021-08-27 07:52:04,994 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request...