./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/list-simple/sll2n_insert_unequal.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 35987657 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/list-simple/sll2n_insert_unequal.i -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 383c6933c6ab916f651364224af1d774f30e162ad506fd2f28fe7f76c4487ba3 --- Real Ultimate output --- This is Ultimate 0.2.2-?-3598765 [2022-07-21 17:50:06,756 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-07-21 17:50:06,758 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-07-21 17:50:06,791 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-07-21 17:50:06,792 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-07-21 17:50:06,793 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-07-21 17:50:06,795 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-07-21 17:50:06,798 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-07-21 17:50:06,799 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-07-21 17:50:06,802 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-07-21 17:50:06,803 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-07-21 17:50:06,806 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-07-21 17:50:06,807 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-07-21 17:50:06,808 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-07-21 17:50:06,809 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-07-21 17:50:06,811 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-07-21 17:50:06,811 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-07-21 17:50:06,813 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-07-21 17:50:06,814 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-07-21 17:50:06,818 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-07-21 17:50:06,819 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-07-21 17:50:06,820 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-07-21 17:50:06,821 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-07-21 17:50:06,822 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-07-21 17:50:06,823 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-07-21 17:50:06,828 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-07-21 17:50:06,828 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-07-21 17:50:06,828 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-07-21 17:50:06,829 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-07-21 17:50:06,829 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-07-21 17:50:06,830 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-07-21 17:50:06,830 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-07-21 17:50:06,831 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-07-21 17:50:06,832 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-07-21 17:50:06,833 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-07-21 17:50:06,833 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-07-21 17:50:06,833 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-07-21 17:50:06,834 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-07-21 17:50:06,834 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-07-21 17:50:06,834 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-07-21 17:50:06,835 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-07-21 17:50:06,836 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-07-21 17:50:06,842 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2022-07-21 17:50:06,866 INFO L113 SettingsManager]: Loading preferences was successful [2022-07-21 17:50:06,867 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-07-21 17:50:06,867 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-07-21 17:50:06,867 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-07-21 17:50:06,868 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-07-21 17:50:06,868 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-07-21 17:50:06,869 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-07-21 17:50:06,869 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-07-21 17:50:06,869 INFO L138 SettingsManager]: * Use SBE=true [2022-07-21 17:50:06,870 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-07-21 17:50:06,870 INFO L138 SettingsManager]: * sizeof long=4 [2022-07-21 17:50:06,870 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-07-21 17:50:06,870 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-07-21 17:50:06,871 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-07-21 17:50:06,871 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-07-21 17:50:06,871 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2022-07-21 17:50:06,871 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2022-07-21 17:50:06,872 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2022-07-21 17:50:06,872 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-07-21 17:50:06,872 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-07-21 17:50:06,872 INFO L138 SettingsManager]: * sizeof long double=12 [2022-07-21 17:50:06,872 INFO L138 SettingsManager]: * Use constant arrays=true [2022-07-21 17:50:06,872 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-07-21 17:50:06,873 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-07-21 17:50:06,873 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-07-21 17:50:06,873 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-21 17:50:06,873 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-07-21 17:50:06,873 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-07-21 17:50:06,874 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-07-21 17:50:06,874 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-07-21 17:50:06,874 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 -> 383c6933c6ab916f651364224af1d774f30e162ad506fd2f28fe7f76c4487ba3 [2022-07-21 17:50:07,146 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-07-21 17:50:07,165 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-07-21 17:50:07,167 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-07-21 17:50:07,168 INFO L271 PluginConnector]: Initializing CDTParser... [2022-07-21 17:50:07,169 INFO L275 PluginConnector]: CDTParser initialized [2022-07-21 17:50:07,170 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/list-simple/sll2n_insert_unequal.i [2022-07-21 17:50:07,234 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e84de0abc/99edd519de12489db3f9dbc8c09d37c2/FLAG43247728f [2022-07-21 17:50:07,592 INFO L306 CDTParser]: Found 1 translation units. [2022-07-21 17:50:07,593 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/list-simple/sll2n_insert_unequal.i [2022-07-21 17:50:07,604 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e84de0abc/99edd519de12489db3f9dbc8c09d37c2/FLAG43247728f [2022-07-21 17:50:07,618 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e84de0abc/99edd519de12489db3f9dbc8c09d37c2 [2022-07-21 17:50:07,622 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-07-21 17:50:07,623 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-07-21 17:50:07,625 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-07-21 17:50:07,626 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-07-21 17:50:07,628 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-07-21 17:50:07,629 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.07 05:50:07" (1/1) ... [2022-07-21 17:50:07,629 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@39ffdff2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 05:50:07, skipping insertion in model container [2022-07-21 17:50:07,630 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.07 05:50:07" (1/1) ... [2022-07-21 17:50:07,635 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-07-21 17:50:07,671 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-07-21 17:50:07,945 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/list-simple/sll2n_insert_unequal.i[24620,24633] [2022-07-21 17:50:07,947 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-21 17:50:07,974 INFO L203 MainTranslator]: Completed pre-run [2022-07-21 17:50:08,064 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/list-simple/sll2n_insert_unequal.i[24620,24633] [2022-07-21 17:50:08,065 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-21 17:50:08,108 INFO L208 MainTranslator]: Completed translation [2022-07-21 17:50:08,123 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 05:50:08 WrapperNode [2022-07-21 17:50:08,124 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-07-21 17:50:08,125 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-07-21 17:50:08,125 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-07-21 17:50:08,126 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-07-21 17:50:08,130 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 05:50:08" (1/1) ... [2022-07-21 17:50:08,165 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 05:50:08" (1/1) ... [2022-07-21 17:50:08,193 INFO L137 Inliner]: procedures = 128, calls = 36, calls flagged for inlining = 6, calls inlined = 6, statements flattened = 151 [2022-07-21 17:50:08,193 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-07-21 17:50:08,194 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-07-21 17:50:08,194 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-07-21 17:50:08,194 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-07-21 17:50:08,199 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 05:50:08" (1/1) ... [2022-07-21 17:50:08,200 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 05:50:08" (1/1) ... [2022-07-21 17:50:08,203 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 05:50:08" (1/1) ... [2022-07-21 17:50:08,203 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 05:50:08" (1/1) ... [2022-07-21 17:50:08,208 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 05:50:08" (1/1) ... [2022-07-21 17:50:08,212 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 05:50:08" (1/1) ... [2022-07-21 17:50:08,213 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 05:50:08" (1/1) ... [2022-07-21 17:50:08,223 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-07-21 17:50:08,224 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-07-21 17:50:08,225 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-07-21 17:50:08,225 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-07-21 17:50:08,225 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 05:50:08" (1/1) ... [2022-07-21 17:50:08,230 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-21 17:50:08,241 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-21 17:50:08,251 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) [2022-07-21 17:50:08,260 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 [2022-07-21 17:50:08,293 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-07-21 17:50:08,294 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-07-21 17:50:08,294 INFO L130 BoogieDeclarations]: Found specification of procedure node_create [2022-07-21 17:50:08,294 INFO L138 BoogieDeclarations]: Found implementation of procedure node_create [2022-07-21 17:50:08,294 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-07-21 17:50:08,294 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-07-21 17:50:08,294 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-07-21 17:50:08,294 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-07-21 17:50:08,294 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-07-21 17:50:08,294 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-07-21 17:50:08,295 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2022-07-21 17:50:08,295 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-07-21 17:50:08,295 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-07-21 17:50:08,295 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-07-21 17:50:08,427 INFO L234 CfgBuilder]: Building ICFG [2022-07-21 17:50:08,428 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-07-21 17:50:08,721 INFO L275 CfgBuilder]: Performing block encoding [2022-07-21 17:50:08,743 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-07-21 17:50:08,743 INFO L299 CfgBuilder]: Removed 5 assume(true) statements. [2022-07-21 17:50:08,745 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.07 05:50:08 BoogieIcfgContainer [2022-07-21 17:50:08,745 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-07-21 17:50:08,746 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-07-21 17:50:08,746 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-07-21 17:50:08,748 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-07-21 17:50:08,749 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 21.07 05:50:07" (1/3) ... [2022-07-21 17:50:08,749 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@62c987df and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.07 05:50:08, skipping insertion in model container [2022-07-21 17:50:08,755 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 05:50:08" (2/3) ... [2022-07-21 17:50:08,755 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@62c987df and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.07 05:50:08, skipping insertion in model container [2022-07-21 17:50:08,756 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.07 05:50:08" (3/3) ... [2022-07-21 17:50:08,757 INFO L111 eAbstractionObserver]: Analyzing ICFG sll2n_insert_unequal.i [2022-07-21 17:50:08,777 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-07-21 17:50:08,777 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 39 error locations. [2022-07-21 17:50:08,815 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-07-21 17:50:08,819 INFO L357 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, mAutomataTypeConcurrency=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, mPorIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@296a0e9, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@2b5dd916 [2022-07-21 17:50:08,820 INFO L358 AbstractCegarLoop]: Starting to check reachability of 39 error locations. [2022-07-21 17:50:08,822 INFO L276 IsEmpty]: Start isEmpty. Operand has 99 states, 56 states have (on average 1.9821428571428572) internal successors, (111), 95 states have internal predecessors, (111), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-07-21 17:50:08,826 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2022-07-21 17:50:08,826 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 17:50:08,827 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2022-07-21 17:50:08,841 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting node_createErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 36 more)] === [2022-07-21 17:50:08,845 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 17:50:08,845 INFO L85 PathProgramCache]: Analyzing trace with hash 1814951417, now seen corresponding path program 1 times [2022-07-21 17:50:08,851 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 17:50:08,851 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2099246356] [2022-07-21 17:50:08,851 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 17:50:08,852 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 17:50:08,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 17:50:09,001 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-21 17:50:09,001 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 17:50:09,002 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2099246356] [2022-07-21 17:50:09,002 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2099246356] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 17:50:09,002 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 17:50:09,002 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-07-21 17:50:09,004 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [996308691] [2022-07-21 17:50:09,005 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 17:50:09,007 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-21 17:50:09,008 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 17:50:09,034 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-21 17:50:09,034 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-21 17:50:09,036 INFO L87 Difference]: Start difference. First operand has 99 states, 56 states have (on average 1.9821428571428572) internal successors, (111), 95 states have internal predecessors, (111), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-21 17:50:09,148 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 17:50:09,149 INFO L93 Difference]: Finished difference Result 97 states and 107 transitions. [2022-07-21 17:50:09,154 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-21 17:50:09,155 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 7 [2022-07-21 17:50:09,155 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 17:50:09,161 INFO L225 Difference]: With dead ends: 97 [2022-07-21 17:50:09,162 INFO L226 Difference]: Without dead ends: 94 [2022-07-21 17:50:09,164 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-21 17:50:09,167 INFO L413 NwaCegarLoop]: 100 mSDtfsCounter, 8 mSDsluCounter, 58 mSDsCounter, 0 mSdLazyCounter, 46 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 158 SdHoareTripleChecker+Invalid, 47 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 46 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-21 17:50:09,168 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 158 Invalid, 47 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 46 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-21 17:50:09,180 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2022-07-21 17:50:09,194 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 94. [2022-07-21 17:50:09,195 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 94 states, 54 states have (on average 1.8333333333333333) internal successors, (99), 90 states have internal predecessors, (99), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-07-21 17:50:09,196 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 103 transitions. [2022-07-21 17:50:09,197 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 103 transitions. Word has length 7 [2022-07-21 17:50:09,197 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 17:50:09,197 INFO L495 AbstractCegarLoop]: Abstraction has 94 states and 103 transitions. [2022-07-21 17:50:09,198 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-21 17:50:09,198 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 103 transitions. [2022-07-21 17:50:09,198 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2022-07-21 17:50:09,198 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 17:50:09,198 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2022-07-21 17:50:09,199 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-07-21 17:50:09,199 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting node_createErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 36 more)] === [2022-07-21 17:50:09,199 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 17:50:09,200 INFO L85 PathProgramCache]: Analyzing trace with hash 1814951418, now seen corresponding path program 1 times [2022-07-21 17:50:09,200 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 17:50:09,200 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1435014758] [2022-07-21 17:50:09,200 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 17:50:09,200 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 17:50:09,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 17:50:09,240 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-21 17:50:09,241 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 17:50:09,241 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1435014758] [2022-07-21 17:50:09,241 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1435014758] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 17:50:09,241 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 17:50:09,241 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-07-21 17:50:09,242 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1799650129] [2022-07-21 17:50:09,242 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 17:50:09,243 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-21 17:50:09,243 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 17:50:09,243 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-21 17:50:09,244 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-21 17:50:09,244 INFO L87 Difference]: Start difference. First operand 94 states and 103 transitions. Second operand has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-21 17:50:09,302 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 17:50:09,302 INFO L93 Difference]: Finished difference Result 92 states and 101 transitions. [2022-07-21 17:50:09,303 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-21 17:50:09,303 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 7 [2022-07-21 17:50:09,303 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 17:50:09,304 INFO L225 Difference]: With dead ends: 92 [2022-07-21 17:50:09,304 INFO L226 Difference]: Without dead ends: 92 [2022-07-21 17:50:09,304 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-21 17:50:09,319 INFO L413 NwaCegarLoop]: 97 mSDtfsCounter, 4 mSDsluCounter, 61 mSDsCounter, 0 mSdLazyCounter, 38 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 158 SdHoareTripleChecker+Invalid, 39 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 38 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-21 17:50:09,320 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 158 Invalid, 39 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 38 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-21 17:50:09,321 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2022-07-21 17:50:09,324 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 92. [2022-07-21 17:50:09,325 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 92 states, 54 states have (on average 1.7962962962962963) internal successors, (97), 88 states have internal predecessors, (97), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-07-21 17:50:09,326 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 101 transitions. [2022-07-21 17:50:09,326 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 101 transitions. Word has length 7 [2022-07-21 17:50:09,326 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 17:50:09,327 INFO L495 AbstractCegarLoop]: Abstraction has 92 states and 101 transitions. [2022-07-21 17:50:09,327 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-21 17:50:09,327 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 101 transitions. [2022-07-21 17:50:09,327 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-07-21 17:50:09,327 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 17:50:09,328 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 17:50:09,328 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-07-21 17:50:09,328 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 36 more)] === [2022-07-21 17:50:09,328 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 17:50:09,329 INFO L85 PathProgramCache]: Analyzing trace with hash -1506390976, now seen corresponding path program 1 times [2022-07-21 17:50:09,329 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 17:50:09,329 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [438032341] [2022-07-21 17:50:09,329 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 17:50:09,329 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 17:50:09,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 17:50:09,410 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-21 17:50:09,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 17:50:09,459 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-21 17:50:09,460 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 17:50:09,460 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [438032341] [2022-07-21 17:50:09,460 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [438032341] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 17:50:09,460 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 17:50:09,460 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-21 17:50:09,460 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1452668638] [2022-07-21 17:50:09,461 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 17:50:09,461 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-07-21 17:50:09,461 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 17:50:09,461 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-07-21 17:50:09,462 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-07-21 17:50:09,462 INFO L87 Difference]: Start difference. First operand 92 states and 101 transitions. Second operand has 7 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 5 states have internal predecessors, (11), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-07-21 17:50:09,607 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 17:50:09,608 INFO L93 Difference]: Finished difference Result 96 states and 108 transitions. [2022-07-21 17:50:09,608 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-21 17:50:09,609 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 5 states have internal predecessors, (11), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 13 [2022-07-21 17:50:09,609 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 17:50:09,612 INFO L225 Difference]: With dead ends: 96 [2022-07-21 17:50:09,612 INFO L226 Difference]: Without dead ends: 96 [2022-07-21 17:50:09,613 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2022-07-21 17:50:09,617 INFO L413 NwaCegarLoop]: 99 mSDtfsCounter, 11 mSDsluCounter, 270 mSDsCounter, 0 mSdLazyCounter, 256 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 369 SdHoareTripleChecker+Invalid, 258 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 256 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-21 17:50:09,617 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 369 Invalid, 258 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 256 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-21 17:50:09,618 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2022-07-21 17:50:09,623 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 91. [2022-07-21 17:50:09,626 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 91 states, 54 states have (on average 1.7777777777777777) internal successors, (96), 87 states have internal predecessors, (96), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-07-21 17:50:09,629 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 100 transitions. [2022-07-21 17:50:09,630 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 100 transitions. Word has length 13 [2022-07-21 17:50:09,631 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 17:50:09,631 INFO L495 AbstractCegarLoop]: Abstraction has 91 states and 100 transitions. [2022-07-21 17:50:09,631 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 5 states have internal predecessors, (11), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-07-21 17:50:09,631 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 100 transitions. [2022-07-21 17:50:09,632 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-07-21 17:50:09,632 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 17:50:09,632 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 17:50:09,632 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-07-21 17:50:09,632 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 36 more)] === [2022-07-21 17:50:09,633 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 17:50:09,633 INFO L85 PathProgramCache]: Analyzing trace with hash -1506390975, now seen corresponding path program 1 times [2022-07-21 17:50:09,634 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 17:50:09,634 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [721568264] [2022-07-21 17:50:09,634 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 17:50:09,634 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 17:50:09,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 17:50:09,677 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-21 17:50:09,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 17:50:09,740 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-21 17:50:09,740 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 17:50:09,740 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [721568264] [2022-07-21 17:50:09,741 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [721568264] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 17:50:09,741 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 17:50:09,741 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-21 17:50:09,741 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [813664623] [2022-07-21 17:50:09,741 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 17:50:09,741 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-07-21 17:50:09,742 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 17:50:09,742 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-07-21 17:50:09,742 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-07-21 17:50:09,742 INFO L87 Difference]: Start difference. First operand 91 states and 100 transitions. Second operand has 7 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 5 states have internal predecessors, (11), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-07-21 17:50:09,899 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 17:50:09,900 INFO L93 Difference]: Finished difference Result 95 states and 107 transitions. [2022-07-21 17:50:09,900 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-21 17:50:09,900 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 5 states have internal predecessors, (11), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 13 [2022-07-21 17:50:09,900 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 17:50:09,901 INFO L225 Difference]: With dead ends: 95 [2022-07-21 17:50:09,901 INFO L226 Difference]: Without dead ends: 95 [2022-07-21 17:50:09,901 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2022-07-21 17:50:09,902 INFO L413 NwaCegarLoop]: 99 mSDtfsCounter, 9 mSDsluCounter, 286 mSDsCounter, 0 mSdLazyCounter, 235 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 385 SdHoareTripleChecker+Invalid, 236 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 235 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-21 17:50:09,902 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 385 Invalid, 236 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 235 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-21 17:50:09,903 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2022-07-21 17:50:09,906 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 90. [2022-07-21 17:50:09,906 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 90 states, 54 states have (on average 1.7592592592592593) internal successors, (95), 86 states have internal predecessors, (95), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-07-21 17:50:09,907 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 99 transitions. [2022-07-21 17:50:09,907 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 99 transitions. Word has length 13 [2022-07-21 17:50:09,907 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 17:50:09,907 INFO L495 AbstractCegarLoop]: Abstraction has 90 states and 99 transitions. [2022-07-21 17:50:09,908 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 5 states have internal predecessors, (11), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-07-21 17:50:09,908 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 99 transitions. [2022-07-21 17:50:09,908 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-07-21 17:50:09,908 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 17:50:09,908 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 17:50:09,909 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-07-21 17:50:09,909 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 36 more)] === [2022-07-21 17:50:09,909 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 17:50:09,909 INFO L85 PathProgramCache]: Analyzing trace with hash -2068593344, now seen corresponding path program 1 times [2022-07-21 17:50:09,909 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 17:50:09,909 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [5447685] [2022-07-21 17:50:09,910 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 17:50:09,910 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 17:50:09,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 17:50:09,955 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2022-07-21 17:50:09,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 17:50:09,966 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-21 17:50:09,969 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 17:50:09,969 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [5447685] [2022-07-21 17:50:09,969 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [5447685] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 17:50:09,969 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 17:50:09,969 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-21 17:50:09,970 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [333043526] [2022-07-21 17:50:09,970 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 17:50:09,970 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-21 17:50:09,970 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 17:50:09,971 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-21 17:50:09,971 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-21 17:50:09,971 INFO L87 Difference]: Start difference. First operand 90 states and 99 transitions. Second operand has 4 states, 4 states have (on average 3.25) internal successors, (13), 3 states have internal predecessors, (13), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-07-21 17:50:10,038 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 17:50:10,038 INFO L93 Difference]: Finished difference Result 96 states and 106 transitions. [2022-07-21 17:50:10,039 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-21 17:50:10,039 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.25) internal successors, (13), 3 states have internal predecessors, (13), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 15 [2022-07-21 17:50:10,039 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 17:50:10,040 INFO L225 Difference]: With dead ends: 96 [2022-07-21 17:50:10,040 INFO L226 Difference]: Without dead ends: 96 [2022-07-21 17:50:10,040 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-21 17:50:10,041 INFO L413 NwaCegarLoop]: 97 mSDtfsCounter, 4 mSDsluCounter, 137 mSDsCounter, 0 mSdLazyCounter, 62 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 234 SdHoareTripleChecker+Invalid, 65 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 62 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-21 17:50:10,041 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 234 Invalid, 65 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 62 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-21 17:50:10,041 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2022-07-21 17:50:10,044 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 91. [2022-07-21 17:50:10,045 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 91 states, 55 states have (on average 1.7454545454545454) internal successors, (96), 87 states have internal predecessors, (96), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-07-21 17:50:10,045 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 100 transitions. [2022-07-21 17:50:10,045 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 100 transitions. Word has length 15 [2022-07-21 17:50:10,045 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 17:50:10,046 INFO L495 AbstractCegarLoop]: Abstraction has 91 states and 100 transitions. [2022-07-21 17:50:10,046 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.25) internal successors, (13), 3 states have internal predecessors, (13), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-07-21 17:50:10,046 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 100 transitions. [2022-07-21 17:50:10,046 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2022-07-21 17:50:10,046 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 17:50:10,047 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 17:50:10,047 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-07-21 17:50:10,047 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 36 more)] === [2022-07-21 17:50:10,047 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 17:50:10,063 INFO L85 PathProgramCache]: Analyzing trace with hash -1769802942, now seen corresponding path program 1 times [2022-07-21 17:50:10,063 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 17:50:10,064 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [595914801] [2022-07-21 17:50:10,064 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 17:50:10,064 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 17:50:10,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 17:50:10,122 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-21 17:50:10,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 17:50:10,148 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-07-21 17:50:10,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 17:50:10,155 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2022-07-21 17:50:10,156 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 17:50:10,156 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [595914801] [2022-07-21 17:50:10,156 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [595914801] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-21 17:50:10,156 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1046269446] [2022-07-21 17:50:10,156 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 17:50:10,156 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-21 17:50:10,157 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-21 17:50:10,171 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) [2022-07-21 17:50:10,211 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-07-21 17:50:10,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 17:50:10,310 INFO L263 TraceCheckSpWp]: Trace formula consists of 251 conjuncts, 5 conjunts are in the unsatisfiable core [2022-07-21 17:50:10,314 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-21 17:50:10,360 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 7 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-21 17:50:10,361 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-21 17:50:10,386 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2022-07-21 17:50:10,386 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1046269446] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-21 17:50:10,386 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-21 17:50:10,386 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4, 4] total 6 [2022-07-21 17:50:10,387 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [166702690] [2022-07-21 17:50:10,387 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-21 17:50:10,387 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-21 17:50:10,387 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 17:50:10,388 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-21 17:50:10,388 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2022-07-21 17:50:10,388 INFO L87 Difference]: Start difference. First operand 91 states and 100 transitions. Second operand has 6 states, 6 states have (on average 5.166666666666667) internal successors, (31), 5 states have internal predecessors, (31), 3 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2022-07-21 17:50:10,449 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 17:50:10,449 INFO L93 Difference]: Finished difference Result 97 states and 107 transitions. [2022-07-21 17:50:10,450 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-21 17:50:10,450 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 5.166666666666667) internal successors, (31), 5 states have internal predecessors, (31), 3 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) Word has length 28 [2022-07-21 17:50:10,450 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 17:50:10,451 INFO L225 Difference]: With dead ends: 97 [2022-07-21 17:50:10,451 INFO L226 Difference]: Without dead ends: 97 [2022-07-21 17:50:10,451 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 57 SyntacticMatches, 1 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2022-07-21 17:50:10,452 INFO L413 NwaCegarLoop]: 97 mSDtfsCounter, 8 mSDsluCounter, 226 mSDsCounter, 0 mSdLazyCounter, 66 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 323 SdHoareTripleChecker+Invalid, 71 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 66 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-21 17:50:10,452 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 323 Invalid, 71 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 66 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-21 17:50:10,452 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2022-07-21 17:50:10,455 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 97. [2022-07-21 17:50:10,455 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 97 states, 60 states have (on average 1.6833333333333333) internal successors, (101), 92 states have internal predecessors, (101), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-07-21 17:50:10,455 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 107 transitions. [2022-07-21 17:50:10,456 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 107 transitions. Word has length 28 [2022-07-21 17:50:10,456 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 17:50:10,456 INFO L495 AbstractCegarLoop]: Abstraction has 97 states and 107 transitions. [2022-07-21 17:50:10,456 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 5.166666666666667) internal successors, (31), 5 states have internal predecessors, (31), 3 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2022-07-21 17:50:10,456 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 107 transitions. [2022-07-21 17:50:10,457 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2022-07-21 17:50:10,457 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 17:50:10,457 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 17:50:10,490 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-07-21 17:50:10,675 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2022-07-21 17:50:10,675 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 36 more)] === [2022-07-21 17:50:10,676 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 17:50:10,676 INFO L85 PathProgramCache]: Analyzing trace with hash -888530816, now seen corresponding path program 2 times [2022-07-21 17:50:10,676 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 17:50:10,676 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1582956937] [2022-07-21 17:50:10,676 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 17:50:10,676 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 17:50:10,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 17:50:10,787 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-21 17:50:10,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 17:50:10,833 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-21 17:50:10,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 17:50:10,853 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2022-07-21 17:50:10,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 17:50:10,891 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2022-07-21 17:50:10,891 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 17:50:10,891 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1582956937] [2022-07-21 17:50:10,892 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1582956937] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-21 17:50:10,892 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [653842066] [2022-07-21 17:50:10,892 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-07-21 17:50:10,892 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-21 17:50:10,892 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-21 17:50:10,909 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-21 17:50:10,920 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-07-21 17:50:11,035 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-07-21 17:50:11,036 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-21 17:50:11,038 INFO L263 TraceCheckSpWp]: Trace formula consists of 346 conjuncts, 28 conjunts are in the unsatisfiable core [2022-07-21 17:50:11,041 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-21 17:50:11,069 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-07-21 17:50:11,105 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-07-21 17:50:11,210 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-07-21 17:50:11,269 INFO L356 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-07-21 17:50:11,270 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 18 [2022-07-21 17:50:11,352 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-07-21 17:50:11,494 WARN L319 FreeRefinementEngine]: Global settings require throwing the following exception [2022-07-21 17:50:11,513 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-07-21 17:50:11,694 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable6 [2022-07-21 17:50:11,695 FATAL L? ?]: An unrecoverable error occured during an interaction with an SMT solver: de.uni_freiburg.informatik.ultimate.logic.SMTLIBException: line 25385 column 46: unknown constant v_#valid_BEFORE_CALL_6 at de.uni_freiburg.informatik.ultimate.smtsolver.external.Parser$Action$.CUP$do_action(Parser.java:1458) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Parser.do_action(Parser.java:658) at com.github.jhoenicke.javacup.runtime.LRParser.parse(LRParser.java:383) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parse(Executor.java:239) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parseSuccess(Executor.java:258) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Scriptor.assertTerm(Scriptor.java:147) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.arrays.DiffWrapperScript$DiffTransformer.checkOrAddAxiom(DiffWrapperScript.java:161) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.arrays.DiffWrapperScript$DiffTransformer.convertApplicationTerm(DiffWrapperScript.java:171) at de.uni_freiburg.informatik.ultimate.logic.TermTransformer$BuildApplicationTerm.walk(TermTransformer.java:352) at de.uni_freiburg.informatik.ultimate.logic.NonRecursive.run(NonRecursive.java:115) at de.uni_freiburg.informatik.ultimate.logic.NonRecursive.run(NonRecursive.java:106) at de.uni_freiburg.informatik.ultimate.logic.TermTransformer.transform(TermTransformer.java:285) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.arrays.DiffWrapperScript.assertTerm(DiffWrapperScript.java:109) at de.uni_freiburg.informatik.ultimate.logic.WrapperScript.assertTerm(WrapperScript.java:158) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.ManagedScript.assertTerm(ManagedScript.java:134) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.MonolithicImplicationChecker.checkImplication(MonolithicImplicationChecker.java:83) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier$PredicateComparison.compare(PredicateUnifier.java:824) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier$PredicateComparison.(PredicateUnifier.java:768) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate(PredicateUnifier.java:345) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate(PredicateUnifier.java:305) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp$UnifyPostprocessor.postprocess(TraceCheckSpWp.java:582) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer.applyPostprocessors(IterativePredicateTransformer.java:420) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer.computeStrongestPostconditionSequence(IterativePredicateTransformer.java:199) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.computeInterpolantsUsingUnsatCore(TraceCheckSpWp.java:299) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.computeInterpolants(TraceCheckSpWp.java:185) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.(TraceCheckSpWp.java:163) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSpWp.construct(IpTcStrategyModuleSpWp.java:108) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSpWp.construct(IpTcStrategyModuleSpWp.java:1) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:266) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:147) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:248) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:409) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:300) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseSequentialProgram(TraceAbstractionStarter.java:260) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:173) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:152) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:123) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2022-07-21 17:50:11,697 INFO L158 Benchmark]: Toolchain (without parser) took 4074.38ms. Allocated memory was 54.5MB in the beginning and 98.6MB in the end (delta: 44.0MB). Free memory was 29.7MB in the beginning and 37.9MB in the end (delta: -8.2MB). Peak memory consumption was 36.9MB. Max. memory is 16.1GB. [2022-07-21 17:50:11,698 INFO L158 Benchmark]: CDTParser took 0.14ms. Allocated memory is still 54.5MB. Free memory is still 36.0MB. There was no memory consumed. Max. memory is 16.1GB. [2022-07-21 17:50:11,698 INFO L158 Benchmark]: CACSL2BoogieTranslator took 499.11ms. Allocated memory was 54.5MB in the beginning and 67.1MB in the end (delta: 12.6MB). Free memory was 29.6MB in the beginning and 41.8MB in the end (delta: -12.2MB). Peak memory consumption was 5.7MB. Max. memory is 16.1GB. [2022-07-21 17:50:11,698 INFO L158 Benchmark]: Boogie Procedure Inliner took 68.21ms. Allocated memory is still 67.1MB. Free memory was 41.6MB in the beginning and 39.3MB in the end (delta: 2.3MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-07-21 17:50:11,698 INFO L158 Benchmark]: Boogie Preprocessor took 29.62ms. Allocated memory is still 67.1MB. Free memory was 39.3MB in the beginning and 37.6MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-07-21 17:50:11,698 INFO L158 Benchmark]: RCFGBuilder took 520.79ms. Allocated memory is still 67.1MB. Free memory was 37.6MB in the beginning and 33.1MB in the end (delta: 4.5MB). Peak memory consumption was 8.2MB. Max. memory is 16.1GB. [2022-07-21 17:50:11,699 INFO L158 Benchmark]: TraceAbstraction took 2950.86ms. Allocated memory was 67.1MB in the beginning and 98.6MB in the end (delta: 31.5MB). Free memory was 32.6MB in the beginning and 37.9MB in the end (delta: -5.3MB). Peak memory consumption was 27.1MB. Max. memory is 16.1GB. [2022-07-21 17:50:11,700 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.14ms. Allocated memory is still 54.5MB. Free memory is still 36.0MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 499.11ms. Allocated memory was 54.5MB in the beginning and 67.1MB in the end (delta: 12.6MB). Free memory was 29.6MB in the beginning and 41.8MB in the end (delta: -12.2MB). Peak memory consumption was 5.7MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 68.21ms. Allocated memory is still 67.1MB. Free memory was 41.6MB in the beginning and 39.3MB in the end (delta: 2.3MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 29.62ms. Allocated memory is still 67.1MB. Free memory was 39.3MB in the beginning and 37.6MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 520.79ms. Allocated memory is still 67.1MB. Free memory was 37.6MB in the beginning and 33.1MB in the end (delta: 4.5MB). Peak memory consumption was 8.2MB. Max. memory is 16.1GB. * TraceAbstraction took 2950.86ms. Allocated memory was 67.1MB in the beginning and 98.6MB in the end (delta: 31.5MB). Free memory was 32.6MB in the beginning and 37.9MB in the end (delta: -5.3MB). Peak memory consumption was 27.1MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: SMTLIBException: line 25385 column 46: unknown constant v_#valid_BEFORE_CALL_6 de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: SMTLIBException: line 25385 column 46: unknown constant v_#valid_BEFORE_CALL_6: de.uni_freiburg.informatik.ultimate.smtsolver.external.Parser$Action$.CUP$do_action(Parser.java:1458) RESULT: Ultimate could not prove your program: Toolchain returned no result. [2022-07-21 17:50:11,714 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Ended with exit code 1 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### 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/list-simple/sll2n_insert_unequal.i -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 383c6933c6ab916f651364224af1d774f30e162ad506fd2f28fe7f76c4487ba3 --- Real Ultimate output --- This is Ultimate 0.2.2-?-3598765 [2022-07-21 17:50:13,384 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-07-21 17:50:13,386 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-07-21 17:50:13,426 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-07-21 17:50:13,426 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-07-21 17:50:13,428 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-07-21 17:50:13,430 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-07-21 17:50:13,433 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-07-21 17:50:13,434 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-07-21 17:50:13,438 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-07-21 17:50:13,439 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-07-21 17:50:13,440 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-07-21 17:50:13,441 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-07-21 17:50:13,442 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-07-21 17:50:13,443 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-07-21 17:50:13,448 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-07-21 17:50:13,448 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-07-21 17:50:13,450 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-07-21 17:50:13,451 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-07-21 17:50:13,455 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-07-21 17:50:13,457 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-07-21 17:50:13,458 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-07-21 17:50:13,458 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-07-21 17:50:13,460 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-07-21 17:50:13,461 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-07-21 17:50:13,466 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-07-21 17:50:13,467 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-07-21 17:50:13,467 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-07-21 17:50:13,468 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-07-21 17:50:13,468 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-07-21 17:50:13,469 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-07-21 17:50:13,469 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-07-21 17:50:13,470 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-07-21 17:50:13,471 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-07-21 17:50:13,472 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-07-21 17:50:13,473 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-07-21 17:50:13,473 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-07-21 17:50:13,473 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-07-21 17:50:13,473 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-07-21 17:50:13,474 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-07-21 17:50:13,474 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-07-21 17:50:13,475 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-07-21 17:50:13,479 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf [2022-07-21 17:50:13,505 INFO L113 SettingsManager]: Loading preferences was successful [2022-07-21 17:50:13,506 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-07-21 17:50:13,506 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-07-21 17:50:13,506 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-07-21 17:50:13,507 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-07-21 17:50:13,507 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-07-21 17:50:13,508 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-07-21 17:50:13,508 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-07-21 17:50:13,508 INFO L138 SettingsManager]: * Use SBE=true [2022-07-21 17:50:13,509 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-07-21 17:50:13,509 INFO L138 SettingsManager]: * sizeof long=4 [2022-07-21 17:50:13,509 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-07-21 17:50:13,509 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-07-21 17:50:13,509 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-07-21 17:50:13,509 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-07-21 17:50:13,510 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2022-07-21 17:50:13,510 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2022-07-21 17:50:13,510 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2022-07-21 17:50:13,510 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-07-21 17:50:13,510 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-07-21 17:50:13,510 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2022-07-21 17:50:13,511 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2022-07-21 17:50:13,511 INFO L138 SettingsManager]: * sizeof long double=12 [2022-07-21 17:50:13,511 INFO L138 SettingsManager]: * Use constant arrays=true [2022-07-21 17:50:13,511 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-07-21 17:50:13,511 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-07-21 17:50:13,511 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-07-21 17:50:13,511 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-21 17:50:13,512 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-07-21 17:50:13,512 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-07-21 17:50:13,512 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2022-07-21 17:50:13,512 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2022-07-21 17:50:13,512 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-07-21 17:50:13,512 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 -> 383c6933c6ab916f651364224af1d774f30e162ad506fd2f28fe7f76c4487ba3 [2022-07-21 17:50:13,798 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-07-21 17:50:13,828 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-07-21 17:50:13,830 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-07-21 17:50:13,831 INFO L271 PluginConnector]: Initializing CDTParser... [2022-07-21 17:50:13,831 INFO L275 PluginConnector]: CDTParser initialized [2022-07-21 17:50:13,833 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/list-simple/sll2n_insert_unequal.i [2022-07-21 17:50:13,884 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9649c68cc/de56e7e1bacb428a983b2261bacd7456/FLAG41cb5caf5 [2022-07-21 17:50:14,313 INFO L306 CDTParser]: Found 1 translation units. [2022-07-21 17:50:14,313 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/list-simple/sll2n_insert_unequal.i [2022-07-21 17:50:14,325 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9649c68cc/de56e7e1bacb428a983b2261bacd7456/FLAG41cb5caf5 [2022-07-21 17:50:14,337 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9649c68cc/de56e7e1bacb428a983b2261bacd7456 [2022-07-21 17:50:14,338 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-07-21 17:50:14,339 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-07-21 17:50:14,341 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-07-21 17:50:14,341 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-07-21 17:50:14,343 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-07-21 17:50:14,344 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.07 05:50:14" (1/1) ... [2022-07-21 17:50:14,344 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@610a4876 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 05:50:14, skipping insertion in model container [2022-07-21 17:50:14,347 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.07 05:50:14" (1/1) ... [2022-07-21 17:50:14,352 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-07-21 17:50:14,383 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-07-21 17:50:14,655 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/list-simple/sll2n_insert_unequal.i[24620,24633] [2022-07-21 17:50:14,659 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-21 17:50:14,669 INFO L203 MainTranslator]: Completed pre-run [2022-07-21 17:50:14,701 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/list-simple/sll2n_insert_unequal.i[24620,24633] [2022-07-21 17:50:14,702 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-21 17:50:14,726 INFO L208 MainTranslator]: Completed translation [2022-07-21 17:50:14,726 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 05:50:14 WrapperNode [2022-07-21 17:50:14,726 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-07-21 17:50:14,728 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-07-21 17:50:14,728 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-07-21 17:50:14,728 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-07-21 17:50:14,732 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 05:50:14" (1/1) ... [2022-07-21 17:50:14,751 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 05:50:14" (1/1) ... [2022-07-21 17:50:14,776 INFO L137 Inliner]: procedures = 131, calls = 36, calls flagged for inlining = 6, calls inlined = 6, statements flattened = 152 [2022-07-21 17:50:14,776 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-07-21 17:50:14,777 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-07-21 17:50:14,777 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-07-21 17:50:14,777 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-07-21 17:50:14,782 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 05:50:14" (1/1) ... [2022-07-21 17:50:14,782 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 05:50:14" (1/1) ... [2022-07-21 17:50:14,800 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 05:50:14" (1/1) ... [2022-07-21 17:50:14,801 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 05:50:14" (1/1) ... [2022-07-21 17:50:14,806 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 05:50:14" (1/1) ... [2022-07-21 17:50:14,814 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 05:50:14" (1/1) ... [2022-07-21 17:50:14,816 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 05:50:14" (1/1) ... [2022-07-21 17:50:14,823 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-07-21 17:50:14,824 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-07-21 17:50:14,824 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-07-21 17:50:14,824 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-07-21 17:50:14,825 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 05:50:14" (1/1) ... [2022-07-21 17:50:14,832 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-21 17:50:14,841 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-21 17:50:14,860 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) [2022-07-21 17:50:14,865 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 [2022-07-21 17:50:14,890 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2022-07-21 17:50:14,890 INFO L130 BoogieDeclarations]: Found specification of procedure node_create [2022-07-21 17:50:14,890 INFO L138 BoogieDeclarations]: Found implementation of procedure node_create [2022-07-21 17:50:14,890 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-07-21 17:50:14,891 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-07-21 17:50:14,891 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-07-21 17:50:14,891 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-07-21 17:50:14,891 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-07-21 17:50:14,891 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-07-21 17:50:14,891 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2022-07-21 17:50:14,891 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2022-07-21 17:50:14,891 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2022-07-21 17:50:14,892 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-07-21 17:50:14,892 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-07-21 17:50:15,043 INFO L234 CfgBuilder]: Building ICFG [2022-07-21 17:50:15,044 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-07-21 17:50:15,464 INFO L275 CfgBuilder]: Performing block encoding [2022-07-21 17:50:15,468 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-07-21 17:50:15,468 INFO L299 CfgBuilder]: Removed 5 assume(true) statements. [2022-07-21 17:50:15,470 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.07 05:50:15 BoogieIcfgContainer [2022-07-21 17:50:15,470 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-07-21 17:50:15,471 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-07-21 17:50:15,471 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-07-21 17:50:15,473 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-07-21 17:50:15,473 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 21.07 05:50:14" (1/3) ... [2022-07-21 17:50:15,474 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@430f3f10 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.07 05:50:15, skipping insertion in model container [2022-07-21 17:50:15,474 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 05:50:14" (2/3) ... [2022-07-21 17:50:15,474 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@430f3f10 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.07 05:50:15, skipping insertion in model container [2022-07-21 17:50:15,474 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.07 05:50:15" (3/3) ... [2022-07-21 17:50:15,475 INFO L111 eAbstractionObserver]: Analyzing ICFG sll2n_insert_unequal.i [2022-07-21 17:50:15,486 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-07-21 17:50:15,486 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 39 error locations. [2022-07-21 17:50:15,512 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-07-21 17:50:15,517 INFO L357 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, mAutomataTypeConcurrency=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, mPorIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@3c44d6e6, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@1a5b001d [2022-07-21 17:50:15,518 INFO L358 AbstractCegarLoop]: Starting to check reachability of 39 error locations. [2022-07-21 17:50:15,521 INFO L276 IsEmpty]: Start isEmpty. Operand has 99 states, 56 states have (on average 1.9821428571428572) internal successors, (111), 95 states have internal predecessors, (111), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-07-21 17:50:15,525 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2022-07-21 17:50:15,525 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 17:50:15,526 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2022-07-21 17:50:15,527 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting node_createErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 36 more)] === [2022-07-21 17:50:15,531 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 17:50:15,531 INFO L85 PathProgramCache]: Analyzing trace with hash 1814951417, now seen corresponding path program 1 times [2022-07-21 17:50:15,539 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-21 17:50:15,539 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1883237299] [2022-07-21 17:50:15,539 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 17:50:15,540 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-21 17:50:15,540 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-21 17:50:15,542 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) [2022-07-21 17:50:15,547 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2022-07-21 17:50:15,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 17:50:15,635 INFO L263 TraceCheckSpWp]: Trace formula consists of 53 conjuncts, 3 conjunts are in the unsatisfiable core [2022-07-21 17:50:15,639 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-21 17:50:15,685 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-07-21 17:50:15,696 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-21 17:50:15,696 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-21 17:50:15,697 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-21 17:50:15,697 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1883237299] [2022-07-21 17:50:15,697 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1883237299] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 17:50:15,698 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 17:50:15,698 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-07-21 17:50:15,699 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1228533832] [2022-07-21 17:50:15,700 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 17:50:15,703 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-21 17:50:15,703 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-21 17:50:15,720 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-21 17:50:15,721 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-21 17:50:15,723 INFO L87 Difference]: Start difference. First operand has 99 states, 56 states have (on average 1.9821428571428572) internal successors, (111), 95 states have internal predecessors, (111), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-21 17:50:15,838 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 17:50:15,838 INFO L93 Difference]: Finished difference Result 97 states and 107 transitions. [2022-07-21 17:50:15,839 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-21 17:50:15,840 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 7 [2022-07-21 17:50:15,841 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 17:50:15,845 INFO L225 Difference]: With dead ends: 97 [2022-07-21 17:50:15,845 INFO L226 Difference]: Without dead ends: 94 [2022-07-21 17:50:15,846 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-21 17:50:15,849 INFO L413 NwaCegarLoop]: 100 mSDtfsCounter, 8 mSDsluCounter, 58 mSDsCounter, 0 mSdLazyCounter, 46 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 158 SdHoareTripleChecker+Invalid, 47 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 46 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-21 17:50:15,849 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 158 Invalid, 47 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 46 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-21 17:50:15,861 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2022-07-21 17:50:15,874 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 94. [2022-07-21 17:50:15,875 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 94 states, 54 states have (on average 1.8333333333333333) internal successors, (99), 90 states have internal predecessors, (99), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-07-21 17:50:15,877 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 103 transitions. [2022-07-21 17:50:15,878 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 103 transitions. Word has length 7 [2022-07-21 17:50:15,878 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 17:50:15,878 INFO L495 AbstractCegarLoop]: Abstraction has 94 states and 103 transitions. [2022-07-21 17:50:15,878 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-21 17:50:15,879 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 103 transitions. [2022-07-21 17:50:15,879 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2022-07-21 17:50:15,879 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 17:50:15,879 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2022-07-21 17:50:15,889 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (2)] Ended with exit code 0 [2022-07-21 17:50:16,096 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-21 17:50:16,097 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting node_createErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 36 more)] === [2022-07-21 17:50:16,097 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 17:50:16,097 INFO L85 PathProgramCache]: Analyzing trace with hash 1814951418, now seen corresponding path program 1 times [2022-07-21 17:50:16,105 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-21 17:50:16,105 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2140825526] [2022-07-21 17:50:16,105 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 17:50:16,106 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-21 17:50:16,110 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-21 17:50:16,111 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) [2022-07-21 17:50:16,112 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2022-07-21 17:50:16,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 17:50:16,159 INFO L263 TraceCheckSpWp]: Trace formula consists of 53 conjuncts, 4 conjunts are in the unsatisfiable core [2022-07-21 17:50:16,161 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-21 17:50:16,178 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-07-21 17:50:16,195 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-21 17:50:16,195 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-21 17:50:16,196 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-21 17:50:16,196 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2140825526] [2022-07-21 17:50:16,196 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2140825526] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 17:50:16,196 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 17:50:16,196 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-07-21 17:50:16,199 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [231361404] [2022-07-21 17:50:16,199 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 17:50:16,200 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-21 17:50:16,200 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-21 17:50:16,201 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-21 17:50:16,201 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-21 17:50:16,201 INFO L87 Difference]: Start difference. First operand 94 states and 103 transitions. Second operand has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-21 17:50:16,321 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 17:50:16,321 INFO L93 Difference]: Finished difference Result 92 states and 101 transitions. [2022-07-21 17:50:16,322 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-21 17:50:16,322 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 7 [2022-07-21 17:50:16,322 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 17:50:16,323 INFO L225 Difference]: With dead ends: 92 [2022-07-21 17:50:16,323 INFO L226 Difference]: Without dead ends: 92 [2022-07-21 17:50:16,323 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-21 17:50:16,324 INFO L413 NwaCegarLoop]: 97 mSDtfsCounter, 4 mSDsluCounter, 61 mSDsCounter, 0 mSdLazyCounter, 38 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 158 SdHoareTripleChecker+Invalid, 39 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 38 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-21 17:50:16,324 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 158 Invalid, 39 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 38 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-21 17:50:16,325 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2022-07-21 17:50:16,329 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 92. [2022-07-21 17:50:16,330 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 92 states, 54 states have (on average 1.7962962962962963) internal successors, (97), 88 states have internal predecessors, (97), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-07-21 17:50:16,331 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 101 transitions. [2022-07-21 17:50:16,331 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 101 transitions. Word has length 7 [2022-07-21 17:50:16,331 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 17:50:16,331 INFO L495 AbstractCegarLoop]: Abstraction has 92 states and 101 transitions. [2022-07-21 17:50:16,331 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-21 17:50:16,332 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 101 transitions. [2022-07-21 17:50:16,332 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-07-21 17:50:16,332 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 17:50:16,332 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 17:50:16,354 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (3)] Forceful destruction successful, exit code 0 [2022-07-21 17:50:16,533 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-21 17:50:16,533 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 36 more)] === [2022-07-21 17:50:16,534 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 17:50:16,534 INFO L85 PathProgramCache]: Analyzing trace with hash -1506390976, now seen corresponding path program 1 times [2022-07-21 17:50:16,534 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-21 17:50:16,535 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1022120948] [2022-07-21 17:50:16,535 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 17:50:16,535 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-21 17:50:16,535 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-21 17:50:16,536 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) [2022-07-21 17:50:16,538 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2022-07-21 17:50:16,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 17:50:16,605 INFO L263 TraceCheckSpWp]: Trace formula consists of 86 conjuncts, 6 conjunts are in the unsatisfiable core [2022-07-21 17:50:16,607 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-21 17:50:16,611 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-07-21 17:50:16,639 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-21 17:50:16,639 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-21 17:50:16,639 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-21 17:50:16,639 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1022120948] [2022-07-21 17:50:16,640 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1022120948] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 17:50:16,640 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 17:50:16,640 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-07-21 17:50:16,640 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1280770805] [2022-07-21 17:50:16,640 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 17:50:16,641 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-21 17:50:16,641 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-21 17:50:16,641 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-21 17:50:16,642 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-21 17:50:16,642 INFO L87 Difference]: Start difference. First operand 92 states and 101 transitions. Second operand has 6 states, 5 states have (on average 2.2) internal successors, (11), 5 states have internal predecessors, (11), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-07-21 17:50:16,882 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 17:50:16,882 INFO L93 Difference]: Finished difference Result 96 states and 108 transitions. [2022-07-21 17:50:16,883 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-07-21 17:50:16,883 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 2.2) internal successors, (11), 5 states have internal predecessors, (11), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 13 [2022-07-21 17:50:16,883 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 17:50:16,885 INFO L225 Difference]: With dead ends: 96 [2022-07-21 17:50:16,885 INFO L226 Difference]: Without dead ends: 96 [2022-07-21 17:50:16,885 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-07-21 17:50:16,886 INFO L413 NwaCegarLoop]: 100 mSDtfsCounter, 10 mSDsluCounter, 229 mSDsCounter, 0 mSdLazyCounter, 192 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 329 SdHoareTripleChecker+Invalid, 192 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 192 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-21 17:50:16,886 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 329 Invalid, 192 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 192 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-07-21 17:50:16,887 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2022-07-21 17:50:16,891 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 91. [2022-07-21 17:50:16,891 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 91 states, 54 states have (on average 1.7777777777777777) internal successors, (96), 87 states have internal predecessors, (96), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-07-21 17:50:16,892 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 100 transitions. [2022-07-21 17:50:16,892 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 100 transitions. Word has length 13 [2022-07-21 17:50:16,893 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 17:50:16,893 INFO L495 AbstractCegarLoop]: Abstraction has 91 states and 100 transitions. [2022-07-21 17:50:16,893 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.2) internal successors, (11), 5 states have internal predecessors, (11), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-07-21 17:50:16,893 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 100 transitions. [2022-07-21 17:50:16,893 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-07-21 17:50:16,893 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 17:50:16,894 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 17:50:16,905 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (4)] Forceful destruction successful, exit code 0 [2022-07-21 17:50:17,105 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-21 17:50:17,106 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 36 more)] === [2022-07-21 17:50:17,110 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 17:50:17,110 INFO L85 PathProgramCache]: Analyzing trace with hash -1506390975, now seen corresponding path program 1 times [2022-07-21 17:50:17,110 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-21 17:50:17,111 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [640825956] [2022-07-21 17:50:17,112 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 17:50:17,112 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-21 17:50:17,113 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-21 17:50:17,115 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) [2022-07-21 17:50:17,162 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2022-07-21 17:50:17,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 17:50:17,197 INFO L263 TraceCheckSpWp]: Trace formula consists of 86 conjuncts, 10 conjunts are in the unsatisfiable core [2022-07-21 17:50:17,201 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-21 17:50:17,215 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-07-21 17:50:17,297 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-21 17:50:17,297 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-21 17:50:17,297 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-21 17:50:17,297 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [640825956] [2022-07-21 17:50:17,298 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [640825956] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 17:50:17,298 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 17:50:17,298 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-07-21 17:50:17,298 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [497062951] [2022-07-21 17:50:17,298 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 17:50:17,298 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-21 17:50:17,299 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-21 17:50:17,299 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-21 17:50:17,299 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-21 17:50:17,299 INFO L87 Difference]: Start difference. First operand 91 states and 100 transitions. Second operand has 6 states, 5 states have (on average 2.2) internal successors, (11), 5 states have internal predecessors, (11), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-07-21 17:50:17,570 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 17:50:17,570 INFO L93 Difference]: Finished difference Result 95 states and 107 transitions. [2022-07-21 17:50:17,571 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-07-21 17:50:17,571 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 2.2) internal successors, (11), 5 states have internal predecessors, (11), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 13 [2022-07-21 17:50:17,571 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 17:50:17,572 INFO L225 Difference]: With dead ends: 95 [2022-07-21 17:50:17,572 INFO L226 Difference]: Without dead ends: 95 [2022-07-21 17:50:17,572 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-07-21 17:50:17,573 INFO L413 NwaCegarLoop]: 100 mSDtfsCounter, 9 mSDsluCounter, 245 mSDsCounter, 0 mSdLazyCounter, 172 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 345 SdHoareTripleChecker+Invalid, 172 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 172 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-21 17:50:17,573 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 345 Invalid, 172 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 172 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-07-21 17:50:17,573 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2022-07-21 17:50:17,576 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 90. [2022-07-21 17:50:17,577 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 90 states, 54 states have (on average 1.7592592592592593) internal successors, (95), 86 states have internal predecessors, (95), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-07-21 17:50:17,577 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 99 transitions. [2022-07-21 17:50:17,578 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 99 transitions. Word has length 13 [2022-07-21 17:50:17,578 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 17:50:17,578 INFO L495 AbstractCegarLoop]: Abstraction has 90 states and 99 transitions. [2022-07-21 17:50:17,578 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.2) internal successors, (11), 5 states have internal predecessors, (11), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-07-21 17:50:17,578 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 99 transitions. [2022-07-21 17:50:17,579 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-07-21 17:50:17,579 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 17:50:17,579 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 17:50:17,595 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (5)] Forceful destruction successful, exit code 0 [2022-07-21 17:50:17,786 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-21 17:50:17,786 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 36 more)] === [2022-07-21 17:50:17,787 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 17:50:17,787 INFO L85 PathProgramCache]: Analyzing trace with hash -2068593344, now seen corresponding path program 1 times [2022-07-21 17:50:17,787 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-21 17:50:17,787 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [128981548] [2022-07-21 17:50:17,788 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 17:50:17,788 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-21 17:50:17,788 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-21 17:50:17,795 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) [2022-07-21 17:50:17,797 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2022-07-21 17:50:17,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 17:50:17,856 INFO L263 TraceCheckSpWp]: Trace formula consists of 102 conjuncts, 4 conjunts are in the unsatisfiable core [2022-07-21 17:50:17,857 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-21 17:50:17,867 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-21 17:50:17,868 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-21 17:50:17,868 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-21 17:50:17,868 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [128981548] [2022-07-21 17:50:17,868 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [128981548] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 17:50:17,868 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 17:50:17,869 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-21 17:50:17,869 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [52552520] [2022-07-21 17:50:17,869 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 17:50:17,869 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-21 17:50:17,869 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-21 17:50:17,870 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-21 17:50:17,870 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-21 17:50:17,870 INFO L87 Difference]: Start difference. First operand 90 states and 99 transitions. Second operand has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-07-21 17:50:17,879 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 17:50:17,879 INFO L93 Difference]: Finished difference Result 96 states and 106 transitions. [2022-07-21 17:50:17,879 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-21 17:50:17,880 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 15 [2022-07-21 17:50:17,880 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 17:50:17,880 INFO L225 Difference]: With dead ends: 96 [2022-07-21 17:50:17,880 INFO L226 Difference]: Without dead ends: 96 [2022-07-21 17:50:17,881 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-21 17:50:17,881 INFO L413 NwaCegarLoop]: 98 mSDtfsCounter, 4 mSDsluCounter, 95 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 193 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-21 17:50:17,882 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 193 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-21 17:50:17,882 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2022-07-21 17:50:17,885 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 91. [2022-07-21 17:50:17,885 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 91 states, 55 states have (on average 1.7454545454545454) internal successors, (96), 87 states have internal predecessors, (96), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-07-21 17:50:17,886 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 100 transitions. [2022-07-21 17:50:17,886 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 100 transitions. Word has length 15 [2022-07-21 17:50:17,886 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 17:50:17,886 INFO L495 AbstractCegarLoop]: Abstraction has 91 states and 100 transitions. [2022-07-21 17:50:17,886 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-07-21 17:50:17,887 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 100 transitions. [2022-07-21 17:50:17,887 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2022-07-21 17:50:17,887 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 17:50:17,887 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 17:50:17,909 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (6)] Forceful destruction successful, exit code 0 [2022-07-21 17:50:18,094 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-21 17:50:18,095 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 36 more)] === [2022-07-21 17:50:18,095 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 17:50:18,096 INFO L85 PathProgramCache]: Analyzing trace with hash -1769802942, now seen corresponding path program 1 times [2022-07-21 17:50:18,096 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-21 17:50:18,096 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [371244866] [2022-07-21 17:50:18,096 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 17:50:18,096 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-21 17:50:18,096 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-21 17:50:18,117 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) [2022-07-21 17:50:18,144 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (7)] Waiting until timeout for monitored process [2022-07-21 17:50:18,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 17:50:18,214 INFO L263 TraceCheckSpWp]: Trace formula consists of 173 conjuncts, 5 conjunts are in the unsatisfiable core [2022-07-21 17:50:18,215 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-21 17:50:18,272 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 7 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-21 17:50:18,273 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-21 17:50:18,361 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2022-07-21 17:50:18,362 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-21 17:50:18,362 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [371244866] [2022-07-21 17:50:18,362 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [371244866] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-21 17:50:18,362 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-21 17:50:18,362 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 6 [2022-07-21 17:50:18,362 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [520475638] [2022-07-21 17:50:18,362 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-21 17:50:18,363 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-21 17:50:18,363 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-21 17:50:18,363 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-21 17:50:18,363 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2022-07-21 17:50:18,363 INFO L87 Difference]: Start difference. First operand 91 states and 100 transitions. Second operand has 6 states, 6 states have (on average 5.166666666666667) internal successors, (31), 6 states have internal predecessors, (31), 3 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2022-07-21 17:50:18,400 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 17:50:18,400 INFO L93 Difference]: Finished difference Result 102 states and 113 transitions. [2022-07-21 17:50:18,400 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-21 17:50:18,400 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 5.166666666666667) internal successors, (31), 6 states have internal predecessors, (31), 3 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) Word has length 28 [2022-07-21 17:50:18,401 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 17:50:18,402 INFO L225 Difference]: With dead ends: 102 [2022-07-21 17:50:18,402 INFO L226 Difference]: Without dead ends: 102 [2022-07-21 17:50:18,403 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 50 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2022-07-21 17:50:18,405 INFO L413 NwaCegarLoop]: 103 mSDtfsCounter, 11 mSDsluCounter, 282 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 385 SdHoareTripleChecker+Invalid, 21 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-21 17:50:18,405 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 385 Invalid, 21 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-21 17:50:18,406 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102 states. [2022-07-21 17:50:18,410 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102 to 97. [2022-07-21 17:50:18,414 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 97 states, 60 states have (on average 1.6833333333333333) internal successors, (101), 92 states have internal predecessors, (101), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-07-21 17:50:18,414 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 107 transitions. [2022-07-21 17:50:18,416 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 107 transitions. Word has length 28 [2022-07-21 17:50:18,416 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 17:50:18,417 INFO L495 AbstractCegarLoop]: Abstraction has 97 states and 107 transitions. [2022-07-21 17:50:18,417 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 5.166666666666667) internal successors, (31), 6 states have internal predecessors, (31), 3 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2022-07-21 17:50:18,417 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 107 transitions. [2022-07-21 17:50:18,417 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2022-07-21 17:50:18,418 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 17:50:18,418 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 17:50:18,441 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (7)] Ended with exit code 0 [2022-07-21 17:50:18,625 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-21 17:50:18,625 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 36 more)] === [2022-07-21 17:50:18,626 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 17:50:18,626 INFO L85 PathProgramCache]: Analyzing trace with hash -888530816, now seen corresponding path program 2 times [2022-07-21 17:50:18,626 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-21 17:50:18,626 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1446575520] [2022-07-21 17:50:18,627 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-07-21 17:50:18,627 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-21 17:50:18,627 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-21 17:50:18,628 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) [2022-07-21 17:50:18,629 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (8)] Waiting until timeout for monitored process [2022-07-21 17:50:18,784 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-07-21 17:50:18,784 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-21 17:50:18,791 INFO L263 TraceCheckSpWp]: Trace formula consists of 244 conjuncts, 19 conjunts are in the unsatisfiable core [2022-07-21 17:50:18,794 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-21 17:50:18,803 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-07-21 17:50:18,831 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-07-21 17:50:18,944 INFO L356 Elim1Store]: treesize reduction 15, result has 46.4 percent of original size [2022-07-21 17:50:18,944 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 24 [2022-07-21 17:50:18,983 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-07-21 17:50:19,062 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 17:50:19,063 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 14 [2022-07-21 17:50:19,146 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-07-21 17:50:21,255 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 17:50:21,256 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 14 [2022-07-21 17:50:21,304 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 14 proven. 6 refuted. 6 times theorem prover too weak. 3 trivial. 0 not checked. [2022-07-21 17:50:21,304 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-21 17:50:21,371 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-21 17:50:21,371 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1446575520] [2022-07-21 17:50:21,371 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1446575520] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-21 17:50:21,371 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [429400464] [2022-07-21 17:50:21,371 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-07-21 17:50:21,371 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2022-07-21 17:50:21,371 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2022-07-21 17:50:21,407 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2022-07-21 17:50:21,417 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (9)] Waiting until timeout for monitored process [2022-07-21 17:50:21,592 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-07-21 17:50:21,592 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1108720841] [2022-07-21 17:50:21,592 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-07-21 17:50:21,592 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-21 17:50:21,592 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-21 17:50:21,631 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-21 17:50:21,644 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (9)] Forceful destruction successful, exit code 1 [2022-07-21 17:50:21,657 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2022-07-21 17:50:21,784 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-07-21 17:50:21,785 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-21 17:50:21,790 INFO L263 TraceCheckSpWp]: Trace formula consists of 244 conjuncts, 17 conjunts are in the unsatisfiable core [2022-07-21 17:50:21,799 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-21 17:50:21,802 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-07-21 17:50:23,902 INFO L356 Elim1Store]: treesize reduction 15, result has 46.4 percent of original size [2022-07-21 17:50:23,902 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 24 [2022-07-21 17:50:28,072 INFO L356 Elim1Store]: treesize reduction 12, result has 40.0 percent of original size [2022-07-21 17:50:28,072 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 17 [2022-07-21 17:50:28,228 INFO L356 Elim1Store]: treesize reduction 12, result has 40.0 percent of original size [2022-07-21 17:50:28,228 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 17 [2022-07-21 17:50:28,246 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 0 proven. 4 refuted. 8 times theorem prover too weak. 17 trivial. 0 not checked. [2022-07-21 17:50:28,246 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-21 17:50:32,713 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2022-07-21 17:50:32,713 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1108720841] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-21 17:50:32,713 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-21 17:50:32,713 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 7, 5] total 18 [2022-07-21 17:50:32,713 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [829415649] [2022-07-21 17:50:32,714 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-21 17:50:32,714 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2022-07-21 17:50:32,714 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-21 17:50:32,714 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2022-07-21 17:50:32,714 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=304, Unknown=5, NotChecked=0, Total=380 [2022-07-21 17:50:32,715 INFO L87 Difference]: Start difference. First operand 97 states and 107 transitions. Second operand has 19 states, 17 states have (on average 3.8823529411764706) internal successors, (66), 16 states have internal predecessors, (66), 4 states have call successors, (6), 4 states have call predecessors, (6), 6 states have return successors, (8), 5 states have call predecessors, (8), 4 states have call successors, (8) [2022-07-21 17:50:46,451 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 17:50:46,451 INFO L93 Difference]: Finished difference Result 166 states and 182 transitions. [2022-07-21 17:50:46,451 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-07-21 17:50:46,451 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 17 states have (on average 3.8823529411764706) internal successors, (66), 16 states have internal predecessors, (66), 4 states have call successors, (6), 4 states have call predecessors, (6), 6 states have return successors, (8), 5 states have call predecessors, (8), 4 states have call successors, (8) Word has length 41 [2022-07-21 17:50:46,452 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 17:50:46,452 INFO L225 Difference]: With dead ends: 166 [2022-07-21 17:50:46,452 INFO L226 Difference]: Without dead ends: 166 [2022-07-21 17:50:46,453 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 131 GetRequests, 94 SyntacticMatches, 13 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 204 ImplicationChecksByTransitivity, 26.1s TimeCoverageRelationStatistics Valid=124, Invalid=519, Unknown=7, NotChecked=0, Total=650 [2022-07-21 17:50:46,453 INFO L413 NwaCegarLoop]: 107 mSDtfsCounter, 112 mSDsluCounter, 579 mSDsCounter, 0 mSdLazyCounter, 263 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 112 SdHoareTripleChecker+Valid, 686 SdHoareTripleChecker+Invalid, 407 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 263 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 141 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-07-21 17:50:46,453 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [112 Valid, 686 Invalid, 407 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 263 Invalid, 0 Unknown, 141 Unchecked, 0.3s Time] [2022-07-21 17:50:46,454 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 166 states. [2022-07-21 17:50:46,456 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 166 to 102. [2022-07-21 17:50:46,457 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 102 states, 66 states have (on average 1.5909090909090908) internal successors, (105), 96 states have internal predecessors, (105), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-07-21 17:50:46,457 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 111 transitions. [2022-07-21 17:50:46,457 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 111 transitions. Word has length 41 [2022-07-21 17:50:46,457 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 17:50:46,458 INFO L495 AbstractCegarLoop]: Abstraction has 102 states and 111 transitions. [2022-07-21 17:50:46,458 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 17 states have (on average 3.8823529411764706) internal successors, (66), 16 states have internal predecessors, (66), 4 states have call successors, (6), 4 states have call predecessors, (6), 6 states have return successors, (8), 5 states have call predecessors, (8), 4 states have call successors, (8) [2022-07-21 17:50:46,458 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 111 transitions. [2022-07-21 17:50:46,458 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2022-07-21 17:50:46,459 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 17:50:46,459 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 17:50:46,486 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (8)] Forceful destruction successful, exit code 0 [2022-07-21 17:50:46,678 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2022-07-21 17:50:46,859 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3,10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-21 17:50:46,860 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 36 more)] === [2022-07-21 17:50:46,860 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 17:50:46,860 INFO L85 PathProgramCache]: Analyzing trace with hash -888530815, now seen corresponding path program 1 times [2022-07-21 17:50:46,861 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-21 17:50:46,861 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [981446998] [2022-07-21 17:50:46,861 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 17:50:46,861 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-21 17:50:46,861 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-21 17:50:46,862 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) [2022-07-21 17:50:46,866 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (11)] Waiting until timeout for monitored process [2022-07-21 17:50:47,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 17:50:47,010 INFO L263 TraceCheckSpWp]: Trace formula consists of 244 conjuncts, 25 conjunts are in the unsatisfiable core [2022-07-21 17:50:47,012 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-21 17:50:47,020 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-07-21 17:50:47,025 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-07-21 17:50:47,049 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-07-21 17:50:47,059 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-07-21 17:50:49,156 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 17:50:49,156 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 14 [2022-07-21 17:50:49,164 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-07-21 17:50:49,164 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2022-07-21 17:50:49,217 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-07-21 17:50:51,302 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 17:50:51,303 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 14 [2022-07-21 17:50:51,478 INFO L356 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-07-21 17:50:51,478 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 18 [2022-07-21 17:50:51,545 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 0 proven. 29 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-21 17:50:51,545 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-21 17:50:51,758 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-21 17:50:51,758 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [981446998] [2022-07-21 17:50:51,758 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [981446998] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-21 17:50:51,758 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1620626107] [2022-07-21 17:50:51,758 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 17:50:51,758 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2022-07-21 17:50:51,758 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2022-07-21 17:50:51,760 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2022-07-21 17:50:51,777 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (12)] Waiting until timeout for monitored process [2022-07-21 17:50:51,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 17:50:51,970 INFO L263 TraceCheckSpWp]: Trace formula consists of 244 conjuncts, 24 conjunts are in the unsatisfiable core [2022-07-21 17:50:51,972 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-21 17:50:51,981 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-07-21 17:50:52,004 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-07-21 17:50:52,068 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 17:50:52,069 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 14 [2022-07-21 17:50:52,147 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-07-21 17:50:54,334 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 17:50:54,335 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 14 [2022-07-21 17:50:54,489 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-07-21 17:50:54,553 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 17:50:54,553 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 14 [2022-07-21 17:50:54,570 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 12 proven. 6 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2022-07-21 17:50:54,570 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-21 17:50:54,712 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1620626107] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-21 17:50:54,712 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-21 17:50:54,712 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 11] total 18 [2022-07-21 17:50:54,712 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1614095075] [2022-07-21 17:50:54,712 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-21 17:50:54,713 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2022-07-21 17:50:54,713 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-21 17:50:54,713 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2022-07-21 17:50:54,713 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=64, Invalid=395, Unknown=3, NotChecked=0, Total=462 [2022-07-21 17:50:54,713 INFO L87 Difference]: Start difference. First operand 102 states and 111 transitions. Second operand has 19 states, 17 states have (on average 3.176470588235294) internal successors, (54), 14 states have internal predecessors, (54), 5 states have call successors, (5), 4 states have call predecessors, (5), 4 states have return successors, (6), 6 states have call predecessors, (6), 5 states have call successors, (6) [2022-07-21 17:50:59,634 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 17:50:59,634 INFO L93 Difference]: Finished difference Result 108 states and 116 transitions. [2022-07-21 17:50:59,635 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-07-21 17:50:59,635 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 17 states have (on average 3.176470588235294) internal successors, (54), 14 states have internal predecessors, (54), 5 states have call successors, (5), 4 states have call predecessors, (5), 4 states have return successors, (6), 6 states have call predecessors, (6), 5 states have call successors, (6) Word has length 41 [2022-07-21 17:50:59,635 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 17:50:59,635 INFO L225 Difference]: With dead ends: 108 [2022-07-21 17:50:59,636 INFO L226 Difference]: Without dead ends: 108 [2022-07-21 17:50:59,636 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 92 GetRequests, 64 SyntacticMatches, 2 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 135 ImplicationChecksByTransitivity, 11.3s TimeCoverageRelationStatistics Valid=106, Invalid=646, Unknown=4, NotChecked=0, Total=756 [2022-07-21 17:50:59,636 INFO L413 NwaCegarLoop]: 91 mSDtfsCounter, 4 mSDsluCounter, 706 mSDsCounter, 0 mSdLazyCounter, 206 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 797 SdHoareTripleChecker+Invalid, 475 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 206 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 265 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-07-21 17:50:59,636 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 797 Invalid, 475 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 206 Invalid, 0 Unknown, 265 Unchecked, 0.3s Time] [2022-07-21 17:50:59,637 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 108 states. [2022-07-21 17:50:59,639 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 108 to 108. [2022-07-21 17:50:59,639 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 108 states, 72 states have (on average 1.5277777777777777) internal successors, (110), 101 states have internal predecessors, (110), 3 states have call successors, (3), 3 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-07-21 17:50:59,640 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 116 transitions. [2022-07-21 17:50:59,640 INFO L78 Accepts]: Start accepts. Automaton has 108 states and 116 transitions. Word has length 41 [2022-07-21 17:50:59,640 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 17:50:59,640 INFO L495 AbstractCegarLoop]: Abstraction has 108 states and 116 transitions. [2022-07-21 17:50:59,640 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 17 states have (on average 3.176470588235294) internal successors, (54), 14 states have internal predecessors, (54), 5 states have call successors, (5), 4 states have call predecessors, (5), 4 states have return successors, (6), 6 states have call predecessors, (6), 5 states have call successors, (6) [2022-07-21 17:50:59,640 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 116 transitions. [2022-07-21 17:50:59,641 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2022-07-21 17:50:59,641 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 17:50:59,641 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 17:50:59,652 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (11)] Forceful destruction successful, exit code 0 [2022-07-21 17:50:59,857 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (12)] Ended with exit code 0 [2022-07-21 17:51:00,052 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3,12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt [2022-07-21 17:51:00,053 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 36 more)] === [2022-07-21 17:51:00,053 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 17:51:00,053 INFO L85 PathProgramCache]: Analyzing trace with hash -338093919, now seen corresponding path program 1 times [2022-07-21 17:51:00,054 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-21 17:51:00,054 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [403290493] [2022-07-21 17:51:00,054 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 17:51:00,054 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-21 17:51:00,054 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-21 17:51:00,055 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) [2022-07-21 17:51:00,056 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (13)] Waiting until timeout for monitored process [2022-07-21 17:51:00,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 17:51:00,227 INFO L263 TraceCheckSpWp]: Trace formula consists of 255 conjuncts, 28 conjunts are in the unsatisfiable core [2022-07-21 17:51:00,230 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-21 17:51:00,302 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-07-21 17:51:00,390 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-07-21 17:51:00,483 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 8 [2022-07-21 17:51:00,664 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 17:51:00,665 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 21 [2022-07-21 17:51:00,685 INFO L356 Elim1Store]: treesize reduction 24, result has 33.3 percent of original size [2022-07-21 17:51:00,685 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 19 treesize of output 24 [2022-07-21 17:51:00,772 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 12 [2022-07-21 17:51:00,967 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 23 proven. 3 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-07-21 17:51:00,967 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-21 17:51:01,207 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-21 17:51:01,208 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [403290493] [2022-07-21 17:51:01,208 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [403290493] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-21 17:51:01,208 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1727340821] [2022-07-21 17:51:01,208 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 17:51:01,208 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2022-07-21 17:51:01,208 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2022-07-21 17:51:01,209 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2022-07-21 17:51:01,211 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (14)] Waiting until timeout for monitored process [2022-07-21 17:51:01,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 17:51:01,502 INFO L263 TraceCheckSpWp]: Trace formula consists of 255 conjuncts, 27 conjunts are in the unsatisfiable core [2022-07-21 17:51:01,505 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-21 17:51:01,611 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-07-21 17:51:01,978 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 8 [2022-07-21 17:51:02,279 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 17:51:02,280 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 21 [2022-07-21 17:51:02,299 INFO L356 Elim1Store]: treesize reduction 27, result has 43.8 percent of original size [2022-07-21 17:51:02,300 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 24 treesize of output 35 [2022-07-21 17:51:02,391 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 16 [2022-07-21 17:51:02,474 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 20 proven. 6 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-07-21 17:51:02,474 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-21 17:51:02,607 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1727340821] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-21 17:51:02,607 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-21 17:51:02,607 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17] total 34 [2022-07-21 17:51:02,607 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [476234920] [2022-07-21 17:51:02,607 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-21 17:51:02,608 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 35 states [2022-07-21 17:51:02,608 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-21 17:51:02,608 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2022-07-21 17:51:02,608 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=156, Invalid=1233, Unknown=17, NotChecked=0, Total=1406 [2022-07-21 17:51:02,609 INFO L87 Difference]: Start difference. First operand 108 states and 116 transitions. Second operand has 35 states, 32 states have (on average 2.3125) internal successors, (74), 31 states have internal predecessors, (74), 4 states have call successors, (4), 4 states have call predecessors, (4), 6 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) [2022-07-21 17:51:03,462 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 17:51:03,462 INFO L93 Difference]: Finished difference Result 127 states and 140 transitions. [2022-07-21 17:51:03,462 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-07-21 17:51:03,463 INFO L78 Accepts]: Start accepts. Automaton has has 35 states, 32 states have (on average 2.3125) internal successors, (74), 31 states have internal predecessors, (74), 4 states have call successors, (4), 4 states have call predecessors, (4), 6 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) Word has length 44 [2022-07-21 17:51:03,463 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 17:51:03,463 INFO L225 Difference]: With dead ends: 127 [2022-07-21 17:51:03,463 INFO L226 Difference]: Without dead ends: 127 [2022-07-21 17:51:03,464 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 111 GetRequests, 62 SyntacticMatches, 2 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 676 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=278, Invalid=2044, Unknown=30, NotChecked=0, Total=2352 [2022-07-21 17:51:03,465 INFO L413 NwaCegarLoop]: 86 mSDtfsCounter, 58 mSDsluCounter, 561 mSDsCounter, 0 mSdLazyCounter, 230 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 58 SdHoareTripleChecker+Valid, 647 SdHoareTripleChecker+Invalid, 410 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 230 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 172 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-07-21 17:51:03,465 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [58 Valid, 647 Invalid, 410 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 230 Invalid, 0 Unknown, 172 Unchecked, 0.3s Time] [2022-07-21 17:51:03,465 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 127 states. [2022-07-21 17:51:03,467 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 127 to 110. [2022-07-21 17:51:03,467 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 110 states, 74 states have (on average 1.5405405405405406) internal successors, (114), 103 states have internal predecessors, (114), 3 states have call successors, (3), 3 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-07-21 17:51:03,467 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 110 states and 120 transitions. [2022-07-21 17:51:03,468 INFO L78 Accepts]: Start accepts. Automaton has 110 states and 120 transitions. Word has length 44 [2022-07-21 17:51:03,468 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 17:51:03,468 INFO L495 AbstractCegarLoop]: Abstraction has 110 states and 120 transitions. [2022-07-21 17:51:03,468 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 35 states, 32 states have (on average 2.3125) internal successors, (74), 31 states have internal predecessors, (74), 4 states have call successors, (4), 4 states have call predecessors, (4), 6 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) [2022-07-21 17:51:03,468 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 120 transitions. [2022-07-21 17:51:03,468 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2022-07-21 17:51:03,468 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 17:51:03,469 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 17:51:03,479 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (14)] Forceful destruction successful, exit code 0 [2022-07-21 17:51:03,686 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (13)] Forceful destruction successful, exit code 0 [2022-07-21 17:51:03,876 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt,13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-21 17:51:03,876 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 36 more)] === [2022-07-21 17:51:03,876 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 17:51:03,876 INFO L85 PathProgramCache]: Analyzing trace with hash -338093918, now seen corresponding path program 1 times [2022-07-21 17:51:03,877 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-21 17:51:03,877 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [920452526] [2022-07-21 17:51:03,877 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 17:51:03,877 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-21 17:51:03,877 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-21 17:51:03,880 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) [2022-07-21 17:51:03,882 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (15)] Waiting until timeout for monitored process [2022-07-21 17:51:04,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 17:51:04,076 INFO L263 TraceCheckSpWp]: Trace formula consists of 255 conjuncts, 41 conjunts are in the unsatisfiable core [2022-07-21 17:51:04,078 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-21 17:51:04,151 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-07-21 17:51:04,272 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-07-21 17:51:04,388 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 5 [2022-07-21 17:51:04,393 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2022-07-21 17:51:04,662 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 17:51:04,664 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-07-21 17:51:04,685 INFO L356 Elim1Store]: treesize reduction 27, result has 25.0 percent of original size [2022-07-21 17:51:04,685 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 16 treesize of output 18 [2022-07-21 17:51:04,703 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 17:51:04,704 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-07-21 17:51:04,798 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 9 [2022-07-21 17:51:04,803 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-07-21 17:51:04,995 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 20 proven. 6 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-07-21 17:51:04,995 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-21 17:51:05,468 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-21 17:51:05,469 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [920452526] [2022-07-21 17:51:05,469 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [920452526] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-21 17:51:05,469 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1233300489] [2022-07-21 17:51:05,469 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 17:51:05,469 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2022-07-21 17:51:05,469 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2022-07-21 17:51:05,470 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2022-07-21 17:51:05,472 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (16)] Waiting until timeout for monitored process [2022-07-21 17:51:05,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 17:51:05,781 INFO L263 TraceCheckSpWp]: Trace formula consists of 255 conjuncts, 43 conjunts are in the unsatisfiable core [2022-07-21 17:51:05,783 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-21 17:51:05,899 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-07-21 17:51:05,904 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-07-21 17:51:06,423 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 14 [2022-07-21 17:51:06,426 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2022-07-21 17:51:06,907 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 17:51:06,908 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 28 [2022-07-21 17:51:06,916 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 17:51:06,917 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-07-21 17:51:06,927 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 17:51:06,928 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-07-21 17:51:06,941 INFO L356 Elim1Store]: treesize reduction 4, result has 66.7 percent of original size [2022-07-21 17:51:06,941 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 18 treesize of output 18 [2022-07-21 17:51:07,053 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-07-21 17:51:07,057 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2022-07-21 17:51:07,281 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 20 proven. 6 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-07-21 17:51:07,281 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-21 17:51:07,582 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1233300489] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-21 17:51:07,582 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-21 17:51:07,582 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17] total 34 [2022-07-21 17:51:07,582 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [486237373] [2022-07-21 17:51:07,582 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-21 17:51:07,583 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 35 states [2022-07-21 17:51:07,583 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-21 17:51:07,583 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2022-07-21 17:51:07,583 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=156, Invalid=1373, Unknown=31, NotChecked=0, Total=1560 [2022-07-21 17:51:07,584 INFO L87 Difference]: Start difference. First operand 110 states and 120 transitions. Second operand has 35 states, 32 states have (on average 2.3125) internal successors, (74), 31 states have internal predecessors, (74), 4 states have call successors, (4), 4 states have call predecessors, (4), 6 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) [2022-07-21 17:51:09,181 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 17:51:09,181 INFO L93 Difference]: Finished difference Result 127 states and 139 transitions. [2022-07-21 17:51:09,182 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-07-21 17:51:09,182 INFO L78 Accepts]: Start accepts. Automaton has has 35 states, 32 states have (on average 2.3125) internal successors, (74), 31 states have internal predecessors, (74), 4 states have call successors, (4), 4 states have call predecessors, (4), 6 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) Word has length 44 [2022-07-21 17:51:09,183 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 17:51:09,183 INFO L225 Difference]: With dead ends: 127 [2022-07-21 17:51:09,183 INFO L226 Difference]: Without dead ends: 127 [2022-07-21 17:51:09,184 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 111 GetRequests, 60 SyntacticMatches, 1 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 709 ImplicationChecksByTransitivity, 2.8s TimeCoverageRelationStatistics Valid=285, Invalid=2322, Unknown=45, NotChecked=0, Total=2652 [2022-07-21 17:51:09,184 INFO L413 NwaCegarLoop]: 87 mSDtfsCounter, 51 mSDsluCounter, 1116 mSDsCounter, 0 mSdLazyCounter, 675 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 51 SdHoareTripleChecker+Valid, 1203 SdHoareTripleChecker+Invalid, 888 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 675 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 202 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-07-21 17:51:09,184 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [51 Valid, 1203 Invalid, 888 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 675 Invalid, 0 Unknown, 202 Unchecked, 0.7s Time] [2022-07-21 17:51:09,185 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 127 states. [2022-07-21 17:51:09,186 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 127 to 110. [2022-07-21 17:51:09,186 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 110 states, 74 states have (on average 1.527027027027027) internal successors, (113), 103 states have internal predecessors, (113), 3 states have call successors, (3), 3 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-07-21 17:51:09,187 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 110 states and 119 transitions. [2022-07-21 17:51:09,187 INFO L78 Accepts]: Start accepts. Automaton has 110 states and 119 transitions. Word has length 44 [2022-07-21 17:51:09,187 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 17:51:09,187 INFO L495 AbstractCegarLoop]: Abstraction has 110 states and 119 transitions. [2022-07-21 17:51:09,187 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 35 states, 32 states have (on average 2.3125) internal successors, (74), 31 states have internal predecessors, (74), 4 states have call successors, (4), 4 states have call predecessors, (4), 6 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) [2022-07-21 17:51:09,187 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 119 transitions. [2022-07-21 17:51:09,188 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2022-07-21 17:51:09,188 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 17:51:09,188 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 17:51:09,192 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (16)] Forceful destruction successful, exit code 0 [2022-07-21 17:51:09,413 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (15)] Forceful destruction successful, exit code 0 [2022-07-21 17:51:09,592 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt,15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-21 17:51:09,592 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 36 more)] === [2022-07-21 17:51:09,592 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 17:51:09,592 INFO L85 PathProgramCache]: Analyzing trace with hash -1890978520, now seen corresponding path program 1 times [2022-07-21 17:51:09,593 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-21 17:51:09,593 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1007292897] [2022-07-21 17:51:09,593 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 17:51:09,593 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-21 17:51:09,593 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-21 17:51:09,595 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) [2022-07-21 17:51:09,596 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (17)] Waiting until timeout for monitored process [2022-07-21 17:51:09,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 17:51:09,728 INFO L263 TraceCheckSpWp]: Trace formula consists of 254 conjuncts, 5 conjunts are in the unsatisfiable core [2022-07-21 17:51:09,729 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-21 17:51:09,757 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2022-07-21 17:51:09,757 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-21 17:51:09,758 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-21 17:51:09,758 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1007292897] [2022-07-21 17:51:09,758 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1007292897] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 17:51:09,758 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 17:51:09,758 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-21 17:51:09,758 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [870259215] [2022-07-21 17:51:09,758 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 17:51:09,759 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-21 17:51:09,759 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-21 17:51:09,759 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-21 17:51:09,760 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-21 17:51:09,760 INFO L87 Difference]: Start difference. First operand 110 states and 119 transitions. Second operand has 4 states, 4 states have (on average 5.5) internal successors, (22), 4 states have internal predecessors, (22), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-07-21 17:51:09,790 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 17:51:09,791 INFO L93 Difference]: Finished difference Result 111 states and 119 transitions. [2022-07-21 17:51:09,798 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-21 17:51:09,798 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.5) internal successors, (22), 4 states have internal predecessors, (22), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 45 [2022-07-21 17:51:09,799 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 17:51:09,800 INFO L225 Difference]: With dead ends: 111 [2022-07-21 17:51:09,800 INFO L226 Difference]: Without dead ends: 111 [2022-07-21 17:51:09,800 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 42 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-07-21 17:51:09,801 INFO L413 NwaCegarLoop]: 91 mSDtfsCounter, 81 mSDsluCounter, 95 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 81 SdHoareTripleChecker+Valid, 186 SdHoareTripleChecker+Invalid, 12 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-21 17:51:09,801 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [81 Valid, 186 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-21 17:51:09,803 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2022-07-21 17:51:09,804 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 110. [2022-07-21 17:51:09,805 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 110 states, 74 states have (on average 1.5135135135135136) internal successors, (112), 103 states have internal predecessors, (112), 3 states have call successors, (3), 3 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-07-21 17:51:09,805 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 110 states and 118 transitions. [2022-07-21 17:51:09,805 INFO L78 Accepts]: Start accepts. Automaton has 110 states and 118 transitions. Word has length 45 [2022-07-21 17:51:09,805 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 17:51:09,806 INFO L495 AbstractCegarLoop]: Abstraction has 110 states and 118 transitions. [2022-07-21 17:51:09,806 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.5) internal successors, (22), 4 states have internal predecessors, (22), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-07-21 17:51:09,806 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 118 transitions. [2022-07-21 17:51:09,809 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2022-07-21 17:51:09,810 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 17:51:09,810 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 17:51:09,818 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (17)] Forceful destruction successful, exit code 0 [2022-07-21 17:51:10,018 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-21 17:51:10,019 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 36 more)] === [2022-07-21 17:51:10,019 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 17:51:10,019 INFO L85 PathProgramCache]: Analyzing trace with hash -457619027, now seen corresponding path program 1 times [2022-07-21 17:51:10,020 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-21 17:51:10,020 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [312346925] [2022-07-21 17:51:10,020 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 17:51:10,020 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-21 17:51:10,020 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-21 17:51:10,022 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) [2022-07-21 17:51:10,023 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (18)] Waiting until timeout for monitored process [2022-07-21 17:51:10,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 17:51:10,172 INFO L263 TraceCheckSpWp]: Trace formula consists of 267 conjuncts, 6 conjunts are in the unsatisfiable core [2022-07-21 17:51:10,173 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-21 17:51:10,212 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2022-07-21 17:51:10,212 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-21 17:51:10,741 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2022-07-21 17:51:10,742 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-21 17:51:10,742 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [312346925] [2022-07-21 17:51:10,742 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [312346925] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-21 17:51:10,742 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-21 17:51:10,742 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 8 [2022-07-21 17:51:10,742 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1148409474] [2022-07-21 17:51:10,742 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-21 17:51:10,742 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-07-21 17:51:10,742 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-21 17:51:10,743 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-07-21 17:51:10,743 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2022-07-21 17:51:10,743 INFO L87 Difference]: Start difference. First operand 110 states and 118 transitions. Second operand has 8 states, 8 states have (on average 5.0) internal successors, (40), 8 states have internal predecessors, (40), 4 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-07-21 17:51:10,780 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 17:51:10,780 INFO L93 Difference]: Finished difference Result 107 states and 114 transitions. [2022-07-21 17:51:10,781 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-21 17:51:10,781 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 5.0) internal successors, (40), 8 states have internal predecessors, (40), 4 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Word has length 47 [2022-07-21 17:51:10,781 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 17:51:10,781 INFO L225 Difference]: With dead ends: 107 [2022-07-21 17:51:10,781 INFO L226 Difference]: Without dead ends: 107 [2022-07-21 17:51:10,782 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 94 GetRequests, 86 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2022-07-21 17:51:10,782 INFO L413 NwaCegarLoop]: 88 mSDtfsCounter, 142 mSDsluCounter, 163 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 142 SdHoareTripleChecker+Valid, 251 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-21 17:51:10,782 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [142 Valid, 251 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-21 17:51:10,783 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2022-07-21 17:51:10,784 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 107. [2022-07-21 17:51:10,784 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 107 states, 73 states have (on average 1.4794520547945205) internal successors, (108), 100 states have internal predecessors, (108), 3 states have call successors, (3), 3 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-07-21 17:51:10,784 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 114 transitions. [2022-07-21 17:51:10,785 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 114 transitions. Word has length 47 [2022-07-21 17:51:10,785 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 17:51:10,785 INFO L495 AbstractCegarLoop]: Abstraction has 107 states and 114 transitions. [2022-07-21 17:51:10,785 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 5.0) internal successors, (40), 8 states have internal predecessors, (40), 4 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-07-21 17:51:10,785 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 114 transitions. [2022-07-21 17:51:10,785 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2022-07-21 17:51:10,785 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 17:51:10,785 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 17:51:10,807 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (18)] Ended with exit code 0 [2022-07-21 17:51:10,986 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 18 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-21 17:51:10,986 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 36 more)] === [2022-07-21 17:51:10,986 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 17:51:10,986 INFO L85 PathProgramCache]: Analyzing trace with hash -1301289572, now seen corresponding path program 1 times [2022-07-21 17:51:10,987 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-21 17:51:10,987 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1207561219] [2022-07-21 17:51:10,987 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 17:51:10,987 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-21 17:51:10,987 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-21 17:51:10,989 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) [2022-07-21 17:51:10,989 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (19)] Waiting until timeout for monitored process [2022-07-21 17:51:11,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 17:51:11,144 INFO L263 TraceCheckSpWp]: Trace formula consists of 266 conjuncts, 3 conjunts are in the unsatisfiable core [2022-07-21 17:51:11,146 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-21 17:51:11,167 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2022-07-21 17:51:11,167 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-21 17:51:11,167 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-21 17:51:11,167 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1207561219] [2022-07-21 17:51:11,167 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1207561219] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 17:51:11,167 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 17:51:11,167 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-21 17:51:11,167 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1628596084] [2022-07-21 17:51:11,167 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 17:51:11,167 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-21 17:51:11,167 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-21 17:51:11,168 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-21 17:51:11,168 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-21 17:51:11,168 INFO L87 Difference]: Start difference. First operand 107 states and 114 transitions. Second operand has 4 states, 3 states have (on average 8.333333333333334) internal successors, (25), 4 states have internal predecessors, (25), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-07-21 17:51:11,333 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 17:51:11,333 INFO L93 Difference]: Finished difference Result 118 states and 126 transitions. [2022-07-21 17:51:11,333 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-21 17:51:11,333 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 8.333333333333334) internal successors, (25), 4 states have internal predecessors, (25), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 48 [2022-07-21 17:51:11,334 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 17:51:11,334 INFO L225 Difference]: With dead ends: 118 [2022-07-21 17:51:11,334 INFO L226 Difference]: Without dead ends: 118 [2022-07-21 17:51:11,334 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 45 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-07-21 17:51:11,335 INFO L413 NwaCegarLoop]: 64 mSDtfsCounter, 63 mSDsluCounter, 81 mSDsCounter, 0 mSdLazyCounter, 77 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 63 SdHoareTripleChecker+Valid, 145 SdHoareTripleChecker+Invalid, 77 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 77 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-21 17:51:11,335 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [63 Valid, 145 Invalid, 77 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 77 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-07-21 17:51:11,335 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 118 states. [2022-07-21 17:51:11,336 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 118 to 106. [2022-07-21 17:51:11,337 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 106 states, 73 states have (on average 1.4657534246575343) internal successors, (107), 99 states have internal predecessors, (107), 3 states have call successors, (3), 3 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-07-21 17:51:11,337 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 113 transitions. [2022-07-21 17:51:11,337 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 113 transitions. Word has length 48 [2022-07-21 17:51:11,337 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 17:51:11,337 INFO L495 AbstractCegarLoop]: Abstraction has 106 states and 113 transitions. [2022-07-21 17:51:11,337 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 8.333333333333334) internal successors, (25), 4 states have internal predecessors, (25), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-07-21 17:51:11,337 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 113 transitions. [2022-07-21 17:51:11,338 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2022-07-21 17:51:11,338 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 17:51:11,338 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 17:51:11,348 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (19)] Forceful destruction successful, exit code 0 [2022-07-21 17:51:11,545 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 19 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-21 17:51:11,546 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 36 more)] === [2022-07-21 17:51:11,546 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 17:51:11,546 INFO L85 PathProgramCache]: Analyzing trace with hash -1301289571, now seen corresponding path program 1 times [2022-07-21 17:51:11,547 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-21 17:51:11,547 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [760410416] [2022-07-21 17:51:11,547 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 17:51:11,547 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-21 17:51:11,547 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-21 17:51:11,548 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) [2022-07-21 17:51:11,550 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (20)] Waiting until timeout for monitored process [2022-07-21 17:51:11,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 17:51:11,726 INFO L263 TraceCheckSpWp]: Trace formula consists of 266 conjuncts, 5 conjunts are in the unsatisfiable core [2022-07-21 17:51:11,727 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-21 17:51:11,777 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2022-07-21 17:51:11,777 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-21 17:51:11,777 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-21 17:51:11,777 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [760410416] [2022-07-21 17:51:11,777 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [760410416] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 17:51:11,778 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 17:51:11,778 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-21 17:51:11,778 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [288392898] [2022-07-21 17:51:11,778 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 17:51:11,778 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-21 17:51:11,778 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-21 17:51:11,779 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-21 17:51:11,779 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-21 17:51:11,779 INFO L87 Difference]: Start difference. First operand 106 states and 113 transitions. Second operand has 4 states, 3 states have (on average 8.333333333333334) internal successors, (25), 4 states have internal predecessors, (25), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-07-21 17:51:11,988 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 17:51:11,989 INFO L93 Difference]: Finished difference Result 105 states and 112 transitions. [2022-07-21 17:51:11,989 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-21 17:51:11,990 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 8.333333333333334) internal successors, (25), 4 states have internal predecessors, (25), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 48 [2022-07-21 17:51:11,990 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 17:51:11,990 INFO L225 Difference]: With dead ends: 105 [2022-07-21 17:51:11,990 INFO L226 Difference]: Without dead ends: 105 [2022-07-21 17:51:11,991 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 45 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-07-21 17:51:11,991 INFO L413 NwaCegarLoop]: 66 mSDtfsCounter, 65 mSDsluCounter, 75 mSDsCounter, 0 mSdLazyCounter, 65 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 65 SdHoareTripleChecker+Valid, 141 SdHoareTripleChecker+Invalid, 65 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 65 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-21 17:51:11,991 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [65 Valid, 141 Invalid, 65 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 65 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-07-21 17:51:11,992 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states. [2022-07-21 17:51:11,993 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 105. [2022-07-21 17:51:11,993 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 105 states, 73 states have (on average 1.452054794520548) internal successors, (106), 98 states have internal predecessors, (106), 3 states have call successors, (3), 3 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-07-21 17:51:11,994 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 112 transitions. [2022-07-21 17:51:11,994 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 112 transitions. Word has length 48 [2022-07-21 17:51:11,994 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 17:51:11,994 INFO L495 AbstractCegarLoop]: Abstraction has 105 states and 112 transitions. [2022-07-21 17:51:11,994 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 8.333333333333334) internal successors, (25), 4 states have internal predecessors, (25), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-07-21 17:51:11,994 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 112 transitions. [2022-07-21 17:51:11,996 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2022-07-21 17:51:11,996 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 17:51:11,996 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 17:51:12,005 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (20)] Forceful destruction successful, exit code 0 [2022-07-21 17:51:12,200 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 20 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-21 17:51:12,201 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 36 more)] === [2022-07-21 17:51:12,201 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 17:51:12,201 INFO L85 PathProgramCache]: Analyzing trace with hash -1301289412, now seen corresponding path program 1 times [2022-07-21 17:51:12,201 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-21 17:51:12,201 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [879375259] [2022-07-21 17:51:12,201 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 17:51:12,202 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-21 17:51:12,202 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-21 17:51:12,203 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) [2022-07-21 17:51:12,204 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (21)] Waiting until timeout for monitored process [2022-07-21 17:51:12,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 17:51:12,349 INFO L263 TraceCheckSpWp]: Trace formula consists of 267 conjuncts, 2 conjunts are in the unsatisfiable core [2022-07-21 17:51:12,350 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-21 17:51:12,362 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2022-07-21 17:51:12,363 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-21 17:51:12,363 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-21 17:51:12,363 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [879375259] [2022-07-21 17:51:12,363 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [879375259] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 17:51:12,363 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 17:51:12,363 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-07-21 17:51:12,363 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [326403457] [2022-07-21 17:51:12,363 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 17:51:12,363 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-21 17:51:12,363 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-21 17:51:12,364 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-21 17:51:12,364 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-21 17:51:12,364 INFO L87 Difference]: Start difference. First operand 105 states and 112 transitions. Second operand has 3 states, 2 states have (on average 12.5) internal successors, (25), 3 states have internal predecessors, (25), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-07-21 17:51:12,447 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 17:51:12,447 INFO L93 Difference]: Finished difference Result 116 states and 124 transitions. [2022-07-21 17:51:12,448 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-21 17:51:12,448 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 12.5) internal successors, (25), 3 states have internal predecessors, (25), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 48 [2022-07-21 17:51:12,448 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 17:51:12,448 INFO L225 Difference]: With dead ends: 116 [2022-07-21 17:51:12,448 INFO L226 Difference]: Without dead ends: 116 [2022-07-21 17:51:12,449 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 46 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-21 17:51:12,449 INFO L413 NwaCegarLoop]: 65 mSDtfsCounter, 60 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 39 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 60 SdHoareTripleChecker+Valid, 87 SdHoareTripleChecker+Invalid, 39 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 39 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-21 17:51:12,449 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [60 Valid, 87 Invalid, 39 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 39 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-21 17:51:12,449 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116 states. [2022-07-21 17:51:12,451 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116 to 104. [2022-07-21 17:51:12,451 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 104 states, 73 states have (on average 1.4383561643835616) internal successors, (105), 97 states have internal predecessors, (105), 3 states have call successors, (3), 3 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-07-21 17:51:12,452 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 111 transitions. [2022-07-21 17:51:12,452 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 111 transitions. Word has length 48 [2022-07-21 17:51:12,452 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 17:51:12,452 INFO L495 AbstractCegarLoop]: Abstraction has 104 states and 111 transitions. [2022-07-21 17:51:12,452 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 12.5) internal successors, (25), 3 states have internal predecessors, (25), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-07-21 17:51:12,452 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 111 transitions. [2022-07-21 17:51:12,452 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2022-07-21 17:51:12,453 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 17:51:12,453 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 17:51:12,463 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (21)] Forceful destruction successful, exit code 0 [2022-07-21 17:51:12,653 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 21 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-21 17:51:12,653 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 36 more)] === [2022-07-21 17:51:12,654 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 17:51:12,654 INFO L85 PathProgramCache]: Analyzing trace with hash -1301289411, now seen corresponding path program 1 times [2022-07-21 17:51:12,654 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-21 17:51:12,654 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1894823884] [2022-07-21 17:51:12,654 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 17:51:12,655 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-21 17:51:12,655 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-21 17:51:12,656 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) [2022-07-21 17:51:12,657 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (22)] Waiting until timeout for monitored process [2022-07-21 17:51:12,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 17:51:12,798 INFO L263 TraceCheckSpWp]: Trace formula consists of 267 conjuncts, 5 conjunts are in the unsatisfiable core [2022-07-21 17:51:12,799 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-21 17:51:12,856 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2022-07-21 17:51:12,857 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-21 17:51:12,857 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-21 17:51:12,857 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1894823884] [2022-07-21 17:51:12,857 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1894823884] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 17:51:12,857 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 17:51:12,857 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-21 17:51:12,857 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2136675463] [2022-07-21 17:51:12,857 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 17:51:12,857 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-21 17:51:12,857 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-21 17:51:12,858 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-21 17:51:12,858 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-07-21 17:51:12,858 INFO L87 Difference]: Start difference. First operand 104 states and 111 transitions. Second operand has 5 states, 4 states have (on average 6.25) internal successors, (25), 5 states have internal predecessors, (25), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-07-21 17:51:12,969 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 17:51:12,969 INFO L93 Difference]: Finished difference Result 103 states and 110 transitions. [2022-07-21 17:51:12,969 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-07-21 17:51:12,970 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 6.25) internal successors, (25), 5 states have internal predecessors, (25), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 48 [2022-07-21 17:51:12,970 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 17:51:12,970 INFO L225 Difference]: With dead ends: 103 [2022-07-21 17:51:12,970 INFO L226 Difference]: Without dead ends: 103 [2022-07-21 17:51:12,970 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 44 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2022-07-21 17:51:12,971 INFO L413 NwaCegarLoop]: 65 mSDtfsCounter, 138 mSDsluCounter, 41 mSDsCounter, 0 mSdLazyCounter, 34 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 138 SdHoareTripleChecker+Valid, 106 SdHoareTripleChecker+Invalid, 35 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 34 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-21 17:51:12,971 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [138 Valid, 106 Invalid, 35 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 34 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-21 17:51:12,971 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2022-07-21 17:51:12,975 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 103. [2022-07-21 17:51:12,975 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 103 states, 73 states have (on average 1.4246575342465753) internal successors, (104), 96 states have internal predecessors, (104), 3 states have call successors, (3), 3 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-07-21 17:51:12,976 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 110 transitions. [2022-07-21 17:51:12,976 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 110 transitions. Word has length 48 [2022-07-21 17:51:12,976 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 17:51:12,976 INFO L495 AbstractCegarLoop]: Abstraction has 103 states and 110 transitions. [2022-07-21 17:51:12,976 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 6.25) internal successors, (25), 5 states have internal predecessors, (25), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-07-21 17:51:12,976 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 110 transitions. [2022-07-21 17:51:12,977 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2022-07-21 17:51:12,977 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 17:51:12,977 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 17:51:12,987 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (22)] Forceful destruction successful, exit code 0 [2022-07-21 17:51:13,185 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 22 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-21 17:51:13,185 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 36 more)] === [2022-07-21 17:51:13,185 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 17:51:13,186 INFO L85 PathProgramCache]: Analyzing trace with hash -1685271039, now seen corresponding path program 1 times [2022-07-21 17:51:13,186 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-21 17:51:13,186 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1986402997] [2022-07-21 17:51:13,186 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 17:51:13,186 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-21 17:51:13,186 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-21 17:51:13,187 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) [2022-07-21 17:51:13,189 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (23)] Waiting until timeout for monitored process [2022-07-21 17:51:13,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 17:51:13,359 INFO L263 TraceCheckSpWp]: Trace formula consists of 279 conjuncts, 6 conjunts are in the unsatisfiable core [2022-07-21 17:51:13,360 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-21 17:51:13,371 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-07-21 17:51:13,405 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2022-07-21 17:51:13,406 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-21 17:51:13,406 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-21 17:51:13,406 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1986402997] [2022-07-21 17:51:13,406 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1986402997] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 17:51:13,406 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 17:51:13,406 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-07-21 17:51:13,406 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [867592111] [2022-07-21 17:51:13,406 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 17:51:13,406 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-21 17:51:13,407 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-21 17:51:13,407 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-21 17:51:13,407 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-21 17:51:13,407 INFO L87 Difference]: Start difference. First operand 103 states and 110 transitions. Second operand has 6 states, 5 states have (on average 6.4) internal successors, (32), 5 states have internal predecessors, (32), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-07-21 17:51:13,681 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 17:51:13,682 INFO L93 Difference]: Finished difference Result 114 states and 122 transitions. [2022-07-21 17:51:13,682 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-07-21 17:51:13,682 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 6.4) internal successors, (32), 5 states have internal predecessors, (32), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 49 [2022-07-21 17:51:13,682 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 17:51:13,683 INFO L225 Difference]: With dead ends: 114 [2022-07-21 17:51:13,683 INFO L226 Difference]: Without dead ends: 114 [2022-07-21 17:51:13,683 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 44 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-07-21 17:51:13,683 INFO L413 NwaCegarLoop]: 58 mSDtfsCounter, 59 mSDsluCounter, 167 mSDsCounter, 0 mSdLazyCounter, 156 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 59 SdHoareTripleChecker+Valid, 225 SdHoareTripleChecker+Invalid, 156 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 156 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-07-21 17:51:13,683 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [59 Valid, 225 Invalid, 156 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 156 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-07-21 17:51:13,684 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114 states. [2022-07-21 17:51:13,685 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114 to 102. [2022-07-21 17:51:13,685 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 102 states, 73 states have (on average 1.4109589041095891) internal successors, (103), 95 states have internal predecessors, (103), 3 states have call successors, (3), 3 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-07-21 17:51:13,685 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 109 transitions. [2022-07-21 17:51:13,685 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 109 transitions. Word has length 49 [2022-07-21 17:51:13,685 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 17:51:13,686 INFO L495 AbstractCegarLoop]: Abstraction has 102 states and 109 transitions. [2022-07-21 17:51:13,686 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 6.4) internal successors, (32), 5 states have internal predecessors, (32), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-07-21 17:51:13,686 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 109 transitions. [2022-07-21 17:51:13,686 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2022-07-21 17:51:13,686 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 17:51:13,686 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 17:51:13,698 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (23)] Forceful destruction successful, exit code 0 [2022-07-21 17:51:13,886 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 23 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-21 17:51:13,887 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 36 more)] === [2022-07-21 17:51:13,887 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 17:51:13,887 INFO L85 PathProgramCache]: Analyzing trace with hash -1685271038, now seen corresponding path program 1 times [2022-07-21 17:51:13,888 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-21 17:51:13,888 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1826865267] [2022-07-21 17:51:13,888 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 17:51:13,888 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-21 17:51:13,888 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-21 17:51:13,890 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) [2022-07-21 17:51:13,891 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (24)] Waiting until timeout for monitored process [2022-07-21 17:51:14,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 17:51:14,056 INFO L263 TraceCheckSpWp]: Trace formula consists of 279 conjuncts, 10 conjunts are in the unsatisfiable core [2022-07-21 17:51:14,062 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-21 17:51:14,066 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-07-21 17:51:14,137 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2022-07-21 17:51:14,138 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-21 17:51:14,138 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-21 17:51:14,138 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1826865267] [2022-07-21 17:51:14,138 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1826865267] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 17:51:14,138 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 17:51:14,138 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-07-21 17:51:14,138 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1327324682] [2022-07-21 17:51:14,138 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 17:51:14,138 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-21 17:51:14,138 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-21 17:51:14,139 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-21 17:51:14,139 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-21 17:51:14,139 INFO L87 Difference]: Start difference. First operand 102 states and 109 transitions. Second operand has 6 states, 5 states have (on average 6.4) internal successors, (32), 5 states have internal predecessors, (32), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-07-21 17:51:14,369 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 17:51:14,370 INFO L93 Difference]: Finished difference Result 101 states and 108 transitions. [2022-07-21 17:51:14,370 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-07-21 17:51:14,370 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 6.4) internal successors, (32), 5 states have internal predecessors, (32), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 49 [2022-07-21 17:51:14,370 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 17:51:14,371 INFO L225 Difference]: With dead ends: 101 [2022-07-21 17:51:14,371 INFO L226 Difference]: Without dead ends: 101 [2022-07-21 17:51:14,371 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 44 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-07-21 17:51:14,371 INFO L413 NwaCegarLoop]: 60 mSDtfsCounter, 61 mSDsluCounter, 168 mSDsCounter, 0 mSdLazyCounter, 135 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 61 SdHoareTripleChecker+Valid, 228 SdHoareTripleChecker+Invalid, 135 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 135 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-21 17:51:14,372 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [61 Valid, 228 Invalid, 135 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 135 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-07-21 17:51:14,372 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2022-07-21 17:51:14,373 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 101. [2022-07-21 17:51:14,373 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 101 states, 73 states have (on average 1.3972602739726028) internal successors, (102), 94 states have internal predecessors, (102), 3 states have call successors, (3), 3 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-07-21 17:51:14,373 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 108 transitions. [2022-07-21 17:51:14,373 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 108 transitions. Word has length 49 [2022-07-21 17:51:14,374 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 17:51:14,374 INFO L495 AbstractCegarLoop]: Abstraction has 101 states and 108 transitions. [2022-07-21 17:51:14,374 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 6.4) internal successors, (32), 5 states have internal predecessors, (32), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-07-21 17:51:14,374 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 108 transitions. [2022-07-21 17:51:14,374 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2022-07-21 17:51:14,374 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 17:51:14,374 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 17:51:14,386 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (24)] Forceful destruction successful, exit code 0 [2022-07-21 17:51:14,582 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 24 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-21 17:51:14,582 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 36 more)] === [2022-07-21 17:51:14,582 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 17:51:14,582 INFO L85 PathProgramCache]: Analyzing trace with hash -342796830, now seen corresponding path program 1 times [2022-07-21 17:51:14,583 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-21 17:51:14,583 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1461128204] [2022-07-21 17:51:14,583 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 17:51:14,583 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-21 17:51:14,583 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-21 17:51:14,584 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) [2022-07-21 17:51:14,586 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (25)] Waiting until timeout for monitored process [2022-07-21 17:51:14,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 17:51:14,810 INFO L263 TraceCheckSpWp]: Trace formula consists of 293 conjuncts, 4 conjunts are in the unsatisfiable core [2022-07-21 17:51:14,811 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-21 17:51:14,835 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2022-07-21 17:51:14,835 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-21 17:51:14,835 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-21 17:51:14,835 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1461128204] [2022-07-21 17:51:14,836 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1461128204] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 17:51:14,836 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 17:51:14,836 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-21 17:51:14,836 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [692583456] [2022-07-21 17:51:14,836 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 17:51:14,838 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-21 17:51:14,838 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-21 17:51:14,838 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-21 17:51:14,838 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-21 17:51:14,838 INFO L87 Difference]: Start difference. First operand 101 states and 108 transitions. Second operand has 4 states, 3 states have (on average 9.333333333333334) internal successors, (28), 4 states have internal predecessors, (28), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-07-21 17:51:14,937 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 17:51:14,937 INFO L93 Difference]: Finished difference Result 112 states and 120 transitions. [2022-07-21 17:51:14,937 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-21 17:51:14,938 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 9.333333333333334) internal successors, (28), 4 states have internal predecessors, (28), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 51 [2022-07-21 17:51:14,938 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 17:51:14,938 INFO L225 Difference]: With dead ends: 112 [2022-07-21 17:51:14,938 INFO L226 Difference]: Without dead ends: 112 [2022-07-21 17:51:14,939 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-07-21 17:51:14,939 INFO L413 NwaCegarLoop]: 62 mSDtfsCounter, 129 mSDsluCounter, 38 mSDsCounter, 0 mSdLazyCounter, 44 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 129 SdHoareTripleChecker+Valid, 100 SdHoareTripleChecker+Invalid, 46 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 44 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-21 17:51:14,939 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [129 Valid, 100 Invalid, 46 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 44 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-21 17:51:14,940 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2022-07-21 17:51:14,942 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 100. [2022-07-21 17:51:14,943 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 100 states, 73 states have (on average 1.3835616438356164) internal successors, (101), 93 states have internal predecessors, (101), 3 states have call successors, (3), 3 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-07-21 17:51:14,944 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 107 transitions. [2022-07-21 17:51:14,944 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 107 transitions. Word has length 51 [2022-07-21 17:51:14,944 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 17:51:14,944 INFO L495 AbstractCegarLoop]: Abstraction has 100 states and 107 transitions. [2022-07-21 17:51:14,944 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 9.333333333333334) internal successors, (28), 4 states have internal predecessors, (28), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-07-21 17:51:14,944 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 107 transitions. [2022-07-21 17:51:14,945 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2022-07-21 17:51:14,945 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 17:51:14,945 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 17:51:14,955 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (25)] Forceful destruction successful, exit code 0 [2022-07-21 17:51:15,155 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 25 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-21 17:51:15,156 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 36 more)] === [2022-07-21 17:51:15,156 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 17:51:15,156 INFO L85 PathProgramCache]: Analyzing trace with hash -342796829, now seen corresponding path program 1 times [2022-07-21 17:51:15,157 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-21 17:51:15,157 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [897739654] [2022-07-21 17:51:15,157 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 17:51:15,157 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-21 17:51:15,158 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-21 17:51:15,159 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) [2022-07-21 17:51:15,160 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (26)] Waiting until timeout for monitored process [2022-07-21 17:51:15,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 17:51:15,353 INFO L263 TraceCheckSpWp]: Trace formula consists of 293 conjuncts, 7 conjunts are in the unsatisfiable core [2022-07-21 17:51:15,354 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-21 17:51:15,463 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2022-07-21 17:51:15,463 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-21 17:51:15,463 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-21 17:51:15,463 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [897739654] [2022-07-21 17:51:15,463 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [897739654] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 17:51:15,463 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 17:51:15,463 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-21 17:51:15,463 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1383295605] [2022-07-21 17:51:15,463 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 17:51:15,463 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-21 17:51:15,464 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-21 17:51:15,464 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-21 17:51:15,464 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-07-21 17:51:15,464 INFO L87 Difference]: Start difference. First operand 100 states and 107 transitions. Second operand has 5 states, 4 states have (on average 7.0) internal successors, (28), 5 states have internal predecessors, (28), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-07-21 17:51:15,577 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 17:51:15,577 INFO L93 Difference]: Finished difference Result 98 states and 105 transitions. [2022-07-21 17:51:15,577 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-07-21 17:51:15,577 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 7.0) internal successors, (28), 5 states have internal predecessors, (28), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 51 [2022-07-21 17:51:15,578 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 17:51:15,578 INFO L225 Difference]: With dead ends: 98 [2022-07-21 17:51:15,578 INFO L226 Difference]: Without dead ends: 98 [2022-07-21 17:51:15,578 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 47 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2022-07-21 17:51:15,578 INFO L413 NwaCegarLoop]: 63 mSDtfsCounter, 117 mSDsluCounter, 34 mSDsCounter, 0 mSdLazyCounter, 33 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 117 SdHoareTripleChecker+Valid, 97 SdHoareTripleChecker+Invalid, 36 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 33 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-21 17:51:15,579 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [117 Valid, 97 Invalid, 36 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 33 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-21 17:51:15,579 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2022-07-21 17:51:15,580 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 98. [2022-07-21 17:51:15,581 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 98 states, 73 states have (on average 1.356164383561644) internal successors, (99), 91 states have internal predecessors, (99), 3 states have call successors, (3), 3 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-07-21 17:51:15,581 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 105 transitions. [2022-07-21 17:51:15,581 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 105 transitions. Word has length 51 [2022-07-21 17:51:15,581 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 17:51:15,581 INFO L495 AbstractCegarLoop]: Abstraction has 98 states and 105 transitions. [2022-07-21 17:51:15,581 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 7.0) internal successors, (28), 5 states have internal predecessors, (28), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-07-21 17:51:15,581 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 105 transitions. [2022-07-21 17:51:15,581 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2022-07-21 17:51:15,581 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 17:51:15,582 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 17:51:15,590 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (26)] Forceful destruction successful, exit code 0 [2022-07-21 17:51:15,787 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 26 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-21 17:51:15,788 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr18REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 36 more)] === [2022-07-21 17:51:15,788 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 17:51:15,788 INFO L85 PathProgramCache]: Analyzing trace with hash 1171904341, now seen corresponding path program 1 times [2022-07-21 17:51:15,789 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-21 17:51:15,789 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1791851195] [2022-07-21 17:51:15,789 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 17:51:15,789 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-21 17:51:15,789 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-21 17:51:15,790 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) [2022-07-21 17:51:15,791 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (27)] Waiting until timeout for monitored process [2022-07-21 17:51:16,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 17:51:16,082 INFO L263 TraceCheckSpWp]: Trace formula consists of 303 conjuncts, 33 conjunts are in the unsatisfiable core [2022-07-21 17:51:16,084 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-21 17:51:16,272 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-07-21 17:51:16,412 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 8 [2022-07-21 17:51:16,554 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_51 (_ BitVec 32))) (and (not (= v_arrayElimCell_51 (_ bv0 32))) (bvult v_arrayElimCell_51 |c_#StackHeapBarrier|))) (exists ((v_ArrVal_1354 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_node_create_~temp~0#1.base| v_ArrVal_1354))) (not (= |c_#StackHeapBarrier| (_ bv4294967295 32))) (bvult |c_node_create_~temp~0#1.base| |c_#StackHeapBarrier|)) is different from true [2022-07-21 17:51:16,735 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 17:51:16,737 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 22 [2022-07-21 17:51:17,245 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-21 17:51:17,245 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 27 [2022-07-21 17:51:17,342 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 17:51:17,343 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 22 [2022-07-21 17:51:17,441 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2022-07-21 17:51:17,604 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 19 proven. 6 refuted. 0 times theorem prover too weak. 3 trivial. 2 not checked. [2022-07-21 17:51:17,605 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-21 17:51:17,732 WARN L833 $PredicateComparison]: unable to prove that (and (not (= (_ bv0 32) |c_ULTIMATE.start_main_~mid_index~0#1|)) (forall ((v_ArrVal_1357 (Array (_ BitVec 32) (_ BitVec 32)))) (not (= (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_insert_~new_node~0#1.base| v_ArrVal_1357) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) (_ bv0 32))))) is different from false [2022-07-21 17:51:17,742 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_1357 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1356 (Array (_ BitVec 32) (_ BitVec 32)))) (not (= (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_insert_~snd_to_last~0#1.base| v_ArrVal_1356) |c_ULTIMATE.start_sll_insert_~new_node~0#1.base| v_ArrVal_1357) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) (_ bv0 32)))) (not (= (_ bv0 32) |c_ULTIMATE.start_main_~mid_index~0#1|))) is different from false [2022-07-21 17:51:17,761 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_1357 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1356 (Array (_ BitVec 32) (_ BitVec 32)))) (not (= (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_insert_~last~0#1.base| v_ArrVal_1356) |c_ULTIMATE.start_sll_insert_~new_node~0#1.base| v_ArrVal_1357) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) (_ bv0 32)))) (not (= (_ bv0 32) |c_ULTIMATE.start_main_~mid_index~0#1|))) is different from false [2022-07-21 17:51:17,768 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_1357 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1356 (Array (_ BitVec 32) (_ BitVec 32)))) (not (= (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_insert_#t~mem8#1.base| v_ArrVal_1356) |c_ULTIMATE.start_sll_insert_~new_node~0#1.base| v_ArrVal_1357) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) (_ bv0 32)))) (not (= (_ bv0 32) |c_ULTIMATE.start_main_~mid_index~0#1|))) is different from false [2022-07-21 17:51:17,774 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_1357 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1356 (Array (_ BitVec 32) (_ BitVec 32)))) (not (= (select (select (store (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_insert_~head#1.base|) |c_ULTIMATE.start_sll_insert_~head#1.offset|) v_ArrVal_1356) |c_ULTIMATE.start_sll_insert_~new_node~0#1.base| v_ArrVal_1357) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) (_ bv0 32)))) (not (= (_ bv0 32) |c_ULTIMATE.start_main_~mid_index~0#1|))) is different from false [2022-07-21 17:51:17,782 WARN L833 $PredicateComparison]: unable to prove that (and (not (= (_ bv0 32) |c_ULTIMATE.start_main_~mid_index~0#1|)) (forall ((v_ArrVal_1357 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1356 (Array (_ BitVec 32) (_ BitVec 32)))) (not (= (select (select (store (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_insert_~head#1.base|) |c_ULTIMATE.start_sll_insert_~head#1.offset|) v_ArrVal_1356) |c_ULTIMATE.start_sll_insert_#t~ret7#1.base| v_ArrVal_1357) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) (_ bv0 32))))) is different from false [2022-07-21 17:51:17,964 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-21 17:51:17,965 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1791851195] [2022-07-21 17:51:17,965 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1791851195] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-21 17:51:17,965 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1867508365] [2022-07-21 17:51:17,965 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 17:51:17,965 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2022-07-21 17:51:17,965 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2022-07-21 17:51:17,980 INFO L229 MonitoredProcess]: Starting monitored process 28 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2022-07-21 17:51:17,981 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (28)] Waiting until timeout for monitored process [2022-07-21 17:51:18,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 17:51:18,376 INFO L263 TraceCheckSpWp]: Trace formula consists of 303 conjuncts, 39 conjunts are in the unsatisfiable core [2022-07-21 17:51:18,379 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-21 17:51:18,429 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 17:51:18,430 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 14 [2022-07-21 17:51:18,718 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 14 [2022-07-21 17:51:18,909 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 14 [2022-07-21 17:51:19,265 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 14 [2022-07-21 17:51:19,955 INFO L356 Elim1Store]: treesize reduction 4, result has 66.7 percent of original size [2022-07-21 17:51:19,955 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 15 treesize of output 15 [2022-07-21 17:51:20,167 INFO L356 Elim1Store]: treesize reduction 19, result has 47.2 percent of original size [2022-07-21 17:51:20,167 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 30 treesize of output 34 [2022-07-21 17:51:20,414 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 17:51:20,441 INFO L356 Elim1Store]: treesize reduction 19, result has 32.1 percent of original size [2022-07-21 17:51:20,441 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 37 treesize of output 45 [2022-07-21 17:51:20,447 WARN L319 FreeRefinementEngine]: Global settings require throwing the following exception [2022-07-21 17:51:20,452 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (28)] Forceful destruction successful, exit code 0 [2022-07-21 17:51:20,657 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (27)] Ended with exit code 0 [2022-07-21 17:51:20,847 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 28 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt,27 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-21 17:51:20,848 FATAL L? ?]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction has thrown an exception: java.lang.AssertionError: Should have been eliminated by DER at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.arrays.DerPreprocessor.(DerPreprocessor.java:113) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.arrays.ElimStorePlain.applyComplexEliminationRules(ElimStorePlain.java:353) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.DualJunctionSaa.tryToEliminate(DualJunctionSaa.java:190) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.DualJunctionSaa.tryToEliminateOne3(DualJunctionSaa.java:172) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.DualJunctionSaa.tryToEliminateOne2(DualJunctionSaa.java:151) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.DualJunctionSaa.tryToEliminateOne1(DualJunctionSaa.java:140) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.DualJunctionSaa.tryToEliminateOne0(DualJunctionSaa.java:124) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.DualJunctionSaa.tryToEliminateOne(DualJunctionSaa.java:108) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.DualJunctionSaa.tryExhaustivelyToEliminate(DualJunctionSaa.java:93) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.DualJunctionSaa.tryToEliminate(DualJunctionSaa.java:88) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.tryToEliminateOne(QuantifierPusher.java:764) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.applyNewEliminationTechniquesExhaustively(QuantifierPusher.java:725) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.applyDualJunctionEliminationTechniques(QuantifierPusher.java:643) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.tryToPushOverDualFiniteConnective(QuantifierPusher.java:335) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.convert(QuantifierPushTermWalker.java:176) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.convert(QuantifierPushTermWalker.java:1) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine$ApplicationTermTask.doStep(TermContextTransformationEngine.java:169) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine.transform(TermContextTransformationEngine.java:77) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine.transform(TermContextTransformationEngine.java:61) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.eliminate(QuantifierPushTermWalker.java:265) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.eliminate(QuantifierPushTermWalker.java:251) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.PartialQuantifierElimination.eliminate(PartialQuantifierElimination.java:90) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer$QuantifierEliminationPostprocessor.postprocess(IterativePredicateTransformer.java:238) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer.applyPostprocessors(IterativePredicateTransformer.java:420) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer.computeStrongestPostconditionSequence(IterativePredicateTransformer.java:199) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.computeInterpolantsUsingUnsatCore(TraceCheckSpWp.java:299) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.computeInterpolants(TraceCheckSpWp.java:185) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.(TraceCheckSpWp.java:163) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSpWp.construct(IpTcStrategyModuleSpWp.java:108) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSpWp.construct(IpTcStrategyModuleSpWp.java:1) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:266) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:147) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:248) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:409) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:300) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseSequentialProgram(TraceAbstractionStarter.java:260) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:173) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:152) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:123) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2022-07-21 17:51:20,850 INFO L158 Benchmark]: Toolchain (without parser) took 66510.53ms. Allocated memory was 65.0MB in the beginning and 109.1MB in the end (delta: 44.0MB). Free memory was 44.1MB in the beginning and 32.8MB in the end (delta: 11.3MB). Peak memory consumption was 55.2MB. Max. memory is 16.1GB. [2022-07-21 17:51:20,850 INFO L158 Benchmark]: CDTParser took 0.21ms. Allocated memory is still 65.0MB. Free memory was 47.1MB in the beginning and 47.1MB in the end (delta: 49.4kB). There was no memory consumed. Max. memory is 16.1GB. [2022-07-21 17:51:20,850 INFO L158 Benchmark]: CACSL2BoogieTranslator took 386.17ms. Allocated memory is still 65.0MB. Free memory was 44.0MB in the beginning and 39.3MB in the end (delta: 4.7MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2022-07-21 17:51:20,850 INFO L158 Benchmark]: Boogie Procedure Inliner took 48.77ms. Allocated memory is still 65.0MB. Free memory was 39.1MB in the beginning and 36.8MB in the end (delta: 2.3MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2022-07-21 17:51:20,851 INFO L158 Benchmark]: Boogie Preprocessor took 46.56ms. Allocated memory is still 65.0MB. Free memory was 36.8MB in the beginning and 34.9MB in the end (delta: 1.9MB). There was no memory consumed. Max. memory is 16.1GB. [2022-07-21 17:51:20,851 INFO L158 Benchmark]: RCFGBuilder took 646.01ms. Allocated memory was 65.0MB in the beginning and 90.2MB in the end (delta: 25.2MB). Free memory was 34.7MB in the beginning and 55.4MB in the end (delta: -20.7MB). Peak memory consumption was 6.4MB. Max. memory is 16.1GB. [2022-07-21 17:51:20,852 INFO L158 Benchmark]: TraceAbstraction took 65377.97ms. Allocated memory was 90.2MB in the beginning and 109.1MB in the end (delta: 18.9MB). Free memory was 54.7MB in the beginning and 32.8MB in the end (delta: 21.9MB). Peak memory consumption was 41.5MB. Max. memory is 16.1GB. [2022-07-21 17:51:20,856 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.21ms. Allocated memory is still 65.0MB. Free memory was 47.1MB in the beginning and 47.1MB in the end (delta: 49.4kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 386.17ms. Allocated memory is still 65.0MB. Free memory was 44.0MB in the beginning and 39.3MB in the end (delta: 4.7MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 48.77ms. Allocated memory is still 65.0MB. Free memory was 39.1MB in the beginning and 36.8MB in the end (delta: 2.3MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 46.56ms. Allocated memory is still 65.0MB. Free memory was 36.8MB in the beginning and 34.9MB in the end (delta: 1.9MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 646.01ms. Allocated memory was 65.0MB in the beginning and 90.2MB in the end (delta: 25.2MB). Free memory was 34.7MB in the beginning and 55.4MB in the end (delta: -20.7MB). Peak memory consumption was 6.4MB. Max. memory is 16.1GB. * TraceAbstraction took 65377.97ms. Allocated memory was 90.2MB in the beginning and 109.1MB in the end (delta: 18.9MB). Free memory was 54.7MB in the beginning and 32.8MB in the end (delta: 21.9MB). Peak memory consumption was 41.5MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: AssertionError: Should have been eliminated by DER de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: AssertionError: Should have been eliminated by DER: de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.arrays.DerPreprocessor.(DerPreprocessor.java:113) RESULT: Ultimate could not prove your program: Toolchain returned no result. [2022-07-21 17:51:20,894 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: ERROR: ExceptionOrErrorResult: AssertionError: Should have been eliminated by DER