./Ultimate.py --spec ../../sv-benchmarks/c/properties/valid-memsafety.prp --file ../../sv-benchmarks/c/memsafety-ext/skiplist_3lvl.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 839c364b Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f9e8e85e-e410-4b7b-a9a1-8ec046b18135/bin/uautomizer-DrprNOufMa/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f9e8e85e-e410-4b7b-a9a1-8ec046b18135/bin/uautomizer-DrprNOufMa/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f9e8e85e-e410-4b7b-a9a1-8ec046b18135/bin/uautomizer-DrprNOufMa/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f9e8e85e-e410-4b7b-a9a1-8ec046b18135/bin/uautomizer-DrprNOufMa/config/AutomizerMemDerefMemtrack.xml -i ../../sv-benchmarks/c/memsafety-ext/skiplist_3lvl.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f9e8e85e-e410-4b7b-a9a1-8ec046b18135/bin/uautomizer-DrprNOufMa/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f9e8e85e-e410-4b7b-a9a1-8ec046b18135/bin/uautomizer-DrprNOufMa --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 a92c386f0a3e93e7f4997075243ca49a5a9660dc1b84c645c53a036868e1508d --- Real Ultimate output --- This is Ultimate 0.2.2-hotfix-svcomp22-839c364 [2021-12-06 23:37:08,228 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-12-06 23:37:08,229 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-12-06 23:37:08,252 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-12-06 23:37:08,252 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-12-06 23:37:08,253 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-12-06 23:37:08,255 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-12-06 23:37:08,256 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-12-06 23:37:08,258 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-12-06 23:37:08,259 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-12-06 23:37:08,260 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-12-06 23:37:08,261 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-12-06 23:37:08,261 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-12-06 23:37:08,262 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-12-06 23:37:08,263 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-12-06 23:37:08,264 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-12-06 23:37:08,265 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-12-06 23:37:08,266 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-12-06 23:37:08,268 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-12-06 23:37:08,269 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-12-06 23:37:08,271 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-12-06 23:37:08,272 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-12-06 23:37:08,273 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-12-06 23:37:08,274 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-12-06 23:37:08,277 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-12-06 23:37:08,277 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-12-06 23:37:08,277 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-12-06 23:37:08,278 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-12-06 23:37:08,279 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-12-06 23:37:08,279 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-12-06 23:37:08,280 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-12-06 23:37:08,280 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-12-06 23:37:08,281 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-12-06 23:37:08,282 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-12-06 23:37:08,283 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-12-06 23:37:08,283 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-12-06 23:37:08,284 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-12-06 23:37:08,284 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-12-06 23:37:08,284 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-12-06 23:37:08,285 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-12-06 23:37:08,285 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-12-06 23:37:08,286 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f9e8e85e-e410-4b7b-a9a1-8ec046b18135/bin/uautomizer-DrprNOufMa/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2021-12-06 23:37:08,302 INFO L113 SettingsManager]: Loading preferences was successful [2021-12-06 23:37:08,302 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-12-06 23:37:08,302 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-12-06 23:37:08,303 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-12-06 23:37:08,303 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2021-12-06 23:37:08,303 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2021-12-06 23:37:08,304 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-12-06 23:37:08,304 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-12-06 23:37:08,304 INFO L138 SettingsManager]: * Use SBE=true [2021-12-06 23:37:08,304 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-12-06 23:37:08,304 INFO L138 SettingsManager]: * sizeof long=4 [2021-12-06 23:37:08,304 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2021-12-06 23:37:08,304 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-12-06 23:37:08,305 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-12-06 23:37:08,315 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-12-06 23:37:08,315 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2021-12-06 23:37:08,315 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2021-12-06 23:37:08,315 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2021-12-06 23:37:08,315 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-12-06 23:37:08,315 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2021-12-06 23:37:08,316 INFO L138 SettingsManager]: * sizeof long double=12 [2021-12-06 23:37:08,316 INFO L138 SettingsManager]: * Use constant arrays=true [2021-12-06 23:37:08,316 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-12-06 23:37:08,316 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-12-06 23:37:08,316 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-12-06 23:37:08,316 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-12-06 23:37:08,316 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-12-06 23:37:08,317 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-12-06 23:37:08,317 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-12-06 23:37:08,317 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-12-06 23:37:08,317 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-12-06 23:37:08,317 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:/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f9e8e85e-e410-4b7b-a9a1-8ec046b18135/bin/uautomizer-DrprNOufMa/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 -> /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f9e8e85e-e410-4b7b-a9a1-8ec046b18135/bin/uautomizer-DrprNOufMa 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 -> a92c386f0a3e93e7f4997075243ca49a5a9660dc1b84c645c53a036868e1508d [2021-12-06 23:37:08,504 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-12-06 23:37:08,520 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-12-06 23:37:08,522 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-12-06 23:37:08,523 INFO L271 PluginConnector]: Initializing CDTParser... [2021-12-06 23:37:08,523 INFO L275 PluginConnector]: CDTParser initialized [2021-12-06 23:37:08,524 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f9e8e85e-e410-4b7b-a9a1-8ec046b18135/bin/uautomizer-DrprNOufMa/../../sv-benchmarks/c/memsafety-ext/skiplist_3lvl.i [2021-12-06 23:37:08,567 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f9e8e85e-e410-4b7b-a9a1-8ec046b18135/bin/uautomizer-DrprNOufMa/data/1d40cd351/04f6ebedadce42f2b63cc8be7021ae4e/FLAGb3147d641 [2021-12-06 23:37:08,967 INFO L306 CDTParser]: Found 1 translation units. [2021-12-06 23:37:08,968 INFO L160 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f9e8e85e-e410-4b7b-a9a1-8ec046b18135/sv-benchmarks/c/memsafety-ext/skiplist_3lvl.i [2021-12-06 23:37:08,978 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f9e8e85e-e410-4b7b-a9a1-8ec046b18135/bin/uautomizer-DrprNOufMa/data/1d40cd351/04f6ebedadce42f2b63cc8be7021ae4e/FLAGb3147d641 [2021-12-06 23:37:08,988 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f9e8e85e-e410-4b7b-a9a1-8ec046b18135/bin/uautomizer-DrprNOufMa/data/1d40cd351/04f6ebedadce42f2b63cc8be7021ae4e [2021-12-06 23:37:08,990 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-12-06 23:37:08,991 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-12-06 23:37:08,992 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-12-06 23:37:08,992 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-12-06 23:37:08,995 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-12-06 23:37:08,995 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.12 11:37:08" (1/1) ... [2021-12-06 23:37:08,996 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@11939f01 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 11:37:08, skipping insertion in model container [2021-12-06 23:37:08,996 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.12 11:37:08" (1/1) ... [2021-12-06 23:37:09,002 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-12-06 23:37:09,027 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-12-06 23:37:09,215 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-12-06 23:37:09,221 INFO L203 MainTranslator]: Completed pre-run [2021-12-06 23:37:09,254 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-12-06 23:37:09,277 INFO L208 MainTranslator]: Completed translation [2021-12-06 23:37:09,277 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 11:37:09 WrapperNode [2021-12-06 23:37:09,277 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-12-06 23:37:09,278 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-12-06 23:37:09,278 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-12-06 23:37:09,278 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-12-06 23:37:09,284 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 11:37:09" (1/1) ... [2021-12-06 23:37:09,295 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 11:37:09" (1/1) ... [2021-12-06 23:37:09,316 INFO L137 Inliner]: procedures = 127, calls = 55, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 175 [2021-12-06 23:37:09,317 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-12-06 23:37:09,317 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-12-06 23:37:09,317 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-12-06 23:37:09,317 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-12-06 23:37:09,324 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 11:37:09" (1/1) ... [2021-12-06 23:37:09,324 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 11:37:09" (1/1) ... [2021-12-06 23:37:09,327 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 11:37:09" (1/1) ... [2021-12-06 23:37:09,327 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 11:37:09" (1/1) ... [2021-12-06 23:37:09,335 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 11:37:09" (1/1) ... [2021-12-06 23:37:09,339 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 11:37:09" (1/1) ... [2021-12-06 23:37:09,341 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 11:37:09" (1/1) ... [2021-12-06 23:37:09,343 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-12-06 23:37:09,344 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-12-06 23:37:09,344 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-12-06 23:37:09,344 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-12-06 23:37:09,345 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 11:37:09" (1/1) ... [2021-12-06 23:37:09,351 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-12-06 23:37:09,361 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f9e8e85e-e410-4b7b-a9a1-8ec046b18135/bin/uautomizer-DrprNOufMa/z3 [2021-12-06 23:37:09,372 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f9e8e85e-e410-4b7b-a9a1-8ec046b18135/bin/uautomizer-DrprNOufMa/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2021-12-06 23:37:09,374 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f9e8e85e-e410-4b7b-a9a1-8ec046b18135/bin/uautomizer-DrprNOufMa/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2021-12-06 23:37:09,403 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2021-12-06 23:37:09,403 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2021-12-06 23:37:09,404 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2021-12-06 23:37:09,404 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2021-12-06 23:37:09,404 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-12-06 23:37:09,404 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-12-06 23:37:09,404 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-12-06 23:37:09,404 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-12-06 23:37:09,480 INFO L236 CfgBuilder]: Building ICFG [2021-12-06 23:37:09,481 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2021-12-06 23:37:09,846 INFO L277 CfgBuilder]: Performing block encoding [2021-12-06 23:37:09,854 INFO L296 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-12-06 23:37:09,854 INFO L301 CfgBuilder]: Removed 5 assume(true) statements. [2021-12-06 23:37:09,856 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.12 11:37:09 BoogieIcfgContainer [2021-12-06 23:37:09,856 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-12-06 23:37:09,858 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-12-06 23:37:09,858 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-12-06 23:37:09,861 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-12-06 23:37:09,862 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.12 11:37:08" (1/3) ... [2021-12-06 23:37:09,862 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4b0ee4ad and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.12 11:37:09, skipping insertion in model container [2021-12-06 23:37:09,863 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 11:37:09" (2/3) ... [2021-12-06 23:37:09,863 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4b0ee4ad and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.12 11:37:09, skipping insertion in model container [2021-12-06 23:37:09,863 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.12 11:37:09" (3/3) ... [2021-12-06 23:37:09,864 INFO L111 eAbstractionObserver]: Analyzing ICFG skiplist_3lvl.i [2021-12-06 23:37:09,869 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-12-06 23:37:09,870 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 85 error locations. [2021-12-06 23:37:09,905 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2021-12-06 23:37:09,910 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-06 23:37:09,911 INFO L340 AbstractCegarLoop]: Starting to check reachability of 85 error locations. [2021-12-06 23:37:09,928 INFO L276 IsEmpty]: Start isEmpty. Operand has 171 states, 85 states have (on average 2.176470588235294) internal successors, (185), 170 states have internal predecessors, (185), 0 states have call successors, (0), 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-06 23:37:09,934 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2021-12-06 23:37:09,934 INFO L506 BasicCegarLoop]: Found error trace [2021-12-06 23:37:09,935 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1] [2021-12-06 23:37:09,935 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 81 more)] === [2021-12-06 23:37:09,940 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-06 23:37:09,940 INFO L85 PathProgramCache]: Analyzing trace with hash 29857, now seen corresponding path program 1 times [2021-12-06 23:37:09,948 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-06 23:37:09,948 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [688306914] [2021-12-06 23:37:09,948 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 23:37:09,949 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-06 23:37:10,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 23:37:10,088 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-06 23:37:10,089 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-06 23:37:10,089 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [688306914] [2021-12-06 23:37:10,090 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [688306914] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-06 23:37:10,090 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-06 23:37:10,090 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-12-06 23:37:10,092 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [564946556] [2021-12-06 23:37:10,092 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-06 23:37:10,096 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-12-06 23:37:10,097 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-06 23:37:10,123 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-06 23:37:10,124 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-06 23:37:10,126 INFO L87 Difference]: Start difference. First operand has 171 states, 85 states have (on average 2.176470588235294) internal successors, (185), 170 states have internal predecessors, (185), 0 states have call successors, (0), 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-06 23:37:10,258 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-06 23:37:10,258 INFO L93 Difference]: Finished difference Result 192 states and 202 transitions. [2021-12-06 23:37:10,259 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-06 23:37:10,260 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-06 23:37:10,260 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-06 23:37:10,270 INFO L225 Difference]: With dead ends: 192 [2021-12-06 23:37:10,270 INFO L226 Difference]: Without dead ends: 190 [2021-12-06 23:37:10,272 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-06 23:37:10,276 INFO L933 BasicCegarLoop]: 86 mSDtfsCounter, 161 mSDsluCounter, 19 mSDsCounter, 0 mSdLazyCounter, 102 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 161 SdHoareTripleChecker+Valid, 105 SdHoareTripleChecker+Invalid, 112 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 102 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-06 23:37:10,277 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [161 Valid, 105 Invalid, 112 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 102 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-06 23:37:10,292 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 190 states. [2021-12-06 23:37:10,306 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 190 to 160. [2021-12-06 23:37:10,308 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 160 states, 84 states have (on average 2.011904761904762) internal successors, (169), 159 states have internal predecessors, (169), 0 states have call successors, (0), 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-06 23:37:10,310 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 160 states to 160 states and 169 transitions. [2021-12-06 23:37:10,311 INFO L78 Accepts]: Start accepts. Automaton has 160 states and 169 transitions. Word has length 3 [2021-12-06 23:37:10,311 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-06 23:37:10,311 INFO L470 AbstractCegarLoop]: Abstraction has 160 states and 169 transitions. [2021-12-06 23:37:10,311 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-06 23:37:10,311 INFO L276 IsEmpty]: Start isEmpty. Operand 160 states and 169 transitions. [2021-12-06 23:37:10,311 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2021-12-06 23:37:10,312 INFO L506 BasicCegarLoop]: Found error trace [2021-12-06 23:37:10,312 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1] [2021-12-06 23:37:10,312 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-12-06 23:37:10,312 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 81 more)] === [2021-12-06 23:37:10,313 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-06 23:37:10,313 INFO L85 PathProgramCache]: Analyzing trace with hash 29858, now seen corresponding path program 1 times [2021-12-06 23:37:10,313 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-06 23:37:10,313 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1009219935] [2021-12-06 23:37:10,313 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 23:37:10,313 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-06 23:37:10,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 23:37:10,348 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-06 23:37:10,348 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-06 23:37:10,348 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1009219935] [2021-12-06 23:37:10,348 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1009219935] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-06 23:37:10,349 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-06 23:37:10,349 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-12-06 23:37:10,349 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1217795439] [2021-12-06 23:37:10,349 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-06 23:37:10,350 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-12-06 23:37:10,350 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-06 23:37:10,350 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-06 23:37:10,351 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-06 23:37:10,351 INFO L87 Difference]: Start difference. First operand 160 states and 169 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-06 23:37:10,451 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-06 23:37:10,451 INFO L93 Difference]: Finished difference Result 159 states and 168 transitions. [2021-12-06 23:37:10,451 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-06 23:37:10,452 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-06 23:37:10,452 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-06 23:37:10,453 INFO L225 Difference]: With dead ends: 159 [2021-12-06 23:37:10,454 INFO L226 Difference]: Without dead ends: 159 [2021-12-06 23:37:10,454 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-06 23:37:10,456 INFO L933 BasicCegarLoop]: 166 mSDtfsCounter, 1 mSDsluCounter, 86 mSDsCounter, 0 mSdLazyCounter, 82 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 252 SdHoareTripleChecker+Invalid, 82 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 82 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-06 23:37:10,456 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1 Valid, 252 Invalid, 82 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 82 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-06 23:37:10,457 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 159 states. [2021-12-06 23:37:10,466 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 159 to 159. [2021-12-06 23:37:10,466 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 159 states, 84 states have (on average 2.0) internal successors, (168), 158 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-06 23:37:10,468 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 159 states to 159 states and 168 transitions. [2021-12-06 23:37:10,468 INFO L78 Accepts]: Start accepts. Automaton has 159 states and 168 transitions. Word has length 3 [2021-12-06 23:37:10,468 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-06 23:37:10,468 INFO L470 AbstractCegarLoop]: Abstraction has 159 states and 168 transitions. [2021-12-06 23:37:10,468 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-06 23:37:10,469 INFO L276 IsEmpty]: Start isEmpty. Operand 159 states and 168 transitions. [2021-12-06 23:37:10,469 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2021-12-06 23:37:10,469 INFO L506 BasicCegarLoop]: Found error trace [2021-12-06 23:37:10,469 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2021-12-06 23:37:10,469 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-12-06 23:37:10,469 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 81 more)] === [2021-12-06 23:37:10,470 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-06 23:37:10,470 INFO L85 PathProgramCache]: Analyzing trace with hash 28691811, now seen corresponding path program 1 times [2021-12-06 23:37:10,470 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-06 23:37:10,471 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1925819858] [2021-12-06 23:37:10,471 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 23:37:10,471 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-06 23:37:10,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 23:37:10,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-06 23:37:10,558 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-06 23:37:10,558 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1925819858] [2021-12-06 23:37:10,559 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1925819858] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-06 23:37:10,559 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-06 23:37:10,559 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-12-06 23:37:10,559 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [34528144] [2021-12-06 23:37:10,559 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-06 23:37:10,559 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-12-06 23:37:10,559 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-06 23:37:10,560 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-12-06 23:37:10,560 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-12-06 23:37:10,560 INFO L87 Difference]: Start difference. First operand 159 states and 168 transitions. Second operand has 5 states, 4 states have (on average 1.25) internal successors, (5), 5 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 23:37:10,722 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-06 23:37:10,722 INFO L93 Difference]: Finished difference Result 181 states and 191 transitions. [2021-12-06 23:37:10,722 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-12-06 23:37:10,722 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 1.25) internal successors, (5), 5 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 5 [2021-12-06 23:37:10,723 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-06 23:37:10,724 INFO L225 Difference]: With dead ends: 181 [2021-12-06 23:37:10,724 INFO L226 Difference]: Without dead ends: 181 [2021-12-06 23:37:10,724 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2021-12-06 23:37:10,725 INFO L933 BasicCegarLoop]: 54 mSDtfsCounter, 185 mSDsluCounter, 65 mSDsCounter, 0 mSdLazyCounter, 234 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 185 SdHoareTripleChecker+Valid, 119 SdHoareTripleChecker+Invalid, 246 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 234 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-06 23:37:10,725 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [185 Valid, 119 Invalid, 246 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 234 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-06 23:37:10,726 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 181 states. [2021-12-06 23:37:10,731 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 181 to 151. [2021-12-06 23:37:10,732 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 151 states, 84 states have (on average 1.9047619047619047) internal successors, (160), 150 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-06 23:37:10,732 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 151 states to 151 states and 160 transitions. [2021-12-06 23:37:10,732 INFO L78 Accepts]: Start accepts. Automaton has 151 states and 160 transitions. Word has length 5 [2021-12-06 23:37:10,732 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-06 23:37:10,733 INFO L470 AbstractCegarLoop]: Abstraction has 151 states and 160 transitions. [2021-12-06 23:37:10,733 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 1.25) internal successors, (5), 5 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 23:37:10,733 INFO L276 IsEmpty]: Start isEmpty. Operand 151 states and 160 transitions. [2021-12-06 23:37:10,733 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2021-12-06 23:37:10,733 INFO L506 BasicCegarLoop]: Found error trace [2021-12-06 23:37:10,733 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-06 23:37:10,733 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-12-06 23:37:10,733 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr12REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 81 more)] === [2021-12-06 23:37:10,734 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-06 23:37:10,734 INFO L85 PathProgramCache]: Analyzing trace with hash -1604937495, now seen corresponding path program 1 times [2021-12-06 23:37:10,734 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-06 23:37:10,734 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [561426848] [2021-12-06 23:37:10,734 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 23:37:10,734 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-06 23:37:10,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 23:37:10,812 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-06 23:37:10,813 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-06 23:37:10,813 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [561426848] [2021-12-06 23:37:10,813 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [561426848] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-06 23:37:10,813 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-06 23:37:10,813 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-12-06 23:37:10,813 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1720991225] [2021-12-06 23:37:10,813 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-06 23:37:10,814 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-12-06 23:37:10,814 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-06 23:37:10,814 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-12-06 23:37:10,814 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-12-06 23:37:10,814 INFO L87 Difference]: Start difference. First operand 151 states and 160 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-06 23:37:10,921 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-06 23:37:10,921 INFO L93 Difference]: Finished difference Result 150 states and 159 transitions. [2021-12-06 23:37:10,921 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-12-06 23:37:10,921 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-06 23:37:10,921 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-06 23:37:10,922 INFO L225 Difference]: With dead ends: 150 [2021-12-06 23:37:10,922 INFO L226 Difference]: Without dead ends: 150 [2021-12-06 23:37:10,923 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 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-06 23:37:10,924 INFO L933 BasicCegarLoop]: 146 mSDtfsCounter, 11 mSDsluCounter, 238 mSDsCounter, 0 mSdLazyCounter, 231 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 384 SdHoareTripleChecker+Invalid, 232 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 231 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-06 23:37:10,924 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [11 Valid, 384 Invalid, 232 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 231 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-06 23:37:10,925 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 150 states. [2021-12-06 23:37:10,929 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 150 to 150. [2021-12-06 23:37:10,929 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 150 states, 84 states have (on average 1.8928571428571428) internal successors, (159), 149 states have internal predecessors, (159), 0 states have call successors, (0), 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-06 23:37:10,930 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 150 states to 150 states and 159 transitions. [2021-12-06 23:37:10,930 INFO L78 Accepts]: Start accepts. Automaton has 150 states and 159 transitions. Word has length 11 [2021-12-06 23:37:10,930 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-06 23:37:10,930 INFO L470 AbstractCegarLoop]: Abstraction has 150 states and 159 transitions. [2021-12-06 23:37:10,930 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-06 23:37:10,931 INFO L276 IsEmpty]: Start isEmpty. Operand 150 states and 159 transitions. [2021-12-06 23:37:10,931 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2021-12-06 23:37:10,931 INFO L506 BasicCegarLoop]: Found error trace [2021-12-06 23:37:10,931 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-06 23:37:10,931 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-12-06 23:37:10,931 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr13REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 81 more)] === [2021-12-06 23:37:10,932 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-06 23:37:10,932 INFO L85 PathProgramCache]: Analyzing trace with hash -1604937494, now seen corresponding path program 1 times [2021-12-06 23:37:10,932 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-06 23:37:10,932 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1947269843] [2021-12-06 23:37:10,932 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 23:37:10,932 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-06 23:37:10,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 23:37:11,013 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-06 23:37:11,013 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-06 23:37:11,013 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1947269843] [2021-12-06 23:37:11,013 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1947269843] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-06 23:37:11,013 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-06 23:37:11,013 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-12-06 23:37:11,013 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1655179580] [2021-12-06 23:37:11,013 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-06 23:37:11,014 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-12-06 23:37:11,014 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-06 23:37:11,014 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-12-06 23:37:11,014 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2021-12-06 23:37:11,014 INFO L87 Difference]: Start difference. First operand 150 states and 159 transitions. Second operand has 6 states, 5 states have (on average 2.2) internal successors, (11), 6 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-06 23:37:11,154 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-06 23:37:11,154 INFO L93 Difference]: Finished difference Result 149 states and 158 transitions. [2021-12-06 23:37:11,155 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-12-06 23:37:11,155 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 2.2) internal successors, (11), 6 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-06 23:37:11,155 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-06 23:37:11,156 INFO L225 Difference]: With dead ends: 149 [2021-12-06 23:37:11,156 INFO L226 Difference]: Without dead ends: 149 [2021-12-06 23:37:11,156 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2021-12-06 23:37:11,157 INFO L933 BasicCegarLoop]: 146 mSDtfsCounter, 14 mSDsluCounter, 219 mSDsCounter, 0 mSdLazyCounter, 248 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 365 SdHoareTripleChecker+Invalid, 252 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 248 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-06 23:37:11,158 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [14 Valid, 365 Invalid, 252 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 248 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-06 23:37:11,158 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 149 states. [2021-12-06 23:37:11,161 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 149 to 149. [2021-12-06 23:37:11,161 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 149 states, 84 states have (on average 1.880952380952381) internal successors, (158), 148 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-06 23:37:11,162 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 149 states to 149 states and 158 transitions. [2021-12-06 23:37:11,162 INFO L78 Accepts]: Start accepts. Automaton has 149 states and 158 transitions. Word has length 11 [2021-12-06 23:37:11,162 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-06 23:37:11,162 INFO L470 AbstractCegarLoop]: Abstraction has 149 states and 158 transitions. [2021-12-06 23:37:11,163 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.2) internal successors, (11), 6 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-06 23:37:11,163 INFO L276 IsEmpty]: Start isEmpty. Operand 149 states and 158 transitions. [2021-12-06 23:37:11,163 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2021-12-06 23:37:11,163 INFO L506 BasicCegarLoop]: Found error trace [2021-12-06 23:37:11,163 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-06 23:37:11,163 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-12-06 23:37:11,163 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr14REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 81 more)] === [2021-12-06 23:37:11,164 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-06 23:37:11,164 INFO L85 PathProgramCache]: Analyzing trace with hash 1786545203, now seen corresponding path program 1 times [2021-12-06 23:37:11,164 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-06 23:37:11,164 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1188745905] [2021-12-06 23:37:11,164 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 23:37:11,165 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-06 23:37:11,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 23:37:11,207 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-06 23:37:11,208 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-06 23:37:11,208 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1188745905] [2021-12-06 23:37:11,208 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1188745905] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-06 23:37:11,208 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-06 23:37:11,208 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-12-06 23:37:11,209 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1204309131] [2021-12-06 23:37:11,209 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-06 23:37:11,209 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-12-06 23:37:11,209 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-06 23:37:11,210 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-12-06 23:37:11,210 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-12-06 23:37:11,210 INFO L87 Difference]: Start difference. First operand 149 states and 158 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-06 23:37:11,287 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-06 23:37:11,287 INFO L93 Difference]: Finished difference Result 148 states and 157 transitions. [2021-12-06 23:37:11,287 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-12-06 23:37:11,287 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-06 23:37:11,288 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-06 23:37:11,289 INFO L225 Difference]: With dead ends: 148 [2021-12-06 23:37:11,289 INFO L226 Difference]: Without dead ends: 148 [2021-12-06 23:37:11,289 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-06 23:37:11,290 INFO L933 BasicCegarLoop]: 150 mSDtfsCounter, 12 mSDsluCounter, 337 mSDsCounter, 0 mSdLazyCounter, 124 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 487 SdHoareTripleChecker+Invalid, 125 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 124 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-06 23:37:11,291 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [12 Valid, 487 Invalid, 125 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 124 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-06 23:37:11,292 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 148 states. [2021-12-06 23:37:11,295 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 148 to 148. [2021-12-06 23:37:11,295 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 148 states, 84 states have (on average 1.869047619047619) internal successors, (157), 147 states have internal predecessors, (157), 0 states have call successors, (0), 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-06 23:37:11,296 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 148 states to 148 states and 157 transitions. [2021-12-06 23:37:11,296 INFO L78 Accepts]: Start accepts. Automaton has 148 states and 157 transitions. Word has length 12 [2021-12-06 23:37:11,297 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-06 23:37:11,297 INFO L470 AbstractCegarLoop]: Abstraction has 148 states and 157 transitions. [2021-12-06 23:37:11,297 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-06 23:37:11,297 INFO L276 IsEmpty]: Start isEmpty. Operand 148 states and 157 transitions. [2021-12-06 23:37:11,297 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2021-12-06 23:37:11,297 INFO L506 BasicCegarLoop]: Found error trace [2021-12-06 23:37:11,298 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-06 23:37:11,298 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2021-12-06 23:37:11,298 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr15REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 81 more)] === [2021-12-06 23:37:11,298 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-06 23:37:11,298 INFO L85 PathProgramCache]: Analyzing trace with hash 1786545204, now seen corresponding path program 1 times [2021-12-06 23:37:11,299 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-06 23:37:11,299 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [561447444] [2021-12-06 23:37:11,299 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 23:37:11,299 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-06 23:37:11,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 23:37:11,395 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-06 23:37:11,395 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-06 23:37:11,395 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [561447444] [2021-12-06 23:37:11,395 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [561447444] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-06 23:37:11,396 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-06 23:37:11,396 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-12-06 23:37:11,396 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [57402323] [2021-12-06 23:37:11,396 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-06 23:37:11,396 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-12-06 23:37:11,396 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-06 23:37:11,396 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-12-06 23:37:11,397 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2021-12-06 23:37:11,397 INFO L87 Difference]: Start difference. First operand 148 states and 157 transitions. Second operand has 7 states, 6 states have (on average 2.0) 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-06 23:37:11,545 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-06 23:37:11,545 INFO L93 Difference]: Finished difference Result 147 states and 156 transitions. [2021-12-06 23:37:11,545 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-12-06 23:37:11,545 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 2.0) 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-06 23:37:11,546 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-06 23:37:11,546 INFO L225 Difference]: With dead ends: 147 [2021-12-06 23:37:11,546 INFO L226 Difference]: Without dead ends: 147 [2021-12-06 23:37:11,547 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2021-12-06 23:37:11,547 INFO L933 BasicCegarLoop]: 145 mSDtfsCounter, 12 mSDsluCounter, 335 mSDsCounter, 0 mSdLazyCounter, 280 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 480 SdHoareTripleChecker+Invalid, 282 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 280 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-06 23:37:11,547 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [12 Valid, 480 Invalid, 282 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 280 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-06 23:37:11,548 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 147 states. [2021-12-06 23:37:11,550 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 147 to 147. [2021-12-06 23:37:11,550 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 147 states, 84 states have (on average 1.8571428571428572) internal successors, (156), 146 states have internal predecessors, (156), 0 states have call successors, (0), 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-06 23:37:11,551 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 147 states to 147 states and 156 transitions. [2021-12-06 23:37:11,551 INFO L78 Accepts]: Start accepts. Automaton has 147 states and 156 transitions. Word has length 12 [2021-12-06 23:37:11,551 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-06 23:37:11,551 INFO L470 AbstractCegarLoop]: Abstraction has 147 states and 156 transitions. [2021-12-06 23:37:11,551 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 2.0) 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-06 23:37:11,551 INFO L276 IsEmpty]: Start isEmpty. Operand 147 states and 156 transitions. [2021-12-06 23:37:11,551 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2021-12-06 23:37:11,551 INFO L506 BasicCegarLoop]: Found error trace [2021-12-06 23:37:11,552 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-06 23:37:11,552 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2021-12-06 23:37:11,552 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr16REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 81 more)] === [2021-12-06 23:37:11,552 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-06 23:37:11,552 INFO L85 PathProgramCache]: Analyzing trace with hash -451673556, now seen corresponding path program 1 times [2021-12-06 23:37:11,552 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-06 23:37:11,552 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [745381564] [2021-12-06 23:37:11,552 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 23:37:11,553 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-06 23:37:11,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 23:37:11,587 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-06 23:37:11,587 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-06 23:37:11,587 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [745381564] [2021-12-06 23:37:11,587 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [745381564] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-06 23:37:11,587 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-06 23:37:11,587 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-12-06 23:37:11,588 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [365638309] [2021-12-06 23:37:11,588 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-06 23:37:11,588 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-12-06 23:37:11,588 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-06 23:37:11,588 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-12-06 23:37:11,588 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-12-06 23:37:11,588 INFO L87 Difference]: Start difference. First operand 147 states and 156 transitions. Second operand has 5 states, 4 states have (on average 3.25) internal successors, (13), 5 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-06 23:37:11,656 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-06 23:37:11,656 INFO L93 Difference]: Finished difference Result 146 states and 155 transitions. [2021-12-06 23:37:11,656 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-12-06 23:37:11,657 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 3.25) internal successors, (13), 5 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-06 23:37:11,657 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-06 23:37:11,657 INFO L225 Difference]: With dead ends: 146 [2021-12-06 23:37:11,657 INFO L226 Difference]: Without dead ends: 146 [2021-12-06 23:37:11,658 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-06 23:37:11,658 INFO L933 BasicCegarLoop]: 148 mSDtfsCounter, 8 mSDsluCounter, 335 mSDsCounter, 0 mSdLazyCounter, 123 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 483 SdHoareTripleChecker+Invalid, 123 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 123 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-06 23:37:11,658 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [8 Valid, 483 Invalid, 123 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 123 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-06 23:37:11,659 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 146 states. [2021-12-06 23:37:11,660 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 146 to 146. [2021-12-06 23:37:11,661 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 146 states, 84 states have (on average 1.8452380952380953) internal successors, (155), 145 states have internal predecessors, (155), 0 states have call successors, (0), 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-06 23:37:11,661 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 146 states to 146 states and 155 transitions. [2021-12-06 23:37:11,661 INFO L78 Accepts]: Start accepts. Automaton has 146 states and 155 transitions. Word has length 13 [2021-12-06 23:37:11,662 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-06 23:37:11,662 INFO L470 AbstractCegarLoop]: Abstraction has 146 states and 155 transitions. [2021-12-06 23:37:11,662 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 3.25) internal successors, (13), 5 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-06 23:37:11,662 INFO L276 IsEmpty]: Start isEmpty. Operand 146 states and 155 transitions. [2021-12-06 23:37:11,662 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2021-12-06 23:37:11,662 INFO L506 BasicCegarLoop]: Found error trace [2021-12-06 23:37:11,662 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-06 23:37:11,662 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2021-12-06 23:37:11,663 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr17REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 81 more)] === [2021-12-06 23:37:11,663 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-06 23:37:11,663 INFO L85 PathProgramCache]: Analyzing trace with hash -451673555, now seen corresponding path program 1 times [2021-12-06 23:37:11,663 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-06 23:37:11,663 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1336843106] [2021-12-06 23:37:11,663 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 23:37:11,663 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-06 23:37:11,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 23:37:11,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-06 23:37:11,775 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-06 23:37:11,775 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1336843106] [2021-12-06 23:37:11,775 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1336843106] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-06 23:37:11,775 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-06 23:37:11,776 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-12-06 23:37:11,776 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [517063879] [2021-12-06 23:37:11,776 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-06 23:37:11,776 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-12-06 23:37:11,776 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-06 23:37:11,777 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-12-06 23:37:11,777 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2021-12-06 23:37:11,777 INFO L87 Difference]: Start difference. First operand 146 states and 155 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-06 23:37:11,929 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-06 23:37:11,929 INFO L93 Difference]: Finished difference Result 145 states and 154 transitions. [2021-12-06 23:37:11,930 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-12-06 23:37:11,930 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-06 23:37:11,930 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-06 23:37:11,931 INFO L225 Difference]: With dead ends: 145 [2021-12-06 23:37:11,931 INFO L226 Difference]: Without dead ends: 145 [2021-12-06 23:37:11,931 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2021-12-06 23:37:11,931 INFO L933 BasicCegarLoop]: 144 mSDtfsCounter, 13 mSDsluCounter, 332 mSDsCounter, 0 mSdLazyCounter, 274 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 476 SdHoareTripleChecker+Invalid, 276 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 274 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-06 23:37:11,932 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [13 Valid, 476 Invalid, 276 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 274 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-06 23:37:11,932 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 145 states. [2021-12-06 23:37:11,934 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 145 to 145. [2021-12-06 23:37:11,934 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 145 states, 84 states have (on average 1.8333333333333333) internal successors, (154), 144 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-06 23:37:11,935 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 145 states to 145 states and 154 transitions. [2021-12-06 23:37:11,935 INFO L78 Accepts]: Start accepts. Automaton has 145 states and 154 transitions. Word has length 13 [2021-12-06 23:37:11,935 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-06 23:37:11,936 INFO L470 AbstractCegarLoop]: Abstraction has 145 states and 154 transitions. [2021-12-06 23:37:11,936 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-06 23:37:11,936 INFO L276 IsEmpty]: Start isEmpty. Operand 145 states and 154 transitions. [2021-12-06 23:37:11,936 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2021-12-06 23:37:11,937 INFO L506 BasicCegarLoop]: Found error trace [2021-12-06 23:37:11,937 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-06 23:37:11,937 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2021-12-06 23:37:11,937 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr24REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 81 more)] === [2021-12-06 23:37:11,937 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-06 23:37:11,937 INFO L85 PathProgramCache]: Analyzing trace with hash -598729444, now seen corresponding path program 1 times [2021-12-06 23:37:11,938 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-06 23:37:11,938 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1249553604] [2021-12-06 23:37:11,938 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 23:37:11,938 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-06 23:37:11,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 23:37:12,075 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-06 23:37:12,075 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-06 23:37:12,075 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1249553604] [2021-12-06 23:37:12,075 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1249553604] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-06 23:37:12,075 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-06 23:37:12,075 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2021-12-06 23:37:12,075 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1142072733] [2021-12-06 23:37:12,075 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-06 23:37:12,076 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2021-12-06 23:37:12,076 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-06 23:37:12,076 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2021-12-06 23:37:12,076 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=114, Unknown=0, NotChecked=0, Total=156 [2021-12-06 23:37:12,076 INFO L87 Difference]: Start difference. First operand 145 states and 154 transitions. Second operand has 13 states, 12 states have (on average 1.5) internal successors, (18), 13 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-06 23:37:12,315 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-06 23:37:12,316 INFO L93 Difference]: Finished difference Result 144 states and 153 transitions. [2021-12-06 23:37:12,316 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-12-06 23:37:12,316 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 12 states have (on average 1.5) internal successors, (18), 13 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-06 23:37:12,316 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-06 23:37:12,317 INFO L225 Difference]: With dead ends: 144 [2021-12-06 23:37:12,317 INFO L226 Difference]: Without dead ends: 144 [2021-12-06 23:37:12,318 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=68, Invalid=204, Unknown=0, NotChecked=0, Total=272 [2021-12-06 23:37:12,319 INFO L933 BasicCegarLoop]: 135 mSDtfsCounter, 27 mSDsluCounter, 617 mSDsCounter, 0 mSdLazyCounter, 427 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 27 SdHoareTripleChecker+Valid, 752 SdHoareTripleChecker+Invalid, 445 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 427 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-12-06 23:37:12,319 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [27 Valid, 752 Invalid, 445 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 427 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2021-12-06 23:37:12,320 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 144 states. [2021-12-06 23:37:12,322 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 144 to 144. [2021-12-06 23:37:12,323 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 144 states, 84 states have (on average 1.8214285714285714) internal successors, (153), 143 states have internal predecessors, (153), 0 states have call successors, (0), 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-06 23:37:12,324 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 144 states to 144 states and 153 transitions. [2021-12-06 23:37:12,324 INFO L78 Accepts]: Start accepts. Automaton has 144 states and 153 transitions. Word has length 18 [2021-12-06 23:37:12,324 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-06 23:37:12,324 INFO L470 AbstractCegarLoop]: Abstraction has 144 states and 153 transitions. [2021-12-06 23:37:12,324 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 12 states have (on average 1.5) internal successors, (18), 13 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-06 23:37:12,325 INFO L276 IsEmpty]: Start isEmpty. Operand 144 states and 153 transitions. [2021-12-06 23:37:12,325 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2021-12-06 23:37:12,325 INFO L506 BasicCegarLoop]: Found error trace [2021-12-06 23:37:12,325 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-06 23:37:12,325 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2021-12-06 23:37:12,326 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr25REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 81 more)] === [2021-12-06 23:37:12,326 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-06 23:37:12,326 INFO L85 PathProgramCache]: Analyzing trace with hash -598729443, now seen corresponding path program 1 times [2021-12-06 23:37:12,326 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-06 23:37:12,327 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1739431692] [2021-12-06 23:37:12,327 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 23:37:12,327 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-06 23:37:12,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 23:37:12,516 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-06 23:37:12,516 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-06 23:37:12,516 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1739431692] [2021-12-06 23:37:12,516 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1739431692] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-06 23:37:12,516 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-06 23:37:12,517 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2021-12-06 23:37:12,517 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [165179512] [2021-12-06 23:37:12,517 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-06 23:37:12,517 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2021-12-06 23:37:12,517 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-06 23:37:12,517 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2021-12-06 23:37:12,518 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=114, Unknown=0, NotChecked=0, Total=156 [2021-12-06 23:37:12,518 INFO L87 Difference]: Start difference. First operand 144 states and 153 transitions. Second operand has 13 states, 12 states have (on average 1.5) internal successors, (18), 13 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-06 23:37:12,792 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-06 23:37:12,793 INFO L93 Difference]: Finished difference Result 143 states and 152 transitions. [2021-12-06 23:37:12,793 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-12-06 23:37:12,793 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 12 states have (on average 1.5) internal successors, (18), 13 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-06 23:37:12,793 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-06 23:37:12,794 INFO L225 Difference]: With dead ends: 143 [2021-12-06 23:37:12,794 INFO L226 Difference]: Without dead ends: 143 [2021-12-06 23:37:12,794 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=68, Invalid=204, Unknown=0, NotChecked=0, Total=272 [2021-12-06 23:37:12,795 INFO L933 BasicCegarLoop]: 135 mSDtfsCounter, 23 mSDsluCounter, 802 mSDsCounter, 0 mSdLazyCounter, 512 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 937 SdHoareTripleChecker+Invalid, 526 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 512 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-12-06 23:37:12,795 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [23 Valid, 937 Invalid, 526 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 512 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2021-12-06 23:37:12,795 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 143 states. [2021-12-06 23:37:12,797 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 143 to 143. [2021-12-06 23:37:12,797 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 143 states, 84 states have (on average 1.8095238095238095) internal successors, (152), 142 states have internal predecessors, (152), 0 states have call successors, (0), 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-06 23:37:12,798 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 143 states to 143 states and 152 transitions. [2021-12-06 23:37:12,798 INFO L78 Accepts]: Start accepts. Automaton has 143 states and 152 transitions. Word has length 18 [2021-12-06 23:37:12,798 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-06 23:37:12,798 INFO L470 AbstractCegarLoop]: Abstraction has 143 states and 152 transitions. [2021-12-06 23:37:12,798 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 12 states have (on average 1.5) internal successors, (18), 13 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-06 23:37:12,798 INFO L276 IsEmpty]: Start isEmpty. Operand 143 states and 152 transitions. [2021-12-06 23:37:12,798 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2021-12-06 23:37:12,799 INFO L506 BasicCegarLoop]: Found error trace [2021-12-06 23:37:12,799 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-06 23:37:12,799 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2021-12-06 23:37:12,799 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr26REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 81 more)] === [2021-12-06 23:37:12,799 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-06 23:37:12,799 INFO L85 PathProgramCache]: Analyzing trace with hash -1380743565, now seen corresponding path program 1 times [2021-12-06 23:37:12,800 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-06 23:37:12,800 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2076298488] [2021-12-06 23:37:12,800 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 23:37:12,800 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-06 23:37:12,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 23:37:12,838 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-06 23:37:12,838 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-06 23:37:12,838 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2076298488] [2021-12-06 23:37:12,838 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2076298488] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-06 23:37:12,838 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-06 23:37:12,839 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-12-06 23:37:12,839 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1605682813] [2021-12-06 23:37:12,839 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-06 23:37:12,839 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-12-06 23:37:12,839 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-06 23:37:12,840 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-12-06 23:37:12,840 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-12-06 23:37:12,840 INFO L87 Difference]: Start difference. First operand 143 states and 152 transitions. Second operand has 5 states, 4 states have (on average 4.75) internal successors, (19), 5 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-06 23:37:12,914 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-06 23:37:12,914 INFO L93 Difference]: Finished difference Result 142 states and 151 transitions. [2021-12-06 23:37:12,914 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-12-06 23:37:12,914 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 4.75) internal successors, (19), 5 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-06 23:37:12,914 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-06 23:37:12,915 INFO L225 Difference]: With dead ends: 142 [2021-12-06 23:37:12,915 INFO L226 Difference]: Without dead ends: 142 [2021-12-06 23:37:12,915 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-06 23:37:12,916 INFO L933 BasicCegarLoop]: 145 mSDtfsCounter, 11 mSDsluCounter, 324 mSDsCounter, 0 mSdLazyCounter, 120 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 469 SdHoareTripleChecker+Invalid, 121 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 120 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-06 23:37:12,916 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [11 Valid, 469 Invalid, 121 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 120 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-06 23:37:12,917 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 142 states. [2021-12-06 23:37:12,918 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 142 to 142. [2021-12-06 23:37:12,918 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 142 states, 84 states have (on average 1.7976190476190477) internal successors, (151), 141 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-06 23:37:12,919 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 142 states to 142 states and 151 transitions. [2021-12-06 23:37:12,919 INFO L78 Accepts]: Start accepts. Automaton has 142 states and 151 transitions. Word has length 19 [2021-12-06 23:37:12,919 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-06 23:37:12,919 INFO L470 AbstractCegarLoop]: Abstraction has 142 states and 151 transitions. [2021-12-06 23:37:12,919 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 4.75) internal successors, (19), 5 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-06 23:37:12,919 INFO L276 IsEmpty]: Start isEmpty. Operand 142 states and 151 transitions. [2021-12-06 23:37:12,920 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2021-12-06 23:37:12,920 INFO L506 BasicCegarLoop]: Found error trace [2021-12-06 23:37:12,920 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-06 23:37:12,920 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2021-12-06 23:37:12,920 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr27REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 81 more)] === [2021-12-06 23:37:12,920 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-06 23:37:12,920 INFO L85 PathProgramCache]: Analyzing trace with hash -1380743564, now seen corresponding path program 1 times [2021-12-06 23:37:12,920 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-06 23:37:12,921 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2022839449] [2021-12-06 23:37:12,921 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 23:37:12,921 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-06 23:37:12,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 23:37:13,130 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-06 23:37:13,131 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-06 23:37:13,131 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2022839449] [2021-12-06 23:37:13,131 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2022839449] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-06 23:37:13,131 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-06 23:37:13,131 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2021-12-06 23:37:13,131 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1391503907] [2021-12-06 23:37:13,131 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-06 23:37:13,131 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2021-12-06 23:37:13,131 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-06 23:37:13,132 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2021-12-06 23:37:13,132 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=162, Unknown=0, NotChecked=0, Total=210 [2021-12-06 23:37:13,132 INFO L87 Difference]: Start difference. First operand 142 states and 151 transitions. Second operand has 15 states, 14 states have (on average 1.3571428571428572) internal successors, (19), 15 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-06 23:37:13,304 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-06 23:37:13,304 INFO L93 Difference]: Finished difference Result 141 states and 150 transitions. [2021-12-06 23:37:13,304 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2021-12-06 23:37:13,304 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 14 states have (on average 1.3571428571428572) internal successors, (19), 15 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-06 23:37:13,304 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-06 23:37:13,305 INFO L225 Difference]: With dead ends: 141 [2021-12-06 23:37:13,305 INFO L226 Difference]: Without dead ends: 141 [2021-12-06 23:37:13,306 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 54 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=84, Invalid=296, Unknown=0, NotChecked=0, Total=380 [2021-12-06 23:37:13,306 INFO L933 BasicCegarLoop]: 134 mSDtfsCounter, 34 mSDsluCounter, 477 mSDsCounter, 0 mSdLazyCounter, 270 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 34 SdHoareTripleChecker+Valid, 611 SdHoareTripleChecker+Invalid, 288 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 270 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-06 23:37:13,307 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [34 Valid, 611 Invalid, 288 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 270 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-06 23:37:13,307 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 141 states. [2021-12-06 23:37:13,309 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 141 to 141. [2021-12-06 23:37:13,309 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 141 states, 84 states have (on average 1.7857142857142858) internal successors, (150), 140 states have internal predecessors, (150), 0 states have call successors, (0), 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-06 23:37:13,310 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 141 states to 141 states and 150 transitions. [2021-12-06 23:37:13,310 INFO L78 Accepts]: Start accepts. Automaton has 141 states and 150 transitions. Word has length 19 [2021-12-06 23:37:13,310 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-06 23:37:13,310 INFO L470 AbstractCegarLoop]: Abstraction has 141 states and 150 transitions. [2021-12-06 23:37:13,310 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 14 states have (on average 1.3571428571428572) internal successors, (19), 15 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-06 23:37:13,310 INFO L276 IsEmpty]: Start isEmpty. Operand 141 states and 150 transitions. [2021-12-06 23:37:13,310 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2021-12-06 23:37:13,311 INFO L506 BasicCegarLoop]: Found error trace [2021-12-06 23:37:13,311 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-06 23:37:13,311 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2021-12-06 23:37:13,311 INFO L402 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr28REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 81 more)] === [2021-12-06 23:37:13,311 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-06 23:37:13,311 INFO L85 PathProgramCache]: Analyzing trace with hash 146622463, now seen corresponding path program 1 times [2021-12-06 23:37:13,311 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-06 23:37:13,311 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [300526548] [2021-12-06 23:37:13,311 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 23:37:13,311 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-06 23:37:13,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 23:37:13,350 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-06 23:37:13,351 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-06 23:37:13,351 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [300526548] [2021-12-06 23:37:13,351 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [300526548] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-06 23:37:13,351 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-06 23:37:13,351 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-12-06 23:37:13,351 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2040369031] [2021-12-06 23:37:13,351 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-06 23:37:13,352 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-12-06 23:37:13,352 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-06 23:37:13,352 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-12-06 23:37:13,352 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-12-06 23:37:13,352 INFO L87 Difference]: Start difference. First operand 141 states and 150 transitions. Second operand has 5 states, 4 states have (on average 5.0) internal successors, (20), 5 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-06 23:37:13,423 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-06 23:37:13,423 INFO L93 Difference]: Finished difference Result 140 states and 149 transitions. [2021-12-06 23:37:13,424 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-12-06 23:37:13,424 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 5.0) internal successors, (20), 5 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-06 23:37:13,424 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-06 23:37:13,424 INFO L225 Difference]: With dead ends: 140 [2021-12-06 23:37:13,425 INFO L226 Difference]: Without dead ends: 140 [2021-12-06 23:37:13,425 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-06 23:37:13,425 INFO L933 BasicCegarLoop]: 143 mSDtfsCounter, 7 mSDsluCounter, 322 mSDsCounter, 0 mSdLazyCounter, 119 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 465 SdHoareTripleChecker+Invalid, 119 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 119 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-06 23:37:13,425 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [7 Valid, 465 Invalid, 119 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 119 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-06 23:37:13,426 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 140 states. [2021-12-06 23:37:13,427 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 140 to 140. [2021-12-06 23:37:13,427 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 140 states, 84 states have (on average 1.7738095238095237) internal successors, (149), 139 states have internal predecessors, (149), 0 states have call successors, (0), 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-06 23:37:13,428 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 140 states to 140 states and 149 transitions. [2021-12-06 23:37:13,428 INFO L78 Accepts]: Start accepts. Automaton has 140 states and 149 transitions. Word has length 20 [2021-12-06 23:37:13,428 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-06 23:37:13,428 INFO L470 AbstractCegarLoop]: Abstraction has 140 states and 149 transitions. [2021-12-06 23:37:13,428 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 5.0) internal successors, (20), 5 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-06 23:37:13,428 INFO L276 IsEmpty]: Start isEmpty. Operand 140 states and 149 transitions. [2021-12-06 23:37:13,429 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2021-12-06 23:37:13,429 INFO L506 BasicCegarLoop]: Found error trace [2021-12-06 23:37:13,429 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-06 23:37:13,429 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2021-12-06 23:37:13,429 INFO L402 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr29REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 81 more)] === [2021-12-06 23:37:13,429 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-06 23:37:13,429 INFO L85 PathProgramCache]: Analyzing trace with hash 146622464, now seen corresponding path program 1 times [2021-12-06 23:37:13,429 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-06 23:37:13,429 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [318173744] [2021-12-06 23:37:13,430 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 23:37:13,430 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-06 23:37:13,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 23:37:13,618 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-06 23:37:13,619 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-06 23:37:13,619 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [318173744] [2021-12-06 23:37:13,619 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [318173744] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-06 23:37:13,619 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-06 23:37:13,619 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2021-12-06 23:37:13,619 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [368203740] [2021-12-06 23:37:13,619 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-06 23:37:13,620 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2021-12-06 23:37:13,620 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-06 23:37:13,620 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2021-12-06 23:37:13,620 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=162, Unknown=0, NotChecked=0, Total=210 [2021-12-06 23:37:13,621 INFO L87 Difference]: Start difference. First operand 140 states and 149 transitions. Second operand has 15 states, 14 states have (on average 1.4285714285714286) internal successors, (20), 15 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-06 23:37:13,860 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-06 23:37:13,861 INFO L93 Difference]: Finished difference Result 139 states and 148 transitions. [2021-12-06 23:37:13,861 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2021-12-06 23:37:13,861 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 14 states have (on average 1.4285714285714286) internal successors, (20), 15 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-06 23:37:13,861 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-06 23:37:13,862 INFO L225 Difference]: With dead ends: 139 [2021-12-06 23:37:13,862 INFO L226 Difference]: Without dead ends: 139 [2021-12-06 23:37:13,862 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 54 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=84, Invalid=296, Unknown=0, NotChecked=0, Total=380 [2021-12-06 23:37:13,863 INFO L933 BasicCegarLoop]: 133 mSDtfsCounter, 31 mSDsluCounter, 708 mSDsCounter, 0 mSdLazyCounter, 438 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 31 SdHoareTripleChecker+Valid, 841 SdHoareTripleChecker+Invalid, 455 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 438 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-12-06 23:37:13,863 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [31 Valid, 841 Invalid, 455 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 438 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2021-12-06 23:37:13,864 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 139 states. [2021-12-06 23:37:13,865 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 139 to 139. [2021-12-06 23:37:13,865 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 139 states, 84 states have (on average 1.7619047619047619) internal successors, (148), 138 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-06 23:37:13,866 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 139 states to 139 states and 148 transitions. [2021-12-06 23:37:13,866 INFO L78 Accepts]: Start accepts. Automaton has 139 states and 148 transitions. Word has length 20 [2021-12-06 23:37:13,866 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-06 23:37:13,866 INFO L470 AbstractCegarLoop]: Abstraction has 139 states and 148 transitions. [2021-12-06 23:37:13,866 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 14 states have (on average 1.4285714285714286) internal successors, (20), 15 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-06 23:37:13,866 INFO L276 IsEmpty]: Start isEmpty. Operand 139 states and 148 transitions. [2021-12-06 23:37:13,867 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2021-12-06 23:37:13,867 INFO L506 BasicCegarLoop]: Found error trace [2021-12-06 23:37:13,867 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-06 23:37:13,867 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2021-12-06 23:37:13,867 INFO L402 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr30REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 81 more)] === [2021-12-06 23:37:13,868 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-06 23:37:13,868 INFO L85 PathProgramCache]: Analyzing trace with hash -1043484996, now seen corresponding path program 1 times [2021-12-06 23:37:13,868 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-06 23:37:13,868 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1517511696] [2021-12-06 23:37:13,868 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 23:37:13,868 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-06 23:37:13,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 23:37:13,915 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-06 23:37:13,916 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-06 23:37:13,916 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1517511696] [2021-12-06 23:37:13,916 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1517511696] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-06 23:37:13,916 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-06 23:37:13,916 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-12-06 23:37:13,916 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1891466100] [2021-12-06 23:37:13,916 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-06 23:37:13,917 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-12-06 23:37:13,917 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-06 23:37:13,917 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-12-06 23:37:13,917 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-12-06 23:37:13,917 INFO L87 Difference]: Start difference. First operand 139 states and 148 transitions. Second operand has 6 states, 5 states have (on average 5.0) internal successors, (25), 6 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-06 23:37:14,025 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-06 23:37:14,026 INFO L93 Difference]: Finished difference Result 200 states and 212 transitions. [2021-12-06 23:37:14,026 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-12-06 23:37:14,026 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 5.0) internal successors, (25), 6 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-06 23:37:14,026 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-06 23:37:14,027 INFO L225 Difference]: With dead ends: 200 [2021-12-06 23:37:14,027 INFO L226 Difference]: Without dead ends: 200 [2021-12-06 23:37:14,027 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2021-12-06 23:37:14,028 INFO L933 BasicCegarLoop]: 92 mSDtfsCounter, 478 mSDsluCounter, 80 mSDsCounter, 0 mSdLazyCounter, 216 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 478 SdHoareTripleChecker+Valid, 172 SdHoareTripleChecker+Invalid, 223 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 216 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-06 23:37:14,028 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [478 Valid, 172 Invalid, 223 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 216 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-06 23:37:14,028 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 200 states. [2021-12-06 23:37:14,030 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 200 to 137. [2021-12-06 23:37:14,030 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 137 states, 84 states have (on average 1.7380952380952381) internal successors, (146), 136 states have internal predecessors, (146), 0 states have call successors, (0), 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-06 23:37:14,031 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 137 states to 137 states and 146 transitions. [2021-12-06 23:37:14,031 INFO L78 Accepts]: Start accepts. Automaton has 137 states and 146 transitions. Word has length 25 [2021-12-06 23:37:14,031 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-06 23:37:14,031 INFO L470 AbstractCegarLoop]: Abstraction has 137 states and 146 transitions. [2021-12-06 23:37:14,031 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 5.0) internal successors, (25), 6 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-06 23:37:14,031 INFO L276 IsEmpty]: Start isEmpty. Operand 137 states and 146 transitions. [2021-12-06 23:37:14,031 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2021-12-06 23:37:14,032 INFO L506 BasicCegarLoop]: Found error trace [2021-12-06 23:37:14,032 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-06 23:37:14,032 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2021-12-06 23:37:14,032 INFO L402 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr31REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 81 more)] === [2021-12-06 23:37:14,032 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-06 23:37:14,032 INFO L85 PathProgramCache]: Analyzing trace with hash -1043484995, now seen corresponding path program 1 times [2021-12-06 23:37:14,032 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-06 23:37:14,032 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1476489909] [2021-12-06 23:37:14,032 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 23:37:14,032 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-06 23:37:14,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 23:37:14,089 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-06 23:37:14,090 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-06 23:37:14,090 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1476489909] [2021-12-06 23:37:14,090 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1476489909] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-06 23:37:14,090 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-06 23:37:14,090 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-12-06 23:37:14,090 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [563116269] [2021-12-06 23:37:14,090 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-06 23:37:14,090 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-12-06 23:37:14,090 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-06 23:37:14,091 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-12-06 23:37:14,091 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2021-12-06 23:37:14,091 INFO L87 Difference]: Start difference. First operand 137 states and 146 transitions. Second operand has 7 states, 6 states have (on average 4.166666666666667) internal successors, (25), 7 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-06 23:37:14,228 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-06 23:37:14,229 INFO L93 Difference]: Finished difference Result 171 states and 181 transitions. [2021-12-06 23:37:14,229 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-12-06 23:37:14,229 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 4.166666666666667) internal successors, (25), 7 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-06 23:37:14,229 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-06 23:37:14,230 INFO L225 Difference]: With dead ends: 171 [2021-12-06 23:37:14,230 INFO L226 Difference]: Without dead ends: 171 [2021-12-06 23:37:14,230 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2021-12-06 23:37:14,230 INFO L933 BasicCegarLoop]: 102 mSDtfsCounter, 625 mSDsluCounter, 32 mSDsCounter, 0 mSdLazyCounter, 147 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 625 SdHoareTripleChecker+Valid, 134 SdHoareTripleChecker+Invalid, 155 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 147 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-06 23:37:14,231 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [625 Valid, 134 Invalid, 155 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 147 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-06 23:37:14,231 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 171 states. [2021-12-06 23:37:14,234 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 171 to 135. [2021-12-06 23:37:14,234 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 135 states, 84 states have (on average 1.7142857142857142) internal successors, (144), 134 states have internal predecessors, (144), 0 states have call successors, (0), 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-06 23:37:14,234 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 135 states to 135 states and 144 transitions. [2021-12-06 23:37:14,235 INFO L78 Accepts]: Start accepts. Automaton has 135 states and 144 transitions. Word has length 25 [2021-12-06 23:37:14,235 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-06 23:37:14,235 INFO L470 AbstractCegarLoop]: Abstraction has 135 states and 144 transitions. [2021-12-06 23:37:14,235 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 4.166666666666667) internal successors, (25), 7 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-06 23:37:14,235 INFO L276 IsEmpty]: Start isEmpty. Operand 135 states and 144 transitions. [2021-12-06 23:37:14,236 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2021-12-06 23:37:14,236 INFO L506 BasicCegarLoop]: Found error trace [2021-12-06 23:37:14,236 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-06 23:37:14,236 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2021-12-06 23:37:14,237 INFO L402 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr68REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 81 more)] === [2021-12-06 23:37:14,237 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-06 23:37:14,237 INFO L85 PathProgramCache]: Analyzing trace with hash 2011706153, now seen corresponding path program 1 times [2021-12-06 23:37:14,237 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-06 23:37:14,237 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1453299195] [2021-12-06 23:37:14,238 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 23:37:14,238 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-06 23:37:14,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 23:37:14,283 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-06 23:37:14,283 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-06 23:37:14,283 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1453299195] [2021-12-06 23:37:14,284 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1453299195] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-06 23:37:14,284 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-06 23:37:14,284 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-12-06 23:37:14,284 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1346121691] [2021-12-06 23:37:14,284 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-06 23:37:14,284 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-12-06 23:37:14,284 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-06 23:37:14,285 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-12-06 23:37:14,285 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-12-06 23:37:14,285 INFO L87 Difference]: Start difference. First operand 135 states and 144 transitions. Second operand has 6 states, 5 states have (on average 5.2) internal successors, (26), 6 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-06 23:37:14,401 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-06 23:37:14,402 INFO L93 Difference]: Finished difference Result 156 states and 166 transitions. [2021-12-06 23:37:14,402 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-12-06 23:37:14,402 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 5.2) internal successors, (26), 6 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-06 23:37:14,402 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-06 23:37:14,403 INFO L225 Difference]: With dead ends: 156 [2021-12-06 23:37:14,403 INFO L226 Difference]: Without dead ends: 156 [2021-12-06 23:37:14,403 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2021-12-06 23:37:14,407 INFO L933 BasicCegarLoop]: 68 mSDtfsCounter, 384 mSDsluCounter, 96 mSDsCounter, 0 mSdLazyCounter, 221 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 384 SdHoareTripleChecker+Valid, 164 SdHoareTripleChecker+Invalid, 235 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 221 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-06 23:37:14,408 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [384 Valid, 164 Invalid, 235 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 221 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-06 23:37:14,408 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 156 states. [2021-12-06 23:37:14,410 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 156 to 132. [2021-12-06 23:37:14,410 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 132 states, 85 states have (on average 1.6705882352941177) internal successors, (142), 131 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-06 23:37:14,410 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 132 states to 132 states and 142 transitions. [2021-12-06 23:37:14,411 INFO L78 Accepts]: Start accepts. Automaton has 132 states and 142 transitions. Word has length 26 [2021-12-06 23:37:14,411 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-06 23:37:14,411 INFO L470 AbstractCegarLoop]: Abstraction has 132 states and 142 transitions. [2021-12-06 23:37:14,411 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 5.2) internal successors, (26), 6 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-06 23:37:14,411 INFO L276 IsEmpty]: Start isEmpty. Operand 132 states and 142 transitions. [2021-12-06 23:37:14,411 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2021-12-06 23:37:14,411 INFO L506 BasicCegarLoop]: Found error trace [2021-12-06 23:37:14,411 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-06 23:37:14,412 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2021-12-06 23:37:14,412 INFO L402 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr69REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 81 more)] === [2021-12-06 23:37:14,412 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-06 23:37:14,412 INFO L85 PathProgramCache]: Analyzing trace with hash 2011706154, now seen corresponding path program 1 times [2021-12-06 23:37:14,412 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-06 23:37:14,412 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [874238026] [2021-12-06 23:37:14,412 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 23:37:14,412 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-06 23:37:14,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 23:37:14,466 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-06 23:37:14,466 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-06 23:37:14,466 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [874238026] [2021-12-06 23:37:14,466 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [874238026] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-06 23:37:14,466 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-06 23:37:14,466 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-12-06 23:37:14,467 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1532614187] [2021-12-06 23:37:14,467 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-06 23:37:14,467 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-12-06 23:37:14,467 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-06 23:37:14,467 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-12-06 23:37:14,467 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2021-12-06 23:37:14,467 INFO L87 Difference]: Start difference. First operand 132 states and 142 transitions. Second operand has 7 states, 6 states have (on average 4.333333333333333) internal successors, (26), 7 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-06 23:37:14,583 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-06 23:37:14,583 INFO L93 Difference]: Finished difference Result 127 states and 136 transitions. [2021-12-06 23:37:14,584 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-12-06 23:37:14,584 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 4.333333333333333) internal successors, (26), 7 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-06 23:37:14,584 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-06 23:37:14,585 INFO L225 Difference]: With dead ends: 127 [2021-12-06 23:37:14,585 INFO L226 Difference]: Without dead ends: 127 [2021-12-06 23:37:14,585 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2021-12-06 23:37:14,585 INFO L933 BasicCegarLoop]: 67 mSDtfsCounter, 378 mSDsluCounter, 57 mSDsCounter, 0 mSdLazyCounter, 164 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 378 SdHoareTripleChecker+Valid, 124 SdHoareTripleChecker+Invalid, 173 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 164 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-06 23:37:14,585 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [378 Valid, 124 Invalid, 173 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 164 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-06 23:37:14,586 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 127 states. [2021-12-06 23:37:14,587 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 127 to 127. [2021-12-06 23:37:14,587 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 127 states, 85 states have (on average 1.6) internal successors, (136), 126 states have internal predecessors, (136), 0 states have call successors, (0), 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-06 23:37:14,588 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 127 states to 127 states and 136 transitions. [2021-12-06 23:37:14,588 INFO L78 Accepts]: Start accepts. Automaton has 127 states and 136 transitions. Word has length 26 [2021-12-06 23:37:14,588 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-06 23:37:14,588 INFO L470 AbstractCegarLoop]: Abstraction has 127 states and 136 transitions. [2021-12-06 23:37:14,588 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 4.333333333333333) internal successors, (26), 7 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-06 23:37:14,588 INFO L276 IsEmpty]: Start isEmpty. Operand 127 states and 136 transitions. [2021-12-06 23:37:14,589 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2021-12-06 23:37:14,589 INFO L506 BasicCegarLoop]: Found error trace [2021-12-06 23:37:14,589 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, 1] [2021-12-06 23:37:14,589 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2021-12-06 23:37:14,589 INFO L402 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr32REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 81 more)] === [2021-12-06 23:37:14,589 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-06 23:37:14,589 INFO L85 PathProgramCache]: Analyzing trace with hash -2061699999, now seen corresponding path program 1 times [2021-12-06 23:37:14,589 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-06 23:37:14,590 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [620586215] [2021-12-06 23:37:14,590 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 23:37:14,590 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-06 23:37:14,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 23:37:14,844 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-06 23:37:14,845 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-06 23:37:14,845 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [620586215] [2021-12-06 23:37:14,845 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [620586215] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-06 23:37:14,845 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-06 23:37:14,845 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [20] imperfect sequences [] total 20 [2021-12-06 23:37:14,845 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [229564551] [2021-12-06 23:37:14,845 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-06 23:37:14,846 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2021-12-06 23:37:14,846 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-06 23:37:14,846 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2021-12-06 23:37:14,846 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=360, Unknown=0, NotChecked=0, Total=420 [2021-12-06 23:37:14,847 INFO L87 Difference]: Start difference. First operand 127 states and 136 transitions. Second operand has 21 states, 20 states have (on average 1.35) internal successors, (27), 21 states have internal predecessors, (27), 0 states have call successors, (0), 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-06 23:37:15,452 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-06 23:37:15,452 INFO L93 Difference]: Finished difference Result 209 states and 226 transitions. [2021-12-06 23:37:15,452 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2021-12-06 23:37:15,452 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 20 states have (on average 1.35) internal successors, (27), 21 states have internal predecessors, (27), 0 states have call successors, (0), 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 27 [2021-12-06 23:37:15,452 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-06 23:37:15,453 INFO L225 Difference]: With dead ends: 209 [2021-12-06 23:37:15,453 INFO L226 Difference]: Without dead ends: 209 [2021-12-06 23:37:15,454 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 218 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=225, Invalid=1181, Unknown=0, NotChecked=0, Total=1406 [2021-12-06 23:37:15,454 INFO L933 BasicCegarLoop]: 80 mSDtfsCounter, 562 mSDsluCounter, 996 mSDsCounter, 0 mSdLazyCounter, 1063 mSolverCounterSat, 59 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 562 SdHoareTripleChecker+Valid, 1076 SdHoareTripleChecker+Invalid, 1122 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 59 IncrementalHoareTripleChecker+Valid, 1063 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2021-12-06 23:37:15,455 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [562 Valid, 1076 Invalid, 1122 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [59 Valid, 1063 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2021-12-06 23:37:15,455 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 209 states. [2021-12-06 23:37:15,457 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 209 to 128. [2021-12-06 23:37:15,457 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 128 states, 90 states have (on average 1.5444444444444445) internal successors, (139), 127 states have internal predecessors, (139), 0 states have call successors, (0), 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-06 23:37:15,458 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 128 states to 128 states and 139 transitions. [2021-12-06 23:37:15,458 INFO L78 Accepts]: Start accepts. Automaton has 128 states and 139 transitions. Word has length 27 [2021-12-06 23:37:15,458 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-06 23:37:15,458 INFO L470 AbstractCegarLoop]: Abstraction has 128 states and 139 transitions. [2021-12-06 23:37:15,458 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 20 states have (on average 1.35) internal successors, (27), 21 states have internal predecessors, (27), 0 states have call successors, (0), 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-06 23:37:15,458 INFO L276 IsEmpty]: Start isEmpty. Operand 128 states and 139 transitions. [2021-12-06 23:37:15,458 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2021-12-06 23:37:15,459 INFO L506 BasicCegarLoop]: Found error trace [2021-12-06 23:37:15,459 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, 1] [2021-12-06 23:37:15,459 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2021-12-06 23:37:15,459 INFO L402 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr33REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 81 more)] === [2021-12-06 23:37:15,459 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-06 23:37:15,459 INFO L85 PathProgramCache]: Analyzing trace with hash -2061699998, now seen corresponding path program 1 times [2021-12-06 23:37:15,460 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-06 23:37:15,460 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [715456169] [2021-12-06 23:37:15,460 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 23:37:15,460 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-06 23:37:15,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 23:37:15,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-06 23:37:15,830 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-06 23:37:15,831 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [715456169] [2021-12-06 23:37:15,831 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [715456169] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-06 23:37:15,831 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-06 23:37:15,831 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [21] imperfect sequences [] total 21 [2021-12-06 23:37:15,831 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1941772260] [2021-12-06 23:37:15,831 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-06 23:37:15,831 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2021-12-06 23:37:15,832 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-06 23:37:15,832 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2021-12-06 23:37:15,832 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=399, Unknown=0, NotChecked=0, Total=462 [2021-12-06 23:37:15,832 INFO L87 Difference]: Start difference. First operand 128 states and 139 transitions. Second operand has 22 states, 21 states have (on average 1.2857142857142858) internal successors, (27), 22 states have internal predecessors, (27), 0 states have call successors, (0), 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-06 23:37:16,587 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-06 23:37:16,587 INFO L93 Difference]: Finished difference Result 281 states and 306 transitions. [2021-12-06 23:37:16,588 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2021-12-06 23:37:16,588 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 21 states have (on average 1.2857142857142858) internal successors, (27), 22 states have internal predecessors, (27), 0 states have call successors, (0), 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 27 [2021-12-06 23:37:16,588 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-06 23:37:16,589 INFO L225 Difference]: With dead ends: 281 [2021-12-06 23:37:16,589 INFO L226 Difference]: Without dead ends: 281 [2021-12-06 23:37:16,589 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 245 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=243, Invalid=1317, Unknown=0, NotChecked=0, Total=1560 [2021-12-06 23:37:16,590 INFO L933 BasicCegarLoop]: 80 mSDtfsCounter, 886 mSDsluCounter, 1025 mSDsCounter, 0 mSdLazyCounter, 1002 mSolverCounterSat, 73 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 886 SdHoareTripleChecker+Valid, 1105 SdHoareTripleChecker+Invalid, 1075 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 73 IncrementalHoareTripleChecker+Valid, 1002 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2021-12-06 23:37:16,590 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [886 Valid, 1105 Invalid, 1075 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [73 Valid, 1002 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2021-12-06 23:37:16,591 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 281 states. [2021-12-06 23:37:16,593 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 281 to 166. [2021-12-06 23:37:16,593 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 166 states, 128 states have (on average 1.625) internal successors, (208), 165 states have internal predecessors, (208), 0 states have call successors, (0), 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-06 23:37:16,594 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 166 states to 166 states and 208 transitions. [2021-12-06 23:37:16,594 INFO L78 Accepts]: Start accepts. Automaton has 166 states and 208 transitions. Word has length 27 [2021-12-06 23:37:16,594 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-06 23:37:16,594 INFO L470 AbstractCegarLoop]: Abstraction has 166 states and 208 transitions. [2021-12-06 23:37:16,594 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 21 states have (on average 1.2857142857142858) internal successors, (27), 22 states have internal predecessors, (27), 0 states have call successors, (0), 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-06 23:37:16,594 INFO L276 IsEmpty]: Start isEmpty. Operand 166 states and 208 transitions. [2021-12-06 23:37:16,595 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2021-12-06 23:37:16,595 INFO L506 BasicCegarLoop]: Found error trace [2021-12-06 23:37:16,595 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, 1, 1, 1] [2021-12-06 23:37:16,595 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2021-12-06 23:37:16,595 INFO L402 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr82ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 81 more)] === [2021-12-06 23:37:16,595 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-06 23:37:16,595 INFO L85 PathProgramCache]: Analyzing trace with hash -1235458799, now seen corresponding path program 1 times [2021-12-06 23:37:16,595 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-06 23:37:16,595 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1720080334] [2021-12-06 23:37:16,595 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 23:37:16,596 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-06 23:37:16,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 23:37:16,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-06 23:37:16,642 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-06 23:37:16,642 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1720080334] [2021-12-06 23:37:16,642 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1720080334] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-06 23:37:16,642 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-06 23:37:16,642 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-12-06 23:37:16,642 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [438021485] [2021-12-06 23:37:16,643 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-06 23:37:16,643 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-12-06 23:37:16,643 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-06 23:37:16,643 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-12-06 23:37:16,643 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-12-06 23:37:16,643 INFO L87 Difference]: Start difference. First operand 166 states and 208 transitions. Second operand has 6 states, 5 states have (on average 5.8) internal successors, (29), 6 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 23:37:16,683 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-06 23:37:16,683 INFO L93 Difference]: Finished difference Result 165 states and 207 transitions. [2021-12-06 23:37:16,684 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-12-06 23:37:16,684 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 5.8) internal successors, (29), 6 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 29 [2021-12-06 23:37:16,684 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-06 23:37:16,686 INFO L225 Difference]: With dead ends: 165 [2021-12-06 23:37:16,686 INFO L226 Difference]: Without dead ends: 165 [2021-12-06 23:37:16,686 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2021-12-06 23:37:16,687 INFO L933 BasicCegarLoop]: 106 mSDtfsCounter, 345 mSDsluCounter, 106 mSDsCounter, 0 mSdLazyCounter, 66 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 345 SdHoareTripleChecker+Valid, 212 SdHoareTripleChecker+Invalid, 66 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 66 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-06 23:37:16,687 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [345 Valid, 212 Invalid, 66 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 66 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-06 23:37:16,688 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 165 states. [2021-12-06 23:37:16,692 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 165 to 165. [2021-12-06 23:37:16,692 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 165 states, 128 states have (on average 1.6171875) internal successors, (207), 164 states have internal predecessors, (207), 0 states have call successors, (0), 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-06 23:37:16,693 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 165 states to 165 states and 207 transitions. [2021-12-06 23:37:16,693 INFO L78 Accepts]: Start accepts. Automaton has 165 states and 207 transitions. Word has length 29 [2021-12-06 23:37:16,693 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-06 23:37:16,693 INFO L470 AbstractCegarLoop]: Abstraction has 165 states and 207 transitions. [2021-12-06 23:37:16,693 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 5.8) internal successors, (29), 6 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 23:37:16,694 INFO L276 IsEmpty]: Start isEmpty. Operand 165 states and 207 transitions. [2021-12-06 23:37:16,694 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2021-12-06 23:37:16,694 INFO L506 BasicCegarLoop]: Found error trace [2021-12-06 23:37:16,694 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, 1, 1, 1, 1, 1] [2021-12-06 23:37:16,694 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2021-12-06 23:37:16,694 INFO L402 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr74REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 81 more)] === [2021-12-06 23:37:16,695 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-06 23:37:16,695 INFO L85 PathProgramCache]: Analyzing trace with hash -1863814087, now seen corresponding path program 1 times [2021-12-06 23:37:16,695 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-06 23:37:16,695 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1409281669] [2021-12-06 23:37:16,695 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 23:37:16,695 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-06 23:37:16,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 23:37:16,936 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-06 23:37:16,936 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-06 23:37:16,937 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1409281669] [2021-12-06 23:37:16,937 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1409281669] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-06 23:37:16,937 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-06 23:37:16,937 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [19] imperfect sequences [] total 19 [2021-12-06 23:37:16,937 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [346069012] [2021-12-06 23:37:16,937 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-06 23:37:16,937 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2021-12-06 23:37:16,937 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-06 23:37:16,938 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2021-12-06 23:37:16,938 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=322, Unknown=0, NotChecked=0, Total=380 [2021-12-06 23:37:16,938 INFO L87 Difference]: Start difference. First operand 165 states and 207 transitions. Second operand has 20 states, 19 states have (on average 1.631578947368421) internal successors, (31), 20 states have internal predecessors, (31), 0 states have call successors, (0), 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-06 23:37:17,382 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-06 23:37:17,383 INFO L93 Difference]: Finished difference Result 224 states and 272 transitions. [2021-12-06 23:37:17,383 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2021-12-06 23:37:17,383 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 19 states have (on average 1.631578947368421) internal successors, (31), 20 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 31 [2021-12-06 23:37:17,383 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-06 23:37:17,384 INFO L225 Difference]: With dead ends: 224 [2021-12-06 23:37:17,384 INFO L226 Difference]: Without dead ends: 224 [2021-12-06 23:37:17,384 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 196 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=208, Invalid=1052, Unknown=0, NotChecked=0, Total=1260 [2021-12-06 23:37:17,385 INFO L933 BasicCegarLoop]: 80 mSDtfsCounter, 424 mSDsluCounter, 824 mSDsCounter, 0 mSdLazyCounter, 740 mSolverCounterSat, 40 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 424 SdHoareTripleChecker+Valid, 904 SdHoareTripleChecker+Invalid, 780 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 40 IncrementalHoareTripleChecker+Valid, 740 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-12-06 23:37:17,385 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [424 Valid, 904 Invalid, 780 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [40 Valid, 740 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2021-12-06 23:37:17,385 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 224 states. [2021-12-06 23:37:17,388 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 224 to 172. [2021-12-06 23:37:17,388 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 172 states, 135 states have (on average 1.6) internal successors, (216), 171 states have internal predecessors, (216), 0 states have call successors, (0), 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-06 23:37:17,388 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 172 states to 172 states and 216 transitions. [2021-12-06 23:37:17,388 INFO L78 Accepts]: Start accepts. Automaton has 172 states and 216 transitions. Word has length 31 [2021-12-06 23:37:17,389 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-06 23:37:17,389 INFO L470 AbstractCegarLoop]: Abstraction has 172 states and 216 transitions. [2021-12-06 23:37:17,389 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 19 states have (on average 1.631578947368421) internal successors, (31), 20 states have internal predecessors, (31), 0 states have call successors, (0), 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-06 23:37:17,389 INFO L276 IsEmpty]: Start isEmpty. Operand 172 states and 216 transitions. [2021-12-06 23:37:17,389 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2021-12-06 23:37:17,389 INFO L506 BasicCegarLoop]: Found error trace [2021-12-06 23:37:17,389 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, 1, 1, 1, 1, 1] [2021-12-06 23:37:17,389 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2021-12-06 23:37:17,389 INFO L402 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr75REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 81 more)] === [2021-12-06 23:37:17,390 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-06 23:37:17,390 INFO L85 PathProgramCache]: Analyzing trace with hash -1863814086, now seen corresponding path program 1 times [2021-12-06 23:37:17,390 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-06 23:37:17,390 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [495368810] [2021-12-06 23:37:17,390 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 23:37:17,390 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-06 23:37:17,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 23:37:17,734 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-06 23:37:17,734 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-06 23:37:17,734 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [495368810] [2021-12-06 23:37:17,734 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [495368810] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-06 23:37:17,735 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-06 23:37:17,735 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [20] imperfect sequences [] total 20 [2021-12-06 23:37:17,735 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [715878035] [2021-12-06 23:37:17,735 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-06 23:37:17,735 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2021-12-06 23:37:17,735 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-06 23:37:17,736 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2021-12-06 23:37:17,736 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=359, Unknown=0, NotChecked=0, Total=420 [2021-12-06 23:37:17,736 INFO L87 Difference]: Start difference. First operand 172 states and 216 transitions. Second operand has 21 states, 20 states have (on average 1.55) internal successors, (31), 21 states have internal predecessors, (31), 0 states have call successors, (0), 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-06 23:37:18,391 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-06 23:37:18,391 INFO L93 Difference]: Finished difference Result 224 states and 272 transitions. [2021-12-06 23:37:18,391 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2021-12-06 23:37:18,391 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 20 states have (on average 1.55) internal successors, (31), 21 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 31 [2021-12-06 23:37:18,392 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-06 23:37:18,392 INFO L225 Difference]: With dead ends: 224 [2021-12-06 23:37:18,392 INFO L226 Difference]: Without dead ends: 224 [2021-12-06 23:37:18,393 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 219 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=225, Invalid=1181, Unknown=0, NotChecked=0, Total=1406 [2021-12-06 23:37:18,393 INFO L933 BasicCegarLoop]: 71 mSDtfsCounter, 365 mSDsluCounter, 865 mSDsCounter, 0 mSdLazyCounter, 930 mSolverCounterSat, 49 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 365 SdHoareTripleChecker+Valid, 936 SdHoareTripleChecker+Invalid, 979 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 49 IncrementalHoareTripleChecker+Valid, 930 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2021-12-06 23:37:18,394 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [365 Valid, 936 Invalid, 979 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [49 Valid, 930 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2021-12-06 23:37:18,394 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 224 states. [2021-12-06 23:37:18,396 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 224 to 172. [2021-12-06 23:37:18,396 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 172 states, 135 states have (on average 1.5925925925925926) internal successors, (215), 171 states have internal predecessors, (215), 0 states have call successors, (0), 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-06 23:37:18,397 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 172 states to 172 states and 215 transitions. [2021-12-06 23:37:18,397 INFO L78 Accepts]: Start accepts. Automaton has 172 states and 215 transitions. Word has length 31 [2021-12-06 23:37:18,397 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-06 23:37:18,397 INFO L470 AbstractCegarLoop]: Abstraction has 172 states and 215 transitions. [2021-12-06 23:37:18,397 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 20 states have (on average 1.55) internal successors, (31), 21 states have internal predecessors, (31), 0 states have call successors, (0), 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-06 23:37:18,397 INFO L276 IsEmpty]: Start isEmpty. Operand 172 states and 215 transitions. [2021-12-06 23:37:18,397 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2021-12-06 23:37:18,397 INFO L506 BasicCegarLoop]: Found error trace [2021-12-06 23:37:18,397 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, 1, 1, 1, 1, 1, 1] [2021-12-06 23:37:18,398 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2021-12-06 23:37:18,398 INFO L402 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr84ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 81 more)] === [2021-12-06 23:37:18,398 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-06 23:37:18,398 INFO L85 PathProgramCache]: Analyzing trace with hash -1978046457, now seen corresponding path program 1 times [2021-12-06 23:37:18,398 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-06 23:37:18,398 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1308326401] [2021-12-06 23:37:18,398 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 23:37:18,398 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-06 23:37:18,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 23:37:18,665 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-06 23:37:18,665 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-06 23:37:18,665 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1308326401] [2021-12-06 23:37:18,665 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1308326401] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-06 23:37:18,665 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-06 23:37:18,665 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [22] imperfect sequences [] total 22 [2021-12-06 23:37:18,666 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [772209664] [2021-12-06 23:37:18,666 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-06 23:37:18,666 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2021-12-06 23:37:18,666 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-06 23:37:18,666 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2021-12-06 23:37:18,667 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=79, Invalid=383, Unknown=0, NotChecked=0, Total=462 [2021-12-06 23:37:18,667 INFO L87 Difference]: Start difference. First operand 172 states and 215 transitions. Second operand has 22 states, 22 states have (on average 1.4545454545454546) internal successors, (32), 22 states have internal predecessors, (32), 0 states have call successors, (0), 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-06 23:37:19,139 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-06 23:37:19,139 INFO L93 Difference]: Finished difference Result 217 states and 265 transitions. [2021-12-06 23:37:19,140 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2021-12-06 23:37:19,140 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 22 states have (on average 1.4545454545454546) internal successors, (32), 22 states have internal predecessors, (32), 0 states have call successors, (0), 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 32 [2021-12-06 23:37:19,140 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-06 23:37:19,141 INFO L225 Difference]: With dead ends: 217 [2021-12-06 23:37:19,141 INFO L226 Difference]: Without dead ends: 217 [2021-12-06 23:37:19,141 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 185 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=218, Invalid=1042, Unknown=0, NotChecked=0, Total=1260 [2021-12-06 23:37:19,142 INFO L933 BasicCegarLoop]: 83 mSDtfsCounter, 267 mSDsluCounter, 1235 mSDsCounter, 0 mSdLazyCounter, 815 mSolverCounterSat, 47 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 267 SdHoareTripleChecker+Valid, 1318 SdHoareTripleChecker+Invalid, 862 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 47 IncrementalHoareTripleChecker+Valid, 815 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2021-12-06 23:37:19,142 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [267 Valid, 1318 Invalid, 862 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [47 Valid, 815 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2021-12-06 23:37:19,142 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 217 states. [2021-12-06 23:37:19,144 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 217 to 172. [2021-12-06 23:37:19,145 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 172 states, 135 states have (on average 1.5851851851851853) internal successors, (214), 171 states have internal predecessors, (214), 0 states have call successors, (0), 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-06 23:37:19,145 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 172 states to 172 states and 214 transitions. [2021-12-06 23:37:19,145 INFO L78 Accepts]: Start accepts. Automaton has 172 states and 214 transitions. Word has length 32 [2021-12-06 23:37:19,146 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-06 23:37:19,146 INFO L470 AbstractCegarLoop]: Abstraction has 172 states and 214 transitions. [2021-12-06 23:37:19,146 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 22 states have (on average 1.4545454545454546) internal successors, (32), 22 states have internal predecessors, (32), 0 states have call successors, (0), 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-06 23:37:19,146 INFO L276 IsEmpty]: Start isEmpty. Operand 172 states and 214 transitions. [2021-12-06 23:37:19,146 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2021-12-06 23:37:19,146 INFO L506 BasicCegarLoop]: Found error trace [2021-12-06 23:37:19,146 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, 1, 1, 1, 1, 1, 1, 1] [2021-12-06 23:37:19,146 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2021-12-06 23:37:19,146 INFO L402 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr38REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 81 more)] === [2021-12-06 23:37:19,147 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-06 23:37:19,147 INFO L85 PathProgramCache]: Analyzing trace with hash 190378255, now seen corresponding path program 1 times [2021-12-06 23:37:19,147 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-06 23:37:19,147 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [518324620] [2021-12-06 23:37:19,147 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 23:37:19,147 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-06 23:37:19,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 23:37:19,178 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-06 23:37:19,178 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-06 23:37:19,178 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [518324620] [2021-12-06 23:37:19,178 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [518324620] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-06 23:37:19,179 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-06 23:37:19,179 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-12-06 23:37:19,179 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [172334680] [2021-12-06 23:37:19,179 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-06 23:37:19,179 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-12-06 23:37:19,179 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-06 23:37:19,180 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-12-06 23:37:19,180 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-12-06 23:37:19,180 INFO L87 Difference]: Start difference. First operand 172 states and 214 transitions. Second operand has 4 states, 3 states have (on average 11.0) internal successors, (33), 4 states have internal predecessors, (33), 0 states have call successors, (0), 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-06 23:37:19,270 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-06 23:37:19,270 INFO L93 Difference]: Finished difference Result 189 states and 229 transitions. [2021-12-06 23:37:19,270 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-12-06 23:37:19,271 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 11.0) internal successors, (33), 4 states have internal predecessors, (33), 0 states have call successors, (0), 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 33 [2021-12-06 23:37:19,271 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-06 23:37:19,272 INFO L225 Difference]: With dead ends: 189 [2021-12-06 23:37:19,272 INFO L226 Difference]: Without dead ends: 189 [2021-12-06 23:37:19,272 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 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-06 23:37:19,273 INFO L933 BasicCegarLoop]: 104 mSDtfsCounter, 169 mSDsluCounter, 46 mSDsCounter, 0 mSdLazyCounter, 126 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 169 SdHoareTripleChecker+Valid, 150 SdHoareTripleChecker+Invalid, 133 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 126 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-06 23:37:19,273 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [169 Valid, 150 Invalid, 133 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 126 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-06 23:37:19,274 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 189 states. [2021-12-06 23:37:19,276 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 189 to 170. [2021-12-06 23:37:19,277 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 170 states, 137 states have (on average 1.532846715328467) internal successors, (210), 169 states have internal predecessors, (210), 0 states have call successors, (0), 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-06 23:37:19,278 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 170 states to 170 states and 210 transitions. [2021-12-06 23:37:19,278 INFO L78 Accepts]: Start accepts. Automaton has 170 states and 210 transitions. Word has length 33 [2021-12-06 23:37:19,278 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-06 23:37:19,278 INFO L470 AbstractCegarLoop]: Abstraction has 170 states and 210 transitions. [2021-12-06 23:37:19,279 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 11.0) internal successors, (33), 4 states have internal predecessors, (33), 0 states have call successors, (0), 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-06 23:37:19,279 INFO L276 IsEmpty]: Start isEmpty. Operand 170 states and 210 transitions. [2021-12-06 23:37:19,279 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2021-12-06 23:37:19,279 INFO L506 BasicCegarLoop]: Found error trace [2021-12-06 23:37:19,279 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, 1, 1, 1, 1, 1, 1, 1] [2021-12-06 23:37:19,279 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2021-12-06 23:37:19,279 INFO L402 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr39REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 81 more)] === [2021-12-06 23:37:19,280 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-06 23:37:19,280 INFO L85 PathProgramCache]: Analyzing trace with hash 190378256, now seen corresponding path program 1 times [2021-12-06 23:37:19,280 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-06 23:37:19,280 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [72030966] [2021-12-06 23:37:19,280 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 23:37:19,280 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-06 23:37:19,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 23:37:19,596 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-06 23:37:19,596 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-06 23:37:19,596 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [72030966] [2021-12-06 23:37:19,596 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [72030966] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-06 23:37:19,596 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-06 23:37:19,596 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [24] imperfect sequences [] total 24 [2021-12-06 23:37:19,596 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [938868199] [2021-12-06 23:37:19,596 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-06 23:37:19,596 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2021-12-06 23:37:19,597 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-06 23:37:19,597 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2021-12-06 23:37:19,597 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=86, Invalid=514, Unknown=0, NotChecked=0, Total=600 [2021-12-06 23:37:19,597 INFO L87 Difference]: Start difference. First operand 170 states and 210 transitions. Second operand has 25 states, 24 states have (on average 1.375) internal successors, (33), 25 states have internal predecessors, (33), 0 states have call successors, (0), 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-06 23:37:20,170 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-06 23:37:20,170 INFO L93 Difference]: Finished difference Result 282 states and 313 transitions. [2021-12-06 23:37:20,170 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2021-12-06 23:37:20,170 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 24 states have (on average 1.375) internal successors, (33), 25 states have internal predecessors, (33), 0 states have call successors, (0), 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 33 [2021-12-06 23:37:20,170 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-06 23:37:20,171 INFO L225 Difference]: With dead ends: 282 [2021-12-06 23:37:20,171 INFO L226 Difference]: Without dead ends: 282 [2021-12-06 23:37:20,172 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 266 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=273, Invalid=1449, Unknown=0, NotChecked=0, Total=1722 [2021-12-06 23:37:20,172 INFO L933 BasicCegarLoop]: 81 mSDtfsCounter, 1007 mSDsluCounter, 945 mSDsCounter, 0 mSdLazyCounter, 885 mSolverCounterSat, 76 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1007 SdHoareTripleChecker+Valid, 1026 SdHoareTripleChecker+Invalid, 961 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 76 IncrementalHoareTripleChecker+Valid, 885 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2021-12-06 23:37:20,173 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1007 Valid, 1026 Invalid, 961 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [76 Valid, 885 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2021-12-06 23:37:20,173 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 282 states. [2021-12-06 23:37:20,176 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 282 to 183. [2021-12-06 23:37:20,176 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 183 states, 150 states have (on average 1.5333333333333334) internal successors, (230), 182 states have internal predecessors, (230), 0 states have call successors, (0), 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-06 23:37:20,177 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 183 states to 183 states and 230 transitions. [2021-12-06 23:37:20,177 INFO L78 Accepts]: Start accepts. Automaton has 183 states and 230 transitions. Word has length 33 [2021-12-06 23:37:20,178 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-06 23:37:20,178 INFO L470 AbstractCegarLoop]: Abstraction has 183 states and 230 transitions. [2021-12-06 23:37:20,178 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 24 states have (on average 1.375) internal successors, (33), 25 states have internal predecessors, (33), 0 states have call successors, (0), 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-06 23:37:20,178 INFO L276 IsEmpty]: Start isEmpty. Operand 183 states and 230 transitions. [2021-12-06 23:37:20,178 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2021-12-06 23:37:20,178 INFO L506 BasicCegarLoop]: Found error trace [2021-12-06 23:37:20,178 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, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-06 23:37:20,179 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2021-12-06 23:37:20,179 INFO L402 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr78ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 81 more)] === [2021-12-06 23:37:20,179 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-06 23:37:20,179 INFO L85 PathProgramCache]: Analyzing trace with hash 451934574, now seen corresponding path program 1 times [2021-12-06 23:37:20,179 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-06 23:37:20,179 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [891555307] [2021-12-06 23:37:20,179 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 23:37:20,180 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-06 23:37:20,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 23:37:20,533 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-06 23:37:20,533 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-06 23:37:20,533 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [891555307] [2021-12-06 23:37:20,533 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [891555307] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-06 23:37:20,534 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-06 23:37:20,534 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [21] imperfect sequences [] total 21 [2021-12-06 23:37:20,534 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [68947089] [2021-12-06 23:37:20,534 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-06 23:37:20,534 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2021-12-06 23:37:20,534 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-06 23:37:20,534 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2021-12-06 23:37:20,538 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=70, Invalid=392, Unknown=0, NotChecked=0, Total=462 [2021-12-06 23:37:20,539 INFO L87 Difference]: Start difference. First operand 183 states and 230 transitions. Second operand has 22 states, 21 states have (on average 1.619047619047619) internal successors, (34), 22 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 23:37:21,138 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-06 23:37:21,138 INFO L93 Difference]: Finished difference Result 238 states and 292 transitions. [2021-12-06 23:37:21,139 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2021-12-06 23:37:21,139 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 21 states have (on average 1.619047619047619) internal successors, (34), 22 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 34 [2021-12-06 23:37:21,139 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-06 23:37:21,140 INFO L225 Difference]: With dead ends: 238 [2021-12-06 23:37:21,140 INFO L226 Difference]: Without dead ends: 238 [2021-12-06 23:37:21,140 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 200 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=195, Invalid=1065, Unknown=0, NotChecked=0, Total=1260 [2021-12-06 23:37:21,141 INFO L933 BasicCegarLoop]: 82 mSDtfsCounter, 214 mSDsluCounter, 938 mSDsCounter, 0 mSdLazyCounter, 842 mSolverCounterSat, 38 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 214 SdHoareTripleChecker+Valid, 1020 SdHoareTripleChecker+Invalid, 880 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 38 IncrementalHoareTripleChecker+Valid, 842 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2021-12-06 23:37:21,141 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [214 Valid, 1020 Invalid, 880 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [38 Valid, 842 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2021-12-06 23:37:21,141 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 238 states. [2021-12-06 23:37:21,143 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 238 to 186. [2021-12-06 23:37:21,143 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 186 states, 153 states have (on average 1.522875816993464) internal successors, (233), 185 states have internal predecessors, (233), 0 states have call successors, (0), 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-06 23:37:21,144 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 186 states to 186 states and 233 transitions. [2021-12-06 23:37:21,144 INFO L78 Accepts]: Start accepts. Automaton has 186 states and 233 transitions. Word has length 34 [2021-12-06 23:37:21,144 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-06 23:37:21,144 INFO L470 AbstractCegarLoop]: Abstraction has 186 states and 233 transitions. [2021-12-06 23:37:21,144 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 21 states have (on average 1.619047619047619) internal successors, (34), 22 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 23:37:21,144 INFO L276 IsEmpty]: Start isEmpty. Operand 186 states and 233 transitions. [2021-12-06 23:37:21,144 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2021-12-06 23:37:21,145 INFO L506 BasicCegarLoop]: Found error trace [2021-12-06 23:37:21,145 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, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-06 23:37:21,145 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2021-12-06 23:37:21,145 INFO L402 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr32REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 81 more)] === [2021-12-06 23:37:21,145 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-06 23:37:21,145 INFO L85 PathProgramCache]: Analyzing trace with hash 1606811227, now seen corresponding path program 1 times [2021-12-06 23:37:21,145 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-06 23:37:21,145 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2061473487] [2021-12-06 23:37:21,145 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 23:37:21,145 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-06 23:37:21,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 23:37:21,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-06 23:37:21,846 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-06 23:37:21,846 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2061473487] [2021-12-06 23:37:21,846 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2061473487] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-06 23:37:21,847 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [549881378] [2021-12-06 23:37:21,847 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 23:37:21,847 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-06 23:37:21,847 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f9e8e85e-e410-4b7b-a9a1-8ec046b18135/bin/uautomizer-DrprNOufMa/z3 [2021-12-06 23:37:21,848 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f9e8e85e-e410-4b7b-a9a1-8ec046b18135/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-06 23:37:21,848 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f9e8e85e-e410-4b7b-a9a1-8ec046b18135/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2021-12-06 23:37:21,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 23:37:21,938 INFO L263 TraceCheckSpWp]: Trace formula consists of 310 conjuncts, 86 conjunts are in the unsatisfiable core [2021-12-06 23:37:21,944 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-06 23:37:21,994 INFO L354 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-12-06 23:37:21,995 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 19 treesize of output 18 [2021-12-06 23:37:22,040 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-06 23:37:22,106 INFO L354 Elim1Store]: treesize reduction 48, result has 36.0 percent of original size [2021-12-06 23:37:22,106 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 26 treesize of output 41 [2021-12-06 23:37:22,162 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-06 23:37:22,162 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 39 treesize of output 30 [2021-12-06 23:37:22,526 INFO L354 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-12-06 23:37:22,526 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 96 treesize of output 81 [2021-12-06 23:37:22,533 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 18 treesize of output 20 [2021-12-06 23:37:22,638 INFO L354 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-12-06 23:37:22,638 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 89 treesize of output 76 [2021-12-06 23:37:22,644 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 18 treesize of output 20 [2021-12-06 23:37:22,722 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-06 23:37:22,735 INFO L354 Elim1Store]: treesize reduction 78, result has 17.9 percent of original size [2021-12-06 23:37:22,735 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 94 treesize of output 61 [2021-12-06 23:37:22,740 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 93 treesize of output 89 [2021-12-06 23:37:23,042 INFO L354 Elim1Store]: treesize reduction 36, result has 23.4 percent of original size [2021-12-06 23:37:23,042 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 142 treesize of output 119 [2021-12-06 23:37:23,051 INFO L354 Elim1Store]: treesize reduction 27, result has 15.6 percent of original size [2021-12-06 23:37:23,051 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 95 treesize of output 91 [2021-12-06 23:37:23,088 INFO L354 Elim1Store]: treesize reduction 36, result has 23.4 percent of original size [2021-12-06 23:37:23,088 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 133 treesize of output 112 [2021-12-06 23:37:23,097 INFO L354 Elim1Store]: treesize reduction 27, result has 15.6 percent of original size [2021-12-06 23:37:23,097 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 95 treesize of output 91 [2021-12-06 23:37:23,133 INFO L354 Elim1Store]: treesize reduction 36, result has 23.4 percent of original size [2021-12-06 23:37:23,133 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 124 treesize of output 105 [2021-12-06 23:37:23,141 INFO L354 Elim1Store]: treesize reduction 27, result has 15.6 percent of original size [2021-12-06 23:37:23,141 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 95 treesize of output 91 [2021-12-06 23:37:23,353 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 88 treesize of output 68 [2021-12-06 23:37:23,606 INFO L354 Elim1Store]: treesize reduction 28, result has 3.4 percent of original size [2021-12-06 23:37:23,606 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 2 case distinctions, treesize of input 95 treesize of output 32 [2021-12-06 23:37:23,735 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-06 23:37:23,735 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-06 23:37:23,960 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1284 (Array Int Int)) (v_ArrVal_1283 (Array Int Int))) (= (select |c_#valid| (select (let ((.cse0 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_create_sl_with_head_and_tail_#t~mem11#1.base| v_ArrVal_1284))) (select .cse0 (select (select .cse0 |c_ULTIMATE.start_create_sl_with_head_and_tail_~sl~0#1.base|) |c_ULTIMATE.start_create_sl_with_head_and_tail_~sl~0#1.offset|))) (+ 8 (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_create_sl_with_head_and_tail_#t~mem11#1.base| v_ArrVal_1283) |c_ULTIMATE.start_create_sl_with_head_and_tail_~sl~0#1.base|) |c_ULTIMATE.start_create_sl_with_head_and_tail_~sl~0#1.offset|)))) 1)) is different from false [2021-12-06 23:37:24,135 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1280 (Array Int Int)) (v_ArrVal_1279 (Array Int Int)) (v_ArrVal_1284 (Array Int Int)) (v_ArrVal_1283 (Array Int Int)) (v_ArrVal_1282 (Array Int Int)) (v_ArrVal_1281 (Array Int Int))) (= (select |c_#valid| (select (let ((.cse0 (store (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_create_sl_with_head_and_tail_#t~mem13#1.base| v_ArrVal_1279) |c_ULTIMATE.start_create_sl_with_head_and_tail_#t~mem12#1.base| v_ArrVal_1282) |c_ULTIMATE.start_create_sl_with_head_and_tail_#t~mem11#1.base| v_ArrVal_1284))) (select .cse0 (select (select .cse0 |c_ULTIMATE.start_create_sl_with_head_and_tail_~sl~0#1.base|) |c_ULTIMATE.start_create_sl_with_head_and_tail_~sl~0#1.offset|))) (+ (select (select (store (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_create_sl_with_head_and_tail_#t~mem13#1.base| v_ArrVal_1280) |c_ULTIMATE.start_create_sl_with_head_and_tail_#t~mem12#1.base| v_ArrVal_1281) |c_ULTIMATE.start_create_sl_with_head_and_tail_#t~mem11#1.base| v_ArrVal_1283) |c_ULTIMATE.start_create_sl_with_head_and_tail_~sl~0#1.base|) |c_ULTIMATE.start_create_sl_with_head_and_tail_~sl~0#1.offset|) 8))) 1)) is different from false [2021-12-06 23:37:24,144 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1280 (Array Int Int)) (v_ArrVal_1279 (Array Int Int)) (v_ArrVal_1284 (Array Int Int)) (v_ArrVal_1283 (Array Int Int)) (v_ArrVal_1282 (Array Int Int)) (v_ArrVal_1281 (Array Int Int))) (= (select |c_#valid| (let ((.cse1 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_create_sl_with_head_and_tail_~sl~0#1.base|) (+ 4 |c_ULTIMATE.start_create_sl_with_head_and_tail_~sl~0#1.offset|)))) (select (let ((.cse0 (store (store (store |c_#memory_$Pointer$.base| .cse1 v_ArrVal_1279) |c_ULTIMATE.start_create_sl_with_head_and_tail_#t~mem12#1.base| v_ArrVal_1282) |c_ULTIMATE.start_create_sl_with_head_and_tail_#t~mem11#1.base| v_ArrVal_1284))) (select .cse0 (select (select .cse0 |c_ULTIMATE.start_create_sl_with_head_and_tail_~sl~0#1.base|) |c_ULTIMATE.start_create_sl_with_head_and_tail_~sl~0#1.offset|))) (+ 8 (select (select (store (store (store |c_#memory_$Pointer$.offset| .cse1 v_ArrVal_1280) |c_ULTIMATE.start_create_sl_with_head_and_tail_#t~mem12#1.base| v_ArrVal_1281) |c_ULTIMATE.start_create_sl_with_head_and_tail_#t~mem11#1.base| v_ArrVal_1283) |c_ULTIMATE.start_create_sl_with_head_and_tail_~sl~0#1.base|) |c_ULTIMATE.start_create_sl_with_head_and_tail_~sl~0#1.offset|))))) 1)) is different from false [2021-12-06 23:37:24,152 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1284 (Array Int Int)) (v_ArrVal_1283 (Array Int Int)) (v_ArrVal_1282 (Array Int Int)) (v_ArrVal_1281 (Array Int Int))) (= (select |c_#valid| (let ((.cse1 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_create_sl_with_head_and_tail_~sl~0#1.base|) (+ 4 |c_ULTIMATE.start_create_sl_with_head_and_tail_~sl~0#1.offset|)))) (select (let ((.cse0 (store (store |c_#memory_$Pointer$.base| .cse1 v_ArrVal_1282) |c_ULTIMATE.start_create_sl_with_head_and_tail_#t~mem11#1.base| v_ArrVal_1284))) (select .cse0 (select (select .cse0 |c_ULTIMATE.start_create_sl_with_head_and_tail_~sl~0#1.base|) |c_ULTIMATE.start_create_sl_with_head_and_tail_~sl~0#1.offset|))) (+ (select (select (store (store |c_#memory_$Pointer$.offset| .cse1 v_ArrVal_1281) |c_ULTIMATE.start_create_sl_with_head_and_tail_#t~mem11#1.base| v_ArrVal_1283) |c_ULTIMATE.start_create_sl_with_head_and_tail_~sl~0#1.base|) |c_ULTIMATE.start_create_sl_with_head_and_tail_~sl~0#1.offset|) 8)))) 1)) is different from false [2021-12-06 23:37:24,159 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1284 (Array Int Int)) (v_ArrVal_1283 (Array Int Int))) (= (select |c_#valid| (let ((.cse1 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_create_sl_with_head_and_tail_~sl~0#1.base|) (+ 4 |c_ULTIMATE.start_create_sl_with_head_and_tail_~sl~0#1.offset|)))) (select (let ((.cse0 (store |c_#memory_$Pointer$.base| .cse1 v_ArrVal_1284))) (select .cse0 (select (select .cse0 |c_ULTIMATE.start_create_sl_with_head_and_tail_~sl~0#1.base|) |c_ULTIMATE.start_create_sl_with_head_and_tail_~sl~0#1.offset|))) (+ (select (select (store |c_#memory_$Pointer$.offset| .cse1 v_ArrVal_1283) |c_ULTIMATE.start_create_sl_with_head_and_tail_~sl~0#1.base|) |c_ULTIMATE.start_create_sl_with_head_and_tail_~sl~0#1.offset|) 8)))) 1)) is different from false [2021-12-06 23:37:24,172 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1278 (Array Int Int)) (v_ArrVal_1284 (Array Int Int)) (v_ArrVal_1283 (Array Int Int))) (= (select |c_#valid| (let ((.cse1 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_create_sl_with_head_and_tail_#t~mem7#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_create_sl_with_head_and_tail_#t~mem7#1.base|) (+ 8 |c_ULTIMATE.start_create_sl_with_head_and_tail_#t~mem7#1.offset|) |c_ULTIMATE.start_create_sl_with_head_and_tail_#t~mem10#1.base|)))) (let ((.cse2 (select (select .cse1 |c_ULTIMATE.start_create_sl_with_head_and_tail_~sl~0#1.base|) (+ 4 |c_ULTIMATE.start_create_sl_with_head_and_tail_~sl~0#1.offset|)))) (select (let ((.cse0 (store .cse1 .cse2 v_ArrVal_1284))) (select .cse0 (select (select .cse0 |c_ULTIMATE.start_create_sl_with_head_and_tail_~sl~0#1.base|) |c_ULTIMATE.start_create_sl_with_head_and_tail_~sl~0#1.offset|))) (+ (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_create_sl_with_head_and_tail_#t~mem7#1.base| v_ArrVal_1278) .cse2 v_ArrVal_1283) |c_ULTIMATE.start_create_sl_with_head_and_tail_~sl~0#1.base|) |c_ULTIMATE.start_create_sl_with_head_and_tail_~sl~0#1.offset|) 8))))) 1)) is different from false [2021-12-06 23:37:24,183 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1278 (Array Int Int)) (v_ArrVal_1275 (Array Int Int)) (v_ArrVal_1274 (Array Int Int)) (v_ArrVal_1284 (Array Int Int)) (v_ArrVal_1283 (Array Int Int))) (= 1 (select |c_#valid| (let ((.cse1 (let ((.cse3 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_create_sl_with_head_and_tail_#t~mem8#1.base| v_ArrVal_1275))) (store .cse3 |c_ULTIMATE.start_create_sl_with_head_and_tail_#t~mem7#1.base| (store (select .cse3 |c_ULTIMATE.start_create_sl_with_head_and_tail_#t~mem7#1.base|) (+ 8 |c_ULTIMATE.start_create_sl_with_head_and_tail_#t~mem7#1.offset|) |c_ULTIMATE.start_create_sl_with_head_and_tail_#t~mem10#1.base|))))) (let ((.cse2 (select (select .cse1 |c_ULTIMATE.start_create_sl_with_head_and_tail_~sl~0#1.base|) (+ 4 |c_ULTIMATE.start_create_sl_with_head_and_tail_~sl~0#1.offset|)))) (select (let ((.cse0 (store .cse1 .cse2 v_ArrVal_1284))) (select .cse0 (select (select .cse0 |c_ULTIMATE.start_create_sl_with_head_and_tail_~sl~0#1.base|) |c_ULTIMATE.start_create_sl_with_head_and_tail_~sl~0#1.offset|))) (+ (select (select (store (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_create_sl_with_head_and_tail_#t~mem8#1.base| v_ArrVal_1274) |c_ULTIMATE.start_create_sl_with_head_and_tail_#t~mem7#1.base| v_ArrVal_1278) .cse2 v_ArrVal_1283) |c_ULTIMATE.start_create_sl_with_head_and_tail_~sl~0#1.base|) |c_ULTIMATE.start_create_sl_with_head_and_tail_~sl~0#1.offset|) 8))))))) is different from false [2021-12-06 23:37:24,194 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1278 (Array Int Int)) (v_ArrVal_1275 (Array Int Int)) (v_ArrVal_1274 (Array Int Int)) (v_ArrVal_1273 (Array Int Int)) (v_ArrVal_1284 (Array Int Int)) (v_ArrVal_1272 (Array Int Int)) (v_ArrVal_1283 (Array Int Int))) (= (select |c_#valid| (let ((.cse1 (let ((.cse3 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_create_sl_with_head_and_tail_#t~mem9#1.base| v_ArrVal_1272) |c_ULTIMATE.start_create_sl_with_head_and_tail_#t~mem8#1.base| v_ArrVal_1275))) (store .cse3 |c_ULTIMATE.start_create_sl_with_head_and_tail_#t~mem7#1.base| (store (select .cse3 |c_ULTIMATE.start_create_sl_with_head_and_tail_#t~mem7#1.base|) (+ 8 |c_ULTIMATE.start_create_sl_with_head_and_tail_#t~mem7#1.offset|) |c_ULTIMATE.start_create_sl_with_head_and_tail_#t~mem10#1.base|))))) (let ((.cse2 (select (select .cse1 |c_ULTIMATE.start_create_sl_with_head_and_tail_~sl~0#1.base|) (+ 4 |c_ULTIMATE.start_create_sl_with_head_and_tail_~sl~0#1.offset|)))) (select (let ((.cse0 (store .cse1 .cse2 v_ArrVal_1284))) (select .cse0 (select (select .cse0 |c_ULTIMATE.start_create_sl_with_head_and_tail_~sl~0#1.base|) |c_ULTIMATE.start_create_sl_with_head_and_tail_~sl~0#1.offset|))) (+ (select (select (store (store (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_create_sl_with_head_and_tail_#t~mem9#1.base| v_ArrVal_1273) |c_ULTIMATE.start_create_sl_with_head_and_tail_#t~mem8#1.base| v_ArrVal_1274) |c_ULTIMATE.start_create_sl_with_head_and_tail_#t~mem7#1.base| v_ArrVal_1278) .cse2 v_ArrVal_1283) |c_ULTIMATE.start_create_sl_with_head_and_tail_~sl~0#1.base|) |c_ULTIMATE.start_create_sl_with_head_and_tail_~sl~0#1.offset|) 8))))) 1)) is different from false [2021-12-06 23:37:24,208 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1278 (Array Int Int)) (v_ArrVal_1275 (Array Int Int)) (v_ArrVal_1274 (Array Int Int)) (v_ArrVal_1273 (Array Int Int)) (v_ArrVal_1284 (Array Int Int)) (v_ArrVal_1272 (Array Int Int)) (v_ArrVal_1283 (Array Int Int))) (= (select |c_#valid| (let ((.cse3 (+ 4 |c_ULTIMATE.start_create_sl_with_head_and_tail_~sl~0#1.offset|))) (let ((.cse1 (let ((.cse4 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_create_sl_with_head_and_tail_#t~mem9#1.base| v_ArrVal_1272) |c_ULTIMATE.start_create_sl_with_head_and_tail_#t~mem8#1.base| v_ArrVal_1275))) (store .cse4 |c_ULTIMATE.start_create_sl_with_head_and_tail_#t~mem7#1.base| (store (select .cse4 |c_ULTIMATE.start_create_sl_with_head_and_tail_#t~mem7#1.base|) (+ 8 |c_ULTIMATE.start_create_sl_with_head_and_tail_#t~mem7#1.offset|) (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_create_sl_with_head_and_tail_~sl~0#1.base|) .cse3)))))) (let ((.cse2 (select (select .cse1 |c_ULTIMATE.start_create_sl_with_head_and_tail_~sl~0#1.base|) .cse3))) (select (let ((.cse0 (store .cse1 .cse2 v_ArrVal_1284))) (select .cse0 (select (select .cse0 |c_ULTIMATE.start_create_sl_with_head_and_tail_~sl~0#1.base|) |c_ULTIMATE.start_create_sl_with_head_and_tail_~sl~0#1.offset|))) (+ (select (select (store (store (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_create_sl_with_head_and_tail_#t~mem9#1.base| v_ArrVal_1273) |c_ULTIMATE.start_create_sl_with_head_and_tail_#t~mem8#1.base| v_ArrVal_1274) |c_ULTIMATE.start_create_sl_with_head_and_tail_#t~mem7#1.base| v_ArrVal_1278) .cse2 v_ArrVal_1283) |c_ULTIMATE.start_create_sl_with_head_and_tail_~sl~0#1.base|) |c_ULTIMATE.start_create_sl_with_head_and_tail_~sl~0#1.offset|) 8)))))) 1)) is different from false [2021-12-06 23:37:24,220 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1278 (Array Int Int)) (v_ArrVal_1275 (Array Int Int)) (v_ArrVal_1274 (Array Int Int)) (v_ArrVal_1273 (Array Int Int)) (v_ArrVal_1284 (Array Int Int)) (v_ArrVal_1272 (Array Int Int)) (v_ArrVal_1283 (Array Int Int))) (= (select |c_#valid| (let ((.cse6 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_create_sl_with_head_and_tail_~sl~0#1.base|))) (let ((.cse4 (+ 4 |c_ULTIMATE.start_create_sl_with_head_and_tail_~sl~0#1.offset|)) (.cse3 (select .cse6 |c_ULTIMATE.start_create_sl_with_head_and_tail_~sl~0#1.offset|))) (let ((.cse1 (let ((.cse5 (store (store |c_#memory_$Pointer$.base| .cse3 v_ArrVal_1272) |c_ULTIMATE.start_create_sl_with_head_and_tail_#t~mem8#1.base| v_ArrVal_1275))) (store .cse5 |c_ULTIMATE.start_create_sl_with_head_and_tail_#t~mem7#1.base| (store (select .cse5 |c_ULTIMATE.start_create_sl_with_head_and_tail_#t~mem7#1.base|) (+ 8 |c_ULTIMATE.start_create_sl_with_head_and_tail_#t~mem7#1.offset|) (select .cse6 .cse4)))))) (let ((.cse2 (select (select .cse1 |c_ULTIMATE.start_create_sl_with_head_and_tail_~sl~0#1.base|) .cse4))) (select (let ((.cse0 (store .cse1 .cse2 v_ArrVal_1284))) (select .cse0 (select (select .cse0 |c_ULTIMATE.start_create_sl_with_head_and_tail_~sl~0#1.base|) |c_ULTIMATE.start_create_sl_with_head_and_tail_~sl~0#1.offset|))) (+ (select (select (store (store (store (store |c_#memory_$Pointer$.offset| .cse3 v_ArrVal_1273) |c_ULTIMATE.start_create_sl_with_head_and_tail_#t~mem8#1.base| v_ArrVal_1274) |c_ULTIMATE.start_create_sl_with_head_and_tail_#t~mem7#1.base| v_ArrVal_1278) .cse2 v_ArrVal_1283) |c_ULTIMATE.start_create_sl_with_head_and_tail_~sl~0#1.base|) |c_ULTIMATE.start_create_sl_with_head_and_tail_~sl~0#1.offset|) 8))))))) 1)) is different from false [2021-12-06 23:37:24,233 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1278 (Array Int Int)) (v_ArrVal_1275 (Array Int Int)) (v_ArrVal_1274 (Array Int Int)) (v_ArrVal_1284 (Array Int Int)) (v_ArrVal_1283 (Array Int Int))) (= (select |c_#valid| (let ((.cse6 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_create_sl_with_head_and_tail_~sl~0#1.base|))) (let ((.cse4 (+ 4 |c_ULTIMATE.start_create_sl_with_head_and_tail_~sl~0#1.offset|)) (.cse3 (select .cse6 |c_ULTIMATE.start_create_sl_with_head_and_tail_~sl~0#1.offset|))) (let ((.cse1 (let ((.cse5 (store |c_#memory_$Pointer$.base| .cse3 v_ArrVal_1275))) (store .cse5 |c_ULTIMATE.start_create_sl_with_head_and_tail_#t~mem7#1.base| (store (select .cse5 |c_ULTIMATE.start_create_sl_with_head_and_tail_#t~mem7#1.base|) (+ 8 |c_ULTIMATE.start_create_sl_with_head_and_tail_#t~mem7#1.offset|) (select .cse6 .cse4)))))) (let ((.cse2 (select (select .cse1 |c_ULTIMATE.start_create_sl_with_head_and_tail_~sl~0#1.base|) .cse4))) (select (let ((.cse0 (store .cse1 .cse2 v_ArrVal_1284))) (select .cse0 (select (select .cse0 |c_ULTIMATE.start_create_sl_with_head_and_tail_~sl~0#1.base|) |c_ULTIMATE.start_create_sl_with_head_and_tail_~sl~0#1.offset|))) (+ (select (select (store (store (store |c_#memory_$Pointer$.offset| .cse3 v_ArrVal_1274) |c_ULTIMATE.start_create_sl_with_head_and_tail_#t~mem7#1.base| v_ArrVal_1278) .cse2 v_ArrVal_1283) |c_ULTIMATE.start_create_sl_with_head_and_tail_~sl~0#1.base|) |c_ULTIMATE.start_create_sl_with_head_and_tail_~sl~0#1.offset|) 8))))))) 1)) is different from false [2021-12-06 23:37:24,239 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 644 treesize of output 560 [2021-12-06 23:37:24,243 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-06 23:37:24,243 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 560 treesize of output 354 [2021-12-06 23:37:24,248 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 170 treesize of output 168 [2021-12-06 23:37:24,251 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 338 treesize of output 334 [2021-12-06 23:37:25,499 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_arrayElimArr_1 (Array Int Int)) (v_arrayElimCell_28 Int) (v_arrayElimCell_26 Int) (v_ArrVal_1284 (Array Int Int))) (let ((.cse7 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_create_sl_with_head_and_tail_~sl~0#1.base|))) (let ((.cse10 (select .cse7 |c_ULTIMATE.start_create_sl_with_head_and_tail_~sl~0#1.offset|))) (let ((.cse13 (store |c_#memory_$Pointer$.base| .cse10 v_arrayElimArr_1)) (.cse8 (+ 4 |c_ULTIMATE.start_create_sl_with_head_and_tail_~sl~0#1.offset|))) (let ((.cse11 (select (select .cse13 |c_ULTIMATE.start_create_sl_with_head_and_tail_~sl~0#1.base|) .cse8))) (let ((.cse1 (let ((.cse12 (store .cse13 .cse11 v_ArrVal_1284))) (select .cse12 (select (select .cse12 |c_ULTIMATE.start_create_sl_with_head_and_tail_~sl~0#1.base|) |c_ULTIMATE.start_create_sl_with_head_and_tail_~sl~0#1.offset|)))) (.cse9 (= .cse11 |c_ULTIMATE.start_create_sl_with_head_and_tail_~sl~0#1.base|))) (let ((.cse0 (= .cse10 |c_ULTIMATE.start_create_sl_with_head_and_tail_~sl~0#1.base|)) (.cse3 (not .cse9)) (.cse4 (and (= (select |c_#valid| (select .cse1 (+ 8 v_arrayElimCell_28))) 1) .cse9)) (.cse2 (+ 8 v_arrayElimCell_26))) (or (and (not .cse0) (or (and (= (select |c_#valid| (select .cse1 .cse2)) 1) .cse3) .cse4)) (and .cse0 (or (and (forall ((v_arrayElimCell_27 Int)) (= (select |c_#valid| (select (let ((.cse5 (let ((.cse6 (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_create_sl_with_head_and_tail_~sl~0#1.base|) |c_ULTIMATE.start_create_sl_with_head_and_tail_~sl~0#1.offset|) v_arrayElimArr_1))) (store .cse6 (select (select .cse6 |c_ULTIMATE.start_create_sl_with_head_and_tail_~sl~0#1.base|) (+ 4 |c_ULTIMATE.start_create_sl_with_head_and_tail_~sl~0#1.offset|)) v_ArrVal_1284)))) (select .cse5 (select (select .cse5 |c_ULTIMATE.start_create_sl_with_head_and_tail_~sl~0#1.base|) |c_ULTIMATE.start_create_sl_with_head_and_tail_~sl~0#1.offset|))) (+ 8 v_arrayElimCell_27))) 1)) .cse3) .cse4)) (not (= (select v_arrayElimArr_1 .cse2) (select .cse7 .cse8))))))))))) is different from false [2021-12-06 23:37:27,410 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_arrayElimArr_1 (Array Int Int)) (v_arrayElimCell_28 Int) (v_arrayElimCell_26 Int) (v_ArrVal_1284 (Array Int Int))) (let ((.cse8 (+ 8 v_arrayElimCell_26))) (let ((.cse15 (+ 4 |c_ULTIMATE.start_create_sl_with_head_and_tail_~sl~0#1.offset|)) (.cse9 (select v_arrayElimArr_1 .cse8))) (let ((.cse16 (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_create_sl_with_head_and_tail_~sl~0#1.base|) .cse15 .cse9))) (let ((.cse10 (select .cse16 |c_ULTIMATE.start_create_sl_with_head_and_tail_~sl~0#1.offset|))) (let ((.cse14 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_create_sl_with_head_and_tail_~sl~0#1.base| .cse16) .cse10 v_arrayElimArr_1))) (let ((.cse12 (select (select .cse14 |c_ULTIMATE.start_create_sl_with_head_and_tail_~sl~0#1.base|) .cse15))) (let ((.cse7 (let ((.cse13 (store .cse14 .cse12 v_ArrVal_1284))) (select .cse13 (select (select .cse13 |c_ULTIMATE.start_create_sl_with_head_and_tail_~sl~0#1.base|) |c_ULTIMATE.start_create_sl_with_head_and_tail_~sl~0#1.offset|)))) (.cse11 (= .cse12 |c_ULTIMATE.start_create_sl_with_head_and_tail_~sl~0#1.base|))) (let ((.cse1 (not .cse11)) (.cse6 (and .cse11 (= (select |c_#valid| (select .cse7 (+ 8 v_arrayElimCell_28))) 1))) (.cse0 (= .cse10 |c_ULTIMATE.start_create_sl_with_head_and_tail_~sl~0#1.base|))) (or (and .cse0 (or (and .cse1 (forall ((v_arrayElimCell_27 Int)) (= (select |c_#valid| (select (let ((.cse2 (let ((.cse4 (+ 4 |c_ULTIMATE.start_create_sl_with_head_and_tail_~sl~0#1.offset|))) (let ((.cse3 (let ((.cse5 (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_create_sl_with_head_and_tail_~sl~0#1.base|) .cse4 (select v_arrayElimArr_1 (+ 8 v_arrayElimCell_26))))) (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_create_sl_with_head_and_tail_~sl~0#1.base| .cse5) (select .cse5 |c_ULTIMATE.start_create_sl_with_head_and_tail_~sl~0#1.offset|) v_arrayElimArr_1)))) (store .cse3 (select (select .cse3 |c_ULTIMATE.start_create_sl_with_head_and_tail_~sl~0#1.base|) .cse4) v_ArrVal_1284))))) (select .cse2 (select (select .cse2 |c_ULTIMATE.start_create_sl_with_head_and_tail_~sl~0#1.base|) |c_ULTIMATE.start_create_sl_with_head_and_tail_~sl~0#1.offset|))) (+ 8 v_arrayElimCell_27))) 1))) .cse6)) (and (or (and .cse1 (= (select |c_#valid| (select .cse7 .cse8)) 1)) .cse6) (not .cse0)) (not (= |c_ULTIMATE.start_create_sl_with_head_and_tail_#t~malloc6#1.base| .cse9)))))))))))) is different from false [2021-12-06 23:37:28,435 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-06 23:37:28,435 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 2 case distinctions, treesize of input 966 treesize of output 600 [2021-12-06 23:37:28,448 INFO L354 Elim1Store]: treesize reduction 25, result has 47.9 percent of original size [2021-12-06 23:37:28,449 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 2 case distinctions, treesize of input 782 treesize of output 786 [2021-12-06 23:37:28,456 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-06 23:37:28,969 INFO L354 Elim1Store]: treesize reduction 412, result has 49.1 percent of original size [2021-12-06 23:37:28,969 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 11 select indices, 11 select index equivalence classes, 0 disjoint index pairs (out of 55 index pairs), introduced 12 new quantified variables, introduced 55 case distinctions, treesize of input 21288 treesize of output 15294 [2021-12-06 23:37:29,639 INFO L354 Elim1Store]: treesize reduction 28, result has 75.2 percent of original size [2021-12-06 23:37:29,640 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 12748 treesize of output 10798 [2021-12-06 23:37:29,821 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-06 23:37:29,821 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 10798 treesize of output 10130 [2021-12-06 23:37:58,421 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-06 23:37:58,421 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [549881378] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-06 23:37:58,421 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-06 23:37:58,421 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [28, 22, 25] total 71 [2021-12-06 23:37:58,421 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2037003098] [2021-12-06 23:37:58,421 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-06 23:37:58,422 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 72 states [2021-12-06 23:37:58,422 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-06 23:37:58,422 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 72 interpolants. [2021-12-06 23:37:58,423 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=268, Invalid=3147, Unknown=59, NotChecked=1638, Total=5112 [2021-12-06 23:37:58,424 INFO L87 Difference]: Start difference. First operand 186 states and 233 transitions. Second operand has 72 states, 71 states have (on average 1.380281690140845) internal successors, (98), 72 states have internal predecessors, (98), 0 states have call successors, (0), 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-06 23:38:01,361 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-06 23:38:01,362 INFO L93 Difference]: Finished difference Result 188 states and 236 transitions. [2021-12-06 23:38:01,362 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2021-12-06 23:38:01,362 INFO L78 Accepts]: Start accepts. Automaton has has 72 states, 71 states have (on average 1.380281690140845) internal successors, (98), 72 states have internal predecessors, (98), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 34 [2021-12-06 23:38:01,362 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-06 23:38:01,363 INFO L225 Difference]: With dead ends: 188 [2021-12-06 23:38:01,363 INFO L226 Difference]: Without dead ends: 188 [2021-12-06 23:38:01,365 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 121 GetRequests, 26 SyntacticMatches, 2 SemanticMatches, 93 ConstructedPredicates, 13 IntricatePredicates, 0 DeprecatedPredicates, 1654 ImplicationChecksByTransitivity, 4.3s TimeCoverageRelationStatistics Valid=600, Invalid=6015, Unknown=79, NotChecked=2236, Total=8930 [2021-12-06 23:38:01,366 INFO L933 BasicCegarLoop]: 92 mSDtfsCounter, 142 mSDsluCounter, 2485 mSDsCounter, 0 mSdLazyCounter, 1272 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 142 SdHoareTripleChecker+Valid, 2577 SdHoareTripleChecker+Invalid, 2501 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 1272 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 1199 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2021-12-06 23:38:01,366 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [142 Valid, 2577 Invalid, 2501 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 1272 Invalid, 0 Unknown, 1199 Unchecked, 0.6s Time] [2021-12-06 23:38:01,366 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 188 states. [2021-12-06 23:38:01,368 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 188 to 188. [2021-12-06 23:38:01,368 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 188 states, 155 states have (on average 1.5225806451612902) internal successors, (236), 187 states have internal predecessors, (236), 0 states have call successors, (0), 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-06 23:38:01,369 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 188 states to 188 states and 236 transitions. [2021-12-06 23:38:01,369 INFO L78 Accepts]: Start accepts. Automaton has 188 states and 236 transitions. Word has length 34 [2021-12-06 23:38:01,369 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-06 23:38:01,369 INFO L470 AbstractCegarLoop]: Abstraction has 188 states and 236 transitions. [2021-12-06 23:38:01,370 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 72 states, 71 states have (on average 1.380281690140845) internal successors, (98), 72 states have internal predecessors, (98), 0 states have call successors, (0), 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-06 23:38:01,370 INFO L276 IsEmpty]: Start isEmpty. Operand 188 states and 236 transitions. [2021-12-06 23:38:01,370 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2021-12-06 23:38:01,370 INFO L506 BasicCegarLoop]: Found error trace [2021-12-06 23:38:01,370 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, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-06 23:38:01,391 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f9e8e85e-e410-4b7b-a9a1-8ec046b18135/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2021-12-06 23:38:01,570 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f9e8e85e-e410-4b7b-a9a1-8ec046b18135/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable28 [2021-12-06 23:38:01,571 INFO L402 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr33REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 81 more)] === [2021-12-06 23:38:01,571 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-06 23:38:01,571 INFO L85 PathProgramCache]: Analyzing trace with hash 1606811228, now seen corresponding path program 1 times [2021-12-06 23:38:01,571 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-06 23:38:01,571 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [706796457] [2021-12-06 23:38:01,571 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 23:38:01,571 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-06 23:38:01,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 23:38:02,245 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-06 23:38:02,245 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-06 23:38:02,245 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [706796457] [2021-12-06 23:38:02,245 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [706796457] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-06 23:38:02,245 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [11766161] [2021-12-06 23:38:02,245 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 23:38:02,245 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-06 23:38:02,245 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f9e8e85e-e410-4b7b-a9a1-8ec046b18135/bin/uautomizer-DrprNOufMa/z3 [2021-12-06 23:38:02,246 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f9e8e85e-e410-4b7b-a9a1-8ec046b18135/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-06 23:38:02,247 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f9e8e85e-e410-4b7b-a9a1-8ec046b18135/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2021-12-06 23:38:02,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 23:38:02,327 INFO L263 TraceCheckSpWp]: Trace formula consists of 310 conjuncts, 101 conjunts are in the unsatisfiable core [2021-12-06 23:38:02,331 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-06 23:38:02,340 INFO L354 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-12-06 23:38:02,340 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 19 treesize of output 18 [2021-12-06 23:38:02,371 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-06 23:38:02,411 INFO L354 Elim1Store]: treesize reduction 8, result has 61.9 percent of original size [2021-12-06 23:38:02,412 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 20 treesize of output 22 [2021-12-06 23:38:02,417 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 6 treesize of output 5 [2021-12-06 23:38:02,453 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-06 23:38:02,455 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-06 23:38:02,456 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 30 treesize of output 25 [2021-12-06 23:38:02,745 INFO L354 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-12-06 23:38:02,745 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 76 treesize of output 65 [2021-12-06 23:38:02,748 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 36 treesize of output 34 [2021-12-06 23:38:02,821 INFO L354 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-12-06 23:38:02,821 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 69 treesize of output 60 [2021-12-06 23:38:02,824 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 36 treesize of output 34 [2021-12-06 23:38:02,893 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-06 23:38:02,904 INFO L354 Elim1Store]: treesize reduction 78, result has 17.9 percent of original size [2021-12-06 23:38:02,904 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 95 treesize of output 68 [2021-12-06 23:38:02,907 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-06 23:38:02,907 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 0 case distinctions, treesize of input 104 treesize of output 87 [2021-12-06 23:38:03,219 INFO L354 Elim1Store]: treesize reduction 36, result has 23.4 percent of original size [2021-12-06 23:38:03,219 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 154 treesize of output 135 [2021-12-06 23:38:03,232 INFO L354 Elim1Store]: treesize reduction 64, result has 19.0 percent of original size [2021-12-06 23:38:03,232 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 134 treesize of output 119 [2021-12-06 23:38:03,265 INFO L354 Elim1Store]: treesize reduction 36, result has 23.4 percent of original size [2021-12-06 23:38:03,266 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 145 treesize of output 128 [2021-12-06 23:38:03,278 INFO L354 Elim1Store]: treesize reduction 64, result has 19.0 percent of original size [2021-12-06 23:38:03,278 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 125 treesize of output 112 [2021-12-06 23:38:03,309 INFO L354 Elim1Store]: treesize reduction 36, result has 23.4 percent of original size [2021-12-06 23:38:03,309 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 155 treesize of output 138 [2021-12-06 23:38:03,322 INFO L354 Elim1Store]: treesize reduction 64, result has 19.0 percent of original size [2021-12-06 23:38:03,322 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 135 treesize of output 122 [2021-12-06 23:38:03,835 INFO L354 Elim1Store]: treesize reduction 36, result has 2.7 percent of original size [2021-12-06 23:38:03,836 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 157 treesize of output 76 [2021-12-06 23:38:03,846 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 55 treesize of output 22 [2021-12-06 23:38:03,870 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-06 23:38:03,870 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-06 23:38:13,288 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-06 23:38:13,288 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 596 treesize of output 404 [2021-12-06 23:38:13,303 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-06 23:38:13,303 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 435 treesize of output 348 [2021-12-06 23:38:15,071 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-06 23:38:15,071 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 2 case distinctions, treesize of input 1116 treesize of output 983 [2021-12-06 23:38:15,135 INFO L354 Elim1Store]: treesize reduction 21, result has 47.5 percent of original size [2021-12-06 23:38:15,136 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 2 case distinctions, treesize of input 1591 treesize of output 1524 [2021-12-06 23:38:19,718 INFO L354 Elim1Store]: treesize reduction 6840, result has 37.4 percent of original size [2021-12-06 23:38:19,719 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 14 select indices, 14 select index equivalence classes, 0 disjoint index pairs (out of 91 index pairs), introduced 15 new quantified variables, introduced 91 case distinctions, treesize of input 30012 treesize of output 31986 [2021-12-06 23:38:21,062 INFO L354 Elim1Store]: treesize reduction 122, result has 63.8 percent of original size [2021-12-06 23:38:21,063 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 8 select indices, 8 select index equivalence classes, 0 disjoint index pairs (out of 28 index pairs), introduced 9 new quantified variables, introduced 28 case distinctions, treesize of input 31986 treesize of output 31962 [2021-12-06 23:38:21,568 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-06 23:38:21,569 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 5 new quantified variables, introduced 6 case distinctions, treesize of input 26526 treesize of output 26356 [2021-12-06 23:38:22,062 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-06 23:38:22,063 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 5 new quantified variables, introduced 6 case distinctions, treesize of input 26270 treesize of output 26228