./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/list-simple/dll2n_update_all_reverse.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version c3fed411 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/dll2n_update_all_reverse.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 cab0e4c46b209be0775136f8613c1e239028ef0244464c17ac04057ecb0a0b33 --- Real Ultimate output --- This is Ultimate 0.2.2-tmp.no-commuhash-c3fed41 [2021-12-16 06:04:27,749 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-12-16 06:04:27,752 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-12-16 06:04:27,824 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-12-16 06:04:27,825 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-12-16 06:04:27,826 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-12-16 06:04:27,827 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-12-16 06:04:27,831 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-12-16 06:04:27,833 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-12-16 06:04:27,834 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-12-16 06:04:27,835 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-12-16 06:04:27,836 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-12-16 06:04:27,838 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-12-16 06:04:27,840 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-12-16 06:04:27,842 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-12-16 06:04:27,844 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-12-16 06:04:27,848 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-12-16 06:04:27,853 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-12-16 06:04:27,855 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-12-16 06:04:27,856 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-12-16 06:04:27,862 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-12-16 06:04:27,863 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-12-16 06:04:27,864 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-12-16 06:04:27,865 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-12-16 06:04:27,868 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-12-16 06:04:27,872 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-12-16 06:04:27,872 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-12-16 06:04:27,873 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-12-16 06:04:27,874 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-12-16 06:04:27,875 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-12-16 06:04:27,875 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-12-16 06:04:27,876 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-12-16 06:04:27,877 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-12-16 06:04:27,878 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-12-16 06:04:27,879 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-12-16 06:04:27,880 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-12-16 06:04:27,881 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-12-16 06:04:27,881 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-12-16 06:04:27,881 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-12-16 06:04:27,882 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-12-16 06:04:27,882 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-12-16 06:04:27,883 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2021-12-16 06:04:27,908 INFO L113 SettingsManager]: Loading preferences was successful [2021-12-16 06:04:27,909 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-12-16 06:04:27,910 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-12-16 06:04:27,910 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-12-16 06:04:27,911 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2021-12-16 06:04:27,911 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2021-12-16 06:04:27,911 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-12-16 06:04:27,912 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-12-16 06:04:27,912 INFO L138 SettingsManager]: * Use SBE=true [2021-12-16 06:04:27,912 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-12-16 06:04:27,913 INFO L138 SettingsManager]: * sizeof long=4 [2021-12-16 06:04:27,913 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2021-12-16 06:04:27,913 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-12-16 06:04:27,913 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-12-16 06:04:27,914 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-12-16 06:04:27,914 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2021-12-16 06:04:27,914 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2021-12-16 06:04:27,914 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2021-12-16 06:04:27,914 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-12-16 06:04:27,915 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2021-12-16 06:04:27,915 INFO L138 SettingsManager]: * sizeof long double=12 [2021-12-16 06:04:27,915 INFO L138 SettingsManager]: * Use constant arrays=true [2021-12-16 06:04:27,915 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-12-16 06:04:27,915 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-12-16 06:04:27,916 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-12-16 06:04:27,916 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-12-16 06:04:27,916 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-12-16 06:04:27,916 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-12-16 06:04:27,917 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-12-16 06:04:27,917 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-12-16 06:04:27,917 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-12-16 06:04:27,917 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 -> cab0e4c46b209be0775136f8613c1e239028ef0244464c17ac04057ecb0a0b33 [2021-12-16 06:04:28,154 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-12-16 06:04:28,173 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-12-16 06:04:28,176 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-12-16 06:04:28,177 INFO L271 PluginConnector]: Initializing CDTParser... [2021-12-16 06:04:28,178 INFO L275 PluginConnector]: CDTParser initialized [2021-12-16 06:04:28,179 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/list-simple/dll2n_update_all_reverse.i [2021-12-16 06:04:28,233 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c3820fcc5/b24b1c26b0d04c83b821c47f27950df3/FLAGc3ecc79f5 [2021-12-16 06:04:28,701 INFO L306 CDTParser]: Found 1 translation units. [2021-12-16 06:04:28,702 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/list-simple/dll2n_update_all_reverse.i [2021-12-16 06:04:28,715 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c3820fcc5/b24b1c26b0d04c83b821c47f27950df3/FLAGc3ecc79f5 [2021-12-16 06:04:28,728 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c3820fcc5/b24b1c26b0d04c83b821c47f27950df3 [2021-12-16 06:04:28,730 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-12-16 06:04:28,731 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-12-16 06:04:28,732 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-12-16 06:04:28,733 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-12-16 06:04:28,736 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-12-16 06:04:28,737 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.12 06:04:28" (1/1) ... [2021-12-16 06:04:28,738 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@540591ba and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 06:04:28, skipping insertion in model container [2021-12-16 06:04:28,738 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.12 06:04:28" (1/1) ... [2021-12-16 06:04:28,743 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-12-16 06:04:28,774 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-12-16 06:04:29,052 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/dll2n_update_all_reverse.i[24473,24486] [2021-12-16 06:04:29,061 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-12-16 06:04:29,074 INFO L203 MainTranslator]: Completed pre-run [2021-12-16 06:04:29,114 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/dll2n_update_all_reverse.i[24473,24486] [2021-12-16 06:04:29,114 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-12-16 06:04:29,143 INFO L208 MainTranslator]: Completed translation [2021-12-16 06:04:29,143 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 06:04:29 WrapperNode [2021-12-16 06:04:29,144 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-12-16 06:04:29,145 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-12-16 06:04:29,145 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-12-16 06:04:29,145 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-12-16 06:04:29,150 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 06:04:29" (1/1) ... [2021-12-16 06:04:29,161 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 06:04:29" (1/1) ... [2021-12-16 06:04:29,192 INFO L137 Inliner]: procedures = 126, calls = 27, calls flagged for inlining = 6, calls inlined = 6, statements flattened = 114 [2021-12-16 06:04:29,193 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-12-16 06:04:29,194 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-12-16 06:04:29,194 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-12-16 06:04:29,194 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-12-16 06:04:29,201 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 06:04:29" (1/1) ... [2021-12-16 06:04:29,202 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 06:04:29" (1/1) ... [2021-12-16 06:04:29,219 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 06:04:29" (1/1) ... [2021-12-16 06:04:29,230 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 06:04:29" (1/1) ... [2021-12-16 06:04:29,239 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 06:04:29" (1/1) ... [2021-12-16 06:04:29,254 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 06:04:29" (1/1) ... [2021-12-16 06:04:29,255 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 06:04:29" (1/1) ... [2021-12-16 06:04:29,258 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-12-16 06:04:29,265 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-12-16 06:04:29,266 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-12-16 06:04:29,266 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-12-16 06:04:29,267 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 06:04:29" (1/1) ... [2021-12-16 06:04:29,274 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-12-16 06:04:29,284 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-16 06:04:29,301 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2021-12-16 06:04:29,322 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2021-12-16 06:04:29,342 INFO L130 BoogieDeclarations]: Found specification of procedure myexit [2021-12-16 06:04:29,342 INFO L138 BoogieDeclarations]: Found implementation of procedure myexit [2021-12-16 06:04:29,343 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2021-12-16 06:04:29,343 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2021-12-16 06:04:29,343 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2021-12-16 06:04:29,343 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2021-12-16 06:04:29,343 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2021-12-16 06:04:29,343 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2021-12-16 06:04:29,344 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-12-16 06:04:29,344 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-12-16 06:04:29,344 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-12-16 06:04:29,344 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-12-16 06:04:29,468 INFO L236 CfgBuilder]: Building ICFG [2021-12-16 06:04:29,471 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2021-12-16 06:04:29,507 INFO L768 $ProcedureCfgBuilder]: dead code at ProgramPoint myexitFINAL: assume true; [2021-12-16 06:04:29,652 INFO L277 CfgBuilder]: Performing block encoding [2021-12-16 06:04:29,658 INFO L296 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-12-16 06:04:29,658 INFO L301 CfgBuilder]: Removed 6 assume(true) statements. [2021-12-16 06:04:29,659 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.12 06:04:29 BoogieIcfgContainer [2021-12-16 06:04:29,660 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-12-16 06:04:29,661 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-12-16 06:04:29,661 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-12-16 06:04:29,666 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-12-16 06:04:29,666 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.12 06:04:28" (1/3) ... [2021-12-16 06:04:29,666 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@704cd51f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.12 06:04:29, skipping insertion in model container [2021-12-16 06:04:29,667 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 06:04:29" (2/3) ... [2021-12-16 06:04:29,667 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@704cd51f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.12 06:04:29, skipping insertion in model container [2021-12-16 06:04:29,667 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.12 06:04:29" (3/3) ... [2021-12-16 06:04:29,668 INFO L111 eAbstractionObserver]: Analyzing ICFG dll2n_update_all_reverse.i [2021-12-16 06:04:29,671 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-12-16 06:04:29,671 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 23 error locations. [2021-12-16 06:04:29,707 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2021-12-16 06:04:29,713 INFO L339 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=false, 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, mLoopAccelerationTechnique=FAST_UPR [2021-12-16 06:04:29,713 INFO L340 AbstractCegarLoop]: Starting to check reachability of 23 error locations. [2021-12-16 06:04:29,727 INFO L276 IsEmpty]: Start isEmpty. Operand has 67 states, 42 states have (on average 1.9047619047619047) internal successors, (80), 65 states have internal predecessors, (80), 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) [2021-12-16 06:04:29,733 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2021-12-16 06:04:29,734 INFO L506 BasicCegarLoop]: Found error trace [2021-12-16 06:04:29,734 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2021-12-16 06:04:29,735 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 19 more)] === [2021-12-16 06:04:29,739 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-16 06:04:29,740 INFO L85 PathProgramCache]: Analyzing trace with hash 33471376, now seen corresponding path program 1 times [2021-12-16 06:04:29,748 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-16 06:04:29,749 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [610853781] [2021-12-16 06:04:29,749 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-16 06:04:29,750 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-16 06:04:29,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 06:04:29,898 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-16 06:04:29,898 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-16 06:04:29,898 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [610853781] [2021-12-16 06:04:29,899 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [610853781] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-16 06:04:29,899 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-16 06:04:29,900 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-12-16 06:04:29,901 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1849599754] [2021-12-16 06:04:29,906 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-16 06:04:29,910 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-12-16 06:04:29,911 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-16 06:04:29,934 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-16 06:04:29,935 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-16 06:04:29,937 INFO L87 Difference]: Start difference. First operand has 67 states, 42 states have (on average 1.9047619047619047) internal successors, (80), 65 states have internal predecessors, (80), 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) Second operand has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-16 06:04:30,050 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-16 06:04:30,050 INFO L93 Difference]: Finished difference Result 111 states and 123 transitions. [2021-12-16 06:04:30,052 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-16 06:04:30,054 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 5 [2021-12-16 06:04:30,054 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-16 06:04:30,061 INFO L225 Difference]: With dead ends: 111 [2021-12-16 06:04:30,062 INFO L226 Difference]: Without dead ends: 104 [2021-12-16 06:04:30,063 INFO L932 BasicCegarLoop]: 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 [2021-12-16 06:04:30,068 INFO L933 BasicCegarLoop]: 97 mSDtfsCounter, 63 mSDsluCounter, 39 mSDsCounter, 0 mSdLazyCounter, 44 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 63 SdHoareTripleChecker+Valid, 136 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 [2021-12-16 06:04:30,070 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [63 Valid, 136 Invalid, 46 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 44 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-16 06:04:30,085 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2021-12-16 06:04:30,101 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 59. [2021-12-16 06:04:30,103 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 59 states, 39 states have (on average 1.6666666666666667) internal successors, (65), 58 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-16 06:04:30,104 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 65 transitions. [2021-12-16 06:04:30,104 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 65 transitions. Word has length 5 [2021-12-16 06:04:30,105 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-16 06:04:30,105 INFO L470 AbstractCegarLoop]: Abstraction has 59 states and 65 transitions. [2021-12-16 06:04:30,105 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-16 06:04:30,105 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 65 transitions. [2021-12-16 06:04:30,105 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2021-12-16 06:04:30,105 INFO L506 BasicCegarLoop]: Found error trace [2021-12-16 06:04:30,106 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2021-12-16 06:04:30,106 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-12-16 06:04:30,107 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 19 more)] === [2021-12-16 06:04:30,109 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-16 06:04:30,109 INFO L85 PathProgramCache]: Analyzing trace with hash 33471377, now seen corresponding path program 1 times [2021-12-16 06:04:30,110 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-16 06:04:30,110 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1945600125] [2021-12-16 06:04:30,110 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-16 06:04:30,110 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-16 06:04:30,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 06:04:30,199 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-16 06:04:30,200 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-16 06:04:30,200 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1945600125] [2021-12-16 06:04:30,200 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1945600125] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-16 06:04:30,200 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-16 06:04:30,201 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-12-16 06:04:30,201 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [574719223] [2021-12-16 06:04:30,201 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-16 06:04:30,202 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-12-16 06:04:30,202 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-16 06:04:30,203 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-16 06:04:30,204 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-16 06:04:30,204 INFO L87 Difference]: Start difference. First operand 59 states and 65 transitions. Second operand has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-16 06:04:30,271 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-16 06:04:30,271 INFO L93 Difference]: Finished difference Result 101 states and 112 transitions. [2021-12-16 06:04:30,272 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-16 06:04:30,272 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 5 [2021-12-16 06:04:30,273 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-16 06:04:30,273 INFO L225 Difference]: With dead ends: 101 [2021-12-16 06:04:30,274 INFO L226 Difference]: Without dead ends: 101 [2021-12-16 06:04:30,275 INFO L932 BasicCegarLoop]: 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 [2021-12-16 06:04:30,276 INFO L933 BasicCegarLoop]: 94 mSDtfsCounter, 58 mSDsluCounter, 39 mSDsCounter, 0 mSdLazyCounter, 30 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 58 SdHoareTripleChecker+Valid, 133 SdHoareTripleChecker+Invalid, 32 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 30 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-16 06:04:30,277 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [58 Valid, 133 Invalid, 32 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 30 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-16 06:04:30,277 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2021-12-16 06:04:30,281 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 56. [2021-12-16 06:04:30,281 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 56 states, 39 states have (on average 1.5897435897435896) internal successors, (62), 55 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-16 06:04:30,284 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 62 transitions. [2021-12-16 06:04:30,286 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 62 transitions. Word has length 5 [2021-12-16 06:04:30,287 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-16 06:04:30,289 INFO L470 AbstractCegarLoop]: Abstraction has 56 states and 62 transitions. [2021-12-16 06:04:30,289 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-16 06:04:30,290 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 62 transitions. [2021-12-16 06:04:30,290 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2021-12-16 06:04:30,290 INFO L506 BasicCegarLoop]: Found error trace [2021-12-16 06:04:30,291 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2021-12-16 06:04:30,291 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-12-16 06:04:30,291 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr8REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 19 more)] === [2021-12-16 06:04:30,291 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-16 06:04:30,292 INFO L85 PathProgramCache]: Analyzing trace with hash 678997037, now seen corresponding path program 1 times [2021-12-16 06:04:30,293 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-16 06:04:30,293 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [197307671] [2021-12-16 06:04:30,293 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-16 06:04:30,293 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-16 06:04:30,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 06:04:30,320 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-16 06:04:30,320 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-16 06:04:30,321 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [197307671] [2021-12-16 06:04:30,321 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [197307671] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-16 06:04:30,321 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-16 06:04:30,321 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-12-16 06:04:30,321 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1648135091] [2021-12-16 06:04:30,321 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-16 06:04:30,321 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-12-16 06:04:30,321 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-16 06:04:30,322 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-16 06:04:30,322 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-16 06:04:30,322 INFO L87 Difference]: Start difference. First operand 56 states and 62 transitions. Second operand has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-16 06:04:30,346 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-16 06:04:30,346 INFO L93 Difference]: Finished difference Result 66 states and 73 transitions. [2021-12-16 06:04:30,346 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-16 06:04:30,347 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 8 [2021-12-16 06:04:30,347 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-16 06:04:30,348 INFO L225 Difference]: With dead ends: 66 [2021-12-16 06:04:30,348 INFO L226 Difference]: Without dead ends: 66 [2021-12-16 06:04:30,348 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-16 06:04:30,349 INFO L933 BasicCegarLoop]: 60 mSDtfsCounter, 10 mSDsluCounter, 58 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 118 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 [2021-12-16 06:04:30,350 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [10 Valid, 118 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-16 06:04:30,351 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2021-12-16 06:04:30,354 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 57. [2021-12-16 06:04:30,354 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 57 states, 40 states have (on average 1.575) internal successors, (63), 56 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-16 06:04:30,355 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 63 transitions. [2021-12-16 06:04:30,355 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 63 transitions. Word has length 8 [2021-12-16 06:04:30,356 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-16 06:04:30,356 INFO L470 AbstractCegarLoop]: Abstraction has 57 states and 63 transitions. [2021-12-16 06:04:30,356 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-16 06:04:30,356 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 63 transitions. [2021-12-16 06:04:30,356 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2021-12-16 06:04:30,357 INFO L506 BasicCegarLoop]: Found error trace [2021-12-16 06:04:30,357 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-16 06:04:30,357 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-12-16 06:04:30,363 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 19 more)] === [2021-12-16 06:04:30,364 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-16 06:04:30,365 INFO L85 PathProgramCache]: Analyzing trace with hash 638916372, now seen corresponding path program 1 times [2021-12-16 06:04:30,365 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-16 06:04:30,365 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [559624869] [2021-12-16 06:04:30,365 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-16 06:04:30,366 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-16 06:04:30,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 06:04:30,425 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-16 06:04:30,426 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-16 06:04:30,426 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [559624869] [2021-12-16 06:04:30,426 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [559624869] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-16 06:04:30,426 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-16 06:04:30,427 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-12-16 06:04:30,427 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2048028650] [2021-12-16 06:04:30,427 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-16 06:04:30,427 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-12-16 06:04:30,427 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-16 06:04:30,428 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-16 06:04:30,428 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-16 06:04:30,428 INFO L87 Difference]: Start difference. First operand 57 states and 63 transitions. Second operand has 3 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-16 06:04:30,442 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-16 06:04:30,443 INFO L93 Difference]: Finished difference Result 63 states and 69 transitions. [2021-12-16 06:04:30,443 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-16 06:04:30,443 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 9 [2021-12-16 06:04:30,444 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-16 06:04:30,444 INFO L225 Difference]: With dead ends: 63 [2021-12-16 06:04:30,444 INFO L226 Difference]: Without dead ends: 63 [2021-12-16 06:04:30,445 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-16 06:04:30,446 INFO L933 BasicCegarLoop]: 60 mSDtfsCounter, 1 mSDsluCounter, 53 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 113 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-16 06:04:30,446 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1 Valid, 113 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-16 06:04:30,447 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2021-12-16 06:04:30,449 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 62. [2021-12-16 06:04:30,450 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 62 states, 45 states have (on average 1.511111111111111) internal successors, (68), 61 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-16 06:04:30,450 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 68 transitions. [2021-12-16 06:04:30,450 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 68 transitions. Word has length 9 [2021-12-16 06:04:30,451 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-16 06:04:30,451 INFO L470 AbstractCegarLoop]: Abstraction has 62 states and 68 transitions. [2021-12-16 06:04:30,451 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-16 06:04:30,451 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 68 transitions. [2021-12-16 06:04:30,452 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2021-12-16 06:04:30,452 INFO L506 BasicCegarLoop]: Found error trace [2021-12-16 06:04:30,452 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-16 06:04:30,452 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-12-16 06:04:30,452 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr8REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 19 more)] === [2021-12-16 06:04:30,453 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-16 06:04:30,453 INFO L85 PathProgramCache]: Analyzing trace with hash 2114731710, now seen corresponding path program 1 times [2021-12-16 06:04:30,453 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-16 06:04:30,454 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [325853426] [2021-12-16 06:04:30,454 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-16 06:04:30,454 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-16 06:04:30,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 06:04:30,511 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-16 06:04:30,511 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-16 06:04:30,512 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [325853426] [2021-12-16 06:04:30,512 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [325853426] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-16 06:04:30,512 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [474081600] [2021-12-16 06:04:30,512 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-16 06:04:30,512 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-16 06:04:30,513 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-16 06:04:30,514 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-16 06:04:30,554 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2021-12-16 06:04:30,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 06:04:30,625 INFO L263 TraceCheckSpWp]: Trace formula consists of 142 conjuncts, 5 conjunts are in the unsatisfiable core [2021-12-16 06:04:30,629 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-16 06:04:30,712 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-16 06:04:30,712 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-16 06:04:30,784 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-16 06:04:30,784 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [474081600] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-16 06:04:30,784 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-16 06:04:30,784 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 5 [2021-12-16 06:04:30,785 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [963844011] [2021-12-16 06:04:30,785 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-16 06:04:30,785 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-12-16 06:04:30,785 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-16 06:04:30,786 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-12-16 06:04:30,786 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2021-12-16 06:04:30,786 INFO L87 Difference]: Start difference. First operand 62 states and 68 transitions. Second operand has 5 states, 5 states have (on average 4.6) internal successors, (23), 5 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-16 06:04:30,799 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-16 06:04:30,806 INFO L93 Difference]: Finished difference Result 64 states and 70 transitions. [2021-12-16 06:04:30,806 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-12-16 06:04:30,807 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 4.6) internal successors, (23), 5 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 15 [2021-12-16 06:04:30,807 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-16 06:04:30,808 INFO L225 Difference]: With dead ends: 64 [2021-12-16 06:04:30,808 INFO L226 Difference]: Without dead ends: 64 [2021-12-16 06:04:30,808 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 28 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2021-12-16 06:04:30,809 INFO L933 BasicCegarLoop]: 60 mSDtfsCounter, 16 mSDsluCounter, 107 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 167 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-16 06:04:30,810 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [16 Valid, 167 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-16 06:04:30,810 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2021-12-16 06:04:30,813 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 64. [2021-12-16 06:04:30,827 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 64 states, 47 states have (on average 1.4893617021276595) internal successors, (70), 63 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-16 06:04:30,828 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 70 transitions. [2021-12-16 06:04:30,828 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 70 transitions. Word has length 15 [2021-12-16 06:04:30,829 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-16 06:04:30,829 INFO L470 AbstractCegarLoop]: Abstraction has 64 states and 70 transitions. [2021-12-16 06:04:30,829 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 4.6) internal successors, (23), 5 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-16 06:04:30,829 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 70 transitions. [2021-12-16 06:04:30,829 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2021-12-16 06:04:30,830 INFO L506 BasicCegarLoop]: Found error trace [2021-12-16 06:04:30,830 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1] [2021-12-16 06:04:30,864 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2021-12-16 06:04:31,030 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-16 06:04:31,031 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 19 more)] === [2021-12-16 06:04:31,031 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-16 06:04:31,031 INFO L85 PathProgramCache]: Analyzing trace with hash -2097949021, now seen corresponding path program 1 times [2021-12-16 06:04:31,032 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-16 06:04:31,032 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [977563401] [2021-12-16 06:04:31,032 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-16 06:04:31,032 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-16 06:04:31,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 06:04:31,144 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-16 06:04:31,145 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-16 06:04:31,145 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [977563401] [2021-12-16 06:04:31,145 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [977563401] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-16 06:04:31,145 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [40167085] [2021-12-16 06:04:31,145 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-16 06:04:31,146 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-16 06:04:31,146 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-16 06:04:31,148 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) [2021-12-16 06:04:31,149 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2021-12-16 06:04:31,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 06:04:31,230 INFO L263 TraceCheckSpWp]: Trace formula consists of 174 conjuncts, 9 conjunts are in the unsatisfiable core [2021-12-16 06:04:31,232 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-16 06:04:31,271 INFO L388 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 [2021-12-16 06:04:31,334 INFO L354 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2021-12-16 06:04:31,335 INFO L388 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 21 [2021-12-16 06:04:31,359 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-16 06:04:31,361 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-16 06:04:31,546 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-16 06:04:31,547 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [40167085] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-16 06:04:31,547 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-16 06:04:31,547 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 3, 4] total 6 [2021-12-16 06:04:31,547 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [268467790] [2021-12-16 06:04:31,547 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-16 06:04:31,548 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-12-16 06:04:31,548 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-16 06:04:31,549 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-12-16 06:04:31,549 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2021-12-16 06:04:31,549 INFO L87 Difference]: Start difference. First operand 64 states and 70 transitions. Second operand has 7 states, 6 states have (on average 5.0) internal successors, (30), 7 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-16 06:04:31,614 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-16 06:04:31,614 INFO L93 Difference]: Finished difference Result 77 states and 83 transitions. [2021-12-16 06:04:31,614 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-12-16 06:04:31,615 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 5.0) internal successors, (30), 7 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2021-12-16 06:04:31,615 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-16 06:04:31,615 INFO L225 Difference]: With dead ends: 77 [2021-12-16 06:04:31,616 INFO L226 Difference]: Without dead ends: 77 [2021-12-16 06:04:31,616 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 32 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2021-12-16 06:04:31,617 INFO L933 BasicCegarLoop]: 39 mSDtfsCounter, 266 mSDsluCounter, 27 mSDsCounter, 0 mSdLazyCounter, 42 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 266 SdHoareTripleChecker+Valid, 66 SdHoareTripleChecker+Invalid, 66 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 42 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 23 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-16 06:04:31,617 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [266 Valid, 66 Invalid, 66 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 42 Invalid, 0 Unknown, 23 Unchecked, 0.1s Time] [2021-12-16 06:04:31,618 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2021-12-16 06:04:31,621 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 63. [2021-12-16 06:04:31,621 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 63 states, 47 states have (on average 1.4680851063829787) internal successors, (69), 62 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-16 06:04:31,622 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 69 transitions. [2021-12-16 06:04:31,622 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 69 transitions. Word has length 16 [2021-12-16 06:04:31,622 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-16 06:04:31,623 INFO L470 AbstractCegarLoop]: Abstraction has 63 states and 69 transitions. [2021-12-16 06:04:31,623 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 5.0) internal successors, (30), 7 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-16 06:04:31,623 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 69 transitions. [2021-12-16 06:04:31,623 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2021-12-16 06:04:31,623 INFO L506 BasicCegarLoop]: Found error trace [2021-12-16 06:04:31,624 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1] [2021-12-16 06:04:31,654 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2021-12-16 06:04:31,847 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2021-12-16 06:04:31,848 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 19 more)] === [2021-12-16 06:04:31,848 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-16 06:04:31,848 INFO L85 PathProgramCache]: Analyzing trace with hash -2097949020, now seen corresponding path program 1 times [2021-12-16 06:04:31,848 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-16 06:04:31,848 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [431430573] [2021-12-16 06:04:31,848 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-16 06:04:31,848 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-16 06:04:31,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 06:04:31,969 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-16 06:04:31,969 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-16 06:04:31,969 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [431430573] [2021-12-16 06:04:31,969 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [431430573] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-16 06:04:31,969 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [384190883] [2021-12-16 06:04:31,969 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-16 06:04:31,970 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-16 06:04:31,970 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-16 06:04:31,972 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-16 06:04:31,999 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2021-12-16 06:04:32,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 06:04:32,064 INFO L263 TraceCheckSpWp]: Trace formula consists of 174 conjuncts, 15 conjunts are in the unsatisfiable core [2021-12-16 06:04:32,069 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-16 06:04:32,099 INFO L388 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 [2021-12-16 06:04:32,104 INFO L388 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 [2021-12-16 06:04:32,172 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-16 06:04:32,173 INFO L388 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 [2021-12-16 06:04:32,180 INFO L354 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-12-16 06:04:32,181 INFO L388 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 [2021-12-16 06:04:32,214 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-16 06:04:32,215 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-16 06:04:32,490 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-16 06:04:32,490 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [384190883] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-16 06:04:32,490 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-16 06:04:32,491 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 4, 4] total 9 [2021-12-16 06:04:32,491 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1445639858] [2021-12-16 06:04:32,491 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-16 06:04:32,491 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2021-12-16 06:04:32,492 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-16 06:04:32,492 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-12-16 06:04:32,492 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2021-12-16 06:04:32,493 INFO L87 Difference]: Start difference. First operand 63 states and 69 transitions. Second operand has 10 states, 9 states have (on average 3.888888888888889) internal successors, (35), 10 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-16 06:04:32,574 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-16 06:04:32,576 INFO L93 Difference]: Finished difference Result 76 states and 82 transitions. [2021-12-16 06:04:32,577 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-12-16 06:04:32,577 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 3.888888888888889) internal successors, (35), 10 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2021-12-16 06:04:32,577 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-16 06:04:32,579 INFO L225 Difference]: With dead ends: 76 [2021-12-16 06:04:32,579 INFO L226 Difference]: Without dead ends: 76 [2021-12-16 06:04:32,579 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 27 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=44, Invalid=88, Unknown=0, NotChecked=0, Total=132 [2021-12-16 06:04:32,582 INFO L933 BasicCegarLoop]: 34 mSDtfsCounter, 168 mSDsluCounter, 45 mSDsCounter, 0 mSdLazyCounter, 53 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 168 SdHoareTripleChecker+Valid, 79 SdHoareTripleChecker+Invalid, 82 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 53 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 25 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-16 06:04:32,582 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [168 Valid, 79 Invalid, 82 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 53 Invalid, 0 Unknown, 25 Unchecked, 0.1s Time] [2021-12-16 06:04:32,584 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2021-12-16 06:04:32,592 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 62. [2021-12-16 06:04:32,595 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 62 states, 47 states have (on average 1.446808510638298) internal successors, (68), 61 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-16 06:04:32,596 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 68 transitions. [2021-12-16 06:04:32,597 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 68 transitions. Word has length 16 [2021-12-16 06:04:32,597 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-16 06:04:32,597 INFO L470 AbstractCegarLoop]: Abstraction has 62 states and 68 transitions. [2021-12-16 06:04:32,598 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 3.888888888888889) internal successors, (35), 10 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-16 06:04:32,598 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 68 transitions. [2021-12-16 06:04:32,598 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2021-12-16 06:04:32,599 INFO L506 BasicCegarLoop]: Found error trace [2021-12-16 06:04:32,599 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-16 06:04:32,627 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2021-12-16 06:04:32,803 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-16 06:04:32,804 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr8REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 19 more)] === [2021-12-16 06:04:32,804 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-16 06:04:32,804 INFO L85 PathProgramCache]: Analyzing trace with hash -1891969267, now seen corresponding path program 2 times [2021-12-16 06:04:32,804 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-16 06:04:32,804 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1694553868] [2021-12-16 06:04:32,804 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-16 06:04:32,805 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-16 06:04:32,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 06:04:32,845 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 4 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-16 06:04:32,845 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-16 06:04:32,846 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1694553868] [2021-12-16 06:04:32,846 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1694553868] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-16 06:04:32,846 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [327304808] [2021-12-16 06:04:32,846 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2021-12-16 06:04:32,846 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-16 06:04:32,846 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-16 06:04:32,847 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-16 06:04:32,849 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2021-12-16 06:04:32,928 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-12-16 06:04:32,929 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-12-16 06:04:32,930 INFO L263 TraceCheckSpWp]: Trace formula consists of 214 conjuncts, 5 conjunts are in the unsatisfiable core [2021-12-16 06:04:32,931 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-16 06:04:32,965 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 4 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-16 06:04:32,966 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-16 06:04:33,002 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 4 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-16 06:04:33,003 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [327304808] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-16 06:04:33,003 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-16 06:04:33,003 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 4 [2021-12-16 06:04:33,003 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1653161600] [2021-12-16 06:04:33,004 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-16 06:04:33,004 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-12-16 06:04:33,004 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-16 06:04:33,005 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-12-16 06:04:33,005 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-12-16 06:04:33,005 INFO L87 Difference]: Start difference. First operand 62 states and 68 transitions. Second operand has 4 states, 4 states have (on average 5.5) internal successors, (22), 4 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-16 06:04:33,028 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-16 06:04:33,029 INFO L93 Difference]: Finished difference Result 62 states and 67 transitions. [2021-12-16 06:04:33,029 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-12-16 06:04:33,029 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), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 22 [2021-12-16 06:04:33,029 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-16 06:04:33,030 INFO L225 Difference]: With dead ends: 62 [2021-12-16 06:04:33,030 INFO L226 Difference]: Without dead ends: 62 [2021-12-16 06:04:33,030 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 43 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-12-16 06:04:33,031 INFO L933 BasicCegarLoop]: 53 mSDtfsCounter, 103 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 103 SdHoareTripleChecker+Valid, 56 SdHoareTripleChecker+Invalid, 20 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 20 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-16 06:04:33,031 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [103 Valid, 56 Invalid, 20 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-16 06:04:33,032 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2021-12-16 06:04:33,034 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 62. [2021-12-16 06:04:33,034 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 62 states, 47 states have (on average 1.425531914893617) internal successors, (67), 61 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-16 06:04:33,035 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 67 transitions. [2021-12-16 06:04:33,035 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 67 transitions. Word has length 22 [2021-12-16 06:04:33,035 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-16 06:04:33,035 INFO L470 AbstractCegarLoop]: Abstraction has 62 states and 67 transitions. [2021-12-16 06:04:33,036 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.5) internal successors, (22), 4 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-16 06:04:33,036 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 67 transitions. [2021-12-16 06:04:33,036 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2021-12-16 06:04:33,036 INFO L506 BasicCegarLoop]: Found error trace [2021-12-16 06:04:33,037 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-16 06:04:33,063 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2021-12-16 06:04:33,250 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-16 06:04:33,250 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr8REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 19 more)] === [2021-12-16 06:04:33,250 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-16 06:04:33,250 INFO L85 PathProgramCache]: Analyzing trace with hash -1779022382, now seen corresponding path program 1 times [2021-12-16 06:04:33,251 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-16 06:04:33,251 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2049780516] [2021-12-16 06:04:33,251 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-16 06:04:33,251 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-16 06:04:33,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 06:04:33,335 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2021-12-16 06:04:33,335 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-16 06:04:33,335 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2049780516] [2021-12-16 06:04:33,335 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2049780516] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-16 06:04:33,336 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-16 06:04:33,336 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-12-16 06:04:33,336 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2067688957] [2021-12-16 06:04:33,336 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-16 06:04:33,336 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-12-16 06:04:33,337 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-16 06:04:33,337 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-12-16 06:04:33,337 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2021-12-16 06:04:33,337 INFO L87 Difference]: Start difference. First operand 62 states and 67 transitions. Second operand has 7 states, 6 states have (on average 3.5) internal successors, (21), 7 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-16 06:04:33,479 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-16 06:04:33,479 INFO L93 Difference]: Finished difference Result 113 states and 122 transitions. [2021-12-16 06:04:33,479 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-12-16 06:04:33,479 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 3.5) internal successors, (21), 7 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 23 [2021-12-16 06:04:33,480 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-16 06:04:33,480 INFO L225 Difference]: With dead ends: 113 [2021-12-16 06:04:33,480 INFO L226 Difference]: Without dead ends: 113 [2021-12-16 06:04:33,481 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=39, Invalid=71, Unknown=0, NotChecked=0, Total=110 [2021-12-16 06:04:33,481 INFO L933 BasicCegarLoop]: 56 mSDtfsCounter, 259 mSDsluCounter, 67 mSDsCounter, 0 mSdLazyCounter, 147 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 259 SdHoareTripleChecker+Valid, 123 SdHoareTripleChecker+Invalid, 152 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 147 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-16 06:04:33,481 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [259 Valid, 123 Invalid, 152 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 147 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-16 06:04:33,482 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113 states. [2021-12-16 06:04:33,484 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113 to 65. [2021-12-16 06:04:33,484 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 65 states, 50 states have (on average 1.46) internal successors, (73), 64 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-16 06:04:33,485 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 73 transitions. [2021-12-16 06:04:33,485 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 73 transitions. Word has length 23 [2021-12-16 06:04:33,485 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-16 06:04:33,485 INFO L470 AbstractCegarLoop]: Abstraction has 65 states and 73 transitions. [2021-12-16 06:04:33,485 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 3.5) internal successors, (21), 7 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-16 06:04:33,485 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 73 transitions. [2021-12-16 06:04:33,486 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2021-12-16 06:04:33,486 INFO L506 BasicCegarLoop]: Found error trace [2021-12-16 06:04:33,486 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-16 06:04:33,486 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2021-12-16 06:04:33,486 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr9REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 19 more)] === [2021-12-16 06:04:33,486 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-16 06:04:33,487 INFO L85 PathProgramCache]: Analyzing trace with hash -1779022381, now seen corresponding path program 1 times [2021-12-16 06:04:33,487 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-16 06:04:33,487 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1896744104] [2021-12-16 06:04:33,490 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-16 06:04:33,490 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-16 06:04:33,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 06:04:33,573 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-12-16 06:04:33,573 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-16 06:04:33,574 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1896744104] [2021-12-16 06:04:33,575 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1896744104] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-16 06:04:33,575 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-16 06:04:33,575 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-12-16 06:04:33,575 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1052205793] [2021-12-16 06:04:33,575 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-16 06:04:33,576 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-12-16 06:04:33,576 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-16 06:04:33,577 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-12-16 06:04:33,577 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2021-12-16 06:04:33,577 INFO L87 Difference]: Start difference. First operand 65 states and 73 transitions. Second operand has 7 states, 6 states have (on average 3.8333333333333335) internal successors, (23), 7 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-16 06:04:33,706 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-16 06:04:33,707 INFO L93 Difference]: Finished difference Result 100 states and 109 transitions. [2021-12-16 06:04:33,707 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-12-16 06:04:33,708 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 3.8333333333333335) internal successors, (23), 7 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 23 [2021-12-16 06:04:33,708 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-16 06:04:33,708 INFO L225 Difference]: With dead ends: 100 [2021-12-16 06:04:33,708 INFO L226 Difference]: Without dead ends: 100 [2021-12-16 06:04:33,709 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=39, Invalid=71, Unknown=0, NotChecked=0, Total=110 [2021-12-16 06:04:33,709 INFO L933 BasicCegarLoop]: 64 mSDtfsCounter, 265 mSDsluCounter, 37 mSDsCounter, 0 mSdLazyCounter, 112 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 265 SdHoareTripleChecker+Valid, 101 SdHoareTripleChecker+Invalid, 114 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 112 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-16 06:04:33,710 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [265 Valid, 101 Invalid, 114 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 112 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-16 06:04:33,712 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2021-12-16 06:04:33,717 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 65. [2021-12-16 06:04:33,718 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 65 states, 50 states have (on average 1.42) internal successors, (71), 64 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-16 06:04:33,718 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 71 transitions. [2021-12-16 06:04:33,718 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 71 transitions. Word has length 23 [2021-12-16 06:04:33,719 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-16 06:04:33,719 INFO L470 AbstractCegarLoop]: Abstraction has 65 states and 71 transitions. [2021-12-16 06:04:33,719 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 3.8333333333333335) internal successors, (23), 7 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-16 06:04:33,719 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 71 transitions. [2021-12-16 06:04:33,720 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2021-12-16 06:04:33,720 INFO L506 BasicCegarLoop]: Found error trace [2021-12-16 06:04:33,720 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-16 06:04:33,720 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2021-12-16 06:04:33,720 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr14REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 19 more)] === [2021-12-16 06:04:33,721 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-16 06:04:33,721 INFO L85 PathProgramCache]: Analyzing trace with hash -244809887, now seen corresponding path program 1 times [2021-12-16 06:04:33,721 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-16 06:04:33,721 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1917535578] [2021-12-16 06:04:33,722 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-16 06:04:33,722 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-16 06:04:33,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 06:04:33,797 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2021-12-16 06:04:33,797 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-16 06:04:33,797 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1917535578] [2021-12-16 06:04:33,798 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1917535578] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-16 06:04:33,798 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-16 06:04:33,798 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-12-16 06:04:33,798 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1892332060] [2021-12-16 06:04:33,798 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-16 06:04:33,798 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-12-16 06:04:33,799 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-16 06:04:33,799 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-12-16 06:04:33,799 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2021-12-16 06:04:33,799 INFO L87 Difference]: Start difference. First operand 65 states and 71 transitions. Second operand has 7 states, 6 states have (on average 3.8333333333333335) internal successors, (23), 7 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-16 06:04:33,926 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-16 06:04:33,927 INFO L93 Difference]: Finished difference Result 100 states and 108 transitions. [2021-12-16 06:04:33,927 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-12-16 06:04:33,927 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 3.8333333333333335) internal successors, (23), 7 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 25 [2021-12-16 06:04:33,927 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-16 06:04:33,928 INFO L225 Difference]: With dead ends: 100 [2021-12-16 06:04:33,928 INFO L226 Difference]: Without dead ends: 100 [2021-12-16 06:04:33,928 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=39, Invalid=71, Unknown=0, NotChecked=0, Total=110 [2021-12-16 06:04:33,929 INFO L933 BasicCegarLoop]: 43 mSDtfsCounter, 243 mSDsluCounter, 63 mSDsCounter, 0 mSdLazyCounter, 142 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 243 SdHoareTripleChecker+Valid, 106 SdHoareTripleChecker+Invalid, 147 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 142 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-16 06:04:33,929 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [243 Valid, 106 Invalid, 147 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 142 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-16 06:04:33,930 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2021-12-16 06:04:33,932 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 68. [2021-12-16 06:04:33,932 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 68 states, 53 states have (on average 1.4528301886792452) internal successors, (77), 67 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-16 06:04:33,932 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 77 transitions. [2021-12-16 06:04:33,933 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 77 transitions. Word has length 25 [2021-12-16 06:04:33,933 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-16 06:04:33,933 INFO L470 AbstractCegarLoop]: Abstraction has 68 states and 77 transitions. [2021-12-16 06:04:33,933 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 3.8333333333333335) internal successors, (23), 7 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-16 06:04:33,933 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 77 transitions. [2021-12-16 06:04:33,934 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2021-12-16 06:04:33,934 INFO L506 BasicCegarLoop]: Found error trace [2021-12-16 06:04:33,934 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-16 06:04:33,934 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2021-12-16 06:04:33,934 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr15REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 19 more)] === [2021-12-16 06:04:33,935 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-16 06:04:33,935 INFO L85 PathProgramCache]: Analyzing trace with hash -244809886, now seen corresponding path program 1 times [2021-12-16 06:04:33,935 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-16 06:04:33,935 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1468123303] [2021-12-16 06:04:33,935 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-16 06:04:33,936 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-16 06:04:33,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 06:04:33,978 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-12-16 06:04:33,978 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-16 06:04:33,978 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1468123303] [2021-12-16 06:04:33,978 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1468123303] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-16 06:04:33,979 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1274398752] [2021-12-16 06:04:33,979 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-16 06:04:33,979 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-16 06:04:33,979 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-16 06:04:33,980 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-16 06:04:34,006 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2021-12-16 06:04:34,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 06:04:34,078 INFO L263 TraceCheckSpWp]: Trace formula consists of 226 conjuncts, 3 conjunts are in the unsatisfiable core [2021-12-16 06:04:34,079 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-16 06:04:34,119 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2021-12-16 06:04:34,119 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-16 06:04:34,119 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1274398752] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-16 06:04:34,120 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2021-12-16 06:04:34,120 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [5] total 5 [2021-12-16 06:04:34,120 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1186294927] [2021-12-16 06:04:34,120 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-16 06:04:34,121 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-12-16 06:04:34,121 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-16 06:04:34,121 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-12-16 06:04:34,121 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2021-12-16 06:04:34,121 INFO L87 Difference]: Start difference. First operand 68 states and 77 transitions. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-16 06:04:34,136 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-16 06:04:34,136 INFO L93 Difference]: Finished difference Result 65 states and 71 transitions. [2021-12-16 06:04:34,136 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-12-16 06:04:34,137 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 25 [2021-12-16 06:04:34,137 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-16 06:04:34,137 INFO L225 Difference]: With dead ends: 65 [2021-12-16 06:04:34,137 INFO L226 Difference]: Without dead ends: 65 [2021-12-16 06:04:34,138 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2021-12-16 06:04:34,138 INFO L933 BasicCegarLoop]: 39 mSDtfsCounter, 69 mSDsluCounter, 23 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 69 SdHoareTripleChecker+Valid, 62 SdHoareTripleChecker+Invalid, 12 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-16 06:04:34,139 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [69 Valid, 62 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-16 06:04:34,139 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2021-12-16 06:04:34,140 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 52. [2021-12-16 06:04:34,141 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 52 states, 42 states have (on average 1.3333333333333333) internal successors, (56), 51 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-16 06:04:34,141 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 56 transitions. [2021-12-16 06:04:34,141 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 56 transitions. Word has length 25 [2021-12-16 06:04:34,142 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-16 06:04:34,142 INFO L470 AbstractCegarLoop]: Abstraction has 52 states and 56 transitions. [2021-12-16 06:04:34,142 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-16 06:04:34,142 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 56 transitions. [2021-12-16 06:04:34,142 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2021-12-16 06:04:34,143 INFO L506 BasicCegarLoop]: Found error trace [2021-12-16 06:04:34,143 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-16 06:04:34,164 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2021-12-16 06:04:34,353 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2021-12-16 06:04:34,353 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr8REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 19 more)] === [2021-12-16 06:04:34,354 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-16 06:04:34,354 INFO L85 PathProgramCache]: Analyzing trace with hash 1040689078, now seen corresponding path program 1 times [2021-12-16 06:04:34,354 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-16 06:04:34,354 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1228760877] [2021-12-16 06:04:34,354 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-16 06:04:34,354 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-16 06:04:34,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 06:04:34,427 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 2 proven. 8 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-12-16 06:04:34,427 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-16 06:04:34,427 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1228760877] [2021-12-16 06:04:34,428 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1228760877] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-16 06:04:34,428 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [456597544] [2021-12-16 06:04:34,428 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-16 06:04:34,428 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-16 06:04:34,428 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-16 06:04:34,429 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-16 06:04:34,438 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2021-12-16 06:04:34,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 06:04:34,532 INFO L263 TraceCheckSpWp]: Trace formula consists of 242 conjuncts, 6 conjunts are in the unsatisfiable core [2021-12-16 06:04:34,534 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-16 06:04:34,583 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2021-12-16 06:04:34,584 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-16 06:04:34,584 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [456597544] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-16 06:04:34,584 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2021-12-16 06:04:34,584 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [7] total 7 [2021-12-16 06:04:34,584 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [364519362] [2021-12-16 06:04:34,584 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-16 06:04:34,585 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-12-16 06:04:34,585 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-16 06:04:34,585 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-12-16 06:04:34,585 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2021-12-16 06:04:34,586 INFO L87 Difference]: Start difference. First operand 52 states and 56 transitions. Second operand has 6 states, 6 states have (on average 3.3333333333333335) internal successors, (20), 6 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-16 06:04:34,619 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-16 06:04:34,620 INFO L93 Difference]: Finished difference Result 49 states and 52 transitions. [2021-12-16 06:04:34,620 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-12-16 06:04:34,620 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.3333333333333335) internal successors, (20), 6 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 26 [2021-12-16 06:04:34,622 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-16 06:04:34,623 INFO L225 Difference]: With dead ends: 49 [2021-12-16 06:04:34,623 INFO L226 Difference]: Without dead ends: 49 [2021-12-16 06:04:34,623 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=31, Invalid=59, Unknown=0, NotChecked=0, Total=90 [2021-12-16 06:04:34,625 INFO L933 BasicCegarLoop]: 33 mSDtfsCounter, 94 mSDsluCounter, 27 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 94 SdHoareTripleChecker+Valid, 60 SdHoareTripleChecker+Invalid, 28 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-16 06:04:34,626 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [94 Valid, 60 Invalid, 28 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-16 06:04:34,626 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2021-12-16 06:04:34,631 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 49. [2021-12-16 06:04:34,632 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 49 states, 41 states have (on average 1.2682926829268293) internal successors, (52), 48 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-16 06:04:34,633 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 52 transitions. [2021-12-16 06:04:34,633 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 52 transitions. Word has length 26 [2021-12-16 06:04:34,633 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-16 06:04:34,634 INFO L470 AbstractCegarLoop]: Abstraction has 49 states and 52 transitions. [2021-12-16 06:04:34,634 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.3333333333333335) internal successors, (20), 6 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-16 06:04:34,634 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 52 transitions. [2021-12-16 06:04:34,636 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2021-12-16 06:04:34,636 INFO L506 BasicCegarLoop]: Found error trace [2021-12-16 06:04:34,636 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-16 06:04:34,663 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2021-12-16 06:04:34,853 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-16 06:04:34,853 INFO L402 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr10REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 19 more)] === [2021-12-16 06:04:34,854 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-16 06:04:34,854 INFO L85 PathProgramCache]: Analyzing trace with hash 1040689023, now seen corresponding path program 1 times [2021-12-16 06:04:34,854 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-16 06:04:34,854 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1732825561] [2021-12-16 06:04:34,854 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-16 06:04:34,854 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-16 06:04:34,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 06:04:35,024 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 4 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-16 06:04:35,024 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-16 06:04:35,024 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1732825561] [2021-12-16 06:04:35,024 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1732825561] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-16 06:04:35,025 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1797810319] [2021-12-16 06:04:35,025 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-16 06:04:35,025 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-16 06:04:35,025 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-16 06:04:35,026 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-16 06:04:35,027 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2021-12-16 06:04:35,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 06:04:35,120 INFO L263 TraceCheckSpWp]: Trace formula consists of 242 conjuncts, 43 conjunts are in the unsatisfiable core [2021-12-16 06:04:35,123 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-16 06:04:35,128 INFO L388 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 [2021-12-16 06:04:35,163 INFO L354 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-12-16 06:04:35,163 INFO L388 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 [2021-12-16 06:04:35,182 INFO L388 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 13 treesize of output 9 [2021-12-16 06:04:35,213 INFO L354 Elim1Store]: treesize reduction 27, result has 25.0 percent of original size [2021-12-16 06:04:35,214 INFO L388 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 1 case distinctions, treesize of input 23 treesize of output 22 [2021-12-16 06:04:35,240 INFO L354 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-12-16 06:04:35,241 INFO L388 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 34 treesize of output 35 [2021-12-16 06:04:35,386 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 13 [2021-12-16 06:04:35,402 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 2 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-16 06:04:35,402 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-16 06:04:35,532 INFO L354 Elim1Store]: treesize reduction 5, result has 70.6 percent of original size [2021-12-16 06:04:35,532 INFO L388 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 21 treesize of output 20 [2021-12-16 06:04:35,536 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_730 (Array Int Int))) (= (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_730) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) (+ |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| 4)) |c_ULTIMATE.start_dll_create_~head~0#1.base|)) is different from false [2021-12-16 06:04:35,579 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_728 Int) (v_ArrVal_730 (Array Int Int))) (= (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) (+ |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| 8) v_ArrVal_728)) |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_730) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) (+ |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| 4)) |c_ULTIMATE.start_dll_create_~head~0#1.base|)) is different from false [2021-12-16 06:04:35,594 INFO L354 Elim1Store]: treesize reduction 27, result has 43.8 percent of original size [2021-12-16 06:04:35,595 INFO L388 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 1 new quantified variables, introduced 2 case distinctions, treesize of input 27 treesize of output 33 [2021-12-16 06:04:35,599 INFO L388 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 36 treesize of output 24 [2021-12-16 06:04:35,612 INFO L388 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 7 treesize of output 3 [2021-12-16 06:04:35,726 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 2 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 2 not checked. [2021-12-16 06:04:35,727 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1797810319] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-16 06:04:35,727 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-16 06:04:35,727 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 12, 13] total 30 [2021-12-16 06:04:35,727 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1535280785] [2021-12-16 06:04:35,727 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-16 06:04:35,728 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 31 states [2021-12-16 06:04:35,728 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-16 06:04:35,728 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2021-12-16 06:04:35,729 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=82, Invalid=736, Unknown=2, NotChecked=110, Total=930 [2021-12-16 06:04:35,729 INFO L87 Difference]: Start difference. First operand 49 states and 52 transitions. Second operand has 31 states, 30 states have (on average 2.2) internal successors, (66), 31 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-16 06:04:36,684 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-16 06:04:36,685 INFO L93 Difference]: Finished difference Result 129 states and 137 transitions. [2021-12-16 06:04:36,685 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2021-12-16 06:04:36,686 INFO L78 Accepts]: Start accepts. Automaton has has 31 states, 30 states have (on average 2.2) internal successors, (66), 31 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 26 [2021-12-16 06:04:36,686 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-16 06:04:36,687 INFO L225 Difference]: With dead ends: 129 [2021-12-16 06:04:36,688 INFO L226 Difference]: Without dead ends: 129 [2021-12-16 06:04:36,688 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 82 GetRequests, 31 SyntacticMatches, 5 SemanticMatches, 46 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 333 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=319, Invalid=1757, Unknown=2, NotChecked=178, Total=2256 [2021-12-16 06:04:36,689 INFO L933 BasicCegarLoop]: 45 mSDtfsCounter, 545 mSDsluCounter, 381 mSDsCounter, 0 mSdLazyCounter, 502 mSolverCounterSat, 62 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 545 SdHoareTripleChecker+Valid, 426 SdHoareTripleChecker+Invalid, 789 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 62 IncrementalHoareTripleChecker+Valid, 502 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 225 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2021-12-16 06:04:36,689 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [545 Valid, 426 Invalid, 789 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [62 Valid, 502 Invalid, 0 Unknown, 225 Unchecked, 0.3s Time] [2021-12-16 06:04:36,690 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 129 states. [2021-12-16 06:04:36,693 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 129 to 69. [2021-12-16 06:04:36,694 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 69 states, 61 states have (on average 1.2459016393442623) internal successors, (76), 68 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-16 06:04:36,694 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 76 transitions. [2021-12-16 06:04:36,694 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 76 transitions. Word has length 26 [2021-12-16 06:04:36,694 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-16 06:04:36,694 INFO L470 AbstractCegarLoop]: Abstraction has 69 states and 76 transitions. [2021-12-16 06:04:36,695 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 31 states, 30 states have (on average 2.2) internal successors, (66), 31 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-16 06:04:36,695 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 76 transitions. [2021-12-16 06:04:36,698 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2021-12-16 06:04:36,698 INFO L506 BasicCegarLoop]: Found error trace [2021-12-16 06:04:36,698 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-16 06:04:36,725 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2021-12-16 06:04:36,899 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-16 06:04:36,899 INFO L402 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr11REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 19 more)] === [2021-12-16 06:04:36,899 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-16 06:04:36,899 INFO L85 PathProgramCache]: Analyzing trace with hash 1040689024, now seen corresponding path program 1 times [2021-12-16 06:04:36,900 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-16 06:04:36,900 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [594091319] [2021-12-16 06:04:36,900 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-16 06:04:36,900 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-16 06:04:36,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 06:04:37,140 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 2 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-16 06:04:37,140 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-16 06:04:37,140 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [594091319] [2021-12-16 06:04:37,141 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [594091319] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-16 06:04:37,141 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1636627883] [2021-12-16 06:04:37,141 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-16 06:04:37,141 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-16 06:04:37,141 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-16 06:04:37,142 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-16 06:04:37,144 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2021-12-16 06:04:37,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 06:04:37,254 INFO L263 TraceCheckSpWp]: Trace formula consists of 242 conjuncts, 55 conjunts are in the unsatisfiable core [2021-12-16 06:04:37,260 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-16 06:04:37,268 INFO L388 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 [2021-12-16 06:04:37,332 INFO L354 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-12-16 06:04:37,332 INFO L388 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 [2021-12-16 06:04:37,368 INFO L388 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 13 treesize of output 9 [2021-12-16 06:04:37,373 INFO L388 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 13 treesize of output 9 [2021-12-16 06:04:37,423 INFO L354 Elim1Store]: treesize reduction 27, result has 25.0 percent of original size [2021-12-16 06:04:37,423 INFO L388 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 1 case distinctions, treesize of input 23 treesize of output 22 [2021-12-16 06:04:37,438 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-16 06:04:37,439 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2021-12-16 06:04:37,472 INFO L354 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-12-16 06:04:37,473 INFO L388 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 54 treesize of output 53 [2021-12-16 06:04:37,477 INFO L388 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 41 treesize of output 41 [2021-12-16 06:04:37,660 INFO L388 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 39 treesize of output 21 [2021-12-16 06:04:37,665 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 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 32 treesize of output 14 [2021-12-16 06:04:37,733 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 2 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-16 06:04:37,733 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-16 06:04:37,993 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-16 06:04:37,993 INFO L388 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 46 treesize of output 50 [2021-12-16 06:04:38,040 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_834 (Array Int Int))) (= |c_ULTIMATE.start_dll_create_~head~0#1.base| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_834) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) (+ |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| 4)))) (forall ((v_prenex_1 (Array Int Int))) (<= 0 (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_prenex_1) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) (+ |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| 4)))) (forall ((v_ArrVal_832 (Array Int Int))) (<= (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_832) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) (+ |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| 4)) (+ |c_ULTIMATE.start_dll_create_~head~0#1.offset| 8)))) is different from false [2021-12-16 06:04:38,068 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_830 Int) (v_ArrVal_834 (Array Int Int))) (= |c_ULTIMATE.start_dll_create_~head~0#1.base| (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) (+ |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| 8) v_ArrVal_830)) |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_834) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) (+ |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| 4)))) (forall ((v_prenex_1 (Array Int Int)) (v_ArrVal_831 Int)) (<= 0 (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) (+ |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| 8) v_ArrVal_831)) |c_ULTIMATE.start_dll_create_~head~0#1.base| v_prenex_1) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) (+ |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| 4)))) (forall ((v_ArrVal_832 (Array Int Int)) (v_ArrVal_831 Int)) (<= (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) (+ |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| 8) v_ArrVal_831)) |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_832) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) (+ |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| 4)) (+ |c_ULTIMATE.start_dll_create_~head~0#1.offset| 8)))) is different from false [2021-12-16 06:04:38,088 INFO L354 Elim1Store]: treesize reduction 27, result has 43.8 percent of original size [2021-12-16 06:04:38,088 INFO L388 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 1 new quantified variables, introduced 2 case distinctions, treesize of input 27 treesize of output 33 [2021-12-16 06:04:38,091 INFO L388 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 36 treesize of output 24 [2021-12-16 06:04:38,093 INFO L388 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 7 treesize of output 3 [2021-12-16 06:04:38,107 INFO L354 Elim1Store]: treesize reduction 27, result has 43.8 percent of original size [2021-12-16 06:04:38,107 INFO L388 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 1 new quantified variables, introduced 2 case distinctions, treesize of input 27 treesize of output 33 [2021-12-16 06:04:38,109 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-16 06:04:38,110 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 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 20 treesize of output 8 [2021-12-16 06:04:38,117 INFO L354 Elim1Store]: treesize reduction 47, result has 2.1 percent of original size [2021-12-16 06:04:38,117 INFO L388 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 1 new quantified variables, introduced 2 case distinctions, treesize of input 29 treesize of output 1 [2021-12-16 06:04:38,327 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 2 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 2 not checked. [2021-12-16 06:04:38,328 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1636627883] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-16 06:04:38,328 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-16 06:04:38,328 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 12, 13] total 35 [2021-12-16 06:04:38,328 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [686982303] [2021-12-16 06:04:38,328 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-16 06:04:38,329 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 36 states [2021-12-16 06:04:38,329 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-16 06:04:38,329 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2021-12-16 06:04:38,330 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=97, Invalid=1031, Unknown=2, NotChecked=130, Total=1260 [2021-12-16 06:04:38,330 INFO L87 Difference]: Start difference. First operand 69 states and 76 transitions. Second operand has 36 states, 35 states have (on average 2.057142857142857) internal successors, (72), 36 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-16 06:04:39,933 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-16 06:04:39,934 INFO L93 Difference]: Finished difference Result 130 states and 139 transitions. [2021-12-16 06:04:39,934 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2021-12-16 06:04:39,934 INFO L78 Accepts]: Start accepts. Automaton has has 36 states, 35 states have (on average 2.057142857142857) internal successors, (72), 36 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 26 [2021-12-16 06:04:39,934 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-16 06:04:39,935 INFO L225 Difference]: With dead ends: 130 [2021-12-16 06:04:39,935 INFO L226 Difference]: Without dead ends: 130 [2021-12-16 06:04:39,936 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 82 GetRequests, 29 SyntacticMatches, 1 SemanticMatches, 52 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 356 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=344, Invalid=2314, Unknown=2, NotChecked=202, Total=2862 [2021-12-16 06:04:39,936 INFO L933 BasicCegarLoop]: 63 mSDtfsCounter, 689 mSDsluCounter, 881 mSDsCounter, 0 mSdLazyCounter, 906 mSolverCounterSat, 61 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 689 SdHoareTripleChecker+Valid, 944 SdHoareTripleChecker+Invalid, 1268 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 61 IncrementalHoareTripleChecker+Valid, 906 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 301 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2021-12-16 06:04:39,937 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [689 Valid, 944 Invalid, 1268 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [61 Valid, 906 Invalid, 0 Unknown, 301 Unchecked, 0.5s Time] [2021-12-16 06:04:39,937 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 130 states. [2021-12-16 06:04:39,938 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 130 to 77. [2021-12-16 06:04:39,938 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 77 states, 69 states have (on average 1.2463768115942029) internal successors, (86), 76 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-16 06:04:39,939 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 86 transitions. [2021-12-16 06:04:39,939 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 86 transitions. Word has length 26 [2021-12-16 06:04:39,939 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-16 06:04:39,939 INFO L470 AbstractCegarLoop]: Abstraction has 77 states and 86 transitions. [2021-12-16 06:04:39,939 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 36 states, 35 states have (on average 2.057142857142857) internal successors, (72), 36 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-16 06:04:39,939 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 86 transitions. [2021-12-16 06:04:39,939 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2021-12-16 06:04:39,939 INFO L506 BasicCegarLoop]: Found error trace [2021-12-16 06:04:39,940 INFO L514 BasicCegarLoop]: trace histogram [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] [2021-12-16 06:04:39,972 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2021-12-16 06:04:40,158 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2021-12-16 06:04:40,159 INFO L402 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr16REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 19 more)] === [2021-12-16 06:04:40,159 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-16 06:04:40,159 INFO L85 PathProgramCache]: Analyzing trace with hash -709592258, now seen corresponding path program 1 times [2021-12-16 06:04:40,159 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-16 06:04:40,159 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [580684491] [2021-12-16 06:04:40,159 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-16 06:04:40,160 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-16 06:04:40,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 06:04:40,216 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2021-12-16 06:04:40,216 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-16 06:04:40,216 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [580684491] [2021-12-16 06:04:40,217 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [580684491] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-16 06:04:40,217 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-16 06:04:40,217 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-12-16 06:04:40,217 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [720225347] [2021-12-16 06:04:40,217 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-16 06:04:40,218 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-12-16 06:04:40,218 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-16 06:04:40,218 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-12-16 06:04:40,218 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2021-12-16 06:04:40,219 INFO L87 Difference]: Start difference. First operand 77 states and 86 transitions. Second operand has 7 states, 6 states have (on average 4.833333333333333) internal successors, (29), 7 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-16 06:04:40,314 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-16 06:04:40,314 INFO L93 Difference]: Finished difference Result 88 states and 97 transitions. [2021-12-16 06:04:40,315 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-12-16 06:04:40,315 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 4.833333333333333) internal successors, (29), 7 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 31 [2021-12-16 06:04:40,315 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-16 06:04:40,315 INFO L225 Difference]: With dead ends: 88 [2021-12-16 06:04:40,316 INFO L226 Difference]: Without dead ends: 88 [2021-12-16 06:04:40,316 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=39, Invalid=71, Unknown=0, NotChecked=0, Total=110 [2021-12-16 06:04:40,316 INFO L933 BasicCegarLoop]: 19 mSDtfsCounter, 122 mSDsluCounter, 44 mSDsCounter, 0 mSdLazyCounter, 123 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 122 SdHoareTripleChecker+Valid, 63 SdHoareTripleChecker+Invalid, 128 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 123 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-16 06:04:40,317 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [122 Valid, 63 Invalid, 128 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 123 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-16 06:04:40,317 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2021-12-16 06:04:40,318 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 78. [2021-12-16 06:04:40,319 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 78 states, 71 states have (on average 1.2535211267605635) internal successors, (89), 77 states have internal predecessors, (89), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-16 06:04:40,319 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 89 transitions. [2021-12-16 06:04:40,319 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 89 transitions. Word has length 31 [2021-12-16 06:04:40,319 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-16 06:04:40,319 INFO L470 AbstractCegarLoop]: Abstraction has 78 states and 89 transitions. [2021-12-16 06:04:40,319 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 4.833333333333333) internal successors, (29), 7 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-16 06:04:40,319 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 89 transitions. [2021-12-16 06:04:40,320 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2021-12-16 06:04:40,320 INFO L506 BasicCegarLoop]: Found error trace [2021-12-16 06:04:40,320 INFO L514 BasicCegarLoop]: trace histogram [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] [2021-12-16 06:04:40,320 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2021-12-16 06:04:40,320 INFO L402 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr17REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 19 more)] === [2021-12-16 06:04:40,321 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-16 06:04:40,321 INFO L85 PathProgramCache]: Analyzing trace with hash -709592257, now seen corresponding path program 1 times [2021-12-16 06:04:40,321 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-16 06:04:40,321 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1181149129] [2021-12-16 06:04:40,321 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-16 06:04:40,321 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-16 06:04:40,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 06:04:40,378 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 1 proven. 8 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-12-16 06:04:40,379 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-16 06:04:40,379 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1181149129] [2021-12-16 06:04:40,379 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1181149129] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-16 06:04:40,379 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [879109303] [2021-12-16 06:04:40,379 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-16 06:04:40,380 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-16 06:04:40,380 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-16 06:04:40,384 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) [2021-12-16 06:04:40,414 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2021-12-16 06:04:40,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 06:04:40,502 INFO L263 TraceCheckSpWp]: Trace formula consists of 259 conjuncts, 5 conjunts are in the unsatisfiable core [2021-12-16 06:04:40,503 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-16 06:04:40,546 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2021-12-16 06:04:40,547 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-16 06:04:40,547 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [879109303] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-16 06:04:40,547 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2021-12-16 06:04:40,547 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [6] total 6 [2021-12-16 06:04:40,548 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1229218055] [2021-12-16 06:04:40,548 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-16 06:04:40,548 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-12-16 06:04:40,548 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-16 06:04:40,548 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-12-16 06:04:40,549 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2021-12-16 06:04:40,549 INFO L87 Difference]: Start difference. First operand 78 states and 89 transitions. Second operand has 5 states, 5 states have (on average 5.0) internal successors, (25), 5 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-16 06:04:40,576 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-16 06:04:40,577 INFO L93 Difference]: Finished difference Result 86 states and 95 transitions. [2021-12-16 06:04:40,577 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-12-16 06:04:40,577 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 5.0) internal successors, (25), 5 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 31 [2021-12-16 06:04:40,577 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-16 06:04:40,578 INFO L225 Difference]: With dead ends: 86 [2021-12-16 06:04:40,578 INFO L226 Difference]: Without dead ends: 86 [2021-12-16 06:04:40,578 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2021-12-16 06:04:40,579 INFO L933 BasicCegarLoop]: 34 mSDtfsCounter, 61 mSDsluCounter, 52 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 61 SdHoareTripleChecker+Valid, 86 SdHoareTripleChecker+Invalid, 25 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 19 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-16 06:04:40,579 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [61 Valid, 86 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-16 06:04:40,579 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2021-12-16 06:04:40,581 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 75. [2021-12-16 06:04:40,581 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 75 states, 68 states have (on average 1.2352941176470589) internal successors, (84), 74 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-16 06:04:40,581 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 84 transitions. [2021-12-16 06:04:40,581 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 84 transitions. Word has length 31 [2021-12-16 06:04:40,582 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-16 06:04:40,582 INFO L470 AbstractCegarLoop]: Abstraction has 75 states and 84 transitions. [2021-12-16 06:04:40,582 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.0) internal successors, (25), 5 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-16 06:04:40,582 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 84 transitions. [2021-12-16 06:04:40,582 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2021-12-16 06:04:40,582 INFO L506 BasicCegarLoop]: Found error trace [2021-12-16 06:04:40,583 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-16 06:04:40,608 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2021-12-16 06:04:40,799 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2021-12-16 06:04:40,799 INFO L402 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr10REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 19 more)] === [2021-12-16 06:04:40,800 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-16 06:04:40,800 INFO L85 PathProgramCache]: Analyzing trace with hash 1698966507, now seen corresponding path program 2 times [2021-12-16 06:04:40,800 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-16 06:04:40,800 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1159685181] [2021-12-16 06:04:40,800 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-16 06:04:40,800 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-16 06:04:40,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 06:04:40,844 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 17 proven. 8 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-12-16 06:04:40,844 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-16 06:04:40,845 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1159685181] [2021-12-16 06:04:40,845 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1159685181] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-16 06:04:40,845 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [8333142] [2021-12-16 06:04:40,845 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2021-12-16 06:04:40,845 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-16 06:04:40,846 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-16 06:04:40,847 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-16 06:04:40,875 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2021-12-16 06:04:40,986 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-12-16 06:04:40,986 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-12-16 06:04:40,988 INFO L263 TraceCheckSpWp]: Trace formula consists of 327 conjuncts, 6 conjunts are in the unsatisfiable core [2021-12-16 06:04:40,992 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-16 06:04:41,040 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 25 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-12-16 06:04:41,040 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-16 06:04:41,041 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [8333142] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-16 06:04:41,041 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2021-12-16 06:04:41,041 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [5] total 6 [2021-12-16 06:04:41,041 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [829783557] [2021-12-16 06:04:41,041 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-16 06:04:41,042 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-12-16 06:04:41,042 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-16 06:04:41,042 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-12-16 06:04:41,042 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2021-12-16 06:04:41,043 INFO L87 Difference]: Start difference. First operand 75 states and 84 transitions. Second operand has 5 states, 5 states have (on average 6.8) internal successors, (34), 5 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-16 06:04:41,049 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-16 06:04:41,050 INFO L93 Difference]: Finished difference Result 53 states and 57 transitions. [2021-12-16 06:04:41,050 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-12-16 06:04:41,050 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 6.8) internal successors, (34), 5 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 34 [2021-12-16 06:04:41,050 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-16 06:04:41,051 INFO L225 Difference]: With dead ends: 53 [2021-12-16 06:04:41,051 INFO L226 Difference]: Without dead ends: 53 [2021-12-16 06:04:41,051 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2021-12-16 06:04:41,051 INFO L933 BasicCegarLoop]: 41 mSDtfsCounter, 60 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 60 SdHoareTripleChecker+Valid, 58 SdHoareTripleChecker+Invalid, 12 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-16 06:04:41,052 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [60 Valid, 58 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-16 06:04:41,053 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2021-12-16 06:04:41,054 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 53. [2021-12-16 06:04:41,054 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 53 states, 47 states have (on average 1.2127659574468086) internal successors, (57), 52 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-16 06:04:41,055 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 57 transitions. [2021-12-16 06:04:41,055 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 57 transitions. Word has length 34 [2021-12-16 06:04:41,055 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-16 06:04:41,055 INFO L470 AbstractCegarLoop]: Abstraction has 53 states and 57 transitions. [2021-12-16 06:04:41,055 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 6.8) internal successors, (34), 5 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-16 06:04:41,055 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 57 transitions. [2021-12-16 06:04:41,056 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2021-12-16 06:04:41,056 INFO L506 BasicCegarLoop]: Found error trace [2021-12-16 06:04:41,056 INFO L514 BasicCegarLoop]: trace histogram [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] [2021-12-16 06:04:41,083 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2021-12-16 06:04:41,277 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2021-12-16 06:04:41,277 INFO L402 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr17REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 19 more)] === [2021-12-16 06:04:41,277 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-16 06:04:41,277 INFO L85 PathProgramCache]: Analyzing trace with hash -674776797, now seen corresponding path program 1 times [2021-12-16 06:04:41,277 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-16 06:04:41,277 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [61634370] [2021-12-16 06:04:41,277 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-16 06:04:41,278 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-16 06:04:41,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 06:04:41,334 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2021-12-16 06:04:41,334 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-16 06:04:41,334 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [61634370] [2021-12-16 06:04:41,334 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [61634370] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-16 06:04:41,335 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1463353290] [2021-12-16 06:04:41,335 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-16 06:04:41,335 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-16 06:04:41,335 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-16 06:04:41,336 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-16 06:04:41,363 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2021-12-16 06:04:41,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 06:04:41,464 INFO L263 TraceCheckSpWp]: Trace formula consists of 274 conjuncts, 4 conjunts are in the unsatisfiable core [2021-12-16 06:04:41,465 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-16 06:04:41,524 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2021-12-16 06:04:41,524 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-16 06:04:41,593 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2021-12-16 06:04:41,594 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1463353290] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-16 06:04:41,594 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-16 06:04:41,594 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 5] total 6 [2021-12-16 06:04:41,594 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [397778257] [2021-12-16 06:04:41,594 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-16 06:04:41,595 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-12-16 06:04:41,596 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-16 06:04:41,596 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-12-16 06:04:41,596 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2021-12-16 06:04:41,596 INFO L87 Difference]: Start difference. First operand 53 states and 57 transitions. Second operand has 6 states, 6 states have (on average 6.0) internal successors, (36), 6 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-16 06:04:41,624 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-16 06:04:41,625 INFO L93 Difference]: Finished difference Result 57 states and 61 transitions. [2021-12-16 06:04:41,625 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-12-16 06:04:41,625 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 6.0) internal successors, (36), 6 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 34 [2021-12-16 06:04:41,625 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-16 06:04:41,626 INFO L225 Difference]: With dead ends: 57 [2021-12-16 06:04:41,626 INFO L226 Difference]: Without dead ends: 57 [2021-12-16 06:04:41,626 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 74 GetRequests, 68 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2021-12-16 06:04:41,626 INFO L933 BasicCegarLoop]: 33 mSDtfsCounter, 79 mSDsluCounter, 48 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 79 SdHoareTripleChecker+Valid, 81 SdHoareTripleChecker+Invalid, 28 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 22 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-16 06:04:41,627 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [79 Valid, 81 Invalid, 28 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-16 06:04:41,628 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2021-12-16 06:04:41,628 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 57. [2021-12-16 06:04:41,629 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 57 states, 51 states have (on average 1.196078431372549) internal successors, (61), 56 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-16 06:04:41,629 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 61 transitions. [2021-12-16 06:04:41,629 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 61 transitions. Word has length 34 [2021-12-16 06:04:41,629 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-16 06:04:41,629 INFO L470 AbstractCegarLoop]: Abstraction has 57 states and 61 transitions. [2021-12-16 06:04:41,629 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 6.0) internal successors, (36), 6 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-16 06:04:41,630 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 61 transitions. [2021-12-16 06:04:41,630 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2021-12-16 06:04:41,630 INFO L506 BasicCegarLoop]: Found error trace [2021-12-16 06:04:41,630 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-16 06:04:41,657 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2021-12-16 06:04:41,843 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-16 06:04:41,843 INFO L402 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr10REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 19 more)] === [2021-12-16 06:04:41,844 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-16 06:04:41,844 INFO L85 PathProgramCache]: Analyzing trace with hash -634882153, now seen corresponding path program 1 times [2021-12-16 06:04:41,844 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-16 06:04:41,844 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1828439213] [2021-12-16 06:04:41,844 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-16 06:04:41,844 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-16 06:04:41,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 06:04:41,931 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 7 proven. 10 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2021-12-16 06:04:41,931 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-16 06:04:41,931 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1828439213] [2021-12-16 06:04:41,931 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1828439213] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-16 06:04:41,931 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2123611785] [2021-12-16 06:04:41,932 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-16 06:04:41,932 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-16 06:04:41,932 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-16 06:04:41,936 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-16 06:04:41,960 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2021-12-16 06:04:42,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 06:04:42,061 INFO L263 TraceCheckSpWp]: Trace formula consists of 296 conjuncts, 6 conjunts are in the unsatisfiable core [2021-12-16 06:04:42,062 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-16 06:04:42,118 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 7 proven. 2 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2021-12-16 06:04:42,118 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-16 06:04:42,174 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 7 proven. 2 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2021-12-16 06:04:42,174 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2123611785] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-16 06:04:42,175 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-16 06:04:42,175 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6, 6] total 7 [2021-12-16 06:04:42,175 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [922051892] [2021-12-16 06:04:42,175 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-16 06:04:42,175 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-12-16 06:04:42,175 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-16 06:04:42,176 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-12-16 06:04:42,176 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2021-12-16 06:04:42,176 INFO L87 Difference]: Start difference. First operand 57 states and 61 transitions. Second operand has 7 states, 7 states have (on average 5.142857142857143) internal successors, (36), 7 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-16 06:04:42,218 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-16 06:04:42,218 INFO L93 Difference]: Finished difference Result 52 states and 55 transitions. [2021-12-16 06:04:42,219 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-12-16 06:04:42,219 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 5.142857142857143) internal successors, (36), 7 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 34 [2021-12-16 06:04:42,219 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-16 06:04:42,220 INFO L225 Difference]: With dead ends: 52 [2021-12-16 06:04:42,220 INFO L226 Difference]: Without dead ends: 52 [2021-12-16 06:04:42,220 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 76 GetRequests, 68 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=31, Invalid=59, Unknown=0, NotChecked=0, Total=90 [2021-12-16 06:04:42,221 INFO L933 BasicCegarLoop]: 33 mSDtfsCounter, 61 mSDsluCounter, 83 mSDsCounter, 0 mSdLazyCounter, 39 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 61 SdHoareTripleChecker+Valid, 116 SdHoareTripleChecker+Invalid, 47 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 39 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-16 06:04:42,221 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [61 Valid, 116 Invalid, 47 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 39 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-16 06:04:42,221 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2021-12-16 06:04:42,222 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 52. [2021-12-16 06:04:42,222 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 52 states, 47 states have (on average 1.1702127659574468) internal successors, (55), 51 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-16 06:04:42,223 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 55 transitions. [2021-12-16 06:04:42,223 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 55 transitions. Word has length 34 [2021-12-16 06:04:42,223 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-16 06:04:42,223 INFO L470 AbstractCegarLoop]: Abstraction has 52 states and 55 transitions. [2021-12-16 06:04:42,223 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 5.142857142857143) internal successors, (36), 7 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-16 06:04:42,223 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 55 transitions. [2021-12-16 06:04:42,224 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2021-12-16 06:04:42,224 INFO L506 BasicCegarLoop]: Found error trace [2021-12-16 06:04:42,224 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-16 06:04:42,251 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Forceful destruction successful, exit code 0 [2021-12-16 06:04:42,439 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-16 06:04:42,439 INFO L402 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr17REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 19 more)] === [2021-12-16 06:04:42,440 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-16 06:04:42,440 INFO L85 PathProgramCache]: Analyzing trace with hash -427165145, now seen corresponding path program 2 times [2021-12-16 06:04:42,440 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-16 06:04:42,440 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2003384161] [2021-12-16 06:04:42,440 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-16 06:04:42,440 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-16 06:04:42,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 06:04:42,506 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2021-12-16 06:04:42,507 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-16 06:04:42,507 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2003384161] [2021-12-16 06:04:42,507 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2003384161] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-16 06:04:42,507 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-16 06:04:42,507 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-12-16 06:04:42,508 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1738398039] [2021-12-16 06:04:42,508 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-16 06:04:42,508 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-12-16 06:04:42,508 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-16 06:04:42,508 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-12-16 06:04:42,509 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2021-12-16 06:04:42,509 INFO L87 Difference]: Start difference. First operand 52 states and 55 transitions. Second operand has 7 states, 6 states have (on average 5.666666666666667) internal successors, (34), 7 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-16 06:04:42,618 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-16 06:04:42,618 INFO L93 Difference]: Finished difference Result 60 states and 61 transitions. [2021-12-16 06:04:42,618 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-12-16 06:04:42,618 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 5.666666666666667) internal successors, (34), 7 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 39 [2021-12-16 06:04:42,618 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-16 06:04:42,619 INFO L225 Difference]: With dead ends: 60 [2021-12-16 06:04:42,619 INFO L226 Difference]: Without dead ends: 60 [2021-12-16 06:04:42,619 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=39, Invalid=71, Unknown=0, NotChecked=0, Total=110 [2021-12-16 06:04:42,619 INFO L933 BasicCegarLoop]: 18 mSDtfsCounter, 147 mSDsluCounter, 18 mSDsCounter, 0 mSdLazyCounter, 100 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 147 SdHoareTripleChecker+Valid, 36 SdHoareTripleChecker+Invalid, 106 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 100 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-16 06:04:42,620 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [147 Valid, 36 Invalid, 106 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 100 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-16 06:04:42,620 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2021-12-16 06:04:42,621 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 54. [2021-12-16 06:04:42,621 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 54 states, 49 states have (on average 1.1428571428571428) internal successors, (56), 53 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-16 06:04:42,621 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 56 transitions. [2021-12-16 06:04:42,622 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 56 transitions. Word has length 39 [2021-12-16 06:04:42,622 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-16 06:04:42,622 INFO L470 AbstractCegarLoop]: Abstraction has 54 states and 56 transitions. [2021-12-16 06:04:42,622 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 5.666666666666667) internal successors, (34), 7 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-16 06:04:42,622 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 56 transitions. [2021-12-16 06:04:42,622 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2021-12-16 06:04:42,623 INFO L506 BasicCegarLoop]: Found error trace [2021-12-16 06:04:42,623 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 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] [2021-12-16 06:04:42,623 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2021-12-16 06:04:42,623 INFO L402 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr22ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 19 more)] === [2021-12-16 06:04:42,623 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-16 06:04:42,624 INFO L85 PathProgramCache]: Analyzing trace with hash -357219036, now seen corresponding path program 1 times [2021-12-16 06:04:42,624 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-16 06:04:42,624 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1574051927] [2021-12-16 06:04:42,624 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-16 06:04:42,624 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-16 06:04:42,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 06:04:42,670 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2021-12-16 06:04:42,671 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-16 06:04:42,671 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1574051927] [2021-12-16 06:04:42,671 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1574051927] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-16 06:04:42,671 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-16 06:04:42,671 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-12-16 06:04:42,671 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [199091042] [2021-12-16 06:04:42,671 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-16 06:04:42,672 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-12-16 06:04:42,672 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-16 06:04:42,672 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-12-16 06:04:42,672 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2021-12-16 06:04:42,673 INFO L87 Difference]: Start difference. First operand 54 states and 56 transitions. Second operand has 7 states, 7 states have (on average 5.0) internal successors, (35), 7 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-16 06:04:42,742 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-16 06:04:42,742 INFO L93 Difference]: Finished difference Result 57 states and 58 transitions. [2021-12-16 06:04:42,744 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-12-16 06:04:42,744 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 5.0) internal successors, (35), 7 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 40 [2021-12-16 06:04:42,744 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-16 06:04:42,744 INFO L225 Difference]: With dead ends: 57 [2021-12-16 06:04:42,744 INFO L226 Difference]: Without dead ends: 57 [2021-12-16 06:04:42,744 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=39, Invalid=71, Unknown=0, NotChecked=0, Total=110 [2021-12-16 06:04:42,745 INFO L933 BasicCegarLoop]: 24 mSDtfsCounter, 134 mSDsluCounter, 34 mSDsCounter, 0 mSdLazyCounter, 78 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 134 SdHoareTripleChecker+Valid, 58 SdHoareTripleChecker+Invalid, 82 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 78 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-16 06:04:42,745 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [134 Valid, 58 Invalid, 82 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 78 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-16 06:04:42,746 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2021-12-16 06:04:42,746 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 54. [2021-12-16 06:04:42,747 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 54 states, 49 states have (on average 1.1224489795918366) internal successors, (55), 53 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-16 06:04:42,747 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 55 transitions. [2021-12-16 06:04:42,747 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 55 transitions. Word has length 40 [2021-12-16 06:04:42,747 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-16 06:04:42,747 INFO L470 AbstractCegarLoop]: Abstraction has 54 states and 55 transitions. [2021-12-16 06:04:42,748 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 5.0) internal successors, (35), 7 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-16 06:04:42,748 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 55 transitions. [2021-12-16 06:04:42,748 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2021-12-16 06:04:42,748 INFO L506 BasicCegarLoop]: Found error trace [2021-12-16 06:04:42,748 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 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] [2021-12-16 06:04:42,748 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2021-12-16 06:04:42,749 INFO L402 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 19 more)] === [2021-12-16 06:04:42,749 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-16 06:04:42,749 INFO L85 PathProgramCache]: Analyzing trace with hash 311339877, now seen corresponding path program 1 times [2021-12-16 06:04:42,749 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-16 06:04:42,749 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [490829876] [2021-12-16 06:04:42,749 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-16 06:04:42,750 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-16 06:04:42,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 06:04:42,801 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2021-12-16 06:04:42,802 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-16 06:04:42,802 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [490829876] [2021-12-16 06:04:42,802 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [490829876] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-16 06:04:42,802 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-16 06:04:42,802 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-12-16 06:04:42,802 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1597525308] [2021-12-16 06:04:42,802 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-16 06:04:42,803 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-12-16 06:04:42,803 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-16 06:04:42,803 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-12-16 06:04:42,803 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2021-12-16 06:04:42,804 INFO L87 Difference]: Start difference. First operand 54 states and 55 transitions. Second operand has 7 states, 6 states have (on average 6.166666666666667) internal successors, (37), 7 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-16 06:04:42,902 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-16 06:04:42,902 INFO L93 Difference]: Finished difference Result 55 states and 56 transitions. [2021-12-16 06:04:42,902 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-12-16 06:04:42,902 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 6.166666666666667) internal successors, (37), 7 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 42 [2021-12-16 06:04:42,902 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-16 06:04:42,903 INFO L225 Difference]: With dead ends: 55 [2021-12-16 06:04:42,903 INFO L226 Difference]: Without dead ends: 55 [2021-12-16 06:04:42,903 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=39, Invalid=71, Unknown=0, NotChecked=0, Total=110 [2021-12-16 06:04:42,903 INFO L933 BasicCegarLoop]: 23 mSDtfsCounter, 120 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 90 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 120 SdHoareTripleChecker+Valid, 45 SdHoareTripleChecker+Invalid, 96 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 90 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-16 06:04:42,904 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [120 Valid, 45 Invalid, 96 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 90 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-16 06:04:42,904 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2021-12-16 06:04:42,905 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 55. [2021-12-16 06:04:42,905 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 55 states, 50 states have (on average 1.12) internal successors, (56), 54 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-16 06:04:42,905 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 56 transitions. [2021-12-16 06:04:42,905 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 56 transitions. Word has length 42 [2021-12-16 06:04:42,905 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-16 06:04:42,905 INFO L470 AbstractCegarLoop]: Abstraction has 55 states and 56 transitions. [2021-12-16 06:04:42,905 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 6.166666666666667) internal successors, (37), 7 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-16 06:04:42,905 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 56 transitions. [2021-12-16 06:04:42,906 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2021-12-16 06:04:42,906 INFO L506 BasicCegarLoop]: Found error trace [2021-12-16 06:04:42,906 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 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] [2021-12-16 06:04:42,906 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2021-12-16 06:04:42,906 INFO L402 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr16REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 19 more)] === [2021-12-16 06:04:42,906 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-16 06:04:42,906 INFO L85 PathProgramCache]: Analyzing trace with hash -2002912181, now seen corresponding path program 1 times [2021-12-16 06:04:42,906 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-16 06:04:42,907 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [390823451] [2021-12-16 06:04:42,907 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-16 06:04:42,907 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-16 06:04:42,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 06:04:43,268 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 4 proven. 11 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2021-12-16 06:04:43,268 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-16 06:04:43,268 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [390823451] [2021-12-16 06:04:43,268 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [390823451] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-16 06:04:43,268 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [568018542] [2021-12-16 06:04:43,268 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-16 06:04:43,269 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-16 06:04:43,269 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-16 06:04:43,272 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-16 06:04:43,295 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2021-12-16 06:04:43,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 06:04:43,410 INFO L263 TraceCheckSpWp]: Trace formula consists of 337 conjuncts, 70 conjunts are in the unsatisfiable core [2021-12-16 06:04:43,412 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-16 06:04:43,418 INFO L388 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 [2021-12-16 06:04:43,457 INFO L354 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-12-16 06:04:43,457 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2021-12-16 06:04:43,501 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2021-12-16 06:04:43,539 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-16 06:04:43,540 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2021-12-16 06:04:43,607 INFO L354 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-12-16 06:04:43,610 INFO L388 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 32 treesize of output 33 [2021-12-16 06:04:43,922 INFO L354 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-12-16 06:04:43,922 INFO L388 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 39 treesize of output 38 [2021-12-16 06:04:44,049 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-16 06:04:44,050 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-16 06:04:44,051 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 34 [2021-12-16 06:04:44,187 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-16 06:04:44,187 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 34 treesize of output 36 [2021-12-16 06:04:44,358 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 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 [2021-12-16 06:04:44,375 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 3 proven. 17 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-16 06:04:44,375 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-16 06:04:46,870 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_dll_update_at_~head#1.offset_20| Int)) (or (and (forall ((v_ArrVal_1643 Int)) (= (select |c_#valid| (select (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~s~0#1.base|) |v_ULTIMATE.start_dll_update_at_~head#1.offset_20| v_ArrVal_1643) 4)) 1)) (forall ((v_ArrVal_1643 Int)) (not (= |c_ULTIMATE.start_main_~s~0#1.base| (select (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~s~0#1.base|) |v_ULTIMATE.start_dll_update_at_~head#1.offset_20| v_ArrVal_1643) 4))))) (< |c_ULTIMATE.start_main_~s~0#1.offset| |v_ULTIMATE.start_dll_update_at_~head#1.offset_20|))) is different from false [2021-12-16 06:04:46,999 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-16 06:04:47,000 INFO L388 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 37 treesize of output 41 [2021-12-16 06:04:47,104 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_dll_update_at_~head#1.offset_20| Int)) (or (and (forall ((v_ArrVal_1642 (Array Int Int)) (v_ArrVal_1643 Int)) (= |c_ULTIMATE.start_dll_update_at_~head#1.base| (select (store (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_update_at_~head#1.base| v_ArrVal_1642) |c_ULTIMATE.start_main_~s~0#1.base|) |v_ULTIMATE.start_dll_update_at_~head#1.offset_20| v_ArrVal_1643) 4))) (forall ((v_prenex_3 Int) (v_ArrVal_1642 (Array Int Int))) (not (= |c_ULTIMATE.start_main_~s~0#1.base| (select (store (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_update_at_~head#1.base| v_ArrVal_1642) |c_ULTIMATE.start_main_~s~0#1.base|) |v_ULTIMATE.start_dll_update_at_~head#1.offset_20| v_prenex_3) 4))))) (< |c_ULTIMATE.start_main_~s~0#1.offset| |v_ULTIMATE.start_dll_update_at_~head#1.offset_20|))) is different from false [2021-12-16 06:04:47,194 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_dll_update_at_~head#1.offset_20| Int)) (or (and (forall ((v_prenex_3 Int) (v_ArrVal_1642 (Array Int Int))) (not (= |c_ULTIMATE.start_main_~s~0#1.base| (select (store (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_update_at_#t~mem10#1.base| v_ArrVal_1642) |c_ULTIMATE.start_main_~s~0#1.base|) |v_ULTIMATE.start_dll_update_at_~head#1.offset_20| v_prenex_3) 4)))) (forall ((v_ArrVal_1642 (Array Int Int)) (v_ArrVal_1643 Int)) (= |c_ULTIMATE.start_dll_update_at_#t~mem10#1.base| (select (store (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_update_at_#t~mem10#1.base| v_ArrVal_1642) |c_ULTIMATE.start_main_~s~0#1.base|) |v_ULTIMATE.start_dll_update_at_~head#1.offset_20| v_ArrVal_1643) 4)))) (< |c_ULTIMATE.start_main_~s~0#1.offset| |v_ULTIMATE.start_dll_update_at_~head#1.offset_20|))) is different from false [2021-12-16 06:04:47,245 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_dll_update_at_~head#1.offset_20| Int)) (or (and (forall ((v_ArrVal_1642 (Array Int Int)) (v_ArrVal_1643 Int)) (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_update_at_~head#1.base|) (+ |c_ULTIMATE.start_dll_update_at_~head#1.offset| 4)))) (= .cse0 (select (store (select (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_1642) |c_ULTIMATE.start_main_~s~0#1.base|) |v_ULTIMATE.start_dll_update_at_~head#1.offset_20| v_ArrVal_1643) 4)))) (forall ((v_prenex_3 Int) (v_ArrVal_1642 (Array Int Int))) (not (= |c_ULTIMATE.start_main_~s~0#1.base| (select (store (select (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_update_at_~head#1.base|) (+ |c_ULTIMATE.start_dll_update_at_~head#1.offset| 4)) v_ArrVal_1642) |c_ULTIMATE.start_main_~s~0#1.base|) |v_ULTIMATE.start_dll_update_at_~head#1.offset_20| v_prenex_3) 4))))) (< |c_ULTIMATE.start_main_~s~0#1.offset| |v_ULTIMATE.start_dll_update_at_~head#1.offset_20|))) is different from false [2021-12-16 06:04:47,339 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_dll_update_at_~head#1.offset_20| Int)) (or (< |c_ULTIMATE.start_main_~s~0#1.offset| |v_ULTIMATE.start_dll_update_at_~head#1.offset_20|) (and (forall ((v_ArrVal_1642 (Array Int Int)) (v_ArrVal_1643 Int)) (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~s~0#1.base|) (+ |c_ULTIMATE.start_main_~s~0#1.offset| 4)))) (= .cse0 (select (store (select (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_1642) |c_ULTIMATE.start_main_~s~0#1.base|) |v_ULTIMATE.start_dll_update_at_~head#1.offset_20| v_ArrVal_1643) 4)))) (forall ((v_prenex_3 Int) (v_ArrVal_1642 (Array Int Int))) (not (= |c_ULTIMATE.start_main_~s~0#1.base| (select (store (select (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~s~0#1.base|) (+ |c_ULTIMATE.start_main_~s~0#1.offset| 4)) v_ArrVal_1642) |c_ULTIMATE.start_main_~s~0#1.base|) |v_ULTIMATE.start_dll_update_at_~head#1.offset_20| v_prenex_3) 4))))))) is different from false [2021-12-16 06:04:47,394 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_dll_update_at_~head#1.offset_20| Int)) (or (< |c_ULTIMATE.start_dll_create_#res#1.offset| |v_ULTIMATE.start_dll_update_at_~head#1.offset_20|) (and (forall ((v_ArrVal_1642 (Array Int Int)) (v_ArrVal_1643 Int)) (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_#res#1.base|) (+ |c_ULTIMATE.start_dll_create_#res#1.offset| 4)))) (= .cse0 (select (store (select (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_1642) |c_ULTIMATE.start_dll_create_#res#1.base|) |v_ULTIMATE.start_dll_update_at_~head#1.offset_20| v_ArrVal_1643) 4)))) (forall ((v_prenex_3 Int) (v_ArrVal_1642 (Array Int Int))) (not (= |c_ULTIMATE.start_dll_create_#res#1.base| (select (store (select (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_#res#1.base|) (+ |c_ULTIMATE.start_dll_create_#res#1.offset| 4)) v_ArrVal_1642) |c_ULTIMATE.start_dll_create_#res#1.base|) |v_ULTIMATE.start_dll_update_at_~head#1.offset_20| v_prenex_3) 4))))))) is different from false [2021-12-16 06:04:47,443 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_dll_update_at_~head#1.offset_20| Int)) (or (< |c_ULTIMATE.start_dll_create_~head~0#1.offset| |v_ULTIMATE.start_dll_update_at_~head#1.offset_20|) (and (forall ((v_ArrVal_1642 (Array Int Int)) (v_ArrVal_1643 Int)) (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~head~0#1.base|) (+ |c_ULTIMATE.start_dll_create_~head~0#1.offset| 4)))) (= .cse0 (select (store (select (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_1642) |c_ULTIMATE.start_dll_create_~head~0#1.base|) |v_ULTIMATE.start_dll_update_at_~head#1.offset_20| v_ArrVal_1643) 4)))) (forall ((v_prenex_3 Int) (v_ArrVal_1642 (Array Int Int))) (not (= |c_ULTIMATE.start_dll_create_~head~0#1.base| (select (store (select (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~head~0#1.base|) (+ |c_ULTIMATE.start_dll_create_~head~0#1.offset| 4)) v_ArrVal_1642) |c_ULTIMATE.start_dll_create_~head~0#1.base|) |v_ULTIMATE.start_dll_update_at_~head#1.offset_20| v_prenex_3) 4))))))) is different from false [2021-12-16 06:04:47,543 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_dll_update_at_~head#1.offset_20| Int)) (or (and (forall ((v_ArrVal_1642 (Array Int Int)) (v_ArrVal_1643 Int)) (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) (+ |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| 4)))) (= .cse0 (select (store (select (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_1642) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) |v_ULTIMATE.start_dll_update_at_~head#1.offset_20| v_ArrVal_1643) 4)))) (forall ((v_prenex_3 Int) (v_ArrVal_1642 (Array Int Int))) (not (= |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (select (store (select (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) (+ |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| 4)) v_ArrVal_1642) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) |v_ULTIMATE.start_dll_update_at_~head#1.offset_20| v_prenex_3) 4))))) (< |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| |v_ULTIMATE.start_dll_update_at_~head#1.offset_20|))) is different from false [2021-12-16 06:04:47,611 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_dll_update_at_~head#1.offset_20| Int)) (or (and (forall ((v_ArrVal_1642 (Array Int Int)) (v_ArrVal_1641 (Array Int Int)) (v_ArrVal_1643 Int)) (let ((.cse1 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_1641))) (let ((.cse0 (select (select .cse1 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) (+ |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| 4)))) (= .cse0 (select (store (select (store .cse1 .cse0 v_ArrVal_1642) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) |v_ULTIMATE.start_dll_update_at_~head#1.offset_20| v_ArrVal_1643) 4))))) (forall ((v_prenex_3 Int) (v_ArrVal_1642 (Array Int Int)) (v_ArrVal_1641 (Array Int Int))) (not (= |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (select (store (select (let ((.cse2 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_1641))) (store .cse2 (select (select .cse2 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) (+ |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| 4)) v_ArrVal_1642)) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) |v_ULTIMATE.start_dll_update_at_~head#1.offset_20| v_prenex_3) 4))))) (< |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| |v_ULTIMATE.start_dll_update_at_~head#1.offset_20|))) is different from false [2021-12-16 06:04:47,731 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_dll_update_at_~head#1.offset_20| Int)) (or (and (forall ((v_ArrVal_1642 (Array Int Int)) (v_ArrVal_1641 (Array Int Int)) (v_ArrVal_1643 Int)) (let ((.cse1 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) (+ |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| 8) 0)) |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_1641))) (let ((.cse0 (select (select .cse1 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) (+ |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| 4)))) (= .cse0 (select (store (select (store .cse1 .cse0 v_ArrVal_1642) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) |v_ULTIMATE.start_dll_update_at_~head#1.offset_20| v_ArrVal_1643) 4))))) (forall ((v_prenex_3 Int) (v_ArrVal_1642 (Array Int Int)) (v_ArrVal_1641 (Array Int Int))) (not (= |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (select (store (select (let ((.cse2 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) (+ |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| 8) 0)) |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_1641))) (store .cse2 (select (select .cse2 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) (+ |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| 4)) v_ArrVal_1642)) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) |v_ULTIMATE.start_dll_update_at_~head#1.offset_20| v_prenex_3) 4))))) (< |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| |v_ULTIMATE.start_dll_update_at_~head#1.offset_20|))) is different from false [2021-12-16 06:04:47,747 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-16 06:04:47,763 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-16 06:04:47,763 INFO L388 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 1 new quantified variables, introduced 2 case distinctions, treesize of input 136 treesize of output 82 [2021-12-16 06:04:47,771 INFO L388 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 451 treesize of output 417 [2021-12-16 06:04:47,783 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-16 06:04:47,820 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-16 06:04:47,820 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 456 treesize of output 410 [2021-12-16 06:04:47,853 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-16 06:04:47,854 INFO L388 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 333 treesize of output 300 [2021-12-16 06:04:47,867 INFO L388 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 329 treesize of output 321 [2021-12-16 06:04:47,881 INFO L388 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 343 treesize of output 339 [2021-12-16 06:04:47,914 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-16 06:04:47,914 INFO L388 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 350 treesize of output 343 [2021-12-16 06:04:49,210 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 2 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 13 not checked. [2021-12-16 06:04:49,210 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [568018542] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-16 06:04:49,210 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-16 06:04:49,210 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 21, 21] total 55 [2021-12-16 06:04:49,210 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1481237247] [2021-12-16 06:04:49,210 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-16 06:04:49,211 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 56 states [2021-12-16 06:04:49,211 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-16 06:04:49,211 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 56 interpolants. [2021-12-16 06:04:49,212 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=171, Invalid=1929, Unknown=10, NotChecked=970, Total=3080 [2021-12-16 06:04:49,212 INFO L87 Difference]: Start difference. First operand 55 states and 56 transitions. Second operand has 56 states, 55 states have (on average 2.2363636363636363) internal successors, (123), 56 states have internal predecessors, (123), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-16 06:05:20,751 WARN L227 SmtUtils]: Spent 29.05s on a formula simplification. DAG size of input: 45 DAG size of output: 38 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2021-12-16 06:05:21,820 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~s~0#1.base|))) (and (forall ((|v_ULTIMATE.start_dll_update_at_~head#1.offset_20| Int)) (or (and (forall ((v_ArrVal_1643 Int)) (= (select |c_#valid| (select (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~s~0#1.base|) |v_ULTIMATE.start_dll_update_at_~head#1.offset_20| v_ArrVal_1643) 4)) 1)) (forall ((v_ArrVal_1643 Int)) (not (= |c_ULTIMATE.start_main_~s~0#1.base| (select (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~s~0#1.base|) |v_ULTIMATE.start_dll_update_at_~head#1.offset_20| v_ArrVal_1643) 4))))) (< |c_ULTIMATE.start_main_~s~0#1.offset| |v_ULTIMATE.start_dll_update_at_~head#1.offset_20|))) (= (select .cse0 8) 0) (not (= (select .cse0 4) |c_ULTIMATE.start_main_~s~0#1.base|)) (= |c_ULTIMATE.start_main_~s~0#1.offset| 0) (= 1 (select |c_#valid| (select .cse0 (+ |c_ULTIMATE.start_main_~s~0#1.offset| 4)))) (not (= 0 |c_ULTIMATE.start_main_~s~0#1.base|)))) is different from false [2021-12-16 06:05:22,609 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-16 06:05:22,609 INFO L93 Difference]: Finished difference Result 62 states and 63 transitions. [2021-12-16 06:05:22,609 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2021-12-16 06:05:22,610 INFO L78 Accepts]: Start accepts. Automaton has has 56 states, 55 states have (on average 2.2363636363636363) internal successors, (123), 56 states have internal predecessors, (123), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 45 [2021-12-16 06:05:22,610 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-16 06:05:22,610 INFO L225 Difference]: With dead ends: 62 [2021-12-16 06:05:22,610 INFO L226 Difference]: Without dead ends: 62 [2021-12-16 06:05:22,612 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 136 GetRequests, 54 SyntacticMatches, 8 SemanticMatches, 74 ConstructedPredicates, 11 IntricatePredicates, 0 DeprecatedPredicates, 1061 ImplicationChecksByTransitivity, 36.0s TimeCoverageRelationStatistics Valid=478, Invalid=3715, Unknown=11, NotChecked=1496, Total=5700 [2021-12-16 06:05:22,612 INFO L933 BasicCegarLoop]: 15 mSDtfsCounter, 141 mSDsluCounter, 342 mSDsCounter, 0 mSdLazyCounter, 762 mSolverCounterSat, 44 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 141 SdHoareTripleChecker+Valid, 357 SdHoareTripleChecker+Invalid, 1227 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 44 IncrementalHoareTripleChecker+Valid, 762 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 421 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2021-12-16 06:05:22,612 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [141 Valid, 357 Invalid, 1227 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [44 Valid, 762 Invalid, 0 Unknown, 421 Unchecked, 0.8s Time] [2021-12-16 06:05:22,613 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2021-12-16 06:05:22,613 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 58. [2021-12-16 06:05:22,614 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 58 states, 53 states have (on average 1.150943396226415) internal successors, (61), 57 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-16 06:05:22,614 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 61 transitions. [2021-12-16 06:05:22,614 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 61 transitions. Word has length 45 [2021-12-16 06:05:22,614 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-16 06:05:22,614 INFO L470 AbstractCegarLoop]: Abstraction has 58 states and 61 transitions. [2021-12-16 06:05:22,615 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 56 states, 55 states have (on average 2.2363636363636363) internal successors, (123), 56 states have internal predecessors, (123), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-16 06:05:22,615 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 61 transitions. [2021-12-16 06:05:22,615 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2021-12-16 06:05:22,615 INFO L506 BasicCegarLoop]: Found error trace [2021-12-16 06:05:22,615 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 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] [2021-12-16 06:05:22,637 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Ended with exit code 0 [2021-12-16 06:05:22,831 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable23 [2021-12-16 06:05:22,831 INFO L402 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr17REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 19 more)] === [2021-12-16 06:05:22,832 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-16 06:05:22,832 INFO L85 PathProgramCache]: Analyzing trace with hash -2002912180, now seen corresponding path program 1 times [2021-12-16 06:05:22,832 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-16 06:05:22,832 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2117345537] [2021-12-16 06:05:22,832 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-16 06:05:22,832 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-16 06:05:22,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 06:05:23,720 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 2 proven. 15 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2021-12-16 06:05:23,720 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-16 06:05:23,720 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2117345537] [2021-12-16 06:05:23,720 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2117345537] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-16 06:05:23,720 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [893661709] [2021-12-16 06:05:23,720 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-16 06:05:23,720 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-16 06:05:23,720 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-16 06:05:23,724 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-16 06:05:23,725 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2021-12-16 06:05:23,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 06:05:23,890 INFO L263 TraceCheckSpWp]: Trace formula consists of 337 conjuncts, 83 conjunts are in the unsatisfiable core [2021-12-16 06:05:23,893 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-16 06:05:23,906 INFO L388 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 [2021-12-16 06:05:24,071 INFO L354 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-12-16 06:05:24,071 INFO L388 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 [2021-12-16 06:05:24,157 INFO L388 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 13 treesize of output 9 [2021-12-16 06:05:24,166 INFO L388 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 13 treesize of output 9 [2021-12-16 06:05:24,245 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-16 06:05:24,246 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2021-12-16 06:05:24,265 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-16 06:05:24,265 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2021-12-16 06:05:24,348 INFO L354 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-12-16 06:05:24,349 INFO L388 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 54 treesize of output 53 [2021-12-16 06:05:24,355 INFO L388 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 41 treesize of output 41 [2021-12-16 06:05:24,937 INFO L354 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-12-16 06:05:24,938 INFO L388 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 48 treesize of output 47 [2021-12-16 06:05:24,943 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-16 06:05:24,944 INFO L388 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 35 treesize of output 35 [2021-12-16 06:05:25,098 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-16 06:05:25,099 INFO L388 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 35 treesize of output 30 [2021-12-16 06:05:25,105 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-16 06:05:25,106 INFO L388 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 34 treesize of output 29 [2021-12-16 06:05:25,326 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-16 06:05:25,326 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 27 treesize of output 23 [2021-12-16 06:05:25,345 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-16 06:05:25,346 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 17 treesize of output 17 [2021-12-16 06:05:25,804 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 2 proven. 17 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-12-16 06:05:25,804 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-16 06:05:28,781 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_dll_update_at_~head#1.offset_23| Int)) (or (and (forall ((v_ArrVal_1778 Int)) (<= 0 (+ (select (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~s~0#1.base|) |v_ULTIMATE.start_dll_update_at_~head#1.offset_23| v_ArrVal_1778) 4) 4))) (forall ((v_ArrVal_1780 Int) (v_ArrVal_1778 Int)) (<= (+ (select (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~s~0#1.base|) |v_ULTIMATE.start_dll_update_at_~head#1.offset_23| v_ArrVal_1778) 4) 8) (select |c_#length| (select (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~s~0#1.base|) |v_ULTIMATE.start_dll_update_at_~head#1.offset_23| v_ArrVal_1780) 4))))) (< |c_ULTIMATE.start_main_~s~0#1.offset| |v_ULTIMATE.start_dll_update_at_~head#1.offset_23|))) is different from false [2021-12-16 06:05:28,918 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_dll_update_at_~head#1.offset_23| Int)) (or (and (forall ((v_ArrVal_1775 (Array Int Int)) (v_ArrVal_1778 Int)) (<= 0 (+ (select (store (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_update_at_~head#1.base| v_ArrVal_1775) |c_ULTIMATE.start_main_~s~0#1.base|) |v_ULTIMATE.start_dll_update_at_~head#1.offset_23| v_ArrVal_1778) 4) 4))) (forall ((v_ArrVal_1776 (Array Int Int)) (v_ArrVal_1775 (Array Int Int)) (v_ArrVal_1780 Int) (v_ArrVal_1778 Int)) (<= (+ (select (store (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_update_at_~head#1.base| v_ArrVal_1775) |c_ULTIMATE.start_main_~s~0#1.base|) |v_ULTIMATE.start_dll_update_at_~head#1.offset_23| v_ArrVal_1778) 4) 8) (select |c_#length| (select (store (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_update_at_~head#1.base| v_ArrVal_1776) |c_ULTIMATE.start_main_~s~0#1.base|) |v_ULTIMATE.start_dll_update_at_~head#1.offset_23| v_ArrVal_1780) 4))))) (< |c_ULTIMATE.start_main_~s~0#1.offset| |v_ULTIMATE.start_dll_update_at_~head#1.offset_23|))) is different from false [2021-12-16 06:05:29,010 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_dll_update_at_~head#1.offset_23| Int)) (or (and (forall ((v_ArrVal_1776 (Array Int Int)) (v_ArrVal_1775 (Array Int Int)) (v_ArrVal_1780 Int) (v_ArrVal_1778 Int)) (<= (+ (select (store (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_update_at_#t~mem10#1.base| v_ArrVal_1775) |c_ULTIMATE.start_main_~s~0#1.base|) |v_ULTIMATE.start_dll_update_at_~head#1.offset_23| v_ArrVal_1778) 4) 8) (select |c_#length| (select (store (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_update_at_#t~mem10#1.base| v_ArrVal_1776) |c_ULTIMATE.start_main_~s~0#1.base|) |v_ULTIMATE.start_dll_update_at_~head#1.offset_23| v_ArrVal_1780) 4)))) (forall ((v_ArrVal_1775 (Array Int Int)) (v_ArrVal_1778 Int)) (<= 0 (+ (select (store (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_update_at_#t~mem10#1.base| v_ArrVal_1775) |c_ULTIMATE.start_main_~s~0#1.base|) |v_ULTIMATE.start_dll_update_at_~head#1.offset_23| v_ArrVal_1778) 4) 4)))) (< |c_ULTIMATE.start_main_~s~0#1.offset| |v_ULTIMATE.start_dll_update_at_~head#1.offset_23|))) is different from false [2021-12-16 06:05:29,065 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_dll_update_at_~head#1.offset_23| Int)) (or (and (forall ((v_ArrVal_1776 (Array Int Int)) (v_ArrVal_1775 (Array Int Int)) (v_ArrVal_1780 Int) (v_ArrVal_1778 Int)) (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_update_at_~head#1.base|) (+ |c_ULTIMATE.start_dll_update_at_~head#1.offset| 4)))) (<= (+ (select (store (select (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_1775) |c_ULTIMATE.start_main_~s~0#1.base|) |v_ULTIMATE.start_dll_update_at_~head#1.offset_23| v_ArrVal_1778) 4) 8) (select |c_#length| (select (store (select (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_1776) |c_ULTIMATE.start_main_~s~0#1.base|) |v_ULTIMATE.start_dll_update_at_~head#1.offset_23| v_ArrVal_1780) 4))))) (forall ((v_ArrVal_1775 (Array Int Int)) (v_ArrVal_1778 Int)) (<= 0 (+ (select (store (select (store |c_#memory_$Pointer$.offset| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_update_at_~head#1.base|) (+ |c_ULTIMATE.start_dll_update_at_~head#1.offset| 4)) v_ArrVal_1775) |c_ULTIMATE.start_main_~s~0#1.base|) |v_ULTIMATE.start_dll_update_at_~head#1.offset_23| v_ArrVal_1778) 4) 4)))) (< |c_ULTIMATE.start_main_~s~0#1.offset| |v_ULTIMATE.start_dll_update_at_~head#1.offset_23|))) is different from false [2021-12-16 06:05:29,170 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_dll_update_at_~head#1.offset_23| Int)) (or (and (forall ((v_ArrVal_1776 (Array Int Int)) (v_ArrVal_1775 (Array Int Int)) (v_ArrVal_1780 Int) (v_ArrVal_1778 Int)) (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~s~0#1.base|) (+ |c_ULTIMATE.start_main_~s~0#1.offset| 4)))) (<= (+ (select (store (select (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_1775) |c_ULTIMATE.start_main_~s~0#1.base|) |v_ULTIMATE.start_dll_update_at_~head#1.offset_23| v_ArrVal_1778) 4) 8) (select |c_#length| (select (store (select (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_1776) |c_ULTIMATE.start_main_~s~0#1.base|) |v_ULTIMATE.start_dll_update_at_~head#1.offset_23| v_ArrVal_1780) 4))))) (forall ((v_ArrVal_1775 (Array Int Int)) (v_ArrVal_1778 Int)) (<= 0 (+ (select (store (select (store |c_#memory_$Pointer$.offset| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~s~0#1.base|) (+ |c_ULTIMATE.start_main_~s~0#1.offset| 4)) v_ArrVal_1775) |c_ULTIMATE.start_main_~s~0#1.base|) |v_ULTIMATE.start_dll_update_at_~head#1.offset_23| v_ArrVal_1778) 4) 4)))) (< |c_ULTIMATE.start_main_~s~0#1.offset| |v_ULTIMATE.start_dll_update_at_~head#1.offset_23|))) is different from false [2021-12-16 06:05:29,228 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_dll_update_at_~head#1.offset_23| Int)) (or (and (forall ((v_ArrVal_1776 (Array Int Int)) (v_ArrVal_1775 (Array Int Int)) (v_ArrVal_1780 Int) (v_ArrVal_1778 Int)) (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_#res#1.base|) (+ |c_ULTIMATE.start_dll_create_#res#1.offset| 4)))) (<= (+ (select (store (select (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_1775) |c_ULTIMATE.start_dll_create_#res#1.base|) |v_ULTIMATE.start_dll_update_at_~head#1.offset_23| v_ArrVal_1778) 4) 8) (select |c_#length| (select (store (select (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_1776) |c_ULTIMATE.start_dll_create_#res#1.base|) |v_ULTIMATE.start_dll_update_at_~head#1.offset_23| v_ArrVal_1780) 4))))) (forall ((v_ArrVal_1775 (Array Int Int)) (v_ArrVal_1778 Int)) (<= 0 (+ (select (store (select (store |c_#memory_$Pointer$.offset| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_#res#1.base|) (+ |c_ULTIMATE.start_dll_create_#res#1.offset| 4)) v_ArrVal_1775) |c_ULTIMATE.start_dll_create_#res#1.base|) |v_ULTIMATE.start_dll_update_at_~head#1.offset_23| v_ArrVal_1778) 4) 4)))) (< |c_ULTIMATE.start_dll_create_#res#1.offset| |v_ULTIMATE.start_dll_update_at_~head#1.offset_23|))) is different from false [2021-12-16 06:05:29,280 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_dll_update_at_~head#1.offset_23| Int)) (or (< |c_ULTIMATE.start_dll_create_~head~0#1.offset| |v_ULTIMATE.start_dll_update_at_~head#1.offset_23|) (and (forall ((v_ArrVal_1776 (Array Int Int)) (v_ArrVal_1775 (Array Int Int)) (v_ArrVal_1780 Int) (v_ArrVal_1778 Int)) (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~head~0#1.base|) (+ |c_ULTIMATE.start_dll_create_~head~0#1.offset| 4)))) (<= (+ (select (store (select (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_1775) |c_ULTIMATE.start_dll_create_~head~0#1.base|) |v_ULTIMATE.start_dll_update_at_~head#1.offset_23| v_ArrVal_1778) 4) 8) (select |c_#length| (select (store (select (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_1776) |c_ULTIMATE.start_dll_create_~head~0#1.base|) |v_ULTIMATE.start_dll_update_at_~head#1.offset_23| v_ArrVal_1780) 4))))) (forall ((v_ArrVal_1775 (Array Int Int)) (v_ArrVal_1778 Int)) (<= 0 (+ (select (store (select (store |c_#memory_$Pointer$.offset| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~head~0#1.base|) (+ |c_ULTIMATE.start_dll_create_~head~0#1.offset| 4)) v_ArrVal_1775) |c_ULTIMATE.start_dll_create_~head~0#1.base|) |v_ULTIMATE.start_dll_update_at_~head#1.offset_23| v_ArrVal_1778) 4) 4)))))) is different from false [2021-12-16 06:05:29,386 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_dll_update_at_~head#1.offset_23| Int)) (or (< |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| |v_ULTIMATE.start_dll_update_at_~head#1.offset_23|) (and (forall ((v_ArrVal_1776 (Array Int Int)) (v_ArrVal_1775 (Array Int Int)) (v_ArrVal_1780 Int) (v_ArrVal_1778 Int)) (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) (+ |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| 4)))) (<= (+ (select (store (select (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_1775) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) |v_ULTIMATE.start_dll_update_at_~head#1.offset_23| v_ArrVal_1778) 4) 8) (select |c_#length| (select (store (select (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_1776) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) |v_ULTIMATE.start_dll_update_at_~head#1.offset_23| v_ArrVal_1780) 4))))) (forall ((v_ArrVal_1775 (Array Int Int)) (v_ArrVal_1778 Int)) (<= 0 (+ (select (store (select (store |c_#memory_$Pointer$.offset| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) (+ |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| 4)) v_ArrVal_1775) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) |v_ULTIMATE.start_dll_update_at_~head#1.offset_23| v_ArrVal_1778) 4) 4)))))) is different from false [2021-12-16 06:05:29,415 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-16 06:05:29,416 INFO L388 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 87 treesize of output 91 [2021-12-16 06:05:29,608 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_dll_update_at_~head#1.offset_23| Int)) (or (< |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| |v_ULTIMATE.start_dll_update_at_~head#1.offset_23|) (and (forall ((v_ArrVal_1774 (Array Int Int)) (v_prenex_14 Int) (v_ArrVal_1773 (Array Int Int)) (v_prenex_13 (Array Int Int))) (<= (select (store (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_1774) (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_1773) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) (+ |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| 4)) v_prenex_13) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) |v_ULTIMATE.start_dll_update_at_~head#1.offset_23| v_prenex_14) 4) (+ |c_ULTIMATE.start_dll_create_~head~0#1.offset| 4))) (forall ((v_ArrVal_1775 (Array Int Int)) (v_ArrVal_1774 (Array Int Int)) (v_ArrVal_1773 (Array Int Int)) (v_ArrVal_1778 Int)) (<= 0 (+ (select (store (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_1774) (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_1773) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) (+ |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| 4)) v_ArrVal_1775) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) |v_ULTIMATE.start_dll_update_at_~head#1.offset_23| v_ArrVal_1778) 4) 4))) (forall ((v_ArrVal_1776 (Array Int Int)) (v_ArrVal_1780 Int) (v_ArrVal_1773 (Array Int Int))) (= |c_ULTIMATE.start_dll_create_~head~0#1.base| (select (store (select (let ((.cse0 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_1773))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) (+ |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| 4)) v_ArrVal_1776)) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) |v_ULTIMATE.start_dll_update_at_~head#1.offset_23| v_ArrVal_1780) 4)))))) is different from false [2021-12-16 06:05:29,774 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_dll_update_at_~head#1.offset_23| Int)) (or (and (forall ((v_ArrVal_1772 Int) (v_ArrVal_1774 (Array Int Int)) (v_prenex_14 Int) (v_ArrVal_1773 (Array Int Int)) (v_prenex_13 (Array Int Int)) (v_ArrVal_1769 Int)) (<= (select (store (select (let ((.cse0 (+ |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| 8))) (store (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) .cse0 v_ArrVal_1769)) |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_1774) (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) .cse0 v_ArrVal_1772)) |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_1773) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) (+ |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| 4)) v_prenex_13)) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) |v_ULTIMATE.start_dll_update_at_~head#1.offset_23| v_prenex_14) 4) (+ |c_ULTIMATE.start_dll_create_~head~0#1.offset| 4))) (forall ((v_ArrVal_1775 (Array Int Int)) (v_ArrVal_1772 Int) (v_ArrVal_1774 (Array Int Int)) (v_ArrVal_1773 (Array Int Int)) (v_ArrVal_1778 Int) (v_ArrVal_1769 Int)) (<= 0 (+ (select (store (select (let ((.cse1 (+ |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| 8))) (store (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) .cse1 v_ArrVal_1769)) |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_1774) (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) .cse1 v_ArrVal_1772)) |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_1773) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) (+ |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| 4)) v_ArrVal_1775)) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) |v_ULTIMATE.start_dll_update_at_~head#1.offset_23| v_ArrVal_1778) 4) 4))) (forall ((v_ArrVal_1776 (Array Int Int)) (v_ArrVal_1780 Int) (v_ArrVal_1772 Int) (v_ArrVal_1773 (Array Int Int))) (= |c_ULTIMATE.start_dll_create_~head~0#1.base| (select (store (select (let ((.cse2 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) (+ |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| 8) v_ArrVal_1772)) |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_1773))) (store .cse2 (select (select .cse2 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) (+ |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| 4)) v_ArrVal_1776)) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) |v_ULTIMATE.start_dll_update_at_~head#1.offset_23| v_ArrVal_1780) 4)))) (< |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| |v_ULTIMATE.start_dll_update_at_~head#1.offset_23|))) is different from false [2021-12-16 06:05:29,791 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-16 06:05:29,808 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-16 06:05:29,809 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 2 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 4 case distinctions, treesize of input 170 treesize of output 181 [2021-12-16 06:05:29,815 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-16 06:05:29,832 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-16 06:05:29,832 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 3 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 3 new quantified variables, introduced 6 case distinctions, treesize of input 181 treesize of output 181 [2021-12-16 06:05:29,838 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-16 06:05:29,843 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-16 06:05:29,843 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 210 treesize of output 192 [2021-12-16 06:05:29,862 INFO L388 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 484 treesize of output 472 [2021-12-16 06:05:29,873 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-16 06:05:29,903 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-16 06:05:29,904 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 520 treesize of output 524 [2021-12-16 06:05:29,914 INFO L388 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 775 treesize of output 755 [2021-12-16 06:05:29,927 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-16 06:05:29,959 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-16 06:05:29,959 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 775 treesize of output 759 [2021-12-16 06:05:29,973 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-16 06:05:29,980 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-16 06:05:29,980 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 788 treesize of output 770 [2021-12-16 06:05:29,995 INFO L388 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 980 treesize of output 970 [2021-12-16 06:05:30,014 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-16 06:05:30,053 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-16 06:05:30,054 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 1006 treesize of output 1012 [2021-12-16 06:05:30,096 INFO L388 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 905 treesize of output 897 [2021-12-16 06:05:30,116 INFO L388 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 993 treesize of output 977 [2021-12-16 06:05:30,130 INFO L388 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 977 treesize of output 953 [2021-12-16 06:05:30,165 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-16 06:05:30,165 INFO L388 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 973 treesize of output 956 [2021-12-16 06:05:30,192 INFO L388 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 981 treesize of output 975 [2021-12-16 06:05:30,211 INFO L388 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 1047 treesize of output 1035 [2021-12-16 06:05:30,226 INFO L388 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 1035 treesize of output 1011 [2021-12-16 06:05:30,246 INFO L388 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 1051 treesize of output 1043 [2021-12-16 06:05:33,595 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 2 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 13 not checked. [2021-12-16 06:05:33,595 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [893661709] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-16 06:05:33,595 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-16 06:05:33,595 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 19, 21] total 58 [2021-12-16 06:05:33,595 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [909245032] [2021-12-16 06:05:33,595 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-16 06:05:33,596 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 59 states [2021-12-16 06:05:33,596 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-16 06:05:33,596 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 59 interpolants. [2021-12-16 06:05:33,597 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=195, Invalid=2187, Unknown=10, NotChecked=1030, Total=3422 [2021-12-16 06:05:33,597 INFO L87 Difference]: Start difference. First operand 58 states and 61 transitions. Second operand has 59 states, 58 states have (on average 2.2241379310344827) internal successors, (129), 59 states have internal predecessors, (129), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)