./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/forester-heap/dll-circular-2.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/forester-heap/dll-circular-2.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 5b2cf85bdf3ceca18f859bba09ed8bf6de8160130db2f8571365ac2bc4f0e30c --- Real Ultimate output --- This is Ultimate 0.2.2-tmp.no-commuhash-c3fed41 [2021-12-18 21:24:35,781 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-12-18 21:24:35,782 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-12-18 21:24:35,836 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-12-18 21:24:35,836 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-12-18 21:24:35,839 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-12-18 21:24:35,840 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-12-18 21:24:35,843 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-12-18 21:24:35,844 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-12-18 21:24:35,847 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-12-18 21:24:35,847 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-12-18 21:24:35,848 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-12-18 21:24:35,849 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-12-18 21:24:35,850 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-12-18 21:24:35,851 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-12-18 21:24:35,853 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-12-18 21:24:35,853 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-12-18 21:24:35,854 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-12-18 21:24:35,857 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-12-18 21:24:35,861 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-12-18 21:24:35,861 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-12-18 21:24:35,862 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-12-18 21:24:35,863 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-12-18 21:24:35,864 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-12-18 21:24:35,868 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-12-18 21:24:35,869 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-12-18 21:24:35,869 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-12-18 21:24:35,870 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-12-18 21:24:35,870 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-12-18 21:24:35,871 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-12-18 21:24:35,871 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-12-18 21:24:35,872 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-12-18 21:24:35,873 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-12-18 21:24:35,874 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-12-18 21:24:35,874 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-12-18 21:24:35,875 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-12-18 21:24:35,875 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-12-18 21:24:35,875 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-12-18 21:24:35,875 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-12-18 21:24:35,876 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-12-18 21:24:35,876 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-12-18 21:24:35,878 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2021-12-18 21:24:35,903 INFO L113 SettingsManager]: Loading preferences was successful [2021-12-18 21:24:35,904 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-12-18 21:24:35,904 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-12-18 21:24:35,904 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-12-18 21:24:35,905 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2021-12-18 21:24:35,905 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2021-12-18 21:24:35,905 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-12-18 21:24:35,906 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-12-18 21:24:35,906 INFO L138 SettingsManager]: * Use SBE=true [2021-12-18 21:24:35,906 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-12-18 21:24:35,907 INFO L138 SettingsManager]: * sizeof long=4 [2021-12-18 21:24:35,907 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2021-12-18 21:24:35,907 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-12-18 21:24:35,907 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-12-18 21:24:35,907 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-12-18 21:24:35,907 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2021-12-18 21:24:35,907 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2021-12-18 21:24:35,908 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2021-12-18 21:24:35,908 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-12-18 21:24:35,908 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2021-12-18 21:24:35,908 INFO L138 SettingsManager]: * sizeof long double=12 [2021-12-18 21:24:35,908 INFO L138 SettingsManager]: * Use constant arrays=true [2021-12-18 21:24:35,908 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-12-18 21:24:35,909 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-12-18 21:24:35,909 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-12-18 21:24:35,909 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-12-18 21:24:35,909 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-12-18 21:24:35,910 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-12-18 21:24:35,910 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-12-18 21:24:35,910 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-12-18 21:24:35,911 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-12-18 21:24:35,911 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 -> 5b2cf85bdf3ceca18f859bba09ed8bf6de8160130db2f8571365ac2bc4f0e30c [2021-12-18 21:24:36,110 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-12-18 21:24:36,134 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-12-18 21:24:36,137 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-12-18 21:24:36,138 INFO L271 PluginConnector]: Initializing CDTParser... [2021-12-18 21:24:36,138 INFO L275 PluginConnector]: CDTParser initialized [2021-12-18 21:24:36,139 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/forester-heap/dll-circular-2.i [2021-12-18 21:24:36,204 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b7e76a427/ac5c511c83a74ba6930155f381e2ce8f/FLAG1a89b8466 [2021-12-18 21:24:36,614 INFO L306 CDTParser]: Found 1 translation units. [2021-12-18 21:24:36,614 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/dll-circular-2.i [2021-12-18 21:24:36,630 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b7e76a427/ac5c511c83a74ba6930155f381e2ce8f/FLAG1a89b8466 [2021-12-18 21:24:36,639 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b7e76a427/ac5c511c83a74ba6930155f381e2ce8f [2021-12-18 21:24:36,641 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-12-18 21:24:36,642 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-12-18 21:24:36,647 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-12-18 21:24:36,648 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-12-18 21:24:36,650 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-12-18 21:24:36,650 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.12 09:24:36" (1/1) ... [2021-12-18 21:24:36,651 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7ab41f80 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 09:24:36, skipping insertion in model container [2021-12-18 21:24:36,652 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.12 09:24:36" (1/1) ... [2021-12-18 21:24:36,656 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-12-18 21:24:36,686 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-12-18 21:24:36,899 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/forester-heap/dll-circular-2.i[22391,22404] [2021-12-18 21:24:36,903 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/forester-heap/dll-circular-2.i[22497,22510] [2021-12-18 21:24:36,904 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/forester-heap/dll-circular-2.i[22622,22635] [2021-12-18 21:24:36,907 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-12-18 21:24:36,912 INFO L203 MainTranslator]: Completed pre-run [2021-12-18 21:24:36,933 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/forester-heap/dll-circular-2.i[22391,22404] [2021-12-18 21:24:36,934 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/forester-heap/dll-circular-2.i[22497,22510] [2021-12-18 21:24:36,935 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/forester-heap/dll-circular-2.i[22622,22635] [2021-12-18 21:24:36,936 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-12-18 21:24:36,952 INFO L208 MainTranslator]: Completed translation [2021-12-18 21:24:36,953 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 09:24:36 WrapperNode [2021-12-18 21:24:36,953 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-12-18 21:24:36,954 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-12-18 21:24:36,954 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-12-18 21:24:36,954 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-12-18 21:24:36,958 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 09:24:36" (1/1) ... [2021-12-18 21:24:36,967 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 09:24:36" (1/1) ... [2021-12-18 21:24:36,981 INFO L137 Inliner]: procedures = 119, calls = 31, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 123 [2021-12-18 21:24:36,981 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-12-18 21:24:36,984 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-12-18 21:24:36,984 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-12-18 21:24:36,984 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-12-18 21:24:36,990 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 09:24:36" (1/1) ... [2021-12-18 21:24:36,990 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 09:24:36" (1/1) ... [2021-12-18 21:24:36,993 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 09:24:36" (1/1) ... [2021-12-18 21:24:36,993 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 09:24:36" (1/1) ... [2021-12-18 21:24:36,999 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 09:24:36" (1/1) ... [2021-12-18 21:24:37,005 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 09:24:36" (1/1) ... [2021-12-18 21:24:37,009 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 09:24:36" (1/1) ... [2021-12-18 21:24:37,013 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-12-18 21:24:37,014 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-12-18 21:24:37,014 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-12-18 21:24:37,014 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-12-18 21:24:37,017 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 09:24:36" (1/1) ... [2021-12-18 21:24:37,024 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-12-18 21:24:37,032 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-18 21:24:37,042 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-18 21:24:37,044 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-18 21:24:37,064 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2021-12-18 21:24:37,065 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2021-12-18 21:24:37,065 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2021-12-18 21:24:37,065 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2021-12-18 21:24:37,065 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2021-12-18 21:24:37,065 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2021-12-18 21:24:37,065 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-12-18 21:24:37,065 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-12-18 21:24:37,066 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-12-18 21:24:37,066 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-12-18 21:24:37,124 INFO L236 CfgBuilder]: Building ICFG [2021-12-18 21:24:37,125 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2021-12-18 21:24:37,390 INFO L277 CfgBuilder]: Performing block encoding [2021-12-18 21:24:37,394 INFO L296 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-12-18 21:24:37,395 INFO L301 CfgBuilder]: Removed 9 assume(true) statements. [2021-12-18 21:24:37,397 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.12 09:24:37 BoogieIcfgContainer [2021-12-18 21:24:37,397 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-12-18 21:24:37,398 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-12-18 21:24:37,398 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-12-18 21:24:37,400 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-12-18 21:24:37,400 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 18.12 09:24:36" (1/3) ... [2021-12-18 21:24:37,401 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@14c38d67 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.12 09:24:37, skipping insertion in model container [2021-12-18 21:24:37,401 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 09:24:36" (2/3) ... [2021-12-18 21:24:37,401 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@14c38d67 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.12 09:24:37, skipping insertion in model container [2021-12-18 21:24:37,401 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.12 09:24:37" (3/3) ... [2021-12-18 21:24:37,402 INFO L111 eAbstractionObserver]: Analyzing ICFG dll-circular-2.i [2021-12-18 21:24:37,406 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-12-18 21:24:37,406 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 52 error locations. [2021-12-18 21:24:37,442 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2021-12-18 21:24:37,448 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-18 21:24:37,448 INFO L340 AbstractCegarLoop]: Starting to check reachability of 52 error locations. [2021-12-18 21:24:37,465 INFO L276 IsEmpty]: Start isEmpty. Operand has 112 states, 59 states have (on average 2.2033898305084745) internal successors, (130), 111 states have internal predecessors, (130), 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-18 21:24:37,477 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2021-12-18 21:24:37,478 INFO L506 BasicCegarLoop]: Found error trace [2021-12-18 21:24:37,479 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1] [2021-12-18 21:24:37,479 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 48 more)] === [2021-12-18 21:24:37,484 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-18 21:24:37,486 INFO L85 PathProgramCache]: Analyzing trace with hash 29857, now seen corresponding path program 1 times [2021-12-18 21:24:37,491 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-18 21:24:37,491 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [432285277] [2021-12-18 21:24:37,491 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-18 21:24:37,492 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-18 21:24:37,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 21:24:37,613 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-18 21:24:37,614 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-18 21:24:37,614 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [432285277] [2021-12-18 21:24:37,614 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [432285277] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-18 21:24:37,615 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-18 21:24:37,615 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-12-18 21:24:37,616 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1036788351] [2021-12-18 21:24:37,617 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-18 21:24:37,620 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-12-18 21:24:37,620 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-18 21:24:37,656 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-18 21:24:37,657 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-18 21:24:37,659 INFO L87 Difference]: Start difference. First operand has 112 states, 59 states have (on average 2.2033898305084745) internal successors, (130), 111 states have internal predecessors, (130), 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) Second operand has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 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-18 21:24:37,762 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-18 21:24:37,762 INFO L93 Difference]: Finished difference Result 117 states and 124 transitions. [2021-12-18 21:24:37,763 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-18 21:24:37,764 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 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 3 [2021-12-18 21:24:37,765 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-18 21:24:37,770 INFO L225 Difference]: With dead ends: 117 [2021-12-18 21:24:37,770 INFO L226 Difference]: Without dead ends: 115 [2021-12-18 21:24:37,771 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-18 21:24:37,773 INFO L933 BasicCegarLoop]: 69 mSDtfsCounter, 95 mSDsluCounter, 11 mSDsCounter, 0 mSdLazyCounter, 58 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 95 SdHoareTripleChecker+Valid, 80 SdHoareTripleChecker+Invalid, 63 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 58 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-18 21:24:37,774 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [95 Valid, 80 Invalid, 63 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 58 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-18 21:24:37,785 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115 states. [2021-12-18 21:24:37,795 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115 to 105. [2021-12-18 21:24:37,796 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 105 states, 58 states have (on average 1.9137931034482758) internal successors, (111), 104 states have internal predecessors, (111), 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-18 21:24:37,798 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 111 transitions. [2021-12-18 21:24:37,799 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 111 transitions. Word has length 3 [2021-12-18 21:24:37,799 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-18 21:24:37,799 INFO L470 AbstractCegarLoop]: Abstraction has 105 states and 111 transitions. [2021-12-18 21:24:37,799 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 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-18 21:24:37,799 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 111 transitions. [2021-12-18 21:24:37,800 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2021-12-18 21:24:37,800 INFO L506 BasicCegarLoop]: Found error trace [2021-12-18 21:24:37,800 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1] [2021-12-18 21:24:37,800 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-12-18 21:24:37,800 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 48 more)] === [2021-12-18 21:24:37,801 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-18 21:24:37,801 INFO L85 PathProgramCache]: Analyzing trace with hash 29858, now seen corresponding path program 1 times [2021-12-18 21:24:37,801 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-18 21:24:37,801 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1789080953] [2021-12-18 21:24:37,802 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-18 21:24:37,802 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-18 21:24:37,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 21:24:37,833 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-18 21:24:37,833 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-18 21:24:37,833 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1789080953] [2021-12-18 21:24:37,834 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1789080953] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-18 21:24:37,834 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-18 21:24:37,834 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-12-18 21:24:37,834 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [385228199] [2021-12-18 21:24:37,834 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-18 21:24:37,835 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-12-18 21:24:37,835 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-18 21:24:37,836 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-18 21:24:37,836 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-18 21:24:37,836 INFO L87 Difference]: Start difference. First operand 105 states and 111 transitions. Second operand has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 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-18 21:24:37,912 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-18 21:24:37,912 INFO L93 Difference]: Finished difference Result 112 states and 118 transitions. [2021-12-18 21:24:37,912 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-18 21:24:37,913 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 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 3 [2021-12-18 21:24:37,913 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-18 21:24:37,915 INFO L225 Difference]: With dead ends: 112 [2021-12-18 21:24:37,915 INFO L226 Difference]: Without dead ends: 112 [2021-12-18 21:24:37,917 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-18 21:24:37,918 INFO L933 BasicCegarLoop]: 69 mSDtfsCounter, 92 mSDsluCounter, 11 mSDsCounter, 0 mSdLazyCounter, 49 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 92 SdHoareTripleChecker+Valid, 80 SdHoareTripleChecker+Invalid, 54 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 49 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-18 21:24:37,919 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [92 Valid, 80 Invalid, 54 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 49 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-18 21:24:37,922 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2021-12-18 21:24:37,930 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 100. [2021-12-18 21:24:37,931 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 100 states, 58 states have (on average 1.8275862068965518) internal successors, (106), 99 states have internal predecessors, (106), 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-18 21:24:37,933 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 106 transitions. [2021-12-18 21:24:37,934 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 106 transitions. Word has length 3 [2021-12-18 21:24:37,935 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-18 21:24:37,935 INFO L470 AbstractCegarLoop]: Abstraction has 100 states and 106 transitions. [2021-12-18 21:24:37,936 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 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-18 21:24:37,936 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 106 transitions. [2021-12-18 21:24:37,936 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2021-12-18 21:24:37,936 INFO L506 BasicCegarLoop]: Found error trace [2021-12-18 21:24:37,937 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-18 21:24:37,937 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-12-18 21:24:37,937 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr19REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 48 more)] === [2021-12-18 21:24:37,938 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-18 21:24:37,938 INFO L85 PathProgramCache]: Analyzing trace with hash 1837112040, now seen corresponding path program 1 times [2021-12-18 21:24:37,938 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-18 21:24:37,939 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [920468016] [2021-12-18 21:24:37,939 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-18 21:24:37,939 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-18 21:24:37,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 21:24:37,978 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-18 21:24:37,978 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-18 21:24:37,979 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [920468016] [2021-12-18 21:24:37,979 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [920468016] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-18 21:24:37,979 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-18 21:24:37,979 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-12-18 21:24:37,979 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [722846284] [2021-12-18 21:24:37,979 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-18 21:24:37,980 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-12-18 21:24:37,980 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-18 21:24:37,980 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-12-18 21:24:37,980 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-12-18 21:24:37,981 INFO L87 Difference]: Start difference. First operand 100 states and 106 transitions. Second operand has 4 states, 3 states have (on average 3.0) internal successors, (9), 4 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-18 21:24:38,057 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-18 21:24:38,058 INFO L93 Difference]: Finished difference Result 97 states and 104 transitions. [2021-12-18 21:24:38,058 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-12-18 21:24:38,058 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 3.0) internal successors, (9), 4 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-18 21:24:38,058 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-18 21:24:38,061 INFO L225 Difference]: With dead ends: 97 [2021-12-18 21:24:38,061 INFO L226 Difference]: Without dead ends: 97 [2021-12-18 21:24:38,065 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-12-18 21:24:38,068 INFO L933 BasicCegarLoop]: 46 mSDtfsCounter, 149 mSDsluCounter, 8 mSDsCounter, 0 mSdLazyCounter, 79 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 149 SdHoareTripleChecker+Valid, 54 SdHoareTripleChecker+Invalid, 101 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 79 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-18 21:24:38,069 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [149 Valid, 54 Invalid, 101 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 79 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-18 21:24:38,070 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2021-12-18 21:24:38,077 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 88. [2021-12-18 21:24:38,079 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 88 states, 58 states have (on average 1.6206896551724137) internal successors, (94), 87 states have internal predecessors, (94), 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-18 21:24:38,080 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 94 transitions. [2021-12-18 21:24:38,081 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 94 transitions. Word has length 9 [2021-12-18 21:24:38,082 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-18 21:24:38,082 INFO L470 AbstractCegarLoop]: Abstraction has 88 states and 94 transitions. [2021-12-18 21:24:38,082 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 3.0) internal successors, (9), 4 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-18 21:24:38,082 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 94 transitions. [2021-12-18 21:24:38,082 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2021-12-18 21:24:38,083 INFO L506 BasicCegarLoop]: Found error trace [2021-12-18 21:24:38,083 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-18 21:24:38,083 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-12-18 21:24:38,084 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr20REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 48 more)] === [2021-12-18 21:24:38,085 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-18 21:24:38,085 INFO L85 PathProgramCache]: Analyzing trace with hash 1837112041, now seen corresponding path program 1 times [2021-12-18 21:24:38,085 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-18 21:24:38,085 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1599428199] [2021-12-18 21:24:38,085 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-18 21:24:38,086 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-18 21:24:38,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 21:24:38,144 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-18 21:24:38,145 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-18 21:24:38,145 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1599428199] [2021-12-18 21:24:38,145 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1599428199] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-18 21:24:38,145 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-18 21:24:38,145 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-12-18 21:24:38,145 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [962503148] [2021-12-18 21:24:38,146 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-18 21:24:38,146 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-12-18 21:24:38,146 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-18 21:24:38,146 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-12-18 21:24:38,147 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-12-18 21:24:38,147 INFO L87 Difference]: Start difference. First operand 88 states and 94 transitions. Second operand has 4 states, 3 states have (on average 3.0) internal successors, (9), 4 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-18 21:24:38,245 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-18 21:24:38,245 INFO L93 Difference]: Finished difference Result 113 states and 120 transitions. [2021-12-18 21:24:38,245 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-12-18 21:24:38,246 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 3.0) internal successors, (9), 4 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-18 21:24:38,246 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-18 21:24:38,246 INFO L225 Difference]: With dead ends: 113 [2021-12-18 21:24:38,246 INFO L226 Difference]: Without dead ends: 113 [2021-12-18 21:24:38,247 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-12-18 21:24:38,247 INFO L933 BasicCegarLoop]: 57 mSDtfsCounter, 103 mSDsluCounter, 44 mSDsCounter, 0 mSdLazyCounter, 106 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 103 SdHoareTripleChecker+Valid, 101 SdHoareTripleChecker+Invalid, 112 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 106 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-18 21:24:38,248 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [103 Valid, 101 Invalid, 112 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 106 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-18 21:24:38,248 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113 states. [2021-12-18 21:24:38,250 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113 to 97. [2021-12-18 21:24:38,251 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 97 states, 67 states have (on average 1.5820895522388059) internal successors, (106), 96 states have internal predecessors, (106), 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-18 21:24:38,251 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 106 transitions. [2021-12-18 21:24:38,251 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 106 transitions. Word has length 9 [2021-12-18 21:24:38,251 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-18 21:24:38,252 INFO L470 AbstractCegarLoop]: Abstraction has 97 states and 106 transitions. [2021-12-18 21:24:38,252 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 3.0) internal successors, (9), 4 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-18 21:24:38,252 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 106 transitions. [2021-12-18 21:24:38,252 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2021-12-18 21:24:38,252 INFO L506 BasicCegarLoop]: Found error trace [2021-12-18 21:24:38,252 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-18 21:24:38,253 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-12-18 21:24:38,253 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr11REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 48 more)] === [2021-12-18 21:24:38,253 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-18 21:24:38,253 INFO L85 PathProgramCache]: Analyzing trace with hash -1363413642, now seen corresponding path program 1 times [2021-12-18 21:24:38,253 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-18 21:24:38,254 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1774465893] [2021-12-18 21:24:38,254 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-18 21:24:38,254 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-18 21:24:38,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 21:24:38,323 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-18 21:24:38,323 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-18 21:24:38,323 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1774465893] [2021-12-18 21:24:38,324 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1774465893] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-18 21:24:38,325 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-18 21:24:38,325 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-12-18 21:24:38,325 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [481829313] [2021-12-18 21:24:38,325 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-18 21:24:38,326 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-12-18 21:24:38,326 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-18 21:24:38,326 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-12-18 21:24:38,326 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-12-18 21:24:38,326 INFO L87 Difference]: Start difference. First operand 97 states and 106 transitions. Second operand has 5 states, 4 states have (on average 3.0) internal successors, (12), 5 states have internal predecessors, (12), 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-18 21:24:38,415 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-18 21:24:38,415 INFO L93 Difference]: Finished difference Result 96 states and 104 transitions. [2021-12-18 21:24:38,416 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-12-18 21:24:38,416 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 3.0) internal successors, (12), 5 states have internal predecessors, (12), 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 12 [2021-12-18 21:24:38,416 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-18 21:24:38,416 INFO L225 Difference]: With dead ends: 96 [2021-12-18 21:24:38,416 INFO L226 Difference]: Without dead ends: 96 [2021-12-18 21:24:38,417 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2021-12-18 21:24:38,418 INFO L933 BasicCegarLoop]: 87 mSDtfsCounter, 6 mSDsluCounter, 137 mSDsCounter, 0 mSdLazyCounter, 137 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 224 SdHoareTripleChecker+Invalid, 138 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 137 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-18 21:24:38,418 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [6 Valid, 224 Invalid, 138 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 137 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-18 21:24:38,420 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2021-12-18 21:24:38,424 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 96. [2021-12-18 21:24:38,424 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 96 states, 67 states have (on average 1.5522388059701493) internal successors, (104), 95 states have internal predecessors, (104), 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-18 21:24:38,426 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 104 transitions. [2021-12-18 21:24:38,426 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 104 transitions. Word has length 12 [2021-12-18 21:24:38,426 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-18 21:24:38,426 INFO L470 AbstractCegarLoop]: Abstraction has 96 states and 104 transitions. [2021-12-18 21:24:38,426 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 3.0) internal successors, (12), 5 states have internal predecessors, (12), 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-18 21:24:38,426 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 104 transitions. [2021-12-18 21:24:38,427 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2021-12-18 21:24:38,430 INFO L506 BasicCegarLoop]: Found error trace [2021-12-18 21:24:38,430 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-18 21:24:38,430 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-12-18 21:24:38,430 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr10REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 48 more)] === [2021-12-18 21:24:38,431 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-18 21:24:38,431 INFO L85 PathProgramCache]: Analyzing trace with hash -1363413643, now seen corresponding path program 1 times [2021-12-18 21:24:38,431 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-18 21:24:38,431 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [885245258] [2021-12-18 21:24:38,431 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-18 21:24:38,432 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-18 21:24:38,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 21:24:38,479 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-18 21:24:38,480 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-18 21:24:38,480 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [885245258] [2021-12-18 21:24:38,480 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [885245258] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-18 21:24:38,480 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-18 21:24:38,480 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-12-18 21:24:38,480 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [337440227] [2021-12-18 21:24:38,481 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-18 21:24:38,481 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-12-18 21:24:38,481 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-18 21:24:38,481 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-12-18 21:24:38,482 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-12-18 21:24:38,482 INFO L87 Difference]: Start difference. First operand 96 states and 104 transitions. Second operand has 5 states, 4 states have (on average 3.0) internal successors, (12), 5 states have internal predecessors, (12), 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-18 21:24:38,563 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-18 21:24:38,564 INFO L93 Difference]: Finished difference Result 95 states and 102 transitions. [2021-12-18 21:24:38,564 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-12-18 21:24:38,564 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 3.0) internal successors, (12), 5 states have internal predecessors, (12), 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 12 [2021-12-18 21:24:38,565 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-18 21:24:38,565 INFO L225 Difference]: With dead ends: 95 [2021-12-18 21:24:38,565 INFO L226 Difference]: Without dead ends: 95 [2021-12-18 21:24:38,565 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2021-12-18 21:24:38,569 INFO L933 BasicCegarLoop]: 86 mSDtfsCounter, 7 mSDsluCounter, 143 mSDsCounter, 0 mSdLazyCounter, 126 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 229 SdHoareTripleChecker+Invalid, 128 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 126 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-18 21:24:38,569 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [7 Valid, 229 Invalid, 128 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 126 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-18 21:24:38,570 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2021-12-18 21:24:38,579 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 95. [2021-12-18 21:24:38,580 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 95 states, 67 states have (on average 1.5223880597014925) internal successors, (102), 94 states have internal predecessors, (102), 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-18 21:24:38,580 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 102 transitions. [2021-12-18 21:24:38,580 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 102 transitions. Word has length 12 [2021-12-18 21:24:38,581 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-18 21:24:38,581 INFO L470 AbstractCegarLoop]: Abstraction has 95 states and 102 transitions. [2021-12-18 21:24:38,581 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 3.0) internal successors, (12), 5 states have internal predecessors, (12), 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-18 21:24:38,581 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 102 transitions. [2021-12-18 21:24:38,581 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2021-12-18 21:24:38,581 INFO L506 BasicCegarLoop]: Found error trace [2021-12-18 21:24:38,582 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-18 21:24:38,582 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2021-12-18 21:24:38,582 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr23ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 48 more)] === [2021-12-18 21:24:38,582 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-18 21:24:38,582 INFO L85 PathProgramCache]: Analyzing trace with hash 683852107, now seen corresponding path program 1 times [2021-12-18 21:24:38,583 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-18 21:24:38,583 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [28595067] [2021-12-18 21:24:38,583 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-18 21:24:38,583 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-18 21:24:38,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 21:24:38,700 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-18 21:24:38,700 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-18 21:24:38,700 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [28595067] [2021-12-18 21:24:38,700 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [28595067] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-18 21:24:38,701 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-18 21:24:38,701 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-12-18 21:24:38,701 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1992114676] [2021-12-18 21:24:38,701 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-18 21:24:38,701 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2021-12-18 21:24:38,701 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-18 21:24:38,702 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-12-18 21:24:38,702 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2021-12-18 21:24:38,702 INFO L87 Difference]: Start difference. First operand 95 states and 102 transitions. Second operand has 8 states, 8 states have (on average 1.625) internal successors, (13), 8 states have internal predecessors, (13), 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-18 21:24:38,851 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-18 21:24:38,851 INFO L93 Difference]: Finished difference Result 178 states and 189 transitions. [2021-12-18 21:24:38,852 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-12-18 21:24:38,852 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 1.625) internal successors, (13), 8 states have internal predecessors, (13), 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 13 [2021-12-18 21:24:38,852 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-18 21:24:38,853 INFO L225 Difference]: With dead ends: 178 [2021-12-18 21:24:38,853 INFO L226 Difference]: Without dead ends: 178 [2021-12-18 21:24:38,853 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=48, Invalid=84, Unknown=0, NotChecked=0, Total=132 [2021-12-18 21:24:38,853 INFO L933 BasicCegarLoop]: 67 mSDtfsCounter, 279 mSDsluCounter, 217 mSDsCounter, 0 mSdLazyCounter, 140 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 279 SdHoareTripleChecker+Valid, 284 SdHoareTripleChecker+Invalid, 153 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 140 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-18 21:24:38,854 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [279 Valid, 284 Invalid, 153 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 140 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-18 21:24:38,854 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 178 states. [2021-12-18 21:24:38,855 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 178 to 98. [2021-12-18 21:24:38,856 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 98 states, 70 states have (on average 1.5) internal successors, (105), 97 states have internal predecessors, (105), 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-18 21:24:38,856 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 105 transitions. [2021-12-18 21:24:38,856 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 105 transitions. Word has length 13 [2021-12-18 21:24:38,856 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-18 21:24:38,856 INFO L470 AbstractCegarLoop]: Abstraction has 98 states and 105 transitions. [2021-12-18 21:24:38,857 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 1.625) internal successors, (13), 8 states have internal predecessors, (13), 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-18 21:24:38,857 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 105 transitions. [2021-12-18 21:24:38,857 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2021-12-18 21:24:38,857 INFO L506 BasicCegarLoop]: Found error trace [2021-12-18 21:24:38,857 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-18 21:24:38,857 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2021-12-18 21:24:38,857 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr24REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 48 more)] === [2021-12-18 21:24:38,858 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-18 21:24:38,858 INFO L85 PathProgramCache]: Analyzing trace with hash -275416990, now seen corresponding path program 1 times [2021-12-18 21:24:38,858 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-18 21:24:38,858 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1484526536] [2021-12-18 21:24:38,858 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-18 21:24:38,858 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-18 21:24:38,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 21:24:38,943 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-18 21:24:38,943 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-18 21:24:38,943 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1484526536] [2021-12-18 21:24:38,943 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1484526536] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-18 21:24:38,943 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-18 21:24:38,944 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-12-18 21:24:38,944 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1866924325] [2021-12-18 21:24:38,944 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-18 21:24:38,944 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2021-12-18 21:24:38,944 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-18 21:24:38,944 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-12-18 21:24:38,945 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2021-12-18 21:24:38,945 INFO L87 Difference]: Start difference. First operand 98 states and 105 transitions. Second operand has 8 states, 7 states have (on average 2.0) internal successors, (14), 8 states have internal predecessors, (14), 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-18 21:24:39,130 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-18 21:24:39,131 INFO L93 Difference]: Finished difference Result 140 states and 149 transitions. [2021-12-18 21:24:39,131 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-12-18 21:24:39,131 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 2.0) internal successors, (14), 8 states have internal predecessors, (14), 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 14 [2021-12-18 21:24:39,131 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-18 21:24:39,132 INFO L225 Difference]: With dead ends: 140 [2021-12-18 21:24:39,132 INFO L226 Difference]: Without dead ends: 140 [2021-12-18 21:24:39,132 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=53, Invalid=103, Unknown=0, NotChecked=0, Total=156 [2021-12-18 21:24:39,132 INFO L933 BasicCegarLoop]: 46 mSDtfsCounter, 314 mSDsluCounter, 164 mSDsCounter, 0 mSdLazyCounter, 268 mSolverCounterSat, 33 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 314 SdHoareTripleChecker+Valid, 210 SdHoareTripleChecker+Invalid, 301 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 33 IncrementalHoareTripleChecker+Valid, 268 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-18 21:24:39,132 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [314 Valid, 210 Invalid, 301 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [33 Valid, 268 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-18 21:24:39,133 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 140 states. [2021-12-18 21:24:39,134 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 140 to 100. [2021-12-18 21:24:39,134 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 100 states, 72 states have (on average 1.5) internal successors, (108), 99 states have internal predecessors, (108), 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-18 21:24:39,134 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 108 transitions. [2021-12-18 21:24:39,134 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 108 transitions. Word has length 14 [2021-12-18 21:24:39,134 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-18 21:24:39,134 INFO L470 AbstractCegarLoop]: Abstraction has 100 states and 108 transitions. [2021-12-18 21:24:39,135 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 2.0) internal successors, (14), 8 states have internal predecessors, (14), 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-18 21:24:39,135 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 108 transitions. [2021-12-18 21:24:39,135 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2021-12-18 21:24:39,135 INFO L506 BasicCegarLoop]: Found error trace [2021-12-18 21:24:39,135 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-18 21:24:39,135 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2021-12-18 21:24:39,135 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr25REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 48 more)] === [2021-12-18 21:24:39,135 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-18 21:24:39,135 INFO L85 PathProgramCache]: Analyzing trace with hash -275416989, now seen corresponding path program 1 times [2021-12-18 21:24:39,135 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-18 21:24:39,135 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1961100937] [2021-12-18 21:24:39,135 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-18 21:24:39,136 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-18 21:24:39,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 21:24:39,242 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-18 21:24:39,243 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-18 21:24:39,243 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1961100937] [2021-12-18 21:24:39,243 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1961100937] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-18 21:24:39,243 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-18 21:24:39,243 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-12-18 21:24:39,243 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1589699806] [2021-12-18 21:24:39,243 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-18 21:24:39,243 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2021-12-18 21:24:39,243 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-18 21:24:39,243 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-12-18 21:24:39,244 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2021-12-18 21:24:39,244 INFO L87 Difference]: Start difference. First operand 100 states and 108 transitions. Second operand has 8 states, 7 states have (on average 2.0) internal successors, (14), 8 states have internal predecessors, (14), 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-18 21:24:39,444 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-18 21:24:39,444 INFO L93 Difference]: Finished difference Result 172 states and 183 transitions. [2021-12-18 21:24:39,444 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-12-18 21:24:39,444 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 2.0) internal successors, (14), 8 states have internal predecessors, (14), 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 14 [2021-12-18 21:24:39,444 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-18 21:24:39,445 INFO L225 Difference]: With dead ends: 172 [2021-12-18 21:24:39,445 INFO L226 Difference]: Without dead ends: 172 [2021-12-18 21:24:39,445 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=47, Invalid=85, Unknown=0, NotChecked=0, Total=132 [2021-12-18 21:24:39,446 INFO L933 BasicCegarLoop]: 54 mSDtfsCounter, 254 mSDsluCounter, 162 mSDsCounter, 0 mSdLazyCounter, 223 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 254 SdHoareTripleChecker+Valid, 216 SdHoareTripleChecker+Invalid, 245 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 223 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-18 21:24:39,446 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [254 Valid, 216 Invalid, 245 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 223 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-18 21:24:39,446 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 172 states. [2021-12-18 21:24:39,448 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 172 to 112. [2021-12-18 21:24:39,448 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 112 states, 84 states have (on average 1.5) internal successors, (126), 111 states have internal predecessors, (126), 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-18 21:24:39,448 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 126 transitions. [2021-12-18 21:24:39,448 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 126 transitions. Word has length 14 [2021-12-18 21:24:39,448 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-18 21:24:39,448 INFO L470 AbstractCegarLoop]: Abstraction has 112 states and 126 transitions. [2021-12-18 21:24:39,448 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 2.0) internal successors, (14), 8 states have internal predecessors, (14), 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-18 21:24:39,448 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 126 transitions. [2021-12-18 21:24:39,449 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2021-12-18 21:24:39,449 INFO L506 BasicCegarLoop]: Found error trace [2021-12-18 21:24:39,449 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-18 21:24:39,449 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2021-12-18 21:24:39,449 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr14REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 48 more)] === [2021-12-18 21:24:39,449 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-18 21:24:39,449 INFO L85 PathProgramCache]: Analyzing trace with hash 1546362871, now seen corresponding path program 1 times [2021-12-18 21:24:39,449 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-18 21:24:39,449 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2122315512] [2021-12-18 21:24:39,450 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-18 21:24:39,450 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-18 21:24:39,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 21:24:39,513 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-18 21:24:39,513 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-18 21:24:39,513 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2122315512] [2021-12-18 21:24:39,513 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2122315512] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-18 21:24:39,514 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-18 21:24:39,514 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-12-18 21:24:39,514 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [690800881] [2021-12-18 21:24:39,514 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-18 21:24:39,514 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2021-12-18 21:24:39,514 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-18 21:24:39,515 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-12-18 21:24:39,515 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2021-12-18 21:24:39,515 INFO L87 Difference]: Start difference. First operand 112 states and 126 transitions. Second operand has 9 states, 8 states have (on average 2.0) internal successors, (16), 9 states have internal predecessors, (16), 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-18 21:24:39,744 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-18 21:24:39,744 INFO L93 Difference]: Finished difference Result 120 states and 135 transitions. [2021-12-18 21:24:39,744 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-12-18 21:24:39,744 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 2.0) internal successors, (16), 9 states have internal predecessors, (16), 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-18 21:24:39,744 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-18 21:24:39,745 INFO L225 Difference]: With dead ends: 120 [2021-12-18 21:24:39,745 INFO L226 Difference]: Without dead ends: 120 [2021-12-18 21:24:39,745 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=82, Invalid=190, Unknown=0, NotChecked=0, Total=272 [2021-12-18 21:24:39,746 INFO L933 BasicCegarLoop]: 46 mSDtfsCounter, 167 mSDsluCounter, 164 mSDsCounter, 0 mSdLazyCounter, 368 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 167 SdHoareTripleChecker+Valid, 210 SdHoareTripleChecker+Invalid, 389 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 368 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-12-18 21:24:39,746 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [167 Valid, 210 Invalid, 389 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 368 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2021-12-18 21:24:39,746 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 120 states. [2021-12-18 21:24:39,747 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 120 to 111. [2021-12-18 21:24:39,748 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 111 states, 84 states have (on average 1.4880952380952381) internal successors, (125), 110 states have internal predecessors, (125), 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-18 21:24:39,748 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 125 transitions. [2021-12-18 21:24:39,748 INFO L78 Accepts]: Start accepts. Automaton has 111 states and 125 transitions. Word has length 16 [2021-12-18 21:24:39,748 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-18 21:24:39,748 INFO L470 AbstractCegarLoop]: Abstraction has 111 states and 125 transitions. [2021-12-18 21:24:39,749 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 2.0) internal successors, (16), 9 states have internal predecessors, (16), 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-18 21:24:39,749 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 125 transitions. [2021-12-18 21:24:39,749 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2021-12-18 21:24:39,749 INFO L506 BasicCegarLoop]: Found error trace [2021-12-18 21:24:39,749 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-18 21:24:39,749 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2021-12-18 21:24:39,749 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr15REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 48 more)] === [2021-12-18 21:24:39,750 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-18 21:24:39,750 INFO L85 PathProgramCache]: Analyzing trace with hash 1546362872, now seen corresponding path program 1 times [2021-12-18 21:24:39,750 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-18 21:24:39,750 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1489358796] [2021-12-18 21:24:39,750 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-18 21:24:39,750 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-18 21:24:39,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 21:24:39,830 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-18 21:24:39,831 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-18 21:24:39,831 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1489358796] [2021-12-18 21:24:39,831 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1489358796] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-18 21:24:39,831 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-18 21:24:39,831 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2021-12-18 21:24:39,831 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [177302530] [2021-12-18 21:24:39,831 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-18 21:24:39,832 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2021-12-18 21:24:39,832 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-18 21:24:39,832 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-12-18 21:24:39,832 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2021-12-18 21:24:39,832 INFO L87 Difference]: Start difference. First operand 111 states and 125 transitions. Second operand has 10 states, 9 states have (on average 1.7777777777777777) internal successors, (16), 10 states have internal predecessors, (16), 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-18 21:24:40,160 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-18 21:24:40,160 INFO L93 Difference]: Finished difference Result 115 states and 130 transitions. [2021-12-18 21:24:40,160 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2021-12-18 21:24:40,161 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 1.7777777777777777) internal successors, (16), 10 states have internal predecessors, (16), 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-18 21:24:40,161 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-18 21:24:40,161 INFO L225 Difference]: With dead ends: 115 [2021-12-18 21:24:40,161 INFO L226 Difference]: Without dead ends: 115 [2021-12-18 21:24:40,161 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=140, Invalid=366, Unknown=0, NotChecked=0, Total=506 [2021-12-18 21:24:40,162 INFO L933 BasicCegarLoop]: 48 mSDtfsCounter, 158 mSDsluCounter, 192 mSDsCounter, 0 mSdLazyCounter, 425 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 158 SdHoareTripleChecker+Valid, 240 SdHoareTripleChecker+Invalid, 448 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 425 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-12-18 21:24:40,162 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [158 Valid, 240 Invalid, 448 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 425 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2021-12-18 21:24:40,162 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115 states. [2021-12-18 21:24:40,163 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115 to 99. [2021-12-18 21:24:40,164 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 99 states, 78 states have (on average 1.4487179487179487) internal successors, (113), 98 states have internal predecessors, (113), 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-18 21:24:40,164 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 113 transitions. [2021-12-18 21:24:40,164 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 113 transitions. Word has length 16 [2021-12-18 21:24:40,164 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-18 21:24:40,164 INFO L470 AbstractCegarLoop]: Abstraction has 99 states and 113 transitions. [2021-12-18 21:24:40,164 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 1.7777777777777777) internal successors, (16), 10 states have internal predecessors, (16), 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-18 21:24:40,164 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 113 transitions. [2021-12-18 21:24:40,164 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2021-12-18 21:24:40,164 INFO L506 BasicCegarLoop]: Found error trace [2021-12-18 21:24:40,164 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-18 21:24:40,165 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2021-12-18 21:24:40,165 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr28REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 48 more)] === [2021-12-18 21:24:40,165 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-18 21:24:40,165 INFO L85 PathProgramCache]: Analyzing trace with hash -1559926215, now seen corresponding path program 1 times [2021-12-18 21:24:40,165 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-18 21:24:40,165 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [614816889] [2021-12-18 21:24:40,165 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-18 21:24:40,165 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-18 21:24:40,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 21:24:40,269 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-18 21:24:40,269 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-18 21:24:40,270 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [614816889] [2021-12-18 21:24:40,270 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [614816889] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-18 21:24:40,270 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-18 21:24:40,270 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-12-18 21:24:40,270 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [356033343] [2021-12-18 21:24:40,270 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-18 21:24:40,270 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2021-12-18 21:24:40,271 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-18 21:24:40,271 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-12-18 21:24:40,271 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2021-12-18 21:24:40,271 INFO L87 Difference]: Start difference. First operand 99 states and 113 transitions. Second operand has 9 states, 8 states have (on average 2.125) internal successors, (17), 9 states have internal predecessors, (17), 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-18 21:24:40,488 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-18 21:24:40,488 INFO L93 Difference]: Finished difference Result 147 states and 158 transitions. [2021-12-18 21:24:40,488 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-12-18 21:24:40,489 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 2.125) internal successors, (17), 9 states have internal predecessors, (17), 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 17 [2021-12-18 21:24:40,490 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-18 21:24:40,490 INFO L225 Difference]: With dead ends: 147 [2021-12-18 21:24:40,490 INFO L226 Difference]: Without dead ends: 147 [2021-12-18 21:24:40,491 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=71, Invalid=169, Unknown=0, NotChecked=0, Total=240 [2021-12-18 21:24:40,491 INFO L933 BasicCegarLoop]: 59 mSDtfsCounter, 265 mSDsluCounter, 263 mSDsCounter, 0 mSdLazyCounter, 257 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 265 SdHoareTripleChecker+Valid, 322 SdHoareTripleChecker+Invalid, 277 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 257 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-18 21:24:40,491 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [265 Valid, 322 Invalid, 277 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 257 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-18 21:24:40,491 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 147 states. [2021-12-18 21:24:40,492 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 147 to 99. [2021-12-18 21:24:40,493 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 99 states, 78 states have (on average 1.435897435897436) internal successors, (112), 98 states have internal predecessors, (112), 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-18 21:24:40,493 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 112 transitions. [2021-12-18 21:24:40,493 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 112 transitions. Word has length 17 [2021-12-18 21:24:40,493 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-18 21:24:40,493 INFO L470 AbstractCegarLoop]: Abstraction has 99 states and 112 transitions. [2021-12-18 21:24:40,493 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 2.125) internal successors, (17), 9 states have internal predecessors, (17), 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-18 21:24:40,493 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 112 transitions. [2021-12-18 21:24:40,494 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2021-12-18 21:24:40,494 INFO L506 BasicCegarLoop]: Found error trace [2021-12-18 21:24:40,494 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-18 21:24:40,494 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2021-12-18 21:24:40,494 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr29REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 48 more)] === [2021-12-18 21:24:40,494 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-18 21:24:40,494 INFO L85 PathProgramCache]: Analyzing trace with hash -1559926214, now seen corresponding path program 1 times [2021-12-18 21:24:40,494 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-18 21:24:40,494 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1916394931] [2021-12-18 21:24:40,494 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-18 21:24:40,494 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-18 21:24:40,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 21:24:40,599 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-18 21:24:40,599 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-18 21:24:40,599 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1916394931] [2021-12-18 21:24:40,599 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1916394931] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-18 21:24:40,600 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-18 21:24:40,600 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-12-18 21:24:40,600 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1382088011] [2021-12-18 21:24:40,600 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-18 21:24:40,600 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2021-12-18 21:24:40,600 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-18 21:24:40,601 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-12-18 21:24:40,601 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2021-12-18 21:24:40,601 INFO L87 Difference]: Start difference. First operand 99 states and 112 transitions. Second operand has 8 states, 7 states have (on average 2.4285714285714284) internal successors, (17), 8 states have internal predecessors, (17), 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-18 21:24:40,788 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-18 21:24:40,788 INFO L93 Difference]: Finished difference Result 157 states and 168 transitions. [2021-12-18 21:24:40,789 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-12-18 21:24:40,789 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 2.4285714285714284) internal successors, (17), 8 states have internal predecessors, (17), 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 17 [2021-12-18 21:24:40,789 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-18 21:24:40,789 INFO L225 Difference]: With dead ends: 157 [2021-12-18 21:24:40,789 INFO L226 Difference]: Without dead ends: 157 [2021-12-18 21:24:40,790 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=52, Invalid=104, Unknown=0, NotChecked=0, Total=156 [2021-12-18 21:24:40,790 INFO L933 BasicCegarLoop]: 51 mSDtfsCounter, 247 mSDsluCounter, 194 mSDsCounter, 0 mSdLazyCounter, 251 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 247 SdHoareTripleChecker+Valid, 245 SdHoareTripleChecker+Invalid, 269 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 251 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-18 21:24:40,790 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [247 Valid, 245 Invalid, 269 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 251 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-18 21:24:40,790 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 157 states. [2021-12-18 21:24:40,792 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 157 to 99. [2021-12-18 21:24:40,792 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 99 states, 78 states have (on average 1.4230769230769231) internal successors, (111), 98 states have internal predecessors, (111), 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-18 21:24:40,792 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 111 transitions. [2021-12-18 21:24:40,792 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 111 transitions. Word has length 17 [2021-12-18 21:24:40,792 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-18 21:24:40,792 INFO L470 AbstractCegarLoop]: Abstraction has 99 states and 111 transitions. [2021-12-18 21:24:40,792 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 2.4285714285714284) internal successors, (17), 8 states have internal predecessors, (17), 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-18 21:24:40,792 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 111 transitions. [2021-12-18 21:24:40,792 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2021-12-18 21:24:40,793 INFO L506 BasicCegarLoop]: Found error trace [2021-12-18 21:24:40,793 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-18 21:24:40,793 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2021-12-18 21:24:40,793 INFO L402 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr41REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 48 more)] === [2021-12-18 21:24:40,793 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-18 21:24:40,793 INFO L85 PathProgramCache]: Analyzing trace with hash -1113087206, now seen corresponding path program 1 times [2021-12-18 21:24:40,793 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-18 21:24:40,793 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [692560037] [2021-12-18 21:24:40,793 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-18 21:24:40,793 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-18 21:24:40,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 21:24:40,853 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-18 21:24:40,854 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-18 21:24:40,854 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [692560037] [2021-12-18 21:24:40,854 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [692560037] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-18 21:24:40,854 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-18 21:24:40,854 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-12-18 21:24:40,854 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1687465742] [2021-12-18 21:24:40,854 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-18 21:24:40,855 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2021-12-18 21:24:40,855 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-18 21:24:40,855 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-12-18 21:24:40,855 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2021-12-18 21:24:40,855 INFO L87 Difference]: Start difference. First operand 99 states and 111 transitions. Second operand has 8 states, 7 states have (on average 2.5714285714285716) internal successors, (18), 8 states have internal predecessors, (18), 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-18 21:24:41,016 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-18 21:24:41,016 INFO L93 Difference]: Finished difference Result 138 states and 152 transitions. [2021-12-18 21:24:41,017 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-12-18 21:24:41,017 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 2.5714285714285716) internal successors, (18), 8 states have internal predecessors, (18), 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 18 [2021-12-18 21:24:41,017 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-18 21:24:41,017 INFO L225 Difference]: With dead ends: 138 [2021-12-18 21:24:41,017 INFO L226 Difference]: Without dead ends: 138 [2021-12-18 21:24:41,018 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=51, Invalid=105, Unknown=0, NotChecked=0, Total=156 [2021-12-18 21:24:41,018 INFO L933 BasicCegarLoop]: 46 mSDtfsCounter, 287 mSDsluCounter, 161 mSDsCounter, 0 mSdLazyCounter, 234 mSolverCounterSat, 32 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 287 SdHoareTripleChecker+Valid, 207 SdHoareTripleChecker+Invalid, 266 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 32 IncrementalHoareTripleChecker+Valid, 234 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-18 21:24:41,018 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [287 Valid, 207 Invalid, 266 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [32 Valid, 234 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-18 21:24:41,019 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 138 states. [2021-12-18 21:24:41,020 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 138 to 116. [2021-12-18 21:24:41,020 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 116 states, 95 states have (on average 1.4947368421052631) internal successors, (142), 115 states have internal predecessors, (142), 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-18 21:24:41,021 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 116 states to 116 states and 142 transitions. [2021-12-18 21:24:41,021 INFO L78 Accepts]: Start accepts. Automaton has 116 states and 142 transitions. Word has length 18 [2021-12-18 21:24:41,021 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-18 21:24:41,021 INFO L470 AbstractCegarLoop]: Abstraction has 116 states and 142 transitions. [2021-12-18 21:24:41,021 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 2.5714285714285716) internal successors, (18), 8 states have internal predecessors, (18), 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-18 21:24:41,021 INFO L276 IsEmpty]: Start isEmpty. Operand 116 states and 142 transitions. [2021-12-18 21:24:41,021 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2021-12-18 21:24:41,022 INFO L506 BasicCegarLoop]: Found error trace [2021-12-18 21:24:41,022 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-18 21:24:41,022 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2021-12-18 21:24:41,022 INFO L402 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr42REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 48 more)] === [2021-12-18 21:24:41,022 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-18 21:24:41,022 INFO L85 PathProgramCache]: Analyzing trace with hash -1113087205, now seen corresponding path program 1 times [2021-12-18 21:24:41,022 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-18 21:24:41,023 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [248663037] [2021-12-18 21:24:41,023 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-18 21:24:41,023 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-18 21:24:41,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 21:24:41,135 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-18 21:24:41,135 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-18 21:24:41,135 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [248663037] [2021-12-18 21:24:41,135 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [248663037] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-18 21:24:41,135 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-18 21:24:41,136 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-12-18 21:24:41,136 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1903527852] [2021-12-18 21:24:41,136 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-18 21:24:41,136 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2021-12-18 21:24:41,136 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-18 21:24:41,136 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-12-18 21:24:41,137 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2021-12-18 21:24:41,137 INFO L87 Difference]: Start difference. First operand 116 states and 142 transitions. Second operand has 8 states, 7 states have (on average 2.5714285714285716) internal successors, (18), 8 states have internal predecessors, (18), 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-18 21:24:41,320 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-18 21:24:41,320 INFO L93 Difference]: Finished difference Result 159 states and 173 transitions. [2021-12-18 21:24:41,320 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-12-18 21:24:41,320 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 2.5714285714285716) internal successors, (18), 8 states have internal predecessors, (18), 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 18 [2021-12-18 21:24:41,320 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-18 21:24:41,321 INFO L225 Difference]: With dead ends: 159 [2021-12-18 21:24:41,321 INFO L226 Difference]: Without dead ends: 159 [2021-12-18 21:24:41,321 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=42, Invalid=90, Unknown=0, NotChecked=0, Total=132 [2021-12-18 21:24:41,321 INFO L933 BasicCegarLoop]: 44 mSDtfsCounter, 222 mSDsluCounter, 140 mSDsCounter, 0 mSdLazyCounter, 214 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 222 SdHoareTripleChecker+Valid, 184 SdHoareTripleChecker+Invalid, 240 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 214 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-18 21:24:41,322 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [222 Valid, 184 Invalid, 240 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 214 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-18 21:24:41,322 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 159 states. [2021-12-18 21:24:41,323 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 159 to 121. [2021-12-18 21:24:41,323 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 121 states, 100 states have (on average 1.47) internal successors, (147), 120 states have internal predecessors, (147), 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-18 21:24:41,324 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121 states to 121 states and 147 transitions. [2021-12-18 21:24:41,324 INFO L78 Accepts]: Start accepts. Automaton has 121 states and 147 transitions. Word has length 18 [2021-12-18 21:24:41,324 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-18 21:24:41,324 INFO L470 AbstractCegarLoop]: Abstraction has 121 states and 147 transitions. [2021-12-18 21:24:41,324 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 2.5714285714285716) internal successors, (18), 8 states have internal predecessors, (18), 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-18 21:24:41,324 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 147 transitions. [2021-12-18 21:24:41,324 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2021-12-18 21:24:41,324 INFO L506 BasicCegarLoop]: Found error trace [2021-12-18 21:24:41,324 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-18 21:24:41,325 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2021-12-18 21:24:41,325 INFO L402 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr49ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 48 more)] === [2021-12-18 21:24:41,325 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-18 21:24:41,325 INFO L85 PathProgramCache]: Analyzing trace with hash 1461687964, now seen corresponding path program 1 times [2021-12-18 21:24:41,325 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-18 21:24:41,325 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1550336541] [2021-12-18 21:24:41,325 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-18 21:24:41,325 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-18 21:24:41,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 21:24:41,412 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-18 21:24:41,412 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-18 21:24:41,412 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1550336541] [2021-12-18 21:24:41,413 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1550336541] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-18 21:24:41,413 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-18 21:24:41,413 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-12-18 21:24:41,413 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [68870528] [2021-12-18 21:24:41,413 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-18 21:24:41,413 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2021-12-18 21:24:41,413 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-18 21:24:41,414 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-12-18 21:24:41,414 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2021-12-18 21:24:41,414 INFO L87 Difference]: Start difference. First operand 121 states and 147 transitions. Second operand has 8 states, 7 states have (on average 3.0) internal successors, (21), 8 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-18 21:24:41,537 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-18 21:24:41,537 INFO L93 Difference]: Finished difference Result 155 states and 169 transitions. [2021-12-18 21:24:41,538 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-12-18 21:24:41,538 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 3.0) internal successors, (21), 8 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 21 [2021-12-18 21:24:41,538 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-18 21:24:41,538 INFO L225 Difference]: With dead ends: 155 [2021-12-18 21:24:41,538 INFO L226 Difference]: Without dead ends: 155 [2021-12-18 21:24:41,538 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=43, Invalid=89, Unknown=0, NotChecked=0, Total=132 [2021-12-18 21:24:41,539 INFO L933 BasicCegarLoop]: 66 mSDtfsCounter, 172 mSDsluCounter, 192 mSDsCounter, 0 mSdLazyCounter, 162 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 172 SdHoareTripleChecker+Valid, 258 SdHoareTripleChecker+Invalid, 176 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 162 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-18 21:24:41,539 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [172 Valid, 258 Invalid, 176 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 162 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-18 21:24:41,539 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 155 states. [2021-12-18 21:24:41,540 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 155 to 122. [2021-12-18 21:24:41,541 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 122 states, 101 states have (on average 1.4653465346534653) internal successors, (148), 121 states have internal predecessors, (148), 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-18 21:24:41,541 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 122 states to 122 states and 148 transitions. [2021-12-18 21:24:41,541 INFO L78 Accepts]: Start accepts. Automaton has 122 states and 148 transitions. Word has length 21 [2021-12-18 21:24:41,541 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-18 21:24:41,541 INFO L470 AbstractCegarLoop]: Abstraction has 122 states and 148 transitions. [2021-12-18 21:24:41,541 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 3.0) internal successors, (21), 8 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-18 21:24:41,541 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states and 148 transitions. [2021-12-18 21:24:41,542 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2021-12-18 21:24:41,542 INFO L506 BasicCegarLoop]: Found error trace [2021-12-18 21:24:41,542 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-18 21:24:41,542 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2021-12-18 21:24:41,542 INFO L402 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr36ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 48 more)] === [2021-12-18 21:24:41,542 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-18 21:24:41,542 INFO L85 PathProgramCache]: Analyzing trace with hash 1905376220, now seen corresponding path program 1 times [2021-12-18 21:24:41,542 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-18 21:24:41,542 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [228011021] [2021-12-18 21:24:41,542 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-18 21:24:41,542 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-18 21:24:41,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 21:24:41,558 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-18 21:24:41,558 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-18 21:24:41,558 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [228011021] [2021-12-18 21:24:41,558 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [228011021] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-18 21:24:41,558 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-18 21:24:41,559 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-12-18 21:24:41,559 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1201495] [2021-12-18 21:24:41,559 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-18 21:24:41,559 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-12-18 21:24:41,559 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-18 21:24:41,559 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-18 21:24:41,560 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-18 21:24:41,560 INFO L87 Difference]: Start difference. First operand 122 states and 148 transitions. Second operand has 3 states, 3 states have (on average 7.0) internal successors, (21), 3 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-18 21:24:41,564 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-18 21:24:41,564 INFO L93 Difference]: Finished difference Result 125 states and 151 transitions. [2021-12-18 21:24:41,564 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-18 21:24:41,564 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 7.0) internal successors, (21), 3 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 21 [2021-12-18 21:24:41,565 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-18 21:24:41,565 INFO L225 Difference]: With dead ends: 125 [2021-12-18 21:24:41,565 INFO L226 Difference]: Without dead ends: 125 [2021-12-18 21:24:41,565 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-18 21:24:41,566 INFO L933 BasicCegarLoop]: 84 mSDtfsCounter, 0 mSDsluCounter, 78 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 162 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-18 21:24:41,566 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 162 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-18 21:24:41,566 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 125 states. [2021-12-18 21:24:41,567 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 125 to 125. [2021-12-18 21:24:41,568 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 125 states, 104 states have (on average 1.4519230769230769) internal successors, (151), 124 states have internal predecessors, (151), 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-18 21:24:41,568 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 125 states to 125 states and 151 transitions. [2021-12-18 21:24:41,568 INFO L78 Accepts]: Start accepts. Automaton has 125 states and 151 transitions. Word has length 21 [2021-12-18 21:24:41,568 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-18 21:24:41,568 INFO L470 AbstractCegarLoop]: Abstraction has 125 states and 151 transitions. [2021-12-18 21:24:41,568 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 7.0) internal successors, (21), 3 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-18 21:24:41,569 INFO L276 IsEmpty]: Start isEmpty. Operand 125 states and 151 transitions. [2021-12-18 21:24:41,569 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2021-12-18 21:24:41,569 INFO L506 BasicCegarLoop]: Found error trace [2021-12-18 21:24:41,569 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-18 21:24:41,569 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2021-12-18 21:24:41,569 INFO L402 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr18ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 48 more)] === [2021-12-18 21:24:41,570 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-18 21:24:41,570 INFO L85 PathProgramCache]: Analyzing trace with hash 2137291894, now seen corresponding path program 1 times [2021-12-18 21:24:41,570 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-18 21:24:41,570 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1381561037] [2021-12-18 21:24:41,570 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-18 21:24:41,570 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-18 21:24:41,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 21:24:41,629 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-18 21:24:41,629 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-18 21:24:41,629 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1381561037] [2021-12-18 21:24:41,629 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1381561037] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-18 21:24:41,629 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-18 21:24:41,629 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2021-12-18 21:24:41,629 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1837229871] [2021-12-18 21:24:41,630 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-18 21:24:41,630 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2021-12-18 21:24:41,630 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-18 21:24:41,630 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-12-18 21:24:41,630 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2021-12-18 21:24:41,630 INFO L87 Difference]: Start difference. First operand 125 states and 151 transitions. Second operand has 10 states, 10 states have (on average 2.1) internal successors, (21), 10 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-18 21:24:41,848 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-18 21:24:41,848 INFO L93 Difference]: Finished difference Result 161 states and 192 transitions. [2021-12-18 21:24:41,848 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-12-18 21:24:41,848 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 2.1) internal successors, (21), 10 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 21 [2021-12-18 21:24:41,848 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-18 21:24:41,849 INFO L225 Difference]: With dead ends: 161 [2021-12-18 21:24:41,849 INFO L226 Difference]: Without dead ends: 161 [2021-12-18 21:24:41,849 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=60, Invalid=180, Unknown=0, NotChecked=0, Total=240 [2021-12-18 21:24:41,849 INFO L933 BasicCegarLoop]: 66 mSDtfsCounter, 131 mSDsluCounter, 290 mSDsCounter, 0 mSdLazyCounter, 423 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 131 SdHoareTripleChecker+Valid, 356 SdHoareTripleChecker+Invalid, 435 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 423 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-12-18 21:24:41,849 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [131 Valid, 356 Invalid, 435 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 423 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2021-12-18 21:24:41,850 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 161 states. [2021-12-18 21:24:41,851 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 161 to 139. [2021-12-18 21:24:41,851 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 139 states, 118 states have (on average 1.423728813559322) internal successors, (168), 138 states have internal predecessors, (168), 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-18 21:24:41,851 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 139 states to 139 states and 168 transitions. [2021-12-18 21:24:41,851 INFO L78 Accepts]: Start accepts. Automaton has 139 states and 168 transitions. Word has length 21 [2021-12-18 21:24:41,852 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-18 21:24:41,852 INFO L470 AbstractCegarLoop]: Abstraction has 139 states and 168 transitions. [2021-12-18 21:24:41,852 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 2.1) internal successors, (21), 10 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-18 21:24:41,852 INFO L276 IsEmpty]: Start isEmpty. Operand 139 states and 168 transitions. [2021-12-18 21:24:41,852 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2021-12-18 21:24:41,852 INFO L506 BasicCegarLoop]: Found error trace [2021-12-18 21:24:41,852 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-18 21:24:41,852 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2021-12-18 21:24:41,852 INFO L402 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr34REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 48 more)] === [2021-12-18 21:24:41,852 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-18 21:24:41,852 INFO L85 PathProgramCache]: Analyzing trace with hash -1062832435, now seen corresponding path program 1 times [2021-12-18 21:24:41,852 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-18 21:24:41,853 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1750866154] [2021-12-18 21:24:41,853 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-18 21:24:41,853 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-18 21:24:41,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 21:24:41,876 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-18 21:24:41,876 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-18 21:24:41,876 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1750866154] [2021-12-18 21:24:41,876 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1750866154] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-18 21:24:41,876 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-18 21:24:41,877 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-12-18 21:24:41,877 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1202432587] [2021-12-18 21:24:41,877 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-18 21:24:41,877 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-12-18 21:24:41,877 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-18 21:24:41,877 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-12-18 21:24:41,877 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-12-18 21:24:41,878 INFO L87 Difference]: Start difference. First operand 139 states and 168 transitions. Second operand has 5 states, 4 states have (on average 5.5) internal successors, (22), 5 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-18 21:24:41,947 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-18 21:24:41,947 INFO L93 Difference]: Finished difference Result 138 states and 165 transitions. [2021-12-18 21:24:41,947 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-12-18 21:24:41,947 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 5.5) internal successors, (22), 5 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-18 21:24:41,948 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-18 21:24:41,948 INFO L225 Difference]: With dead ends: 138 [2021-12-18 21:24:41,948 INFO L226 Difference]: Without dead ends: 138 [2021-12-18 21:24:41,948 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2021-12-18 21:24:41,949 INFO L933 BasicCegarLoop]: 74 mSDtfsCounter, 29 mSDsluCounter, 96 mSDsCounter, 0 mSdLazyCounter, 134 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 29 SdHoareTripleChecker+Valid, 170 SdHoareTripleChecker+Invalid, 134 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 134 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-18 21:24:41,949 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [29 Valid, 170 Invalid, 134 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 134 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-18 21:24:41,949 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 138 states. [2021-12-18 21:24:41,950 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 138 to 138. [2021-12-18 21:24:41,951 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 138 states, 118 states have (on average 1.3983050847457628) internal successors, (165), 137 states have internal predecessors, (165), 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-18 21:24:41,951 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 138 states to 138 states and 165 transitions. [2021-12-18 21:24:41,951 INFO L78 Accepts]: Start accepts. Automaton has 138 states and 165 transitions. Word has length 22 [2021-12-18 21:24:41,951 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-18 21:24:41,951 INFO L470 AbstractCegarLoop]: Abstraction has 138 states and 165 transitions. [2021-12-18 21:24:41,951 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 5.5) internal successors, (22), 5 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-18 21:24:41,952 INFO L276 IsEmpty]: Start isEmpty. Operand 138 states and 165 transitions. [2021-12-18 21:24:41,952 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2021-12-18 21:24:41,952 INFO L506 BasicCegarLoop]: Found error trace [2021-12-18 21:24:41,952 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-18 21:24:41,952 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2021-12-18 21:24:41,952 INFO L402 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr35REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 48 more)] === [2021-12-18 21:24:41,953 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-18 21:24:41,953 INFO L85 PathProgramCache]: Analyzing trace with hash -1062832434, now seen corresponding path program 1 times [2021-12-18 21:24:41,953 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-18 21:24:41,953 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [455639273] [2021-12-18 21:24:41,953 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-18 21:24:41,953 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-18 21:24:41,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 21:24:42,047 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-18 21:24:42,048 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-18 21:24:42,048 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [455639273] [2021-12-18 21:24:42,048 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [455639273] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-18 21:24:42,048 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-18 21:24:42,048 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2021-12-18 21:24:42,048 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2037977579] [2021-12-18 21:24:42,048 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-18 21:24:42,049 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2021-12-18 21:24:42,049 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-18 21:24:42,049 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-12-18 21:24:42,049 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2021-12-18 21:24:42,049 INFO L87 Difference]: Start difference. First operand 138 states and 165 transitions. Second operand has 10 states, 9 states have (on average 2.4444444444444446) internal successors, (22), 10 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-18 21:24:42,290 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-18 21:24:42,290 INFO L93 Difference]: Finished difference Result 157 states and 171 transitions. [2021-12-18 21:24:42,290 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-12-18 21:24:42,290 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 2.4444444444444446) internal successors, (22), 10 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-18 21:24:42,290 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-18 21:24:42,291 INFO L225 Difference]: With dead ends: 157 [2021-12-18 21:24:42,291 INFO L226 Difference]: Without dead ends: 157 [2021-12-18 21:24:42,291 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=89, Invalid=217, Unknown=0, NotChecked=0, Total=306 [2021-12-18 21:24:42,292 INFO L933 BasicCegarLoop]: 64 mSDtfsCounter, 180 mSDsluCounter, 276 mSDsCounter, 0 mSdLazyCounter, 277 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 180 SdHoareTripleChecker+Valid, 340 SdHoareTripleChecker+Invalid, 292 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 277 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-18 21:24:42,292 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [180 Valid, 340 Invalid, 292 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 277 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-18 21:24:42,292 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 157 states. [2021-12-18 21:24:42,293 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 157 to 138. [2021-12-18 21:24:42,294 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 138 states, 118 states have (on average 1.3898305084745763) internal successors, (164), 137 states have internal predecessors, (164), 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-18 21:24:42,294 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 138 states to 138 states and 164 transitions. [2021-12-18 21:24:42,294 INFO L78 Accepts]: Start accepts. Automaton has 138 states and 164 transitions. Word has length 22 [2021-12-18 21:24:42,294 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-18 21:24:42,294 INFO L470 AbstractCegarLoop]: Abstraction has 138 states and 164 transitions. [2021-12-18 21:24:42,294 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 2.4444444444444446) internal successors, (22), 10 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-18 21:24:42,295 INFO L276 IsEmpty]: Start isEmpty. Operand 138 states and 164 transitions. [2021-12-18 21:24:42,295 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2021-12-18 21:24:42,295 INFO L506 BasicCegarLoop]: Found error trace [2021-12-18 21:24:42,295 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-18 21:24:42,295 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2021-12-18 21:24:42,295 INFO L402 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr51ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 48 more)] === [2021-12-18 21:24:42,296 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-18 21:24:42,296 INFO L85 PathProgramCache]: Analyzing trace with hash 227835007, now seen corresponding path program 1 times [2021-12-18 21:24:42,296 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-18 21:24:42,296 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1344736191] [2021-12-18 21:24:42,296 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-18 21:24:42,296 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-18 21:24:42,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 21:24:42,404 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-18 21:24:42,405 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-18 21:24:42,405 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1344736191] [2021-12-18 21:24:42,405 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1344736191] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-18 21:24:42,405 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-18 21:24:42,405 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2021-12-18 21:24:42,405 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [143413882] [2021-12-18 21:24:42,405 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-18 21:24:42,406 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2021-12-18 21:24:42,407 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-18 21:24:42,407 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-12-18 21:24:42,407 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2021-12-18 21:24:42,408 INFO L87 Difference]: Start difference. First operand 138 states and 164 transitions. Second operand has 9 states, 9 states have (on average 2.5555555555555554) internal successors, (23), 9 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-18 21:24:42,606 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-18 21:24:42,606 INFO L93 Difference]: Finished difference Result 155 states and 168 transitions. [2021-12-18 21:24:42,606 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-12-18 21:24:42,607 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 2.5555555555555554) internal successors, (23), 9 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-18 21:24:42,607 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-18 21:24:42,607 INFO L225 Difference]: With dead ends: 155 [2021-12-18 21:24:42,607 INFO L226 Difference]: Without dead ends: 155 [2021-12-18 21:24:42,608 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=63, Invalid=119, Unknown=0, NotChecked=0, Total=182 [2021-12-18 21:24:42,608 INFO L933 BasicCegarLoop]: 64 mSDtfsCounter, 201 mSDsluCounter, 293 mSDsCounter, 0 mSdLazyCounter, 220 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 201 SdHoareTripleChecker+Valid, 357 SdHoareTripleChecker+Invalid, 231 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 220 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-18 21:24:42,608 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [201 Valid, 357 Invalid, 231 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 220 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-18 21:24:42,609 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 155 states. [2021-12-18 21:24:42,610 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 155 to 138. [2021-12-18 21:24:42,619 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 138 states, 118 states have (on average 1.38135593220339) internal successors, (163), 137 states have internal predecessors, (163), 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-18 21:24:42,619 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 138 states to 138 states and 163 transitions. [2021-12-18 21:24:42,619 INFO L78 Accepts]: Start accepts. Automaton has 138 states and 163 transitions. Word has length 23 [2021-12-18 21:24:42,620 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-18 21:24:42,620 INFO L470 AbstractCegarLoop]: Abstraction has 138 states and 163 transitions. [2021-12-18 21:24:42,620 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 2.5555555555555554) internal successors, (23), 9 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-18 21:24:42,620 INFO L276 IsEmpty]: Start isEmpty. Operand 138 states and 163 transitions. [2021-12-18 21:24:42,620 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2021-12-18 21:24:42,620 INFO L506 BasicCegarLoop]: Found error trace [2021-12-18 21:24:42,621 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-18 21:24:42,621 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2021-12-18 21:24:42,621 INFO L402 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr24REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 48 more)] === [2021-12-18 21:24:42,621 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-18 21:24:42,621 INFO L85 PathProgramCache]: Analyzing trace with hash 779247630, now seen corresponding path program 1 times [2021-12-18 21:24:42,621 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-18 21:24:42,621 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [567015794] [2021-12-18 21:24:42,622 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-18 21:24:42,622 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-18 21:24:42,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 21:24:42,647 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-18 21:24:42,648 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-18 21:24:42,648 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [567015794] [2021-12-18 21:24:42,648 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [567015794] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-18 21:24:42,648 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-18 21:24:42,648 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-12-18 21:24:42,648 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1820517602] [2021-12-18 21:24:42,648 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-18 21:24:42,649 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-12-18 21:24:42,649 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-18 21:24:42,649 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-12-18 21:24:42,649 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-12-18 21:24:42,649 INFO L87 Difference]: Start difference. First operand 138 states and 163 transitions. Second operand has 6 states, 5 states have (on average 4.8) internal successors, (24), 6 states have internal predecessors, (24), 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-18 21:24:42,745 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-18 21:24:42,746 INFO L93 Difference]: Finished difference Result 140 states and 164 transitions. [2021-12-18 21:24:42,747 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-12-18 21:24:42,747 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 4.8) internal successors, (24), 6 states have internal predecessors, (24), 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 24 [2021-12-18 21:24:42,747 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-18 21:24:42,748 INFO L225 Difference]: With dead ends: 140 [2021-12-18 21:24:42,748 INFO L226 Difference]: Without dead ends: 140 [2021-12-18 21:24:42,748 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2021-12-18 21:24:42,748 INFO L933 BasicCegarLoop]: 58 mSDtfsCounter, 78 mSDsluCounter, 105 mSDsCounter, 0 mSdLazyCounter, 193 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 78 SdHoareTripleChecker+Valid, 163 SdHoareTripleChecker+Invalid, 199 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 193 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-18 21:24:42,749 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [78 Valid, 163 Invalid, 199 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 193 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-18 21:24:42,749 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 140 states. [2021-12-18 21:24:42,750 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 140 to 139. [2021-12-18 21:24:42,750 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 139 states, 119 states have (on average 1.3781512605042017) internal successors, (164), 138 states have internal predecessors, (164), 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-18 21:24:42,750 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 139 states to 139 states and 164 transitions. [2021-12-18 21:24:42,750 INFO L78 Accepts]: Start accepts. Automaton has 139 states and 164 transitions. Word has length 24 [2021-12-18 21:24:42,750 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-18 21:24:42,750 INFO L470 AbstractCegarLoop]: Abstraction has 139 states and 164 transitions. [2021-12-18 21:24:42,750 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 4.8) internal successors, (24), 6 states have internal predecessors, (24), 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-18 21:24:42,751 INFO L276 IsEmpty]: Start isEmpty. Operand 139 states and 164 transitions. [2021-12-18 21:24:42,751 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2021-12-18 21:24:42,751 INFO L506 BasicCegarLoop]: Found error trace [2021-12-18 21:24:42,751 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-18 21:24:42,751 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2021-12-18 21:24:42,751 INFO L402 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr25REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 48 more)] === [2021-12-18 21:24:42,751 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-18 21:24:42,751 INFO L85 PathProgramCache]: Analyzing trace with hash 779247631, now seen corresponding path program 1 times [2021-12-18 21:24:42,751 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-18 21:24:42,752 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [750412463] [2021-12-18 21:24:42,752 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-18 21:24:42,752 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-18 21:24:42,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 21:24:42,862 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-18 21:24:42,863 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-18 21:24:42,863 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [750412463] [2021-12-18 21:24:42,863 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [750412463] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-18 21:24:42,863 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2092383431] [2021-12-18 21:24:42,863 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-18 21:24:42,864 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-18 21:24:42,864 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-18 21:24:42,865 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-18 21:24:42,866 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-18 21:24:42,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 21:24:42,960 INFO L263 TraceCheckSpWp]: Trace formula consists of 160 conjuncts, 15 conjunts are in the unsatisfiable core [2021-12-18 21:24:42,963 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-18 21:24:43,082 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 23 treesize of output 15 [2021-12-18 21:24:43,085 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 28 treesize of output 16 [2021-12-18 21:24:43,115 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-18 21:24:43,116 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-18 21:24:43,116 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2092383431] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-18 21:24:43,116 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2021-12-18 21:24:43,116 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [10] total 14 [2021-12-18 21:24:43,116 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2035533159] [2021-12-18 21:24:43,116 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-18 21:24:43,116 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-12-18 21:24:43,116 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-18 21:24:43,116 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-12-18 21:24:43,117 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=175, Unknown=0, NotChecked=0, Total=210 [2021-12-18 21:24:43,117 INFO L87 Difference]: Start difference. First operand 139 states and 164 transitions. Second operand has 6 states, 5 states have (on average 4.8) internal successors, (24), 6 states have internal predecessors, (24), 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-18 21:24:43,304 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-18 21:24:43,304 INFO L93 Difference]: Finished difference Result 139 states and 161 transitions. [2021-12-18 21:24:43,304 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-12-18 21:24:43,304 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 4.8) internal successors, (24), 6 states have internal predecessors, (24), 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 24 [2021-12-18 21:24:43,304 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-18 21:24:43,305 INFO L225 Difference]: With dead ends: 139 [2021-12-18 21:24:43,305 INFO L226 Difference]: Without dead ends: 139 [2021-12-18 21:24:43,305 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 22 SyntacticMatches, 1 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 50 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=56, Invalid=286, Unknown=0, NotChecked=0, Total=342 [2021-12-18 21:24:43,305 INFO L933 BasicCegarLoop]: 60 mSDtfsCounter, 63 mSDsluCounter, 117 mSDsCounter, 0 mSdLazyCounter, 186 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 63 SdHoareTripleChecker+Valid, 177 SdHoareTripleChecker+Invalid, 191 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 186 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-18 21:24:43,305 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [63 Valid, 177 Invalid, 191 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 186 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-18 21:24:43,306 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 139 states. [2021-12-18 21:24:43,307 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 139 to 138. [2021-12-18 21:24:43,307 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 138 states, 119 states have (on average 1.3445378151260505) internal successors, (160), 137 states have internal predecessors, (160), 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-18 21:24:43,307 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 138 states to 138 states and 160 transitions. [2021-12-18 21:24:43,307 INFO L78 Accepts]: Start accepts. Automaton has 138 states and 160 transitions. Word has length 24 [2021-12-18 21:24:43,307 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-18 21:24:43,307 INFO L470 AbstractCegarLoop]: Abstraction has 138 states and 160 transitions. [2021-12-18 21:24:43,308 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 4.8) internal successors, (24), 6 states have internal predecessors, (24), 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-18 21:24:43,308 INFO L276 IsEmpty]: Start isEmpty. Operand 138 states and 160 transitions. [2021-12-18 21:24:43,308 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2021-12-18 21:24:43,308 INFO L506 BasicCegarLoop]: Found error trace [2021-12-18 21:24:43,308 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-18 21:24:43,330 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-18 21:24:43,508 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable22 [2021-12-18 21:24:43,509 INFO L402 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr36ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 48 more)] === [2021-12-18 21:24:43,509 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-18 21:24:43,509 INFO L85 PathProgramCache]: Analyzing trace with hash -342052636, now seen corresponding path program 1 times [2021-12-18 21:24:43,509 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-18 21:24:43,509 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [991264232] [2021-12-18 21:24:43,509 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-18 21:24:43,509 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-18 21:24:43,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 21:24:43,642 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-18 21:24:43,642 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-18 21:24:43,642 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [991264232] [2021-12-18 21:24:43,642 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [991264232] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-18 21:24:43,642 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-18 21:24:43,643 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2021-12-18 21:24:43,643 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1621128438] [2021-12-18 21:24:43,643 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-18 21:24:43,643 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2021-12-18 21:24:43,643 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-18 21:24:43,643 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-12-18 21:24:43,644 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2021-12-18 21:24:43,644 INFO L87 Difference]: Start difference. First operand 138 states and 160 transitions. Second operand has 11 states, 11 states have (on average 2.272727272727273) internal successors, (25), 11 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-18 21:24:43,880 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-18 21:24:43,881 INFO L93 Difference]: Finished difference Result 150 states and 163 transitions. [2021-12-18 21:24:43,881 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2021-12-18 21:24:43,881 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 2.272727272727273) internal successors, (25), 11 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 25 [2021-12-18 21:24:43,881 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-18 21:24:43,882 INFO L225 Difference]: With dead ends: 150 [2021-12-18 21:24:43,882 INFO L226 Difference]: Without dead ends: 150 [2021-12-18 21:24:43,882 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 53 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=106, Invalid=314, Unknown=0, NotChecked=0, Total=420 [2021-12-18 21:24:43,882 INFO L933 BasicCegarLoop]: 64 mSDtfsCounter, 144 mSDsluCounter, 359 mSDsCounter, 0 mSdLazyCounter, 222 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 144 SdHoareTripleChecker+Valid, 423 SdHoareTripleChecker+Invalid, 237 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 222 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-18 21:24:43,882 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [144 Valid, 423 Invalid, 237 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 222 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-18 21:24:43,883 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 150 states. [2021-12-18 21:24:43,884 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 150 to 137. [2021-12-18 21:24:43,884 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 137 states, 118 states have (on average 1.3389830508474576) internal successors, (158), 136 states have internal predecessors, (158), 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-18 21:24:43,884 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 137 states to 137 states and 158 transitions. [2021-12-18 21:24:43,884 INFO L78 Accepts]: Start accepts. Automaton has 137 states and 158 transitions. Word has length 25 [2021-12-18 21:24:43,884 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-18 21:24:43,884 INFO L470 AbstractCegarLoop]: Abstraction has 137 states and 158 transitions. [2021-12-18 21:24:43,885 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 2.272727272727273) internal successors, (25), 11 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-18 21:24:43,885 INFO L276 IsEmpty]: Start isEmpty. Operand 137 states and 158 transitions. [2021-12-18 21:24:43,885 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2021-12-18 21:24:43,885 INFO L506 BasicCegarLoop]: Found error trace [2021-12-18 21:24:43,885 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-18 21:24:43,885 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2021-12-18 21:24:43,885 INFO L402 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr23ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 48 more)] === [2021-12-18 21:24:43,885 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-18 21:24:43,885 INFO L85 PathProgramCache]: Analyzing trace with hash -1700492295, now seen corresponding path program 1 times [2021-12-18 21:24:43,885 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-18 21:24:43,885 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1229745642] [2021-12-18 21:24:43,885 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-18 21:24:43,886 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-18 21:24:43,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 21:24:43,904 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-18 21:24:43,904 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-18 21:24:43,904 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1229745642] [2021-12-18 21:24:43,904 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1229745642] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-18 21:24:43,905 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-18 21:24:43,905 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-12-18 21:24:43,905 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [896206936] [2021-12-18 21:24:43,905 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-18 21:24:43,905 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-12-18 21:24:43,905 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-18 21:24:43,906 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-18 21:24:43,906 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-18 21:24:43,906 INFO L87 Difference]: Start difference. First operand 137 states and 158 transitions. Second operand has 3 states, 3 states have (on average 8.333333333333334) internal successors, (25), 3 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-18 21:24:43,913 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-18 21:24:43,913 INFO L93 Difference]: Finished difference Result 210 states and 233 transitions. [2021-12-18 21:24:43,914 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-18 21:24:43,914 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 8.333333333333334) internal successors, (25), 3 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 25 [2021-12-18 21:24:43,914 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-18 21:24:43,915 INFO L225 Difference]: With dead ends: 210 [2021-12-18 21:24:43,915 INFO L226 Difference]: Without dead ends: 210 [2021-12-18 21:24:43,916 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-18 21:24:43,916 INFO L933 BasicCegarLoop]: 80 mSDtfsCounter, 61 mSDsluCounter, 75 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 61 SdHoareTripleChecker+Valid, 155 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-18 21:24:43,916 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [61 Valid, 155 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-18 21:24:43,916 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 210 states. [2021-12-18 21:24:43,919 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 210 to 154. [2021-12-18 21:24:43,919 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 154 states, 135 states have (on average 1.3037037037037038) internal successors, (176), 153 states have internal predecessors, (176), 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-18 21:24:43,919 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 154 states to 154 states and 176 transitions. [2021-12-18 21:24:43,923 INFO L78 Accepts]: Start accepts. Automaton has 154 states and 176 transitions. Word has length 25 [2021-12-18 21:24:43,923 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-18 21:24:43,923 INFO L470 AbstractCegarLoop]: Abstraction has 154 states and 176 transitions. [2021-12-18 21:24:43,923 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 8.333333333333334) internal successors, (25), 3 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-18 21:24:43,923 INFO L276 IsEmpty]: Start isEmpty. Operand 154 states and 176 transitions. [2021-12-18 21:24:43,924 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2021-12-18 21:24:43,924 INFO L506 BasicCegarLoop]: Found error trace [2021-12-18 21:24:43,924 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-18 21:24:43,924 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2021-12-18 21:24:43,924 INFO L402 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr27REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 48 more)] === [2021-12-18 21:24:43,924 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-18 21:24:43,924 INFO L85 PathProgramCache]: Analyzing trace with hash 1532665747, now seen corresponding path program 1 times [2021-12-18 21:24:43,925 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-18 21:24:43,925 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1219053424] [2021-12-18 21:24:43,925 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-18 21:24:43,925 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-18 21:24:43,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 21:24:44,039 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-18 21:24:44,040 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-18 21:24:44,040 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1219053424] [2021-12-18 21:24:44,040 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1219053424] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-18 21:24:44,040 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1937516324] [2021-12-18 21:24:44,041 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-18 21:24:44,041 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-18 21:24:44,041 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-18 21:24:44,042 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-18 21:24:44,043 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-18 21:24:44,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 21:24:44,118 INFO L263 TraceCheckSpWp]: Trace formula consists of 167 conjuncts, 19 conjunts are in the unsatisfiable core [2021-12-18 21:24:44,120 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-18 21:24:44,226 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 25 treesize of output 17 [2021-12-18 21:24:44,231 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 21 treesize of output 13 [2021-12-18 21:24:44,258 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 19 treesize of output 7 [2021-12-18 21:24:44,270 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-18 21:24:44,270 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-18 21:24:44,270 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1937516324] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-18 21:24:44,270 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2021-12-18 21:24:44,271 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [11] total 19 [2021-12-18 21:24:44,271 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [468146213] [2021-12-18 21:24:44,271 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-18 21:24:44,271 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2021-12-18 21:24:44,271 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-18 21:24:44,272 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-12-18 21:24:44,272 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=300, Unknown=0, NotChecked=0, Total=342 [2021-12-18 21:24:44,276 INFO L87 Difference]: Start difference. First operand 154 states and 176 transitions. Second operand has 9 states, 9 states have (on average 2.888888888888889) internal successors, (26), 9 states have internal predecessors, (26), 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-18 21:24:44,459 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-18 21:24:44,459 INFO L93 Difference]: Finished difference Result 172 states and 195 transitions. [2021-12-18 21:24:44,460 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-12-18 21:24:44,460 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 2.888888888888889) internal successors, (26), 9 states have internal predecessors, (26), 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-18 21:24:44,460 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-18 21:24:44,461 INFO L225 Difference]: With dead ends: 172 [2021-12-18 21:24:44,461 INFO L226 Difference]: Without dead ends: 172 [2021-12-18 21:24:44,461 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 21 SyntacticMatches, 1 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 85 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=68, Invalid=484, Unknown=0, NotChecked=0, Total=552 [2021-12-18 21:24:44,462 INFO L933 BasicCegarLoop]: 68 mSDtfsCounter, 32 mSDsluCounter, 262 mSDsCounter, 0 mSdLazyCounter, 308 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 32 SdHoareTripleChecker+Valid, 330 SdHoareTripleChecker+Invalid, 309 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 308 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-18 21:24:44,462 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [32 Valid, 330 Invalid, 309 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 308 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-18 21:24:44,463 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 172 states. [2021-12-18 21:24:44,464 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 172 to 167. [2021-12-18 21:24:44,464 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 167 states, 148 states have (on average 1.2905405405405406) internal successors, (191), 166 states have internal predecessors, (191), 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-18 21:24:44,465 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 167 states to 167 states and 191 transitions. [2021-12-18 21:24:44,465 INFO L78 Accepts]: Start accepts. Automaton has 167 states and 191 transitions. Word has length 26 [2021-12-18 21:24:44,465 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-18 21:24:44,465 INFO L470 AbstractCegarLoop]: Abstraction has 167 states and 191 transitions. [2021-12-18 21:24:44,465 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 2.888888888888889) internal successors, (26), 9 states have internal predecessors, (26), 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-18 21:24:44,465 INFO L276 IsEmpty]: Start isEmpty. Operand 167 states and 191 transitions. [2021-12-18 21:24:44,465 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2021-12-18 21:24:44,466 INFO L506 BasicCegarLoop]: Found error trace [2021-12-18 21:24:44,466 INFO L514 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-18 21:24:44,482 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2021-12-18 21:24:44,679 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,SelfDestructingSolverStorable25 [2021-12-18 21:24:44,679 INFO L402 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr23ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 48 more)] === [2021-12-18 21:24:44,680 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-18 21:24:44,680 INFO L85 PathProgramCache]: Analyzing trace with hash -301886117, now seen corresponding path program 1 times [2021-12-18 21:24:44,680 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-18 21:24:44,680 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [494725831] [2021-12-18 21:24:44,680 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-18 21:24:44,680 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-18 21:24:44,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 21:24:44,786 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-18 21:24:44,786 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-18 21:24:44,786 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [494725831] [2021-12-18 21:24:44,787 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [494725831] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-18 21:24:44,787 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1750456860] [2021-12-18 21:24:44,787 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-18 21:24:44,787 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-18 21:24:44,787 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-18 21:24:44,788 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-18 21:24:44,789 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-18 21:24:44,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 21:24:44,871 INFO L263 TraceCheckSpWp]: Trace formula consists of 232 conjuncts, 32 conjunts are in the unsatisfiable core [2021-12-18 21:24:44,873 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-18 21:24:44,884 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-18 21:24:44,945 INFO L354 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-12-18 21:24:44,945 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-18 21:24:44,976 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 11 treesize of output 7 [2021-12-18 21:24:45,048 INFO L354 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-12-18 21:24:45,048 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 27 treesize of output 28 [2021-12-18 21:24:45,115 INFO L354 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-12-18 21:24:45,116 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 30 treesize of output 28 [2021-12-18 21:24:45,149 INFO L354 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-12-18 21:24:45,149 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 30 treesize of output 28 [2021-12-18 21:24:45,209 INFO L354 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-12-18 21:24:45,209 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 27 treesize of output 28 [2021-12-18 21:24:45,238 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 24 treesize of output 12 [2021-12-18 21:24:45,243 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-18 21:24:45,243 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-18 21:24:45,259 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_840 (Array Int Int))) (not (= 0 (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_840) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|)))) is different from false [2021-12-18 21:24:45,287 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_840 (Array Int Int))) (not (= 0 (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem5#1.base| v_ArrVal_840) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|)))) is different from false [2021-12-18 21:24:45,291 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_840 (Array Int Int))) (not (= 0 (select (select (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|) v_ArrVal_840) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|)))) is different from false [2021-12-18 21:24:45,298 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_837 (Array Int Int)) (v_ArrVal_840 (Array Int Int))) (not (= 0 (select (select (let ((.cse0 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem4#1.base| v_ArrVal_837))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|) v_ArrVal_840)) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|)))) is different from false [2021-12-18 21:24:45,305 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_837 (Array Int Int)) (v_ArrVal_840 (Array Int Int))) (not (= 0 (select (select (let ((.cse0 (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|) v_ArrVal_837))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|) v_ArrVal_840)) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|)))) is different from false [2021-12-18 21:24:45,314 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-18 21:24:45,314 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 1 case distinctions, treesize of input 37 treesize of output 30 [2021-12-18 21:24:45,320 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-18 21:24:45,323 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 141 treesize of output 128 [2021-12-18 21:24:45,330 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-18 21:24:45,330 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 112 treesize of output 111 [2021-12-18 21:24:45,334 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 102 treesize of output 98 [2021-12-18 21:24:45,501 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 2 not checked. [2021-12-18 21:24:45,502 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1750456860] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-18 21:24:45,502 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-18 21:24:45,502 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12, 13] total 27 [2021-12-18 21:24:45,502 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1066854998] [2021-12-18 21:24:45,503 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-18 21:24:45,503 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2021-12-18 21:24:45,503 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-18 21:24:45,503 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2021-12-18 21:24:45,503 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=85, Invalid=392, Unknown=5, NotChecked=220, Total=702 [2021-12-18 21:24:45,504 INFO L87 Difference]: Start difference. First operand 167 states and 191 transitions. Second operand has 27 states, 27 states have (on average 2.7777777777777777) internal successors, (75), 27 states have internal predecessors, (75), 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-18 21:24:46,027 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-18 21:24:46,027 INFO L93 Difference]: Finished difference Result 283 states and 309 transitions. [2021-12-18 21:24:46,029 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2021-12-18 21:24:46,029 INFO L78 Accepts]: Start accepts. Automaton has has 27 states, 27 states have (on average 2.7777777777777777) internal successors, (75), 27 states have internal predecessors, (75), 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 28 [2021-12-18 21:24:46,029 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-18 21:24:46,030 INFO L225 Difference]: With dead ends: 283 [2021-12-18 21:24:46,030 INFO L226 Difference]: Without dead ends: 283 [2021-12-18 21:24:46,030 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 83 GetRequests, 43 SyntacticMatches, 6 SemanticMatches, 34 ConstructedPredicates, 5 IntricatePredicates, 0 DeprecatedPredicates, 241 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=189, Invalid=752, Unknown=9, NotChecked=310, Total=1260 [2021-12-18 21:24:46,031 INFO L933 BasicCegarLoop]: 80 mSDtfsCounter, 341 mSDsluCounter, 721 mSDsCounter, 0 mSdLazyCounter, 814 mSolverCounterSat, 36 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 341 SdHoareTripleChecker+Valid, 801 SdHoareTripleChecker+Invalid, 1826 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 36 IncrementalHoareTripleChecker+Valid, 814 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 976 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2021-12-18 21:24:46,031 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [341 Valid, 801 Invalid, 1826 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [36 Valid, 814 Invalid, 0 Unknown, 976 Unchecked, 0.3s Time] [2021-12-18 21:24:46,031 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 283 states. [2021-12-18 21:24:46,033 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 283 to 177. [2021-12-18 21:24:46,033 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 177 states, 158 states have (on average 1.2848101265822784) internal successors, (203), 176 states have internal predecessors, (203), 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-18 21:24:46,033 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 177 states to 177 states and 203 transitions. [2021-12-18 21:24:46,033 INFO L78 Accepts]: Start accepts. Automaton has 177 states and 203 transitions. Word has length 28 [2021-12-18 21:24:46,033 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-18 21:24:46,033 INFO L470 AbstractCegarLoop]: Abstraction has 177 states and 203 transitions. [2021-12-18 21:24:46,034 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 27 states have (on average 2.7777777777777777) internal successors, (75), 27 states have internal predecessors, (75), 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-18 21:24:46,034 INFO L276 IsEmpty]: Start isEmpty. Operand 177 states and 203 transitions. [2021-12-18 21:24:46,034 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2021-12-18 21:24:46,034 INFO L506 BasicCegarLoop]: Found error trace [2021-12-18 21:24:46,034 INFO L514 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-18 21:24:46,055 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2021-12-18 21:24:46,234 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-18 21:24:46,235 INFO L402 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr24REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 48 more)] === [2021-12-18 21:24:46,235 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-18 21:24:46,235 INFO L85 PathProgramCache]: Analyzing trace with hash -768530862, now seen corresponding path program 1 times [2021-12-18 21:24:46,235 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-18 21:24:46,235 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1525637460] [2021-12-18 21:24:46,235 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-18 21:24:46,235 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-18 21:24:46,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 21:24:46,347 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-18 21:24:46,347 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-18 21:24:46,347 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1525637460] [2021-12-18 21:24:46,347 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1525637460] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-18 21:24:46,348 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [995445177] [2021-12-18 21:24:46,348 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-18 21:24:46,348 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-18 21:24:46,348 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-18 21:24:46,349 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-18 21:24:46,350 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-18 21:24:46,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 21:24:46,436 INFO L263 TraceCheckSpWp]: Trace formula consists of 230 conjuncts, 28 conjunts are in the unsatisfiable core [2021-12-18 21:24:46,438 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-18 21:24:46,575 INFO L354 Elim1Store]: treesize reduction 25, result has 21.9 percent of original size [2021-12-18 21:24:46,575 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 19 treesize of output 18 [2021-12-18 21:24:46,646 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-18 21:24:46,647 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-18 21:24:46,649 INFO L354 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2021-12-18 21:24:46,650 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 30 [2021-12-18 21:24:46,715 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-18 21:24:46,716 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-18 21:24:46,718 INFO L354 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2021-12-18 21:24:46,719 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 42 treesize of output 35 [2021-12-18 21:24:46,759 INFO L354 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2021-12-18 21:24:46,759 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 3 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 15 [2021-12-18 21:24:46,775 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-18 21:24:46,775 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-18 21:24:52,962 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-18 21:24:52,963 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 120 treesize of output 99 [2021-12-18 21:24:54,012 INFO L354 Elim1Store]: treesize reduction 8, result has 83.7 percent of original size [2021-12-18 21:24:54,013 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 32 treesize of output 64 [2021-12-18 21:24:54,170 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-18 21:24:54,170 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [995445177] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-18 21:24:54,171 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-18 21:24:54,171 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10, 10] total 24 [2021-12-18 21:24:54,171 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1660522676] [2021-12-18 21:24:54,172 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-18 21:24:54,172 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2021-12-18 21:24:54,172 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-18 21:24:54,172 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2021-12-18 21:24:54,172 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=96, Invalid=501, Unknown=3, NotChecked=0, Total=600 [2021-12-18 21:24:54,173 INFO L87 Difference]: Start difference. First operand 177 states and 203 transitions. Second operand has 25 states, 24 states have (on average 3.1666666666666665) internal successors, (76), 25 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-18 21:24:54,543 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (= 1 (select |c_#valid| |c_ULTIMATE.start_main_~x~0#1.base|)))) (and (forall ((v_ArrVal_949 Int)) (= (select |c_#valid| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base|) (+ |c_ULTIMATE.start_main_~x~0#1.offset| 8) v_ArrVal_949)) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|)) 1)) (= (select |c_#valid| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|)) 1) (= |c_ULTIMATE.start_main_~x~0#1.offset| |c_ULTIMATE.start_main_~head~0#1.offset|) (or (not (= 1 (select |c_#valid| |c_ULTIMATE.start_main_#t~mem5#1.base|))) (forall ((|ULTIMATE.start_main_~x~0#1.offset| Int) (v_ArrVal_949 Int)) (or (< |ULTIMATE.start_main_~x~0#1.offset| 0) (= (select |c_#valid| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem5#1.base| (store (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem5#1.base|) |ULTIMATE.start_main_~x~0#1.offset| |c_ULTIMATE.start_main_~head~0#1.base|) (+ |ULTIMATE.start_main_~x~0#1.offset| 8) v_ArrVal_949)) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|)) 1)))) .cse0 (= |c_ULTIMATE.start_main_~x~0#1.base| |c_ULTIMATE.start_main_~head~0#1.base|) (= |c_ULTIMATE.start_main_~head~0#1.offset| 0) (or (forall ((|ULTIMATE.start_main_~x~0#1.offset| Int) (v_ArrVal_949 Int)) (or (< |ULTIMATE.start_main_~x~0#1.offset| 0) (= (select |c_#valid| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base| (store (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset| |c_ULTIMATE.start_main_~head~0#1.base|) (+ |ULTIMATE.start_main_~x~0#1.offset| 8) v_ArrVal_949)) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|)) 1))) (not .cse0)))) is different from false [2021-12-18 21:24:54,908 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (= 1 (select |c_#valid| |c_ULTIMATE.start_main_~x~0#1.base|))) (.cse1 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base|))) (and (forall ((v_ArrVal_949 Int)) (= (select |c_#valid| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base|) (+ |c_ULTIMATE.start_main_~x~0#1.offset| 8) v_ArrVal_949)) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|)) 1)) (= |c_ULTIMATE.start_main_~x~0#1.offset| |c_ULTIMATE.start_main_~head~0#1.offset|) (or (not (= 1 (select |c_#valid| |c_ULTIMATE.start_main_#t~mem5#1.base|))) (forall ((|ULTIMATE.start_main_~x~0#1.offset| Int) (v_ArrVal_949 Int)) (or (< |ULTIMATE.start_main_~x~0#1.offset| 0) (= (select |c_#valid| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem5#1.base| (store (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem5#1.base|) |ULTIMATE.start_main_~x~0#1.offset| |c_ULTIMATE.start_main_~head~0#1.base|) (+ |ULTIMATE.start_main_~x~0#1.offset| 8) v_ArrVal_949)) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|)) 1)))) .cse0 (= |c_ULTIMATE.start_main_~head~0#1.base| |c_ULTIMATE.start_main_~x~0#1.base|) (not (= |c_ULTIMATE.start_main_~x~0#1.base| (select .cse1 |c_ULTIMATE.start_main_~x~0#1.offset|))) (= |c_ULTIMATE.start_main_~x~0#1.base| |c_ULTIMATE.start_main_~head~0#1.base|) (= |c_ULTIMATE.start_main_~head~0#1.offset| 0) (or (forall ((|ULTIMATE.start_main_~x~0#1.offset| Int) (v_ArrVal_949 Int)) (or (< |ULTIMATE.start_main_~x~0#1.offset| 0) (= (select |c_#valid| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base| (store (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset| |c_ULTIMATE.start_main_~head~0#1.base|) (+ |ULTIMATE.start_main_~x~0#1.offset| 8) v_ArrVal_949)) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|)) 1))) (not .cse0)) (= (select |c_#valid| (select .cse1 |c_ULTIMATE.start_main_~head~0#1.offset|)) 1))) is different from false [2021-12-18 21:24:58,236 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-18 21:24:58,236 INFO L93 Difference]: Finished difference Result 271 states and 309 transitions. [2021-12-18 21:24:58,236 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2021-12-18 21:24:58,237 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 24 states have (on average 3.1666666666666665) internal successors, (76), 25 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) Word has length 29 [2021-12-18 21:24:58,237 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-18 21:24:58,237 INFO L225 Difference]: With dead ends: 271 [2021-12-18 21:24:58,237 INFO L226 Difference]: Without dead ends: 271 [2021-12-18 21:24:58,238 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 95 GetRequests, 49 SyntacticMatches, 5 SemanticMatches, 41 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 397 ImplicationChecksByTransitivity, 10.0s TimeCoverageRelationStatistics Valid=318, Invalid=1325, Unknown=5, NotChecked=158, Total=1806 [2021-12-18 21:24:58,238 INFO L933 BasicCegarLoop]: 50 mSDtfsCounter, 376 mSDsluCounter, 548 mSDsCounter, 0 mSdLazyCounter, 653 mSolverCounterSat, 70 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 376 SdHoareTripleChecker+Valid, 598 SdHoareTripleChecker+Invalid, 1045 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 70 IncrementalHoareTripleChecker+Valid, 653 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 322 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2021-12-18 21:24:58,238 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [376 Valid, 598 Invalid, 1045 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [70 Valid, 653 Invalid, 0 Unknown, 322 Unchecked, 0.3s Time] [2021-12-18 21:24:58,239 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 271 states. [2021-12-18 21:24:58,240 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 271 to 216. [2021-12-18 21:24:58,241 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 216 states, 197 states have (on average 1.2791878172588833) internal successors, (252), 215 states have internal predecessors, (252), 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-18 21:24:58,241 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 216 states to 216 states and 252 transitions. [2021-12-18 21:24:58,241 INFO L78 Accepts]: Start accepts. Automaton has 216 states and 252 transitions. Word has length 29 [2021-12-18 21:24:58,241 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-18 21:24:58,241 INFO L470 AbstractCegarLoop]: Abstraction has 216 states and 252 transitions. [2021-12-18 21:24:58,241 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 24 states have (on average 3.1666666666666665) internal successors, (76), 25 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-18 21:24:58,241 INFO L276 IsEmpty]: Start isEmpty. Operand 216 states and 252 transitions. [2021-12-18 21:24:58,241 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2021-12-18 21:24:58,242 INFO L506 BasicCegarLoop]: Found error trace [2021-12-18 21:24:58,242 INFO L514 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-18 21:24:58,259 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-18 21:24:58,442 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable27 [2021-12-18 21:24:58,442 INFO L402 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr25REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 48 more)] === [2021-12-18 21:24:58,442 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-18 21:24:58,442 INFO L85 PathProgramCache]: Analyzing trace with hash -768530861, now seen corresponding path program 1 times [2021-12-18 21:24:58,443 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-18 21:24:58,443 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2102881261] [2021-12-18 21:24:58,443 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-18 21:24:58,443 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-18 21:24:58,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 21:24:58,476 ERROR L253 erpolLogProxyWrapper]: Interpolant 13 not inductive [2021-12-18 21:24:58,483 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2021-12-18 21:24:58,486 FATAL L? ?]: An unrecoverable error occured during an interaction with an SMT solver: de.uni_freiburg.informatik.ultimate.logic.SMTLIBException: generated interpolants did not pass sanity check at de.uni_freiburg.informatik.ultimate.smtinterpol.interpolate.Interpolator.getInterpolants(Interpolator.java:232) at de.uni_freiburg.informatik.ultimate.smtinterpol.smtlib2.SMTInterpol.getInterpolants(SMTInterpol.java:876) at de.uni_freiburg.informatik.ultimate.logic.NoopScript.getInterpolants(NoopScript.java:392) at de.uni_freiburg.informatik.ultimate.logic.NoopScript.getInterpolants(NoopScript.java:386) at de.uni_freiburg.informatik.ultimate.logic.WrapperScript.getInterpolants(WrapperScript.java:337) at de.uni_freiburg.informatik.ultimate.logic.WrapperScript.getInterpolants(WrapperScript.java:337) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.ManagedScript.getInterpolants(ManagedScript.java:192) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.NestedInterpolantsBuilder.computeCraigInterpolants(NestedInterpolantsBuilder.java:285) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.NestedInterpolantsBuilder.(NestedInterpolantsBuilder.java:166) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.InterpolatingTraceCheckCraig.computeInterpolantsRecursive(InterpolatingTraceCheckCraig.java:327) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.InterpolatingTraceCheckCraig.computeInterpolants(InterpolatingTraceCheckCraig.java:229) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.InterpolatingTraceCheckCraig.(InterpolatingTraceCheckCraig.java:97) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleCraig.construct(IpTcStrategyModuleCraig.java:79) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleCraig.construct(IpTcStrategyModuleCraig.java:1) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:100) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.isCorrect(IpTcStrategyModuleBase.java:56) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.checkFeasibility(AutomatonFreeRefinementEngine.java:211) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:124) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:88) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:76) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:610) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:413) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:330) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.CegarLoopUtils.getCegarLoopResult(CegarLoopUtils.java:56) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:393) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:303) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseSequentialProgram(TraceAbstractionStarter.java:263) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:176) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:155) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:123) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2021-12-18 21:24:58,491 INFO L158 Benchmark]: Toolchain (without parser) took 21849.14ms. Allocated memory was 94.4MB in the beginning and 172.0MB in the end (delta: 77.6MB). Free memory was 61.9MB in the beginning and 108.4MB in the end (delta: -46.5MB). Peak memory consumption was 31.2MB. Max. memory is 16.1GB. [2021-12-18 21:24:58,492 INFO L158 Benchmark]: CDTParser took 0.15ms. Allocated memory is still 94.4MB. Free memory was 53.0MB in the beginning and 53.0MB in the end (delta: 38.0kB). There was no memory consumed. Max. memory is 16.1GB. [2021-12-18 21:24:58,492 INFO L158 Benchmark]: CACSL2BoogieTranslator took 305.87ms. Allocated memory is still 94.4MB. Free memory was 61.7MB in the beginning and 62.6MB in the end (delta: -847.8kB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2021-12-18 21:24:58,493 INFO L158 Benchmark]: Boogie Procedure Inliner took 29.52ms. Allocated memory is still 94.4MB. Free memory was 62.6MB in the beginning and 60.5MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2021-12-18 21:24:58,493 INFO L158 Benchmark]: Boogie Preprocessor took 29.49ms. Allocated memory is still 94.4MB. Free memory was 60.5MB in the beginning and 58.9MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2021-12-18 21:24:58,493 INFO L158 Benchmark]: RCFGBuilder took 382.91ms. Allocated memory is still 94.4MB. Free memory was 58.9MB in the beginning and 40.8MB in the end (delta: 18.1MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2021-12-18 21:24:58,493 INFO L158 Benchmark]: TraceAbstraction took 21093.40ms. Allocated memory was 94.4MB in the beginning and 172.0MB in the end (delta: 77.6MB). Free memory was 40.4MB in the beginning and 108.4MB in the end (delta: -68.0MB). Peak memory consumption was 12.8MB. Max. memory is 16.1GB. [2021-12-18 21:24:58,495 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.15ms. Allocated memory is still 94.4MB. Free memory was 53.0MB in the beginning and 53.0MB in the end (delta: 38.0kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 305.87ms. Allocated memory is still 94.4MB. Free memory was 61.7MB in the beginning and 62.6MB in the end (delta: -847.8kB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 29.52ms. Allocated memory is still 94.4MB. Free memory was 62.6MB in the beginning and 60.5MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 29.49ms. Allocated memory is still 94.4MB. Free memory was 60.5MB in the beginning and 58.9MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 382.91ms. Allocated memory is still 94.4MB. Free memory was 58.9MB in the beginning and 40.8MB in the end (delta: 18.1MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * TraceAbstraction took 21093.40ms. Allocated memory was 94.4MB in the beginning and 172.0MB in the end (delta: 77.6MB). Free memory was 40.4MB in the beginning and 108.4MB in the end (delta: -68.0MB). Peak memory consumption was 12.8MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: SMTLIBException: generated interpolants did not pass sanity check de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: SMTLIBException: generated interpolants did not pass sanity check: de.uni_freiburg.informatik.ultimate.smtinterpol.interpolate.Interpolator.getInterpolants(Interpolator.java:232) RESULT: Ultimate could not prove your program: Toolchain returned no result. [2021-12-18 21:24:58,527 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i ../sv-benchmarks/c/forester-heap/dll-circular-2.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 5b2cf85bdf3ceca18f859bba09ed8bf6de8160130db2f8571365ac2bc4f0e30c --- Real Ultimate output --- This is Ultimate 0.2.2-tmp.no-commuhash-c3fed41 [2021-12-18 21:25:00,199 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-12-18 21:25:00,200 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-12-18 21:25:00,218 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-12-18 21:25:00,219 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-12-18 21:25:00,219 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-12-18 21:25:00,220 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-12-18 21:25:00,221 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-12-18 21:25:00,223 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-12-18 21:25:00,223 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-12-18 21:25:00,224 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-12-18 21:25:00,225 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-12-18 21:25:00,225 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-12-18 21:25:00,226 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-12-18 21:25:00,227 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-12-18 21:25:00,228 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-12-18 21:25:00,228 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-12-18 21:25:00,229 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-12-18 21:25:00,230 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-12-18 21:25:00,231 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-12-18 21:25:00,232 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-12-18 21:25:00,236 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-12-18 21:25:00,238 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-12-18 21:25:00,239 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-12-18 21:25:00,242 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-12-18 21:25:00,247 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-12-18 21:25:00,247 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-12-18 21:25:00,255 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-12-18 21:25:00,255 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-12-18 21:25:00,260 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-12-18 21:25:00,261 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-12-18 21:25:00,261 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-12-18 21:25:00,262 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-12-18 21:25:00,263 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-12-18 21:25:00,263 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-12-18 21:25:00,264 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-12-18 21:25:00,264 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-12-18 21:25:00,264 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-12-18 21:25:00,265 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-12-18 21:25:00,265 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-12-18 21:25:00,266 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-12-18 21:25:00,267 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf [2021-12-18 21:25:00,299 INFO L113 SettingsManager]: Loading preferences was successful [2021-12-18 21:25:00,299 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-12-18 21:25:00,300 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-12-18 21:25:00,300 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-12-18 21:25:00,301 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2021-12-18 21:25:00,301 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2021-12-18 21:25:00,301 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-12-18 21:25:00,302 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-12-18 21:25:00,302 INFO L138 SettingsManager]: * Use SBE=true [2021-12-18 21:25:00,302 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-12-18 21:25:00,302 INFO L138 SettingsManager]: * sizeof long=4 [2021-12-18 21:25:00,303 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2021-12-18 21:25:00,303 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-12-18 21:25:00,303 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-12-18 21:25:00,303 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-12-18 21:25:00,303 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2021-12-18 21:25:00,303 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2021-12-18 21:25:00,303 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2021-12-18 21:25:00,304 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-12-18 21:25:00,304 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2021-12-18 21:25:00,304 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2021-12-18 21:25:00,304 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2021-12-18 21:25:00,304 INFO L138 SettingsManager]: * sizeof long double=12 [2021-12-18 21:25:00,304 INFO L138 SettingsManager]: * Use constant arrays=true [2021-12-18 21:25:00,304 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-12-18 21:25:00,305 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-12-18 21:25:00,305 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-12-18 21:25:00,305 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-12-18 21:25:00,305 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-12-18 21:25:00,305 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-12-18 21:25:00,305 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2021-12-18 21:25:00,305 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2021-12-18 21:25:00,306 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-12-18 21:25:00,306 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2021-12-18 21:25:00,306 INFO L138 SettingsManager]: * Logic for external solver=AUFBV WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 5b2cf85bdf3ceca18f859bba09ed8bf6de8160130db2f8571365ac2bc4f0e30c [2021-12-18 21:25:00,562 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-12-18 21:25:00,582 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-12-18 21:25:00,584 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-12-18 21:25:00,585 INFO L271 PluginConnector]: Initializing CDTParser... [2021-12-18 21:25:00,586 INFO L275 PluginConnector]: CDTParser initialized [2021-12-18 21:25:00,586 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/forester-heap/dll-circular-2.i [2021-12-18 21:25:00,633 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/75ebdd22b/bf040a59663b47acb30951024c71e8ab/FLAG63917d188 [2021-12-18 21:25:01,090 INFO L306 CDTParser]: Found 1 translation units. [2021-12-18 21:25:01,090 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/dll-circular-2.i [2021-12-18 21:25:01,103 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/75ebdd22b/bf040a59663b47acb30951024c71e8ab/FLAG63917d188 [2021-12-18 21:25:01,112 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/75ebdd22b/bf040a59663b47acb30951024c71e8ab [2021-12-18 21:25:01,115 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-12-18 21:25:01,116 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-12-18 21:25:01,118 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-12-18 21:25:01,118 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-12-18 21:25:01,120 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-12-18 21:25:01,121 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.12 09:25:01" (1/1) ... [2021-12-18 21:25:01,122 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@23a547fe and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 09:25:01, skipping insertion in model container [2021-12-18 21:25:01,122 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.12 09:25:01" (1/1) ... [2021-12-18 21:25:01,126 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-12-18 21:25:01,151 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-12-18 21:25:01,396 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/forester-heap/dll-circular-2.i[22391,22404] [2021-12-18 21:25:01,399 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/forester-heap/dll-circular-2.i[22497,22510] [2021-12-18 21:25:01,402 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/forester-heap/dll-circular-2.i[22622,22635] [2021-12-18 21:25:01,410 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-12-18 21:25:01,420 INFO L203 MainTranslator]: Completed pre-run [2021-12-18 21:25:01,456 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/forester-heap/dll-circular-2.i[22391,22404] [2021-12-18 21:25:01,457 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/forester-heap/dll-circular-2.i[22497,22510] [2021-12-18 21:25:01,458 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/forester-heap/dll-circular-2.i[22622,22635] [2021-12-18 21:25:01,460 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-12-18 21:25:01,481 INFO L208 MainTranslator]: Completed translation [2021-12-18 21:25:01,482 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 09:25:01 WrapperNode [2021-12-18 21:25:01,482 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-12-18 21:25:01,482 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-12-18 21:25:01,483 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-12-18 21:25:01,483 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-12-18 21:25:01,487 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 09:25:01" (1/1) ... [2021-12-18 21:25:01,514 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 09:25:01" (1/1) ... [2021-12-18 21:25:01,537 INFO L137 Inliner]: procedures = 122, calls = 31, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 122 [2021-12-18 21:25:01,538 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-12-18 21:25:01,539 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-12-18 21:25:01,539 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-12-18 21:25:01,539 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-12-18 21:25:01,545 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 09:25:01" (1/1) ... [2021-12-18 21:25:01,545 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 09:25:01" (1/1) ... [2021-12-18 21:25:01,556 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 09:25:01" (1/1) ... [2021-12-18 21:25:01,556 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 09:25:01" (1/1) ... [2021-12-18 21:25:01,564 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 09:25:01" (1/1) ... [2021-12-18 21:25:01,573 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 09:25:01" (1/1) ... [2021-12-18 21:25:01,576 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 09:25:01" (1/1) ... [2021-12-18 21:25:01,582 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-12-18 21:25:01,583 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-12-18 21:25:01,588 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-12-18 21:25:01,589 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-12-18 21:25:01,589 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 09:25:01" (1/1) ... [2021-12-18 21:25:01,593 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-12-18 21:25:01,601 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-18 21:25:01,610 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-18 21:25:01,618 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-18 21:25:01,643 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2021-12-18 21:25:01,643 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2021-12-18 21:25:01,643 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2021-12-18 21:25:01,643 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2021-12-18 21:25:01,644 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2021-12-18 21:25:01,644 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-12-18 21:25:01,644 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2021-12-18 21:25:01,644 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2021-12-18 21:25:01,644 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-12-18 21:25:01,644 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-12-18 21:25:01,717 INFO L236 CfgBuilder]: Building ICFG [2021-12-18 21:25:01,718 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2021-12-18 21:25:02,054 INFO L277 CfgBuilder]: Performing block encoding [2021-12-18 21:25:02,058 INFO L296 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-12-18 21:25:02,060 INFO L301 CfgBuilder]: Removed 9 assume(true) statements. [2021-12-18 21:25:02,061 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.12 09:25:02 BoogieIcfgContainer [2021-12-18 21:25:02,062 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-12-18 21:25:02,063 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-12-18 21:25:02,063 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-12-18 21:25:02,065 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-12-18 21:25:02,066 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 18.12 09:25:01" (1/3) ... [2021-12-18 21:25:02,067 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@41efb231 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.12 09:25:02, skipping insertion in model container [2021-12-18 21:25:02,067 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 09:25:01" (2/3) ... [2021-12-18 21:25:02,067 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@41efb231 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.12 09:25:02, skipping insertion in model container [2021-12-18 21:25:02,067 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.12 09:25:02" (3/3) ... [2021-12-18 21:25:02,068 INFO L111 eAbstractionObserver]: Analyzing ICFG dll-circular-2.i [2021-12-18 21:25:02,072 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-12-18 21:25:02,072 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 52 error locations. [2021-12-18 21:25:02,107 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2021-12-18 21:25:02,113 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-18 21:25:02,114 INFO L340 AbstractCegarLoop]: Starting to check reachability of 52 error locations. [2021-12-18 21:25:02,126 INFO L276 IsEmpty]: Start isEmpty. Operand has 110 states, 57 states have (on average 2.245614035087719) internal successors, (128), 109 states have internal predecessors, (128), 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-18 21:25:02,129 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2021-12-18 21:25:02,129 INFO L506 BasicCegarLoop]: Found error trace [2021-12-18 21:25:02,130 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1] [2021-12-18 21:25:02,131 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 48 more)] === [2021-12-18 21:25:02,136 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-18 21:25:02,136 INFO L85 PathProgramCache]: Analyzing trace with hash 29857, now seen corresponding path program 1 times [2021-12-18 21:25:02,143 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-18 21:25:02,144 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [721612851] [2021-12-18 21:25:02,144 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-18 21:25:02,145 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-18 21:25:02,145 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-18 21:25:02,147 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-12-18 21:25:02,182 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2021-12-18 21:25:02,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 21:25:02,204 INFO L263 TraceCheckSpWp]: Trace formula consists of 23 conjuncts, 3 conjunts are in the unsatisfiable core [2021-12-18 21:25:02,207 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-18 21:25:02,263 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-18 21:25:02,271 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-18 21:25:02,271 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-18 21:25:02,272 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-18 21:25:02,272 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [721612851] [2021-12-18 21:25:02,272 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [721612851] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-18 21:25:02,272 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-18 21:25:02,273 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-12-18 21:25:02,274 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1201068173] [2021-12-18 21:25:02,274 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-18 21:25:02,277 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-12-18 21:25:02,277 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-18 21:25:02,293 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-18 21:25:02,293 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-18 21:25:02,295 INFO L87 Difference]: Start difference. First operand has 110 states, 57 states have (on average 2.245614035087719) internal successors, (128), 109 states have internal predecessors, (128), 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) Second operand has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 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-18 21:25:02,441 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-18 21:25:02,441 INFO L93 Difference]: Finished difference Result 115 states and 122 transitions. [2021-12-18 21:25:02,442 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-18 21:25:02,443 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 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 3 [2021-12-18 21:25:02,444 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-18 21:25:02,448 INFO L225 Difference]: With dead ends: 115 [2021-12-18 21:25:02,449 INFO L226 Difference]: Without dead ends: 113 [2021-12-18 21:25:02,450 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-18 21:25:02,452 INFO L933 BasicCegarLoop]: 67 mSDtfsCounter, 93 mSDsluCounter, 11 mSDsCounter, 0 mSdLazyCounter, 58 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 93 SdHoareTripleChecker+Valid, 78 SdHoareTripleChecker+Invalid, 63 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 58 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-18 21:25:02,452 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [93 Valid, 78 Invalid, 63 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 58 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-18 21:25:02,463 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113 states. [2021-12-18 21:25:02,472 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113 to 103. [2021-12-18 21:25:02,473 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 103 states, 56 states have (on average 1.9464285714285714) internal successors, (109), 102 states have internal predecessors, (109), 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-18 21:25:02,474 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 109 transitions. [2021-12-18 21:25:02,475 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 109 transitions. Word has length 3 [2021-12-18 21:25:02,475 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-18 21:25:02,475 INFO L470 AbstractCegarLoop]: Abstraction has 103 states and 109 transitions. [2021-12-18 21:25:02,476 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 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-18 21:25:02,476 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 109 transitions. [2021-12-18 21:25:02,476 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2021-12-18 21:25:02,476 INFO L506 BasicCegarLoop]: Found error trace [2021-12-18 21:25:02,476 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1] [2021-12-18 21:25:02,485 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (2)] Forceful destruction successful, exit code 0 [2021-12-18 21:25:02,676 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-12-18 21:25:02,677 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 48 more)] === [2021-12-18 21:25:02,677 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-18 21:25:02,678 INFO L85 PathProgramCache]: Analyzing trace with hash 29858, now seen corresponding path program 1 times [2021-12-18 21:25:02,678 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-18 21:25:02,678 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1155156557] [2021-12-18 21:25:02,678 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-18 21:25:02,678 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-18 21:25:02,678 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-18 21:25:02,679 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-12-18 21:25:02,681 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2021-12-18 21:25:02,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 21:25:02,721 INFO L263 TraceCheckSpWp]: Trace formula consists of 23 conjuncts, 4 conjunts are in the unsatisfiable core [2021-12-18 21:25:02,722 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-18 21:25:02,732 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-18 21:25:02,747 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-18 21:25:02,747 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-18 21:25:02,747 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-18 21:25:02,747 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1155156557] [2021-12-18 21:25:02,748 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1155156557] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-18 21:25:02,748 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-18 21:25:02,748 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-12-18 21:25:02,748 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [979930914] [2021-12-18 21:25:02,748 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-18 21:25:02,749 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-12-18 21:25:02,749 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-18 21:25:02,750 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-18 21:25:02,750 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-18 21:25:02,751 INFO L87 Difference]: Start difference. First operand 103 states and 109 transitions. Second operand has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 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-18 21:25:02,889 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-18 21:25:02,890 INFO L93 Difference]: Finished difference Result 110 states and 116 transitions. [2021-12-18 21:25:02,891 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-18 21:25:02,891 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 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 3 [2021-12-18 21:25:02,891 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-18 21:25:02,892 INFO L225 Difference]: With dead ends: 110 [2021-12-18 21:25:02,892 INFO L226 Difference]: Without dead ends: 110 [2021-12-18 21:25:02,892 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-18 21:25:02,893 INFO L933 BasicCegarLoop]: 67 mSDtfsCounter, 90 mSDsluCounter, 11 mSDsCounter, 0 mSdLazyCounter, 49 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 90 SdHoareTripleChecker+Valid, 78 SdHoareTripleChecker+Invalid, 54 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 49 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-18 21:25:02,893 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [90 Valid, 78 Invalid, 54 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 49 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-18 21:25:02,894 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110 states. [2021-12-18 21:25:02,897 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110 to 98. [2021-12-18 21:25:02,897 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 98 states, 56 states have (on average 1.8571428571428572) internal successors, (104), 97 states have internal predecessors, (104), 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-18 21:25:02,898 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 104 transitions. [2021-12-18 21:25:02,898 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 104 transitions. Word has length 3 [2021-12-18 21:25:02,898 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-18 21:25:02,899 INFO L470 AbstractCegarLoop]: Abstraction has 98 states and 104 transitions. [2021-12-18 21:25:02,899 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 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-18 21:25:02,899 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 104 transitions. [2021-12-18 21:25:02,899 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2021-12-18 21:25:02,899 INFO L506 BasicCegarLoop]: Found error trace [2021-12-18 21:25:02,899 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2021-12-18 21:25:02,910 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (3)] Forceful destruction successful, exit code 0 [2021-12-18 21:25:03,107 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-12-18 21:25:03,108 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr19REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 48 more)] === [2021-12-18 21:25:03,108 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-18 21:25:03,108 INFO L85 PathProgramCache]: Analyzing trace with hash 59261800, now seen corresponding path program 1 times [2021-12-18 21:25:03,108 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-18 21:25:03,109 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1668522373] [2021-12-18 21:25:03,109 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-18 21:25:03,109 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-18 21:25:03,109 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-18 21:25:03,110 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-12-18 21:25:03,112 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2021-12-18 21:25:03,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 21:25:03,156 INFO L263 TraceCheckSpWp]: Trace formula consists of 66 conjuncts, 4 conjunts are in the unsatisfiable core [2021-12-18 21:25:03,157 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-18 21:25:03,176 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-18 21:25:03,205 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-18 21:25:03,206 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-18 21:25:03,206 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-18 21:25:03,206 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1668522373] [2021-12-18 21:25:03,206 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1668522373] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-18 21:25:03,207 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-18 21:25:03,207 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-12-18 21:25:03,207 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [232946662] [2021-12-18 21:25:03,207 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-18 21:25:03,207 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-12-18 21:25:03,208 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-18 21:25:03,209 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-12-18 21:25:03,209 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-12-18 21:25:03,209 INFO L87 Difference]: Start difference. First operand 98 states and 104 transitions. Second operand has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 4 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-18 21:25:03,383 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-18 21:25:03,384 INFO L93 Difference]: Finished difference Result 95 states and 102 transitions. [2021-12-18 21:25:03,384 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-12-18 21:25:03,384 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 4 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-18 21:25:03,385 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-18 21:25:03,385 INFO L225 Difference]: With dead ends: 95 [2021-12-18 21:25:03,385 INFO L226 Difference]: Without dead ends: 95 [2021-12-18 21:25:03,385 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-12-18 21:25:03,386 INFO L933 BasicCegarLoop]: 44 mSDtfsCounter, 146 mSDsluCounter, 8 mSDsCounter, 0 mSdLazyCounter, 79 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 146 SdHoareTripleChecker+Valid, 52 SdHoareTripleChecker+Invalid, 100 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 79 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-12-18 21:25:03,386 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [146 Valid, 52 Invalid, 100 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 79 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2021-12-18 21:25:03,387 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2021-12-18 21:25:03,389 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 86. [2021-12-18 21:25:03,389 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 86 states, 56 states have (on average 1.6428571428571428) internal successors, (92), 85 states have internal predecessors, (92), 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-18 21:25:03,390 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 92 transitions. [2021-12-18 21:25:03,390 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 92 transitions. Word has length 8 [2021-12-18 21:25:03,390 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-18 21:25:03,390 INFO L470 AbstractCegarLoop]: Abstraction has 86 states and 92 transitions. [2021-12-18 21:25:03,390 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 4 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-18 21:25:03,390 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 92 transitions. [2021-12-18 21:25:03,391 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2021-12-18 21:25:03,391 INFO L506 BasicCegarLoop]: Found error trace [2021-12-18 21:25:03,391 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2021-12-18 21:25:03,402 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (4)] Forceful destruction successful, exit code 0 [2021-12-18 21:25:03,599 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-12-18 21:25:03,600 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr20REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 48 more)] === [2021-12-18 21:25:03,600 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-18 21:25:03,600 INFO L85 PathProgramCache]: Analyzing trace with hash 59261801, now seen corresponding path program 1 times [2021-12-18 21:25:03,600 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-18 21:25:03,601 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [696686108] [2021-12-18 21:25:03,601 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-18 21:25:03,601 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-18 21:25:03,601 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-18 21:25:03,602 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-12-18 21:25:03,607 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2021-12-18 21:25:03,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 21:25:03,648 INFO L263 TraceCheckSpWp]: Trace formula consists of 66 conjuncts, 6 conjunts are in the unsatisfiable core [2021-12-18 21:25:03,649 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-18 21:25:03,660 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-18 21:25:03,713 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-18 21:25:03,713 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-18 21:25:03,713 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-18 21:25:03,713 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [696686108] [2021-12-18 21:25:03,714 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [696686108] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-18 21:25:03,714 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-18 21:25:03,714 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-12-18 21:25:03,714 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [950381211] [2021-12-18 21:25:03,714 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-18 21:25:03,714 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-12-18 21:25:03,715 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-18 21:25:03,715 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-12-18 21:25:03,715 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-12-18 21:25:03,715 INFO L87 Difference]: Start difference. First operand 86 states and 92 transitions. Second operand has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 4 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-18 21:25:03,917 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-18 21:25:03,917 INFO L93 Difference]: Finished difference Result 110 states and 117 transitions. [2021-12-18 21:25:03,917 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-12-18 21:25:03,917 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 4 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-18 21:25:03,917 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-18 21:25:03,918 INFO L225 Difference]: With dead ends: 110 [2021-12-18 21:25:03,918 INFO L226 Difference]: Without dead ends: 110 [2021-12-18 21:25:03,918 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-12-18 21:25:03,919 INFO L933 BasicCegarLoop]: 55 mSDtfsCounter, 100 mSDsluCounter, 42 mSDsCounter, 0 mSdLazyCounter, 106 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 100 SdHoareTripleChecker+Valid, 97 SdHoareTripleChecker+Invalid, 112 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 106 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-12-18 21:25:03,920 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [100 Valid, 97 Invalid, 112 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 106 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2021-12-18 21:25:03,921 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110 states. [2021-12-18 21:25:03,924 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110 to 94. [2021-12-18 21:25:03,924 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 94 states, 64 states have (on average 1.609375) internal successors, (103), 93 states have internal predecessors, (103), 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-18 21:25:03,925 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 103 transitions. [2021-12-18 21:25:03,925 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 103 transitions. Word has length 8 [2021-12-18 21:25:03,925 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-18 21:25:03,925 INFO L470 AbstractCegarLoop]: Abstraction has 94 states and 103 transitions. [2021-12-18 21:25:03,925 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 4 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-18 21:25:03,925 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 103 transitions. [2021-12-18 21:25:03,925 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2021-12-18 21:25:03,925 INFO L506 BasicCegarLoop]: Found error trace [2021-12-18 21:25:03,925 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-18 21:25:03,934 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (5)] Forceful destruction successful, exit code 0 [2021-12-18 21:25:04,132 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-12-18 21:25:04,132 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr10REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 48 more)] === [2021-12-18 21:25:04,132 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-18 21:25:04,133 INFO L85 PathProgramCache]: Analyzing trace with hash 236809587, now seen corresponding path program 1 times [2021-12-18 21:25:04,133 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-18 21:25:04,133 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1866111728] [2021-12-18 21:25:04,133 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-18 21:25:04,133 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-18 21:25:04,133 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-18 21:25:04,134 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-12-18 21:25:04,135 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2021-12-18 21:25:04,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 21:25:04,183 INFO L263 TraceCheckSpWp]: Trace formula consists of 94 conjuncts, 7 conjunts are in the unsatisfiable core [2021-12-18 21:25:04,184 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-18 21:25:04,213 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-18 21:25:04,226 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2021-12-18 21:25:04,244 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 20 treesize of output 12 [2021-12-18 21:25:04,250 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-18 21:25:04,250 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-18 21:25:04,250 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-18 21:25:04,251 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1866111728] [2021-12-18 21:25:04,251 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1866111728] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-18 21:25:04,251 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-18 21:25:04,251 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-12-18 21:25:04,251 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1683177021] [2021-12-18 21:25:04,251 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-18 21:25:04,251 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-12-18 21:25:04,251 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-18 21:25:04,252 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-12-18 21:25:04,252 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-12-18 21:25:04,252 INFO L87 Difference]: Start difference. First operand 94 states and 103 transitions. Second operand has 5 states, 4 states have (on average 2.75) internal successors, (11), 5 states have internal predecessors, (11), 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-18 21:25:04,435 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-18 21:25:04,435 INFO L93 Difference]: Finished difference Result 93 states and 101 transitions. [2021-12-18 21:25:04,435 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-12-18 21:25:04,435 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 2.75) internal successors, (11), 5 states have internal predecessors, (11), 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 11 [2021-12-18 21:25:04,435 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-18 21:25:04,436 INFO L225 Difference]: With dead ends: 93 [2021-12-18 21:25:04,436 INFO L226 Difference]: Without dead ends: 93 [2021-12-18 21:25:04,436 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2021-12-18 21:25:04,437 INFO L933 BasicCegarLoop]: 84 mSDtfsCounter, 9 mSDsluCounter, 137 mSDsCounter, 0 mSdLazyCounter, 128 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 221 SdHoareTripleChecker+Invalid, 130 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 128 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-12-18 21:25:04,437 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [9 Valid, 221 Invalid, 130 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 128 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2021-12-18 21:25:04,437 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2021-12-18 21:25:04,444 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 93. [2021-12-18 21:25:04,446 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 93 states, 64 states have (on average 1.578125) internal successors, (101), 92 states have internal predecessors, (101), 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-18 21:25:04,447 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 101 transitions. [2021-12-18 21:25:04,449 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 101 transitions. Word has length 11 [2021-12-18 21:25:04,449 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-18 21:25:04,450 INFO L470 AbstractCegarLoop]: Abstraction has 93 states and 101 transitions. [2021-12-18 21:25:04,450 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 2.75) internal successors, (11), 5 states have internal predecessors, (11), 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-18 21:25:04,450 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 101 transitions. [2021-12-18 21:25:04,450 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2021-12-18 21:25:04,450 INFO L506 BasicCegarLoop]: Found error trace [2021-12-18 21:25:04,450 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-18 21:25:04,458 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (6)] Forceful destruction successful, exit code 0 [2021-12-18 21:25:04,651 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-12-18 21:25:04,651 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr11REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 48 more)] === [2021-12-18 21:25:04,651 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-18 21:25:04,651 INFO L85 PathProgramCache]: Analyzing trace with hash 236809588, now seen corresponding path program 1 times [2021-12-18 21:25:04,652 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-18 21:25:04,652 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1974138633] [2021-12-18 21:25:04,652 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-18 21:25:04,652 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-18 21:25:04,652 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-18 21:25:04,653 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-12-18 21:25:04,656 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (7)] Waiting until timeout for monitored process [2021-12-18 21:25:04,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 21:25:04,704 INFO L263 TraceCheckSpWp]: Trace formula consists of 94 conjuncts, 12 conjunts are in the unsatisfiable core [2021-12-18 21:25:04,705 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-18 21:25:04,722 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-18 21:25:04,744 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2021-12-18 21:25:04,749 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2021-12-18 21:25:04,772 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 17 treesize of output 9 [2021-12-18 21:25:04,775 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 15 treesize of output 7 [2021-12-18 21:25:04,784 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-18 21:25:04,784 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-18 21:25:04,785 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-18 21:25:04,785 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1974138633] [2021-12-18 21:25:04,785 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1974138633] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-18 21:25:04,785 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-18 21:25:04,785 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-12-18 21:25:04,785 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1201737550] [2021-12-18 21:25:04,785 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-18 21:25:04,786 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-12-18 21:25:04,786 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-18 21:25:04,786 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-12-18 21:25:04,786 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-12-18 21:25:04,787 INFO L87 Difference]: Start difference. First operand 93 states and 101 transitions. Second operand has 5 states, 4 states have (on average 2.75) internal successors, (11), 5 states have internal predecessors, (11), 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-18 21:25:05,020 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-18 21:25:05,021 INFO L93 Difference]: Finished difference Result 92 states and 99 transitions. [2021-12-18 21:25:05,021 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-12-18 21:25:05,021 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 2.75) internal successors, (11), 5 states have internal predecessors, (11), 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 11 [2021-12-18 21:25:05,021 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-18 21:25:05,022 INFO L225 Difference]: With dead ends: 92 [2021-12-18 21:25:05,022 INFO L226 Difference]: Without dead ends: 92 [2021-12-18 21:25:05,022 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2021-12-18 21:25:05,022 INFO L933 BasicCegarLoop]: 85 mSDtfsCounter, 4 mSDsluCounter, 131 mSDsCounter, 0 mSdLazyCounter, 135 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 216 SdHoareTripleChecker+Invalid, 136 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 135 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-12-18 21:25:05,023 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [4 Valid, 216 Invalid, 136 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 135 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2021-12-18 21:25:05,023 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2021-12-18 21:25:05,025 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 92. [2021-12-18 21:25:05,025 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 92 states, 64 states have (on average 1.546875) internal successors, (99), 91 states have internal predecessors, (99), 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-18 21:25:05,026 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 99 transitions. [2021-12-18 21:25:05,026 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 99 transitions. Word has length 11 [2021-12-18 21:25:05,026 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-18 21:25:05,026 INFO L470 AbstractCegarLoop]: Abstraction has 92 states and 99 transitions. [2021-12-18 21:25:05,026 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 2.75) internal successors, (11), 5 states have internal predecessors, (11), 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-18 21:25:05,026 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 99 transitions. [2021-12-18 21:25:05,026 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2021-12-18 21:25:05,026 INFO L506 BasicCegarLoop]: Found error trace [2021-12-18 21:25:05,026 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-18 21:25:05,037 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (7)] Forceful destruction successful, exit code 0 [2021-12-18 21:25:05,231 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-12-18 21:25:05,233 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr23ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 48 more)] === [2021-12-18 21:25:05,234 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-18 21:25:05,234 INFO L85 PathProgramCache]: Analyzing trace with hash -1249789621, now seen corresponding path program 1 times [2021-12-18 21:25:05,234 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-18 21:25:05,234 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [320905196] [2021-12-18 21:25:05,234 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-18 21:25:05,234 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-18 21:25:05,235 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-18 21:25:05,235 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-12-18 21:25:05,236 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (8)] Waiting until timeout for monitored process [2021-12-18 21:25:05,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 21:25:05,305 INFO L263 TraceCheckSpWp]: Trace formula consists of 89 conjuncts, 16 conjunts are in the unsatisfiable core [2021-12-18 21:25:05,308 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-18 21:25:05,334 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 11 treesize of output 7 [2021-12-18 21:25:05,355 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-18 21:25:05,358 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 21 treesize of output 20 [2021-12-18 21:25:05,374 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-18 21:25:05,375 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 21 treesize of output 20 [2021-12-18 21:25:05,428 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-18 21:25:05,429 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 21 treesize of output 20 [2021-12-18 21:25:05,444 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 15 treesize of output 7 [2021-12-18 21:25:05,455 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-18 21:25:05,455 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-18 21:25:05,455 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-18 21:25:05,455 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [320905196] [2021-12-18 21:25:05,455 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [320905196] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-18 21:25:05,456 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-18 21:25:05,456 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-12-18 21:25:05,456 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [255237655] [2021-12-18 21:25:05,456 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-18 21:25:05,456 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-12-18 21:25:05,456 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-18 21:25:05,456 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-12-18 21:25:05,456 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2021-12-18 21:25:05,457 INFO L87 Difference]: Start difference. First operand 92 states and 99 transitions. Second operand has 7 states, 7 states have (on average 1.7142857142857142) internal successors, (12), 7 states have internal predecessors, (12), 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-18 21:25:05,693 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-18 21:25:05,693 INFO L93 Difference]: Finished difference Result 175 states and 186 transitions. [2021-12-18 21:25:05,694 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-12-18 21:25:05,694 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 1.7142857142857142) internal successors, (12), 7 states have internal predecessors, (12), 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 12 [2021-12-18 21:25:05,694 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-18 21:25:05,694 INFO L225 Difference]: With dead ends: 175 [2021-12-18 21:25:05,694 INFO L226 Difference]: Without dead ends: 175 [2021-12-18 21:25:05,695 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=36, Invalid=54, Unknown=0, NotChecked=0, Total=90 [2021-12-18 21:25:05,695 INFO L933 BasicCegarLoop]: 65 mSDtfsCounter, 274 mSDsluCounter, 198 mSDsCounter, 0 mSdLazyCounter, 133 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 274 SdHoareTripleChecker+Valid, 263 SdHoareTripleChecker+Invalid, 143 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 133 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-12-18 21:25:05,695 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [274 Valid, 263 Invalid, 143 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 133 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2021-12-18 21:25:05,696 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 175 states. [2021-12-18 21:25:05,698 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 175 to 95. [2021-12-18 21:25:05,698 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 95 states, 67 states have (on average 1.5223880597014925) internal successors, (102), 94 states have internal predecessors, (102), 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-18 21:25:05,699 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 102 transitions. [2021-12-18 21:25:05,699 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 102 transitions. Word has length 12 [2021-12-18 21:25:05,699 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-18 21:25:05,699 INFO L470 AbstractCegarLoop]: Abstraction has 95 states and 102 transitions. [2021-12-18 21:25:05,699 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 1.7142857142857142) internal successors, (12), 7 states have internal predecessors, (12), 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-18 21:25:05,699 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 102 transitions. [2021-12-18 21:25:05,699 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2021-12-18 21:25:05,699 INFO L506 BasicCegarLoop]: Found error trace [2021-12-18 21:25:05,699 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-18 21:25:05,708 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (8)] Ended with exit code 0 [2021-12-18 21:25:05,906 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-12-18 21:25:05,906 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr24REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 48 more)] === [2021-12-18 21:25:05,906 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-18 21:25:05,907 INFO L85 PathProgramCache]: Analyzing trace with hash -88768416, now seen corresponding path program 1 times [2021-12-18 21:25:05,907 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-18 21:25:05,907 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [187477088] [2021-12-18 21:25:05,907 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-18 21:25:05,907 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-18 21:25:05,907 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-18 21:25:05,908 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-12-18 21:25:05,908 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (9)] Waiting until timeout for monitored process [2021-12-18 21:25:05,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 21:25:05,973 INFO L263 TraceCheckSpWp]: Trace formula consists of 89 conjuncts, 17 conjunts are in the unsatisfiable core [2021-12-18 21:25:05,976 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-18 21:25:05,991 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-18 21:25:06,004 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2021-12-18 21:25:06,029 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-18 21:25:06,029 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 21 treesize of output 20 [2021-12-18 21:25:06,042 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-18 21:25:06,044 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 21 treesize of output 20 [2021-12-18 21:25:06,095 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-18 21:25:06,096 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 21 treesize of output 20 [2021-12-18 21:25:06,109 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 15 treesize of output 7 [2021-12-18 21:25:06,126 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-18 21:25:06,126 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-18 21:25:06,126 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-18 21:25:06,127 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [187477088] [2021-12-18 21:25:06,127 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [187477088] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-18 21:25:06,127 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-18 21:25:06,127 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-12-18 21:25:06,127 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [544587343] [2021-12-18 21:25:06,127 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-18 21:25:06,128 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-12-18 21:25:06,128 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-18 21:25:06,128 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-12-18 21:25:06,129 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2021-12-18 21:25:06,129 INFO L87 Difference]: Start difference. First operand 95 states and 102 transitions. Second operand has 7 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 7 states have internal predecessors, (13), 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-18 21:25:06,432 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-18 21:25:06,432 INFO L93 Difference]: Finished difference Result 144 states and 155 transitions. [2021-12-18 21:25:06,433 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-12-18 21:25:06,433 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 7 states have internal predecessors, (13), 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 13 [2021-12-18 21:25:06,433 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-18 21:25:06,433 INFO L225 Difference]: With dead ends: 144 [2021-12-18 21:25:06,433 INFO L226 Difference]: Without dead ends: 144 [2021-12-18 21:25:06,434 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=36, Invalid=54, Unknown=0, NotChecked=0, Total=90 [2021-12-18 21:25:06,434 INFO L933 BasicCegarLoop]: 43 mSDtfsCounter, 255 mSDsluCounter, 112 mSDsCounter, 0 mSdLazyCounter, 209 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 255 SdHoareTripleChecker+Valid, 155 SdHoareTripleChecker+Invalid, 230 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 209 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2021-12-18 21:25:06,434 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [255 Valid, 155 Invalid, 230 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 209 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2021-12-18 21:25:06,435 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 144 states. [2021-12-18 21:25:06,437 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 144 to 97. [2021-12-18 21:25:06,437 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 97 states, 69 states have (on average 1.5217391304347827) internal successors, (105), 96 states have internal predecessors, (105), 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-18 21:25:06,437 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 105 transitions. [2021-12-18 21:25:06,437 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 105 transitions. Word has length 13 [2021-12-18 21:25:06,437 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-18 21:25:06,437 INFO L470 AbstractCegarLoop]: Abstraction has 97 states and 105 transitions. [2021-12-18 21:25:06,438 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 7 states have internal predecessors, (13), 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-18 21:25:06,438 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 105 transitions. [2021-12-18 21:25:06,438 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2021-12-18 21:25:06,438 INFO L506 BasicCegarLoop]: Found error trace [2021-12-18 21:25:06,438 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-18 21:25:06,447 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (9)] Forceful destruction successful, exit code 0 [2021-12-18 21:25:06,638 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-12-18 21:25:06,639 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr25REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 48 more)] === [2021-12-18 21:25:06,639 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-18 21:25:06,639 INFO L85 PathProgramCache]: Analyzing trace with hash -88768415, now seen corresponding path program 1 times [2021-12-18 21:25:06,639 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-18 21:25:06,639 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [180391611] [2021-12-18 21:25:06,639 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-18 21:25:06,640 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-18 21:25:06,640 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-18 21:25:06,640 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-12-18 21:25:06,641 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (10)] Waiting until timeout for monitored process [2021-12-18 21:25:06,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 21:25:06,705 INFO L263 TraceCheckSpWp]: Trace formula consists of 89 conjuncts, 28 conjunts are in the unsatisfiable core [2021-12-18 21:25:06,707 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-18 21:25:06,717 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-18 21:25:06,731 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2021-12-18 21:25:06,737 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2021-12-18 21:25:06,763 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-18 21:25:06,764 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 21 treesize of output 20 [2021-12-18 21:25:06,769 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-18 21:25:06,770 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 21 treesize of output 20 [2021-12-18 21:25:06,786 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-18 21:25:06,787 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 21 treesize of output 20 [2021-12-18 21:25:06,792 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-18 21:25:06,793 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 21 treesize of output 20 [2021-12-18 21:25:06,853 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-18 21:25:06,854 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 21 treesize of output 20 [2021-12-18 21:25:06,860 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-18 21:25:06,861 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 21 treesize of output 20 [2021-12-18 21:25:06,875 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 15 treesize of output 7 [2021-12-18 21:25:06,885 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 15 treesize of output 7 [2021-12-18 21:25:06,919 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-18 21:25:06,919 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-18 21:25:06,919 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-18 21:25:06,919 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [180391611] [2021-12-18 21:25:06,919 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [180391611] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-18 21:25:06,919 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-18 21:25:06,919 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-12-18 21:25:06,920 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1638236306] [2021-12-18 21:25:06,920 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-18 21:25:06,920 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-12-18 21:25:06,920 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-18 21:25:06,920 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-12-18 21:25:06,920 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2021-12-18 21:25:06,921 INFO L87 Difference]: Start difference. First operand 97 states and 105 transitions. Second operand has 7 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 7 states have internal predecessors, (13), 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-18 21:25:07,274 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-18 21:25:07,274 INFO L93 Difference]: Finished difference Result 169 states and 180 transitions. [2021-12-18 21:25:07,275 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-12-18 21:25:07,275 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 7 states have internal predecessors, (13), 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 13 [2021-12-18 21:25:07,275 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-18 21:25:07,276 INFO L225 Difference]: With dead ends: 169 [2021-12-18 21:25:07,276 INFO L226 Difference]: Without dead ends: 169 [2021-12-18 21:25:07,276 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=36, Invalid=54, Unknown=0, NotChecked=0, Total=90 [2021-12-18 21:25:07,276 INFO L933 BasicCegarLoop]: 52 mSDtfsCounter, 249 mSDsluCounter, 145 mSDsCounter, 0 mSdLazyCounter, 193 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 249 SdHoareTripleChecker+Valid, 197 SdHoareTripleChecker+Invalid, 212 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 193 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2021-12-18 21:25:07,276 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [249 Valid, 197 Invalid, 212 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 193 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2021-12-18 21:25:07,277 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 169 states. [2021-12-18 21:25:07,279 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 169 to 109. [2021-12-18 21:25:07,279 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 109 states, 81 states have (on average 1.5185185185185186) internal successors, (123), 108 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-18 21:25:07,279 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 123 transitions. [2021-12-18 21:25:07,279 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 123 transitions. Word has length 13 [2021-12-18 21:25:07,279 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-18 21:25:07,280 INFO L470 AbstractCegarLoop]: Abstraction has 109 states and 123 transitions. [2021-12-18 21:25:07,280 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 7 states have internal predecessors, (13), 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-18 21:25:07,280 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 123 transitions. [2021-12-18 21:25:07,280 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2021-12-18 21:25:07,280 INFO L506 BasicCegarLoop]: Found error trace [2021-12-18 21:25:07,280 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-18 21:25:07,289 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (10)] Forceful destruction successful, exit code 0 [2021-12-18 21:25:07,486 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-12-18 21:25:07,487 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr14REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 48 more)] === [2021-12-18 21:25:07,487 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-18 21:25:07,487 INFO L85 PathProgramCache]: Analyzing trace with hash -1108053835, now seen corresponding path program 1 times [2021-12-18 21:25:07,487 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-18 21:25:07,487 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [467583204] [2021-12-18 21:25:07,488 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-18 21:25:07,488 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-18 21:25:07,488 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-18 21:25:07,488 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-12-18 21:25:07,491 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (11)] Waiting until timeout for monitored process [2021-12-18 21:25:07,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 21:25:07,565 INFO L263 TraceCheckSpWp]: Trace formula consists of 116 conjuncts, 15 conjunts are in the unsatisfiable core [2021-12-18 21:25:07,566 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-18 21:25:07,583 INFO L354 Elim1Store]: treesize reduction 8, result has 60.0 percent of original size [2021-12-18 21:25:07,583 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 21 [2021-12-18 21:25:07,658 INFO L354 Elim1Store]: treesize reduction 38, result has 39.7 percent of original size [2021-12-18 21:25:07,659 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 5 case distinctions, treesize of input 30 treesize of output 47 [2021-12-18 21:25:07,711 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 11 treesize of output 7 [2021-12-18 21:25:07,809 INFO L354 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-12-18 21:25:07,810 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 49 treesize of output 48 [2021-12-18 21:25:07,845 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 46 treesize of output 30 [2021-12-18 21:25:07,946 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-18 21:25:07,946 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-18 21:25:07,946 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-18 21:25:07,946 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [467583204] [2021-12-18 21:25:07,947 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [467583204] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-18 21:25:07,947 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-18 21:25:07,947 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-12-18 21:25:07,947 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [609166935] [2021-12-18 21:25:07,947 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-18 21:25:07,947 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2021-12-18 21:25:07,947 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-18 21:25:07,947 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-12-18 21:25:07,948 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2021-12-18 21:25:07,948 INFO L87 Difference]: Start difference. First operand 109 states and 123 transitions. Second operand has 10 states, 9 states have (on average 1.6666666666666667) internal successors, (15), 9 states have internal predecessors, (15), 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-18 21:25:08,457 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-18 21:25:08,458 INFO L93 Difference]: Finished difference Result 167 states and 185 transitions. [2021-12-18 21:25:08,458 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-12-18 21:25:08,458 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 1.6666666666666667) internal successors, (15), 9 states have internal predecessors, (15), 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-18 21:25:08,458 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-18 21:25:08,459 INFO L225 Difference]: With dead ends: 167 [2021-12-18 21:25:08,459 INFO L226 Difference]: Without dead ends: 167 [2021-12-18 21:25:08,459 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=107, Invalid=235, Unknown=0, NotChecked=0, Total=342 [2021-12-18 21:25:08,459 INFO L933 BasicCegarLoop]: 48 mSDtfsCounter, 179 mSDsluCounter, 254 mSDsCounter, 0 mSdLazyCounter, 223 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 179 SdHoareTripleChecker+Valid, 302 SdHoareTripleChecker+Invalid, 411 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 223 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 167 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2021-12-18 21:25:08,460 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [179 Valid, 302 Invalid, 411 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 223 Invalid, 0 Unknown, 167 Unchecked, 0.3s Time] [2021-12-18 21:25:08,460 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 167 states. [2021-12-18 21:25:08,462 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 167 to 111. [2021-12-18 21:25:08,462 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 111 states, 83 states have (on average 1.5180722891566265) internal successors, (126), 110 states have internal predecessors, (126), 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-18 21:25:08,462 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 126 transitions. [2021-12-18 21:25:08,462 INFO L78 Accepts]: Start accepts. Automaton has 111 states and 126 transitions. Word has length 15 [2021-12-18 21:25:08,462 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-18 21:25:08,462 INFO L470 AbstractCegarLoop]: Abstraction has 111 states and 126 transitions. [2021-12-18 21:25:08,462 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 1.6666666666666667) internal successors, (15), 9 states have internal predecessors, (15), 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-18 21:25:08,463 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 126 transitions. [2021-12-18 21:25:08,463 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2021-12-18 21:25:08,463 INFO L506 BasicCegarLoop]: Found error trace [2021-12-18 21:25:08,463 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-18 21:25:08,470 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (11)] Forceful destruction successful, exit code 0 [2021-12-18 21:25:08,670 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-12-18 21:25:08,670 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr15REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 48 more)] === [2021-12-18 21:25:08,670 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-18 21:25:08,670 INFO L85 PathProgramCache]: Analyzing trace with hash -1108053834, now seen corresponding path program 1 times [2021-12-18 21:25:08,671 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-18 21:25:08,671 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [460327939] [2021-12-18 21:25:08,671 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-18 21:25:08,671 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-18 21:25:08,671 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-18 21:25:08,672 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-12-18 21:25:08,672 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (12)] Waiting until timeout for monitored process [2021-12-18 21:25:08,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 21:25:08,749 INFO L263 TraceCheckSpWp]: Trace formula consists of 116 conjuncts, 22 conjunts are in the unsatisfiable core [2021-12-18 21:25:08,750 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-18 21:25:08,757 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-18 21:25:08,788 INFO L354 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-12-18 21:25:08,788 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 14 treesize of output 14 [2021-12-18 21:25:08,795 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2021-12-18 21:25:08,810 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 11 treesize of output 7 [2021-12-18 21:25:08,816 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2021-12-18 21:25:08,876 INFO L354 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-12-18 21:25:08,876 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 38 treesize of output 37 [2021-12-18 21:25:08,880 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 18 treesize of output 20 [2021-12-18 21:25:08,898 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 15 treesize of output 7 [2021-12-18 21:25:08,900 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 25 treesize of output 13 [2021-12-18 21:25:08,926 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-18 21:25:08,926 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-18 21:25:08,926 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-18 21:25:08,926 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [460327939] [2021-12-18 21:25:08,926 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [460327939] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-18 21:25:08,926 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-18 21:25:08,926 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-12-18 21:25:08,926 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1883834084] [2021-12-18 21:25:08,926 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-18 21:25:08,927 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2021-12-18 21:25:08,927 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-18 21:25:08,927 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-12-18 21:25:08,927 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2021-12-18 21:25:08,927 INFO L87 Difference]: Start difference. First operand 111 states and 126 transitions. Second operand has 9 states, 8 states have (on average 1.875) internal successors, (15), 9 states have internal predecessors, (15), 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-18 21:25:09,503 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-18 21:25:09,503 INFO L93 Difference]: Finished difference Result 114 states and 129 transitions. [2021-12-18 21:25:09,504 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2021-12-18 21:25:09,504 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 1.875) internal successors, (15), 9 states have internal predecessors, (15), 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-18 21:25:09,504 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-18 21:25:09,504 INFO L225 Difference]: With dead ends: 114 [2021-12-18 21:25:09,504 INFO L226 Difference]: Without dead ends: 114 [2021-12-18 21:25:09,505 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 49 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=129, Invalid=333, Unknown=0, NotChecked=0, Total=462 [2021-12-18 21:25:09,505 INFO L933 BasicCegarLoop]: 45 mSDtfsCounter, 153 mSDsluCounter, 124 mSDsCounter, 0 mSdLazyCounter, 316 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 153 SdHoareTripleChecker+Valid, 169 SdHoareTripleChecker+Invalid, 336 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 316 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2021-12-18 21:25:09,505 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [153 Valid, 169 Invalid, 336 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 316 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2021-12-18 21:25:09,506 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114 states. [2021-12-18 21:25:09,507 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114 to 105. [2021-12-18 21:25:09,507 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 105 states, 83 states have (on average 1.4337349397590362) internal successors, (119), 104 states have internal predecessors, (119), 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-18 21:25:09,507 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 119 transitions. [2021-12-18 21:25:09,507 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 119 transitions. Word has length 15 [2021-12-18 21:25:09,507 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-18 21:25:09,507 INFO L470 AbstractCegarLoop]: Abstraction has 105 states and 119 transitions. [2021-12-18 21:25:09,507 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 1.875) internal successors, (15), 9 states have internal predecessors, (15), 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-18 21:25:09,508 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 119 transitions. [2021-12-18 21:25:09,508 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2021-12-18 21:25:09,508 INFO L506 BasicCegarLoop]: Found error trace [2021-12-18 21:25:09,508 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-18 21:25:09,516 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (12)] Forceful destruction successful, exit code 0 [2021-12-18 21:25:09,714 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-12-18 21:25:09,715 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr28REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 48 more)] === [2021-12-18 21:25:09,715 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-18 21:25:09,715 INFO L85 PathProgramCache]: Analyzing trace with hash 1200058809, now seen corresponding path program 1 times [2021-12-18 21:25:09,715 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-18 21:25:09,715 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [301336766] [2021-12-18 21:25:09,716 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-18 21:25:09,716 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-18 21:25:09,716 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-18 21:25:09,716 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-12-18 21:25:09,717 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (13)] Waiting until timeout for monitored process [2021-12-18 21:25:09,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 21:25:09,787 INFO L263 TraceCheckSpWp]: Trace formula consists of 101 conjuncts, 29 conjunts are in the unsatisfiable core [2021-12-18 21:25:09,789 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-18 21:25:09,796 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-18 21:25:09,808 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2021-12-18 21:25:09,812 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2021-12-18 21:25:09,828 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-18 21:25:09,829 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 21 treesize of output 20 [2021-12-18 21:25:09,844 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-18 21:25:09,846 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 21 treesize of output 20 [2021-12-18 21:25:09,859 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-18 21:25:09,861 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 21 treesize of output 20 [2021-12-18 21:25:09,867 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-18 21:25:09,868 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 21 treesize of output 20 [2021-12-18 21:25:09,923 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-18 21:25:09,923 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 21 treesize of output 20 [2021-12-18 21:25:09,928 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-18 21:25:09,928 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 21 treesize of output 20 [2021-12-18 21:25:09,937 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 15 treesize of output 7 [2021-12-18 21:25:10,015 INFO L354 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2021-12-18 21:25:10,016 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 3 new quantified variables, introduced 1 case distinctions, treesize of input 19 treesize of output 13 [2021-12-18 21:25:10,024 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-18 21:25:10,024 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-18 21:25:10,024 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-18 21:25:10,024 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [301336766] [2021-12-18 21:25:10,025 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [301336766] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-18 21:25:10,025 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-18 21:25:10,025 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-12-18 21:25:10,025 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [855762363] [2021-12-18 21:25:10,025 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-18 21:25:10,025 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2021-12-18 21:25:10,025 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-18 21:25:10,026 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-12-18 21:25:10,026 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2021-12-18 21:25:10,026 INFO L87 Difference]: Start difference. First operand 105 states and 119 transitions. Second operand has 8 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 8 states have internal predecessors, (16), 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-18 21:25:10,197 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-18 21:25:10,197 INFO L93 Difference]: Finished difference Result 107 states and 119 transitions. [2021-12-18 21:25:10,197 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-12-18 21:25:10,198 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 8 states have internal predecessors, (16), 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-18 21:25:10,198 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-18 21:25:10,198 INFO L225 Difference]: With dead ends: 107 [2021-12-18 21:25:10,198 INFO L226 Difference]: Without dead ends: 107 [2021-12-18 21:25:10,198 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2021-12-18 21:25:10,199 INFO L933 BasicCegarLoop]: 59 mSDtfsCounter, 47 mSDsluCounter, 161 mSDsCounter, 0 mSdLazyCounter, 83 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 47 SdHoareTripleChecker+Valid, 220 SdHoareTripleChecker+Invalid, 181 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 83 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 88 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-18 21:25:10,199 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [47 Valid, 220 Invalid, 181 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 83 Invalid, 0 Unknown, 88 Unchecked, 0.1s Time] [2021-12-18 21:25:10,199 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2021-12-18 21:25:10,200 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 105. [2021-12-18 21:25:10,200 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 105 states, 83 states have (on average 1.4216867469879517) internal successors, (118), 104 states have internal predecessors, (118), 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-18 21:25:10,201 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 118 transitions. [2021-12-18 21:25:10,201 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 118 transitions. Word has length 16 [2021-12-18 21:25:10,201 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-18 21:25:10,201 INFO L470 AbstractCegarLoop]: Abstraction has 105 states and 118 transitions. [2021-12-18 21:25:10,201 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 8 states have internal predecessors, (16), 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-18 21:25:10,201 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 118 transitions. [2021-12-18 21:25:10,201 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2021-12-18 21:25:10,201 INFO L506 BasicCegarLoop]: Found error trace [2021-12-18 21:25:10,201 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-18 21:25:10,210 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (13)] Forceful destruction successful, exit code 0 [2021-12-18 21:25:10,402 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-12-18 21:25:10,402 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr29REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 48 more)] === [2021-12-18 21:25:10,402 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-18 21:25:10,402 INFO L85 PathProgramCache]: Analyzing trace with hash 1200058810, now seen corresponding path program 1 times [2021-12-18 21:25:10,402 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-18 21:25:10,402 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [34765963] [2021-12-18 21:25:10,403 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-18 21:25:10,403 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-18 21:25:10,403 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-18 21:25:10,404 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-12-18 21:25:10,405 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (14)] Waiting until timeout for monitored process [2021-12-18 21:25:10,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 21:25:10,481 INFO L263 TraceCheckSpWp]: Trace formula consists of 101 conjuncts, 30 conjunts are in the unsatisfiable core [2021-12-18 21:25:10,482 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-18 21:25:10,490 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-18 21:25:10,506 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2021-12-18 21:25:10,512 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2021-12-18 21:25:10,530 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-18 21:25:10,530 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 21 treesize of output 20 [2021-12-18 21:25:10,536 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-18 21:25:10,536 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 21 treesize of output 20 [2021-12-18 21:25:10,553 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-18 21:25:10,554 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 21 treesize of output 20 [2021-12-18 21:25:10,558 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-18 21:25:10,559 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 21 treesize of output 20 [2021-12-18 21:25:10,612 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-18 21:25:10,612 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 21 treesize of output 20 [2021-12-18 21:25:10,617 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-18 21:25:10,618 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 21 treesize of output 20 [2021-12-18 21:25:10,732 INFO L354 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2021-12-18 21:25:10,733 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 3 new quantified variables, introduced 1 case distinctions, treesize of input 38 treesize of output 24 [2021-12-18 21:25:10,738 INFO L354 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2021-12-18 21:25:10,738 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 3 new quantified variables, introduced 1 case distinctions, treesize of input 19 treesize of output 13 [2021-12-18 21:25:10,750 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-18 21:25:10,750 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-18 21:25:10,751 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-18 21:25:10,751 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [34765963] [2021-12-18 21:25:10,751 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [34765963] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-18 21:25:10,751 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-18 21:25:10,751 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-12-18 21:25:10,751 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1705149692] [2021-12-18 21:25:10,751 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-18 21:25:10,751 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2021-12-18 21:25:10,751 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-18 21:25:10,751 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-12-18 21:25:10,752 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2021-12-18 21:25:10,752 INFO L87 Difference]: Start difference. First operand 105 states and 118 transitions. Second operand has 8 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 8 states have internal predecessors, (16), 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-18 21:25:10,967 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-18 21:25:10,967 INFO L93 Difference]: Finished difference Result 108 states and 118 transitions. [2021-12-18 21:25:10,968 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-12-18 21:25:10,968 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 8 states have internal predecessors, (16), 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-18 21:25:10,968 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-18 21:25:10,968 INFO L225 Difference]: With dead ends: 108 [2021-12-18 21:25:10,968 INFO L226 Difference]: Without dead ends: 108 [2021-12-18 21:25:10,969 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2021-12-18 21:25:10,969 INFO L933 BasicCegarLoop]: 61 mSDtfsCounter, 41 mSDsluCounter, 194 mSDsCounter, 0 mSdLazyCounter, 111 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 41 SdHoareTripleChecker+Valid, 255 SdHoareTripleChecker+Invalid, 202 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 111 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 83 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-12-18 21:25:10,969 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [41 Valid, 255 Invalid, 202 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 111 Invalid, 0 Unknown, 83 Unchecked, 0.2s Time] [2021-12-18 21:25:10,970 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 108 states. [2021-12-18 21:25:10,970 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 108 to 105. [2021-12-18 21:25:10,971 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 105 states, 83 states have (on average 1.4096385542168675) internal successors, (117), 104 states have internal predecessors, (117), 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-18 21:25:10,971 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 117 transitions. [2021-12-18 21:25:10,971 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 117 transitions. Word has length 16 [2021-12-18 21:25:10,971 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-18 21:25:10,971 INFO L470 AbstractCegarLoop]: Abstraction has 105 states and 117 transitions. [2021-12-18 21:25:10,971 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 8 states have internal predecessors, (16), 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-18 21:25:10,971 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 117 transitions. [2021-12-18 21:25:10,972 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2021-12-18 21:25:10,972 INFO L506 BasicCegarLoop]: Found error trace [2021-12-18 21:25:10,972 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-18 21:25:10,981 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (14)] Forceful destruction successful, exit code 0 [2021-12-18 21:25:11,179 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-12-18 21:25:11,179 INFO L402 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr41REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 48 more)] === [2021-12-18 21:25:11,179 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-18 21:25:11,179 INFO L85 PathProgramCache]: Analyzing trace with hash -1452897384, now seen corresponding path program 1 times [2021-12-18 21:25:11,179 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-18 21:25:11,180 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [709530916] [2021-12-18 21:25:11,180 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-18 21:25:11,180 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-18 21:25:11,180 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-18 21:25:11,181 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-12-18 21:25:11,181 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (15)] Waiting until timeout for monitored process [2021-12-18 21:25:11,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 21:25:11,251 INFO L263 TraceCheckSpWp]: Trace formula consists of 103 conjuncts, 6 conjunts are in the unsatisfiable core [2021-12-18 21:25:11,252 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-18 21:25:11,289 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 19 treesize of output 11 [2021-12-18 21:25:11,304 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-18 21:25:11,304 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-18 21:25:11,305 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-18 21:25:11,305 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [709530916] [2021-12-18 21:25:11,305 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [709530916] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-18 21:25:11,305 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-18 21:25:11,305 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-12-18 21:25:11,305 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1565811242] [2021-12-18 21:25:11,305 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-18 21:25:11,305 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-12-18 21:25:11,305 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-18 21:25:11,306 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-12-18 21:25:11,306 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2021-12-18 21:25:11,306 INFO L87 Difference]: Start difference. First operand 105 states and 117 transitions. Second operand has 7 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 7 states have internal predecessors, (17), 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-18 21:25:11,726 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-18 21:25:11,727 INFO L93 Difference]: Finished difference Result 141 states and 156 transitions. [2021-12-18 21:25:11,727 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-12-18 21:25:11,727 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 7 states have internal predecessors, (17), 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 17 [2021-12-18 21:25:11,727 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-18 21:25:11,728 INFO L225 Difference]: With dead ends: 141 [2021-12-18 21:25:11,728 INFO L226 Difference]: Without dead ends: 141 [2021-12-18 21:25:11,728 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=40, Invalid=92, Unknown=0, NotChecked=0, Total=132 [2021-12-18 21:25:11,729 INFO L933 BasicCegarLoop]: 46 mSDtfsCounter, 165 mSDsluCounter, 131 mSDsCounter, 0 mSdLazyCounter, 279 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 165 SdHoareTripleChecker+Valid, 177 SdHoareTripleChecker+Invalid, 293 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 279 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2021-12-18 21:25:11,730 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [165 Valid, 177 Invalid, 293 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 279 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2021-12-18 21:25:11,731 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 141 states. [2021-12-18 21:25:11,738 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 141 to 106. [2021-12-18 21:25:11,739 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 106 states, 84 states have (on average 1.4166666666666667) internal successors, (119), 105 states have internal predecessors, (119), 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-18 21:25:11,739 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 119 transitions. [2021-12-18 21:25:11,739 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 119 transitions. Word has length 17 [2021-12-18 21:25:11,739 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-18 21:25:11,739 INFO L470 AbstractCegarLoop]: Abstraction has 106 states and 119 transitions. [2021-12-18 21:25:11,739 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 7 states have internal predecessors, (17), 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-18 21:25:11,740 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 119 transitions. [2021-12-18 21:25:11,740 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2021-12-18 21:25:11,740 INFO L506 BasicCegarLoop]: Found error trace [2021-12-18 21:25:11,740 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-18 21:25:11,747 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (15)] Forceful destruction successful, exit code 0 [2021-12-18 21:25:11,940 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-12-18 21:25:11,941 INFO L402 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr42REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 48 more)] === [2021-12-18 21:25:11,941 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-18 21:25:11,941 INFO L85 PathProgramCache]: Analyzing trace with hash -1452897383, now seen corresponding path program 1 times [2021-12-18 21:25:11,941 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-18 21:25:11,941 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [299631957] [2021-12-18 21:25:11,941 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-18 21:25:11,942 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-18 21:25:11,942 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-18 21:25:11,942 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-12-18 21:25:11,944 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (16)] Waiting until timeout for monitored process [2021-12-18 21:25:12,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 21:25:12,022 INFO L263 TraceCheckSpWp]: Trace formula consists of 103 conjuncts, 11 conjunts are in the unsatisfiable core [2021-12-18 21:25:12,023 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-18 21:25:12,100 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 23 treesize of output 15 [2021-12-18 21:25:12,102 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 34 treesize of output 18 [2021-12-18 21:25:12,164 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-18 21:25:12,164 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-18 21:25:12,164 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-18 21:25:12,164 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [299631957] [2021-12-18 21:25:12,165 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [299631957] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-18 21:25:12,165 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-18 21:25:12,165 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-12-18 21:25:12,165 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1615526515] [2021-12-18 21:25:12,165 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-18 21:25:12,166 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-12-18 21:25:12,166 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-18 21:25:12,166 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-12-18 21:25:12,166 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2021-12-18 21:25:12,166 INFO L87 Difference]: Start difference. First operand 106 states and 119 transitions. Second operand has 7 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 7 states have internal predecessors, (17), 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-18 21:25:13,086 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-18 21:25:13,086 INFO L93 Difference]: Finished difference Result 141 states and 155 transitions. [2021-12-18 21:25:13,087 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-12-18 21:25:13,087 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 7 states have internal predecessors, (17), 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 17 [2021-12-18 21:25:13,087 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-18 21:25:13,088 INFO L225 Difference]: With dead ends: 141 [2021-12-18 21:25:13,088 INFO L226 Difference]: Without dead ends: 141 [2021-12-18 21:25:13,088 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=40, Invalid=92, Unknown=0, NotChecked=0, Total=132 [2021-12-18 21:25:13,088 INFO L933 BasicCegarLoop]: 55 mSDtfsCounter, 150 mSDsluCounter, 143 mSDsCounter, 0 mSdLazyCounter, 264 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 150 SdHoareTripleChecker+Valid, 198 SdHoareTripleChecker+Invalid, 273 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 264 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2021-12-18 21:25:13,088 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [150 Valid, 198 Invalid, 273 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 264 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2021-12-18 21:25:13,089 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 141 states. [2021-12-18 21:25:13,090 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 141 to 105. [2021-12-18 21:25:13,090 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 105 states, 84 states have (on average 1.3928571428571428) internal successors, (117), 104 states have internal predecessors, (117), 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-18 21:25:13,090 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 117 transitions. [2021-12-18 21:25:13,090 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 117 transitions. Word has length 17 [2021-12-18 21:25:13,090 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-18 21:25:13,090 INFO L470 AbstractCegarLoop]: Abstraction has 105 states and 117 transitions. [2021-12-18 21:25:13,091 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 7 states have internal predecessors, (17), 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-18 21:25:13,091 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 117 transitions. [2021-12-18 21:25:13,091 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2021-12-18 21:25:13,091 INFO L506 BasicCegarLoop]: Found error trace [2021-12-18 21:25:13,091 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-18 21:25:13,098 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (16)] Ended with exit code 0 [2021-12-18 21:25:13,295 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-12-18 21:25:13,295 INFO L402 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr48ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 48 more)] === [2021-12-18 21:25:13,296 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-18 21:25:13,296 INFO L85 PathProgramCache]: Analyzing trace with hash -370010073, now seen corresponding path program 1 times [2021-12-18 21:25:13,296 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-18 21:25:13,296 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2026034570] [2021-12-18 21:25:13,296 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-18 21:25:13,296 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-18 21:25:13,296 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-18 21:25:13,297 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-12-18 21:25:13,298 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (17)] Waiting until timeout for monitored process [2021-12-18 21:25:13,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 21:25:13,381 INFO L263 TraceCheckSpWp]: Trace formula consists of 109 conjuncts, 31 conjunts are in the unsatisfiable core [2021-12-18 21:25:13,383 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-18 21:25:13,391 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2021-12-18 21:25:13,394 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2021-12-18 21:25:13,409 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-18 21:25:13,410 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 21 treesize of output 20 [2021-12-18 21:25:13,414 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-18 21:25:13,414 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 21 treesize of output 20 [2021-12-18 21:25:13,424 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-18 21:25:13,425 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 21 treesize of output 20 [2021-12-18 21:25:13,433 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-18 21:25:13,434 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 21 treesize of output 20 [2021-12-18 21:25:13,483 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-18 21:25:13,484 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 21 treesize of output 20 [2021-12-18 21:25:13,488 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-18 21:25:13,489 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 21 treesize of output 20 [2021-12-18 21:25:13,493 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2021-12-18 21:25:13,516 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 15 treesize of output 7 [2021-12-18 21:25:13,518 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 15 treesize of output 7 [2021-12-18 21:25:13,550 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 15 treesize of output 7 [2021-12-18 21:25:13,563 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-18 21:25:13,563 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-18 21:25:13,563 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-18 21:25:13,563 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2026034570] [2021-12-18 21:25:13,563 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2026034570] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-18 21:25:13,563 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-18 21:25:13,563 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2021-12-18 21:25:13,564 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [366588917] [2021-12-18 21:25:13,564 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-18 21:25:13,564 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2021-12-18 21:25:13,564 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-18 21:25:13,564 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-12-18 21:25:13,564 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2021-12-18 21:25:13,564 INFO L87 Difference]: Start difference. First operand 105 states and 117 transitions. Second operand has 9 states, 9 states have (on average 2.111111111111111) internal successors, (19), 9 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-18 21:25:13,985 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-18 21:25:13,986 INFO L93 Difference]: Finished difference Result 146 states and 156 transitions. [2021-12-18 21:25:13,987 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-12-18 21:25:13,987 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 2.111111111111111) internal successors, (19), 9 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 19 [2021-12-18 21:25:13,987 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-18 21:25:13,988 INFO L225 Difference]: With dead ends: 146 [2021-12-18 21:25:13,988 INFO L226 Difference]: Without dead ends: 146 [2021-12-18 21:25:13,988 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=52, Invalid=104, Unknown=0, NotChecked=0, Total=156 [2021-12-18 21:25:13,988 INFO L933 BasicCegarLoop]: 63 mSDtfsCounter, 154 mSDsluCounter, 294 mSDsCounter, 0 mSdLazyCounter, 219 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 154 SdHoareTripleChecker+Valid, 357 SdHoareTripleChecker+Invalid, 228 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 219 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2021-12-18 21:25:13,989 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [154 Valid, 357 Invalid, 228 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 219 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2021-12-18 21:25:13,989 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 146 states. [2021-12-18 21:25:13,990 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 146 to 105. [2021-12-18 21:25:13,990 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 105 states, 84 states have (on average 1.380952380952381) internal successors, (116), 104 states have internal predecessors, (116), 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-18 21:25:13,990 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 116 transitions. [2021-12-18 21:25:13,991 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 116 transitions. Word has length 19 [2021-12-18 21:25:13,991 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-18 21:25:13,991 INFO L470 AbstractCegarLoop]: Abstraction has 105 states and 116 transitions. [2021-12-18 21:25:13,991 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 2.111111111111111) internal successors, (19), 9 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-18 21:25:13,991 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 116 transitions. [2021-12-18 21:25:13,992 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2021-12-18 21:25:13,992 INFO L506 BasicCegarLoop]: Found error trace [2021-12-18 21:25:13,992 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-18 21:25:13,998 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (17)] Forceful destruction successful, exit code 0 [2021-12-18 21:25:14,195 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-12-18 21:25:14,195 INFO L402 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr18ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 48 more)] === [2021-12-18 21:25:14,196 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-18 21:25:14,196 INFO L85 PathProgramCache]: Analyzing trace with hash -666970825, now seen corresponding path program 1 times [2021-12-18 21:25:14,196 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-18 21:25:14,196 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [395510595] [2021-12-18 21:25:14,196 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-18 21:25:14,196 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-18 21:25:14,196 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-18 21:25:14,197 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-12-18 21:25:14,198 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (18)] Waiting until timeout for monitored process [2021-12-18 21:25:14,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 21:25:14,295 INFO L263 TraceCheckSpWp]: Trace formula consists of 145 conjuncts, 7 conjunts are in the unsatisfiable core [2021-12-18 21:25:14,296 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-18 21:25:14,309 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-18 21:25:14,325 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-18 21:25:14,349 INFO L354 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-12-18 21:25:14,349 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 13 treesize of output 13 [2021-12-18 21:25:14,358 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-18 21:25:14,358 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-18 21:25:14,358 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-18 21:25:14,358 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [395510595] [2021-12-18 21:25:14,358 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [395510595] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-18 21:25:14,358 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-18 21:25:14,358 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-12-18 21:25:14,358 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1076550692] [2021-12-18 21:25:14,358 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-18 21:25:14,359 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-12-18 21:25:14,359 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-18 21:25:14,359 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-12-18 21:25:14,359 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-12-18 21:25:14,359 INFO L87 Difference]: Start difference. First operand 105 states and 116 transitions. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 3 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-18 21:25:14,461 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-18 21:25:14,461 INFO L93 Difference]: Finished difference Result 103 states and 114 transitions. [2021-12-18 21:25:14,462 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-12-18 21:25:14,462 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 3 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 19 [2021-12-18 21:25:14,462 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-18 21:25:14,462 INFO L225 Difference]: With dead ends: 103 [2021-12-18 21:25:14,462 INFO L226 Difference]: Without dead ends: 103 [2021-12-18 21:25:14,462 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 14 SyntacticMatches, 2 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-12-18 21:25:14,463 INFO L933 BasicCegarLoop]: 43 mSDtfsCounter, 112 mSDsluCounter, 8 mSDsCounter, 0 mSdLazyCounter, 61 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 112 SdHoareTripleChecker+Valid, 51 SdHoareTripleChecker+Invalid, 69 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 61 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-18 21:25:14,463 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [112 Valid, 51 Invalid, 69 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 61 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-18 21:25:14,464 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2021-12-18 21:25:14,464 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 103. [2021-12-18 21:25:14,465 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 103 states, 83 states have (on average 1.3734939759036144) internal successors, (114), 102 states have internal predecessors, (114), 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-18 21:25:14,465 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 114 transitions. [2021-12-18 21:25:14,465 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 114 transitions. Word has length 19 [2021-12-18 21:25:14,465 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-18 21:25:14,465 INFO L470 AbstractCegarLoop]: Abstraction has 103 states and 114 transitions. [2021-12-18 21:25:14,465 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 3 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-18 21:25:14,465 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 114 transitions. [2021-12-18 21:25:14,467 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2021-12-18 21:25:14,467 INFO L506 BasicCegarLoop]: Found error trace [2021-12-18 21:25:14,467 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-18 21:25:14,477 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (18)] Forceful destruction successful, exit code 0 [2021-12-18 21:25:14,675 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 18 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-12-18 21:25:14,675 INFO L402 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr36ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 48 more)] === [2021-12-18 21:25:14,675 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-18 21:25:14,675 INFO L85 PathProgramCache]: Analyzing trace with hash 1858278108, now seen corresponding path program 1 times [2021-12-18 21:25:14,675 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-18 21:25:14,676 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [140799556] [2021-12-18 21:25:14,676 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-18 21:25:14,676 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-18 21:25:14,676 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-18 21:25:14,677 INFO L229 MonitoredProcess]: Starting monitored process 19 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-12-18 21:25:14,684 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (19)] Waiting until timeout for monitored process [2021-12-18 21:25:14,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 21:25:14,751 INFO L263 TraceCheckSpWp]: Trace formula consists of 109 conjuncts, 2 conjunts are in the unsatisfiable core [2021-12-18 21:25:14,752 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-18 21:25:14,775 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-18 21:25:14,775 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-18 21:25:14,775 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-18 21:25:14,775 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [140799556] [2021-12-18 21:25:14,775 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [140799556] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-18 21:25:14,775 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-18 21:25:14,775 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-12-18 21:25:14,775 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1657854997] [2021-12-18 21:25:14,775 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-18 21:25:14,776 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-12-18 21:25:14,776 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-18 21:25:14,776 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-18 21:25:14,776 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-18 21:25:14,776 INFO L87 Difference]: Start difference. First operand 103 states and 114 transitions. Second operand has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 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-18 21:25:14,783 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-18 21:25:14,783 INFO L93 Difference]: Finished difference Result 105 states and 116 transitions. [2021-12-18 21:25:14,783 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-18 21:25:14,783 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 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 20 [2021-12-18 21:25:14,783 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-18 21:25:14,783 INFO L225 Difference]: With dead ends: 105 [2021-12-18 21:25:14,784 INFO L226 Difference]: Without dead ends: 105 [2021-12-18 21:25:14,784 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 18 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-18 21:25:14,784 INFO L933 BasicCegarLoop]: 80 mSDtfsCounter, 0 mSDsluCounter, 74 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 154 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-18 21:25:14,784 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 154 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-18 21:25:14,785 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states. [2021-12-18 21:25:14,785 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 105. [2021-12-18 21:25:14,786 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 105 states, 85 states have (on average 1.3647058823529412) internal successors, (116), 104 states have internal predecessors, (116), 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-18 21:25:14,786 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 116 transitions. [2021-12-18 21:25:14,786 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 116 transitions. Word has length 20 [2021-12-18 21:25:14,786 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-18 21:25:14,786 INFO L470 AbstractCegarLoop]: Abstraction has 105 states and 116 transitions. [2021-12-18 21:25:14,786 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 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-18 21:25:14,786 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 116 transitions. [2021-12-18 21:25:14,786 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2021-12-18 21:25:14,786 INFO L506 BasicCegarLoop]: Found error trace [2021-12-18 21:25:14,787 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-18 21:25:14,797 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (19)] Forceful destruction successful, exit code 0 [2021-12-18 21:25:14,987 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 19 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-12-18 21:25:14,987 INFO L402 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr34REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 48 more)] === [2021-12-18 21:25:14,987 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-18 21:25:14,987 INFO L85 PathProgramCache]: Analyzing trace with hash 1772093387, now seen corresponding path program 1 times [2021-12-18 21:25:14,988 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-18 21:25:14,988 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [545189559] [2021-12-18 21:25:14,988 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-18 21:25:14,988 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-18 21:25:14,988 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-18 21:25:14,989 INFO L229 MonitoredProcess]: Starting monitored process 20 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-12-18 21:25:14,991 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (20)] Waiting until timeout for monitored process [2021-12-18 21:25:15,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 21:25:15,059 INFO L263 TraceCheckSpWp]: Trace formula consists of 119 conjuncts, 4 conjunts are in the unsatisfiable core [2021-12-18 21:25:15,060 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-18 21:25:15,096 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 19 treesize of output 11 [2021-12-18 21:25:15,103 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-18 21:25:15,103 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-18 21:25:15,103 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-18 21:25:15,103 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [545189559] [2021-12-18 21:25:15,103 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [545189559] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-18 21:25:15,103 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-18 21:25:15,103 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-12-18 21:25:15,103 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [458492193] [2021-12-18 21:25:15,103 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-18 21:25:15,105 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-12-18 21:25:15,105 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-18 21:25:15,105 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-12-18 21:25:15,105 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-12-18 21:25:15,105 INFO L87 Difference]: Start difference. First operand 105 states and 116 transitions. Second operand has 5 states, 4 states have (on average 5.25) internal successors, (21), 5 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-18 21:25:15,294 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-18 21:25:15,294 INFO L93 Difference]: Finished difference Result 104 states and 114 transitions. [2021-12-18 21:25:15,295 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-12-18 21:25:15,295 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 5.25) internal successors, (21), 5 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 21 [2021-12-18 21:25:15,295 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-18 21:25:15,295 INFO L225 Difference]: With dead ends: 104 [2021-12-18 21:25:15,295 INFO L226 Difference]: Without dead ends: 104 [2021-12-18 21:25:15,295 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2021-12-18 21:25:15,296 INFO L933 BasicCegarLoop]: 71 mSDtfsCounter, 27 mSDsluCounter, 86 mSDsCounter, 0 mSdLazyCounter, 133 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 27 SdHoareTripleChecker+Valid, 157 SdHoareTripleChecker+Invalid, 133 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 133 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-12-18 21:25:15,296 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [27 Valid, 157 Invalid, 133 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 133 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2021-12-18 21:25:15,296 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2021-12-18 21:25:15,297 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 104. [2021-12-18 21:25:15,297 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 104 states, 85 states have (on average 1.3411764705882352) internal successors, (114), 103 states have internal predecessors, (114), 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-18 21:25:15,298 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 114 transitions. [2021-12-18 21:25:15,298 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 114 transitions. Word has length 21 [2021-12-18 21:25:15,298 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-18 21:25:15,298 INFO L470 AbstractCegarLoop]: Abstraction has 104 states and 114 transitions. [2021-12-18 21:25:15,298 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 5.25) internal successors, (21), 5 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-18 21:25:15,298 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 114 transitions. [2021-12-18 21:25:15,298 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2021-12-18 21:25:15,298 INFO L506 BasicCegarLoop]: Found error trace [2021-12-18 21:25:15,298 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-18 21:25:15,309 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (20)] Ended with exit code 0 [2021-12-18 21:25:15,499 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 20 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-12-18 21:25:15,499 INFO L402 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr35REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 48 more)] === [2021-12-18 21:25:15,499 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-18 21:25:15,499 INFO L85 PathProgramCache]: Analyzing trace with hash 1772093388, now seen corresponding path program 1 times [2021-12-18 21:25:15,499 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-18 21:25:15,500 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1658211308] [2021-12-18 21:25:15,500 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-18 21:25:15,500 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-18 21:25:15,500 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-18 21:25:15,501 INFO L229 MonitoredProcess]: Starting monitored process 21 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-12-18 21:25:15,512 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (21)] Waiting until timeout for monitored process [2021-12-18 21:25:15,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 21:25:15,589 INFO L263 TraceCheckSpWp]: Trace formula consists of 119 conjuncts, 7 conjunts are in the unsatisfiable core [2021-12-18 21:25:15,590 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-18 21:25:15,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 23 treesize of output 15 [2021-12-18 21:25:15,662 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 34 treesize of output 18 [2021-12-18 21:25:15,690 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-18 21:25:15,690 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-18 21:25:15,690 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-18 21:25:15,690 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1658211308] [2021-12-18 21:25:15,690 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1658211308] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-18 21:25:15,690 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-18 21:25:15,690 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-12-18 21:25:15,690 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [731797598] [2021-12-18 21:25:15,690 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-18 21:25:15,691 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-12-18 21:25:15,691 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-18 21:25:15,691 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-12-18 21:25:15,691 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-12-18 21:25:15,691 INFO L87 Difference]: Start difference. First operand 104 states and 114 transitions. Second operand has 5 states, 4 states have (on average 5.25) internal successors, (21), 5 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-18 21:25:16,053 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-18 21:25:16,054 INFO L93 Difference]: Finished difference Result 103 states and 112 transitions. [2021-12-18 21:25:16,054 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-12-18 21:25:16,054 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 5.25) internal successors, (21), 5 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 21 [2021-12-18 21:25:16,054 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-18 21:25:16,055 INFO L225 Difference]: With dead ends: 103 [2021-12-18 21:25:16,055 INFO L226 Difference]: Without dead ends: 103 [2021-12-18 21:25:16,055 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2021-12-18 21:25:16,055 INFO L933 BasicCegarLoop]: 71 mSDtfsCounter, 24 mSDsluCounter, 90 mSDsCounter, 0 mSdLazyCounter, 128 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 24 SdHoareTripleChecker+Valid, 161 SdHoareTripleChecker+Invalid, 128 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 128 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2021-12-18 21:25:16,055 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [24 Valid, 161 Invalid, 128 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 128 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2021-12-18 21:25:16,056 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2021-12-18 21:25:16,057 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 103. [2021-12-18 21:25:16,057 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 103 states, 85 states have (on average 1.3176470588235294) internal successors, (112), 102 states have internal predecessors, (112), 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-18 21:25:16,057 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 112 transitions. [2021-12-18 21:25:16,057 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 112 transitions. Word has length 21 [2021-12-18 21:25:16,057 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-18 21:25:16,057 INFO L470 AbstractCegarLoop]: Abstraction has 103 states and 112 transitions. [2021-12-18 21:25:16,057 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 5.25) internal successors, (21), 5 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-18 21:25:16,057 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 112 transitions. [2021-12-18 21:25:16,058 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2021-12-18 21:25:16,058 INFO L506 BasicCegarLoop]: Found error trace [2021-12-18 21:25:16,058 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-18 21:25:16,066 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (21)] Forceful destruction successful, exit code 0 [2021-12-18 21:25:16,264 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 21 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-12-18 21:25:16,265 INFO L402 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr24REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 48 more)] === [2021-12-18 21:25:16,265 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-18 21:25:16,265 INFO L85 PathProgramCache]: Analyzing trace with hash 2133696844, now seen corresponding path program 1 times [2021-12-18 21:25:16,265 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-18 21:25:16,265 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1073801575] [2021-12-18 21:25:16,265 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-18 21:25:16,265 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-18 21:25:16,266 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-18 21:25:16,267 INFO L229 MonitoredProcess]: Starting monitored process 22 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-12-18 21:25:16,267 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (22)] Waiting until timeout for monitored process [2021-12-18 21:25:16,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 21:25:16,345 INFO L263 TraceCheckSpWp]: Trace formula consists of 118 conjuncts, 5 conjunts are in the unsatisfiable core [2021-12-18 21:25:16,346 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-18 21:25:16,379 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 19 treesize of output 11 [2021-12-18 21:25:16,391 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-18 21:25:16,391 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-18 21:25:16,391 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-18 21:25:16,392 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1073801575] [2021-12-18 21:25:16,392 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1073801575] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-18 21:25:16,392 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-18 21:25:16,392 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-12-18 21:25:16,392 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [322500795] [2021-12-18 21:25:16,392 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-18 21:25:16,393 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-12-18 21:25:16,393 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-18 21:25:16,393 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-12-18 21:25:16,393 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-12-18 21:25:16,393 INFO L87 Difference]: Start difference. First operand 103 states and 112 transitions. Second operand has 6 states, 5 states have (on average 4.6) internal successors, (23), 6 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-18 21:25:16,652 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-18 21:25:16,652 INFO L93 Difference]: Finished difference Result 105 states and 114 transitions. [2021-12-18 21:25:16,652 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-12-18 21:25:16,652 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 4.6) internal successors, (23), 6 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-18 21:25:16,652 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-18 21:25:16,653 INFO L225 Difference]: With dead ends: 105 [2021-12-18 21:25:16,653 INFO L226 Difference]: Without dead ends: 105 [2021-12-18 21:25:16,653 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2021-12-18 21:25:16,654 INFO L933 BasicCegarLoop]: 54 mSDtfsCounter, 68 mSDsluCounter, 91 mSDsCounter, 0 mSdLazyCounter, 191 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 68 SdHoareTripleChecker+Valid, 145 SdHoareTripleChecker+Invalid, 197 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 191 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-12-18 21:25:16,654 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [68 Valid, 145 Invalid, 197 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 191 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2021-12-18 21:25:16,656 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states. [2021-12-18 21:25:16,657 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 104. [2021-12-18 21:25:16,657 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 104 states, 86 states have (on average 1.3255813953488371) internal successors, (114), 103 states have internal predecessors, (114), 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-18 21:25:16,658 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 114 transitions. [2021-12-18 21:25:16,658 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 114 transitions. Word has length 23 [2021-12-18 21:25:16,658 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-18 21:25:16,658 INFO L470 AbstractCegarLoop]: Abstraction has 104 states and 114 transitions. [2021-12-18 21:25:16,658 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 4.6) internal successors, (23), 6 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-18 21:25:16,658 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 114 transitions. [2021-12-18 21:25:16,658 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2021-12-18 21:25:16,659 INFO L506 BasicCegarLoop]: Found error trace [2021-12-18 21:25:16,659 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-18 21:25:16,665 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (22)] Ended with exit code 0 [2021-12-18 21:25:16,864 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 22 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-12-18 21:25:16,864 INFO L402 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr25REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 48 more)] === [2021-12-18 21:25:16,865 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-18 21:25:16,865 INFO L85 PathProgramCache]: Analyzing trace with hash 2133696845, now seen corresponding path program 1 times [2021-12-18 21:25:16,865 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-18 21:25:16,865 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1202995306] [2021-12-18 21:25:16,865 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-18 21:25:16,865 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-18 21:25:16,865 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-18 21:25:16,866 INFO L229 MonitoredProcess]: Starting monitored process 23 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-12-18 21:25:16,868 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (23)] Waiting until timeout for monitored process [2021-12-18 21:25:16,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 21:25:16,951 INFO L263 TraceCheckSpWp]: Trace formula consists of 118 conjuncts, 9 conjunts are in the unsatisfiable core [2021-12-18 21:25:16,951 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-18 21:25:17,047 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 23 treesize of output 15 [2021-12-18 21:25:17,048 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 34 treesize of output 18 [2021-12-18 21:25:17,106 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-18 21:25:17,106 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-18 21:25:17,106 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-18 21:25:17,106 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1202995306] [2021-12-18 21:25:17,106 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1202995306] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-18 21:25:17,106 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-18 21:25:17,106 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-12-18 21:25:17,106 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [881888642] [2021-12-18 21:25:17,106 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-18 21:25:17,107 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-12-18 21:25:17,107 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-18 21:25:17,107 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-12-18 21:25:17,107 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-12-18 21:25:17,107 INFO L87 Difference]: Start difference. First operand 104 states and 114 transitions. Second operand has 6 states, 5 states have (on average 4.6) internal successors, (23), 6 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-18 21:25:17,695 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-18 21:25:17,696 INFO L93 Difference]: Finished difference Result 105 states and 114 transitions. [2021-12-18 21:25:17,697 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-12-18 21:25:17,697 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 4.6) internal successors, (23), 6 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-18 21:25:17,697 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-18 21:25:17,697 INFO L225 Difference]: With dead ends: 105 [2021-12-18 21:25:17,697 INFO L226 Difference]: Without dead ends: 105 [2021-12-18 21:25:17,698 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2021-12-18 21:25:17,698 INFO L933 BasicCegarLoop]: 57 mSDtfsCounter, 57 mSDsluCounter, 104 mSDsCounter, 0 mSdLazyCounter, 183 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 57 SdHoareTripleChecker+Valid, 161 SdHoareTripleChecker+Invalid, 187 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 183 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2021-12-18 21:25:17,698 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [57 Valid, 161 Invalid, 187 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 183 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2021-12-18 21:25:17,698 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states. [2021-12-18 21:25:17,699 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 104. [2021-12-18 21:25:17,699 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 104 states, 86 states have (on average 1.313953488372093) internal successors, (113), 103 states have internal predecessors, (113), 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-18 21:25:17,700 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 113 transitions. [2021-12-18 21:25:17,700 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 113 transitions. Word has length 23 [2021-12-18 21:25:17,700 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-18 21:25:17,700 INFO L470 AbstractCegarLoop]: Abstraction has 104 states and 113 transitions. [2021-12-18 21:25:17,700 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 4.6) internal successors, (23), 6 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-18 21:25:17,700 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 113 transitions. [2021-12-18 21:25:17,701 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2021-12-18 21:25:17,701 INFO L506 BasicCegarLoop]: Found error trace [2021-12-18 21:25:17,701 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-18 21:25:17,715 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (23)] Forceful destruction successful, exit code 0 [2021-12-18 21:25:17,907 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 23 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-12-18 21:25:17,908 INFO L402 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr23ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 48 more)] === [2021-12-18 21:25:17,908 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-18 21:25:17,908 INFO L85 PathProgramCache]: Analyzing trace with hash -651056198, now seen corresponding path program 1 times [2021-12-18 21:25:17,908 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-18 21:25:17,909 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [193187540] [2021-12-18 21:25:17,909 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-18 21:25:17,909 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-18 21:25:17,909 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-18 21:25:17,910 INFO L229 MonitoredProcess]: Starting monitored process 24 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-12-18 21:25:17,911 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (24)] Waiting until timeout for monitored process [2021-12-18 21:25:17,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 21:25:17,995 INFO L263 TraceCheckSpWp]: Trace formula consists of 155 conjuncts, 2 conjunts are in the unsatisfiable core [2021-12-18 21:25:17,996 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-18 21:25:18,024 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-18 21:25:18,024 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-18 21:25:18,025 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-18 21:25:18,025 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [193187540] [2021-12-18 21:25:18,025 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [193187540] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-18 21:25:18,025 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-18 21:25:18,025 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-12-18 21:25:18,025 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [555346378] [2021-12-18 21:25:18,025 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-18 21:25:18,025 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-12-18 21:25:18,025 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-18 21:25:18,026 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-18 21:25:18,026 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-18 21:25:18,026 INFO L87 Difference]: Start difference. First operand 104 states and 113 transitions. Second operand has 3 states, 3 states have (on average 7.666666666666667) internal successors, (23), 3 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-18 21:25:18,055 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-18 21:25:18,055 INFO L93 Difference]: Finished difference Result 173 states and 186 transitions. [2021-12-18 21:25:18,056 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-18 21:25:18,056 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 7.666666666666667) internal successors, (23), 3 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-18 21:25:18,056 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-18 21:25:18,059 INFO L225 Difference]: With dead ends: 173 [2021-12-18 21:25:18,059 INFO L226 Difference]: Without dead ends: 173 [2021-12-18 21:25:18,059 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 21 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-18 21:25:18,062 INFO L933 BasicCegarLoop]: 76 mSDtfsCounter, 59 mSDsluCounter, 71 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 59 SdHoareTripleChecker+Valid, 147 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-18 21:25:18,062 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [59 Valid, 147 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-18 21:25:18,063 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 173 states. [2021-12-18 21:25:18,066 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 173 to 118. [2021-12-18 21:25:18,066 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 118 states, 100 states have (on average 1.3) internal successors, (130), 117 states have internal predecessors, (130), 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-18 21:25:18,066 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 118 states to 118 states and 130 transitions. [2021-12-18 21:25:18,066 INFO L78 Accepts]: Start accepts. Automaton has 118 states and 130 transitions. Word has length 23 [2021-12-18 21:25:18,066 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-18 21:25:18,067 INFO L470 AbstractCegarLoop]: Abstraction has 118 states and 130 transitions. [2021-12-18 21:25:18,067 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 7.666666666666667) internal successors, (23), 3 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-18 21:25:18,067 INFO L276 IsEmpty]: Start isEmpty. Operand 118 states and 130 transitions. [2021-12-18 21:25:18,068 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2021-12-18 21:25:18,068 INFO L506 BasicCegarLoop]: Found error trace [2021-12-18 21:25:18,068 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-18 21:25:18,077 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (24)] Forceful destruction successful, exit code 0 [2021-12-18 21:25:18,274 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 24 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-12-18 21:25:18,275 INFO L402 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr36ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 48 more)] === [2021-12-18 21:25:18,275 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-18 21:25:18,275 INFO L85 PathProgramCache]: Analyzing trace with hash -1303799964, now seen corresponding path program 1 times [2021-12-18 21:25:18,275 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-18 21:25:18,275 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1871661896] [2021-12-18 21:25:18,275 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-18 21:25:18,276 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-18 21:25:18,276 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-18 21:25:18,276 INFO L229 MonitoredProcess]: Starting monitored process 25 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-12-18 21:25:18,277 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (25)] Waiting until timeout for monitored process [2021-12-18 21:25:18,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 21:25:18,367 INFO L263 TraceCheckSpWp]: Trace formula consists of 126 conjuncts, 35 conjunts are in the unsatisfiable core [2021-12-18 21:25:18,370 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-18 21:25:18,387 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2021-12-18 21:25:18,390 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2021-12-18 21:25:18,410 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-18 21:25:18,411 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 21 treesize of output 20 [2021-12-18 21:25:18,415 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-18 21:25:18,415 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 21 treesize of output 20 [2021-12-18 21:25:18,426 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-18 21:25:18,427 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 21 treesize of output 20 [2021-12-18 21:25:18,430 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-18 21:25:18,431 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 21 treesize of output 20 [2021-12-18 21:25:18,483 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-18 21:25:18,484 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 21 treesize of output 20 [2021-12-18 21:25:18,488 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2021-12-18 21:25:18,493 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-18 21:25:18,493 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 21 treesize of output 20 [2021-12-18 21:25:20,830 INFO L354 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2021-12-18 21:25:20,831 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 3 new quantified variables, introduced 1 case distinctions, treesize of input 55 treesize of output 37 [2021-12-18 21:25:20,847 INFO L354 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2021-12-18 21:25:20,847 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 3 new quantified variables, introduced 1 case distinctions, treesize of input 32 treesize of output 22 [2021-12-18 21:25:20,871 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 22 treesize of output 10 [2021-12-18 21:25:20,900 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-18 21:25:20,900 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-18 21:25:20,900 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-18 21:25:20,900 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1871661896] [2021-12-18 21:25:20,900 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1871661896] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-18 21:25:20,900 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-18 21:25:20,900 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2021-12-18 21:25:20,900 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1609345309] [2021-12-18 21:25:20,900 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-18 21:25:20,901 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2021-12-18 21:25:20,901 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-18 21:25:20,901 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-12-18 21:25:20,901 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2021-12-18 21:25:20,901 INFO L87 Difference]: Start difference. First operand 118 states and 130 transitions. Second operand has 12 states, 12 states have (on average 2.0) internal successors, (24), 12 states have internal predecessors, (24), 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-18 21:25:25,306 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-18 21:25:25,306 INFO L93 Difference]: Finished difference Result 128 states and 139 transitions. [2021-12-18 21:25:25,307 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-12-18 21:25:25,307 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 2.0) internal successors, (24), 12 states have internal predecessors, (24), 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 24 [2021-12-18 21:25:25,307 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-18 21:25:25,307 INFO L225 Difference]: With dead ends: 128 [2021-12-18 21:25:25,307 INFO L226 Difference]: Without dead ends: 128 [2021-12-18 21:25:25,308 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 6.4s TimeCoverageRelationStatistics Valid=53, Invalid=186, Unknown=1, NotChecked=0, Total=240 [2021-12-18 21:25:25,308 INFO L933 BasicCegarLoop]: 70 mSDtfsCounter, 52 mSDsluCounter, 383 mSDsCounter, 0 mSdLazyCounter, 124 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 52 SdHoareTripleChecker+Valid, 453 SdHoareTripleChecker+Invalid, 210 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 124 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 80 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-12-18 21:25:25,308 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [52 Valid, 453 Invalid, 210 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 124 Invalid, 0 Unknown, 80 Unchecked, 0.2s Time] [2021-12-18 21:25:25,309 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 128 states. [2021-12-18 21:25:25,310 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 128 to 117. [2021-12-18 21:25:25,310 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 117 states, 99 states have (on average 1.292929292929293) internal successors, (128), 116 states have internal predecessors, (128), 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-18 21:25:25,310 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117 states to 117 states and 128 transitions. [2021-12-18 21:25:25,310 INFO L78 Accepts]: Start accepts. Automaton has 117 states and 128 transitions. Word has length 24 [2021-12-18 21:25:25,310 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-18 21:25:25,311 INFO L470 AbstractCegarLoop]: Abstraction has 117 states and 128 transitions. [2021-12-18 21:25:25,311 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 2.0) internal successors, (24), 12 states have internal predecessors, (24), 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-18 21:25:25,311 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 128 transitions. [2021-12-18 21:25:25,311 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2021-12-18 21:25:25,311 INFO L506 BasicCegarLoop]: Found error trace [2021-12-18 21:25:25,311 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-18 21:25:25,321 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (25)] Forceful destruction successful, exit code 0 [2021-12-18 21:25:25,515 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 25 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-12-18 21:25:25,515 INFO L402 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr27REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 48 more)] === [2021-12-18 21:25:25,516 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-18 21:25:25,516 INFO L85 PathProgramCache]: Analyzing trace with hash 1783269649, now seen corresponding path program 1 times [2021-12-18 21:25:25,516 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-18 21:25:25,516 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2126119858] [2021-12-18 21:25:25,516 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-18 21:25:25,516 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-18 21:25:25,516 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-18 21:25:25,517 INFO L229 MonitoredProcess]: Starting monitored process 26 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-12-18 21:25:25,518 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (26)] Waiting until timeout for monitored process [2021-12-18 21:25:25,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 21:25:25,593 INFO L263 TraceCheckSpWp]: Trace formula consists of 124 conjuncts, 11 conjunts are in the unsatisfiable core [2021-12-18 21:25:25,594 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-18 21:25:25,674 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 25 treesize of output 17 [2021-12-18 21:25:25,676 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 21 treesize of output 13 [2021-12-18 21:25:25,724 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 19 treesize of output 7 [2021-12-18 21:25:25,736 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-18 21:25:25,737 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-18 21:25:25,737 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-18 21:25:25,737 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2126119858] [2021-12-18 21:25:25,737 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2126119858] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-18 21:25:25,737 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-18 21:25:25,737 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2021-12-18 21:25:25,737 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [663836466] [2021-12-18 21:25:25,737 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-18 21:25:25,737 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2021-12-18 21:25:25,737 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-18 21:25:25,738 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-12-18 21:25:25,738 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2021-12-18 21:25:25,738 INFO L87 Difference]: Start difference. First operand 117 states and 128 transitions. Second operand has 9 states, 9 states have (on average 2.7777777777777777) internal successors, (25), 9 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-18 21:25:26,207 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-18 21:25:26,208 INFO L93 Difference]: Finished difference Result 128 states and 139 transitions. [2021-12-18 21:25:26,208 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-12-18 21:25:26,208 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 2.7777777777777777) internal successors, (25), 9 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 25 [2021-12-18 21:25:26,208 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-18 21:25:26,209 INFO L225 Difference]: With dead ends: 128 [2021-12-18 21:25:26,209 INFO L226 Difference]: Without dead ends: 128 [2021-12-18 21:25:26,209 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=41, Invalid=141, Unknown=0, NotChecked=0, Total=182 [2021-12-18 21:25:26,209 INFO L933 BasicCegarLoop]: 64 mSDtfsCounter, 29 mSDsluCounter, 237 mSDsCounter, 0 mSdLazyCounter, 308 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 29 SdHoareTripleChecker+Valid, 301 SdHoareTripleChecker+Invalid, 309 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 308 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2021-12-18 21:25:26,210 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [29 Valid, 301 Invalid, 309 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 308 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2021-12-18 21:25:26,210 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 128 states. [2021-12-18 21:25:26,211 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 128 to 125. [2021-12-18 21:25:26,211 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 125 states, 107 states have (on average 1.280373831775701) internal successors, (137), 124 states have internal predecessors, (137), 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-18 21:25:26,212 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 125 states to 125 states and 137 transitions. [2021-12-18 21:25:26,212 INFO L78 Accepts]: Start accepts. Automaton has 125 states and 137 transitions. Word has length 25 [2021-12-18 21:25:26,212 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-18 21:25:26,212 INFO L470 AbstractCegarLoop]: Abstraction has 125 states and 137 transitions. [2021-12-18 21:25:26,212 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 2.7777777777777777) internal successors, (25), 9 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-18 21:25:26,212 INFO L276 IsEmpty]: Start isEmpty. Operand 125 states and 137 transitions. [2021-12-18 21:25:26,212 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2021-12-18 21:25:26,213 INFO L506 BasicCegarLoop]: Found error trace [2021-12-18 21:25:26,213 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-18 21:25:26,223 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (26)] Ended with exit code 0 [2021-12-18 21:25:26,419 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 26 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-12-18 21:25:26,420 INFO L402 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr23ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 48 more)] === [2021-12-18 21:25:26,420 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-18 21:25:26,420 INFO L85 PathProgramCache]: Analyzing trace with hash 1432037180, now seen corresponding path program 1 times [2021-12-18 21:25:26,421 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-18 21:25:26,421 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [294136609] [2021-12-18 21:25:26,421 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-18 21:25:26,421 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-18 21:25:26,422 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-18 21:25:26,422 INFO L229 MonitoredProcess]: Starting monitored process 27 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-12-18 21:25:26,424 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (27)] Waiting until timeout for monitored process [2021-12-18 21:25:26,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 21:25:26,561 INFO L263 TraceCheckSpWp]: Trace formula consists of 169 conjuncts, 19 conjunts are in the unsatisfiable core [2021-12-18 21:25:26,563 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-18 21:25:26,568 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-18 21:25:26,607 INFO L354 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-12-18 21:25:26,608 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 14 treesize of output 14 [2021-12-18 21:25:26,630 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 11 treesize of output 7 [2021-12-18 21:25:26,700 INFO L354 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-12-18 21:25:26,700 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 27 treesize of output 28 [2021-12-18 21:25:26,763 INFO L354 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-12-18 21:25:26,763 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 30 treesize of output 28 [2021-12-18 21:25:26,794 INFO L354 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-12-18 21:25:26,794 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 30 treesize of output 28 [2021-12-18 21:25:26,831 INFO L354 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-12-18 21:25:26,831 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 27 treesize of output 28 [2021-12-18 21:25:26,852 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 24 treesize of output 12 [2021-12-18 21:25:26,875 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-18 21:25:26,876 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-18 21:25:26,899 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_840 (Array (_ BitVec 32) (_ BitVec 32)))) (not (= (_ bv0 32) (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_840) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|)))) is different from false [2021-12-18 21:25:26,925 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_840 (Array (_ BitVec 32) (_ BitVec 32)))) (not (= (_ bv0 32) (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem5#1.base| v_ArrVal_840) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|)))) is different from false [2021-12-18 21:25:26,931 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_840 (Array (_ BitVec 32) (_ BitVec 32)))) (not (= (_ bv0 32) (select (select (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|) v_ArrVal_840) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|)))) is different from false [2021-12-18 21:25:26,942 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_840 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_837 (Array (_ BitVec 32) (_ BitVec 32)))) (not (= (_ bv0 32) (select (select (let ((.cse0 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem4#1.base| v_ArrVal_837))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|) v_ArrVal_840)) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|)))) is different from false [2021-12-18 21:25:26,950 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_840 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_837 (Array (_ BitVec 32) (_ BitVec 32)))) (not (= (_ bv0 32) (select (select (let ((.cse0 (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|) v_ArrVal_837))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|) v_ArrVal_840)) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|)))) is different from false [2021-12-18 21:25:26,961 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-18 21:25:26,962 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 1 case distinctions, treesize of input 37 treesize of output 30 [2021-12-18 21:25:26,973 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-18 21:25:26,973 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 245 treesize of output 220 [2021-12-18 21:25:26,985 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-18 21:25:26,985 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 204 treesize of output 197 [2021-12-18 21:25:26,990 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 188 treesize of output 180 [2021-12-18 21:25:27,205 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 1 not checked. [2021-12-18 21:25:27,205 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-18 21:25:27,205 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [294136609] [2021-12-18 21:25:27,205 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [294136609] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-18 21:25:27,205 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2021-12-18 21:25:27,205 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 13] total 20 [2021-12-18 21:25:27,205 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [92003450] [2021-12-18 21:25:27,205 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2021-12-18 21:25:27,206 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2021-12-18 21:25:27,206 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-18 21:25:27,206 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2021-12-18 21:25:27,206 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=172, Unknown=5, NotChecked=150, Total=380 [2021-12-18 21:25:27,206 INFO L87 Difference]: Start difference. First operand 125 states and 137 transitions. Second operand has 20 states, 20 states have (on average 2.3) internal successors, (46), 20 states have internal predecessors, (46), 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-18 21:25:28,106 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-18 21:25:28,106 INFO L93 Difference]: Finished difference Result 230 states and 253 transitions. [2021-12-18 21:25:28,106 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2021-12-18 21:25:28,106 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 20 states have (on average 2.3) internal successors, (46), 20 states have internal predecessors, (46), 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-18 21:25:28,107 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-18 21:25:28,107 INFO L225 Difference]: With dead ends: 230 [2021-12-18 21:25:28,107 INFO L226 Difference]: Without dead ends: 230 [2021-12-18 21:25:28,108 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 29 SyntacticMatches, 5 SemanticMatches, 26 ConstructedPredicates, 5 IntricatePredicates, 0 DeprecatedPredicates, 94 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=132, Invalid=389, Unknown=5, NotChecked=230, Total=756 [2021-12-18 21:25:28,108 INFO L933 BasicCegarLoop]: 71 mSDtfsCounter, 180 mSDsluCounter, 498 mSDsCounter, 0 mSdLazyCounter, 607 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 180 SdHoareTripleChecker+Valid, 569 SdHoareTripleChecker+Invalid, 1367 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 607 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 741 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2021-12-18 21:25:28,108 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [180 Valid, 569 Invalid, 1367 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 607 Invalid, 0 Unknown, 741 Unchecked, 0.7s Time] [2021-12-18 21:25:28,108 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 230 states. [2021-12-18 21:25:28,110 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 230 to 139. [2021-12-18 21:25:28,110 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 139 states, 121 states have (on average 1.2727272727272727) internal successors, (154), 138 states have internal predecessors, (154), 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-18 21:25:28,110 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 139 states to 139 states and 154 transitions. [2021-12-18 21:25:28,110 INFO L78 Accepts]: Start accepts. Automaton has 139 states and 154 transitions. Word has length 25 [2021-12-18 21:25:28,110 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-18 21:25:28,110 INFO L470 AbstractCegarLoop]: Abstraction has 139 states and 154 transitions. [2021-12-18 21:25:28,110 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 2.3) internal successors, (46), 20 states have internal predecessors, (46), 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-18 21:25:28,111 INFO L276 IsEmpty]: Start isEmpty. Operand 139 states and 154 transitions. [2021-12-18 21:25:28,111 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2021-12-18 21:25:28,111 INFO L506 BasicCegarLoop]: Found error trace [2021-12-18 21:25:28,111 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-18 21:25:28,125 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (27)] Forceful destruction successful, exit code 0 [2021-12-18 21:25:28,319 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 27 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-12-18 21:25:28,319 INFO L402 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr24REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 48 more)] === [2021-12-18 21:25:28,320 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-18 21:25:28,320 INFO L85 PathProgramCache]: Analyzing trace with hash 1443483791, now seen corresponding path program 1 times [2021-12-18 21:25:28,320 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-18 21:25:28,320 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [959367534] [2021-12-18 21:25:28,320 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-18 21:25:28,320 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-18 21:25:28,320 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-18 21:25:28,321 INFO L229 MonitoredProcess]: Starting monitored process 28 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-12-18 21:25:28,324 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (28)] Waiting until timeout for monitored process [2021-12-18 21:25:28,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 21:25:28,458 INFO L263 TraceCheckSpWp]: Trace formula consists of 169 conjuncts, 20 conjunts are in the unsatisfiable core [2021-12-18 21:25:28,459 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-18 21:25:28,463 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-18 21:25:28,503 INFO L354 Elim1Store]: treesize reduction 15, result has 46.4 percent of original size [2021-12-18 21:25:28,503 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 20 treesize of output 27 [2021-12-18 21:25:28,534 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 11 treesize of output 7 [2021-12-18 21:25:28,614 INFO L354 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-12-18 21:25:28,614 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 31 treesize of output 32 [2021-12-18 21:25:28,694 INFO L354 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-12-18 21:25:28,694 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 34 treesize of output 32 [2021-12-18 21:25:28,723 INFO L354 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-12-18 21:25:28,723 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 34 treesize of output 32 [2021-12-18 21:25:28,773 INFO L354 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-12-18 21:25:28,773 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 31 treesize of output 32 [2021-12-18 21:25:28,795 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 28 treesize of output 16 [2021-12-18 21:25:28,846 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-18 21:25:28,846 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-18 21:25:28,948 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_900 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv0 1) (bvadd (select |c_#valid| (select (select (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|) v_ArrVal_900) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|)) (_ bv1 1)))) is different from false [2021-12-18 21:25:28,959 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_897 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_900 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv0 1) (bvadd (select |c_#valid| (select (select (let ((.cse0 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem4#1.base| v_ArrVal_897))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|) v_ArrVal_900)) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|)) (_ bv1 1)))) is different from false [2021-12-18 21:25:28,971 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_897 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_900 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv0 1) (bvadd (select |c_#valid| (select (select (let ((.cse0 (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|) v_ArrVal_897))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|) v_ArrVal_900)) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|)) (_ bv1 1)))) is different from false [2021-12-18 21:25:28,982 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-18 21:25:28,983 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 1 case distinctions, treesize of input 40 treesize of output 33 [2021-12-18 21:25:28,997 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-18 21:25:28,997 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 268 treesize of output 243 [2021-12-18 21:25:29,002 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 228 treesize of output 220 [2021-12-18 21:25:29,012 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-18 21:25:29,012 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 220 treesize of output 212 Killed by 15