./Ultimate.py --spec ../../sv-benchmarks/c/properties/valid-memsafety.prp --file ../../sv-benchmarks/c/memsafety/test-0521.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 5e519f3a Calling Ultimate with: /usr/lib/jvm/java-11-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_480cfb37-46ef-4eba-97f5-ce88cab73a92/bin/uautomizer-Dbtcem3rbc/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_480cfb37-46ef-4eba-97f5-ce88cab73a92/bin/uautomizer-Dbtcem3rbc/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_480cfb37-46ef-4eba-97f5-ce88cab73a92/bin/uautomizer-Dbtcem3rbc/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_480cfb37-46ef-4eba-97f5-ce88cab73a92/bin/uautomizer-Dbtcem3rbc/config/AutomizerMemDerefMemtrack.xml -i ../../sv-benchmarks/c/memsafety/test-0521.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_480cfb37-46ef-4eba-97f5-ce88cab73a92/bin/uautomizer-Dbtcem3rbc/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_480cfb37-46ef-4eba-97f5-ce88cab73a92/bin/uautomizer-Dbtcem3rbc --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 aa94cb741c9c7eaa2ca9bb871f44dd4c619faf21975944b61e221a61ad9730d7 --- Real Ultimate output --- [0.001s][warning][os,container] Duplicate cpuset controllers detected. Picking /sys/fs/cgroup/cpuset, skipping /sys/fs/cgroup/cpuset. This is Ultimate 0.2.2-dev-5e519f3 [2022-11-02 20:18:10,137 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-02 20:18:10,139 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-02 20:18:10,186 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-02 20:18:10,187 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-02 20:18:10,191 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-02 20:18:10,194 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-02 20:18:10,200 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-02 20:18:10,203 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-02 20:18:10,209 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-02 20:18:10,210 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-02 20:18:10,213 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-02 20:18:10,213 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-02 20:18:10,216 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-02 20:18:10,217 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-02 20:18:10,218 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-02 20:18:10,219 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-02 20:18:10,220 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-02 20:18:10,222 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-02 20:18:10,224 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-02 20:18:10,225 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-02 20:18:10,229 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-02 20:18:10,230 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-02 20:18:10,232 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-02 20:18:10,236 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-02 20:18:10,242 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-02 20:18:10,242 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-02 20:18:10,243 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-02 20:18:10,246 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-02 20:18:10,248 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-02 20:18:10,248 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-02 20:18:10,250 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-02 20:18:10,252 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-02 20:18:10,254 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-02 20:18:10,255 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-02 20:18:10,258 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-02 20:18:10,259 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-02 20:18:10,259 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-02 20:18:10,259 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-02 20:18:10,260 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-02 20:18:10,261 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-02 20:18:10,261 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_480cfb37-46ef-4eba-97f5-ce88cab73a92/bin/uautomizer-Dbtcem3rbc/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2022-11-02 20:18:10,287 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-02 20:18:10,287 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-02 20:18:10,288 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-02 20:18:10,288 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-02 20:18:10,289 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-11-02 20:18:10,289 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-11-02 20:18:10,290 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-11-02 20:18:10,290 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-11-02 20:18:10,291 INFO L138 SettingsManager]: * Use SBE=true [2022-11-02 20:18:10,291 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-02 20:18:10,291 INFO L138 SettingsManager]: * sizeof long=4 [2022-11-02 20:18:10,292 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-11-02 20:18:10,292 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-11-02 20:18:10,292 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-11-02 20:18:10,292 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-02 20:18:10,293 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2022-11-02 20:18:10,293 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2022-11-02 20:18:10,293 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2022-11-02 20:18:10,293 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-11-02 20:18:10,294 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-11-02 20:18:10,294 INFO L138 SettingsManager]: * sizeof long double=12 [2022-11-02 20:18:10,294 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-02 20:18:10,294 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-02 20:18:10,295 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-11-02 20:18:10,295 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-11-02 20:18:10,295 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-02 20:18:10,296 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-02 20:18:10,296 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-11-02 20:18:10,296 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-11-02 20:18:10,296 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-11-02 20:18:10,297 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_480cfb37-46ef-4eba-97f5-ce88cab73a92/bin/uautomizer-Dbtcem3rbc/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_480cfb37-46ef-4eba-97f5-ce88cab73a92/bin/uautomizer-Dbtcem3rbc 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 -> aa94cb741c9c7eaa2ca9bb871f44dd4c619faf21975944b61e221a61ad9730d7 [2022-11-02 20:18:10,582 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-02 20:18:10,622 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-02 20:18:10,627 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-02 20:18:10,630 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-02 20:18:10,631 INFO L275 PluginConnector]: CDTParser initialized [2022-11-02 20:18:10,632 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_480cfb37-46ef-4eba-97f5-ce88cab73a92/bin/uautomizer-Dbtcem3rbc/../../sv-benchmarks/c/memsafety/test-0521.i [2022-11-02 20:18:10,747 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_480cfb37-46ef-4eba-97f5-ce88cab73a92/bin/uautomizer-Dbtcem3rbc/data/9d23b211e/db7fb1227db644da95ab522d3e255bba/FLAGf18f3622f [2022-11-02 20:18:11,326 INFO L306 CDTParser]: Found 1 translation units. [2022-11-02 20:18:11,330 INFO L160 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_480cfb37-46ef-4eba-97f5-ce88cab73a92/sv-benchmarks/c/memsafety/test-0521.i [2022-11-02 20:18:11,351 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_480cfb37-46ef-4eba-97f5-ce88cab73a92/bin/uautomizer-Dbtcem3rbc/data/9d23b211e/db7fb1227db644da95ab522d3e255bba/FLAGf18f3622f [2022-11-02 20:18:11,617 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_480cfb37-46ef-4eba-97f5-ce88cab73a92/bin/uautomizer-Dbtcem3rbc/data/9d23b211e/db7fb1227db644da95ab522d3e255bba [2022-11-02 20:18:11,620 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-02 20:18:11,622 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-02 20:18:11,623 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-02 20:18:11,624 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-02 20:18:11,633 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-02 20:18:11,634 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.11 08:18:11" (1/1) ... [2022-11-02 20:18:11,635 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@23c62106 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:18:11, skipping insertion in model container [2022-11-02 20:18:11,637 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.11 08:18:11" (1/1) ... [2022-11-02 20:18:11,645 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-02 20:18:11,713 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-02 20:18:12,242 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-02 20:18:12,254 INFO L203 MainTranslator]: Completed pre-run [2022-11-02 20:18:12,352 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-02 20:18:12,389 INFO L208 MainTranslator]: Completed translation [2022-11-02 20:18:12,390 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:18:12 WrapperNode [2022-11-02 20:18:12,390 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-02 20:18:12,391 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-11-02 20:18:12,392 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-11-02 20:18:12,392 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-11-02 20:18:12,402 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:18:12" (1/1) ... [2022-11-02 20:18:12,439 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:18:12" (1/1) ... [2022-11-02 20:18:12,481 INFO L138 Inliner]: procedures = 125, calls = 95, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 305 [2022-11-02 20:18:12,481 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-11-02 20:18:12,482 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-11-02 20:18:12,482 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-11-02 20:18:12,482 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-11-02 20:18:12,493 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:18:12" (1/1) ... [2022-11-02 20:18:12,493 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:18:12" (1/1) ... [2022-11-02 20:18:12,498 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:18:12" (1/1) ... [2022-11-02 20:18:12,498 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:18:12" (1/1) ... [2022-11-02 20:18:12,513 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:18:12" (1/1) ... [2022-11-02 20:18:12,518 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:18:12" (1/1) ... [2022-11-02 20:18:12,521 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:18:12" (1/1) ... [2022-11-02 20:18:12,523 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:18:12" (1/1) ... [2022-11-02 20:18:12,527 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-11-02 20:18:12,528 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-11-02 20:18:12,528 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-11-02 20:18:12,529 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-11-02 20:18:12,530 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:18:12" (1/1) ... [2022-11-02 20:18:12,544 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-02 20:18:12,559 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_480cfb37-46ef-4eba-97f5-ce88cab73a92/bin/uautomizer-Dbtcem3rbc/z3 [2022-11-02 20:18:12,580 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_480cfb37-46ef-4eba-97f5-ce88cab73a92/bin/uautomizer-Dbtcem3rbc/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-11-02 20:18:12,603 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_480cfb37-46ef-4eba-97f5-ce88cab73a92/bin/uautomizer-Dbtcem3rbc/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-11-02 20:18:12,635 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-11-02 20:18:12,635 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-11-02 20:18:12,636 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-11-02 20:18:12,637 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-11-02 20:18:12,637 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-11-02 20:18:12,638 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-11-02 20:18:12,638 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-11-02 20:18:12,638 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2022-11-02 20:18:12,638 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-11-02 20:18:12,639 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-11-02 20:18:12,639 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-11-02 20:18:12,804 INFO L235 CfgBuilder]: Building ICFG [2022-11-02 20:18:12,807 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-11-02 20:18:13,857 INFO L276 CfgBuilder]: Performing block encoding [2022-11-02 20:18:13,878 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-11-02 20:18:13,880 INFO L300 CfgBuilder]: Removed 8 assume(true) statements. [2022-11-02 20:18:13,884 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.11 08:18:13 BoogieIcfgContainer [2022-11-02 20:18:13,885 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-11-02 20:18:13,887 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-11-02 20:18:13,887 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-11-02 20:18:13,892 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-11-02 20:18:13,892 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 02.11 08:18:11" (1/3) ... [2022-11-02 20:18:13,893 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5cec083f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.11 08:18:13, skipping insertion in model container [2022-11-02 20:18:13,894 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:18:12" (2/3) ... [2022-11-02 20:18:13,894 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5cec083f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.11 08:18:13, skipping insertion in model container [2022-11-02 20:18:13,895 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.11 08:18:13" (3/3) ... [2022-11-02 20:18:13,896 INFO L112 eAbstractionObserver]: Analyzing ICFG test-0521.i [2022-11-02 20:18:13,924 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-11-02 20:18:13,925 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 152 error locations. [2022-11-02 20:18:14,023 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-11-02 20:18:14,032 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=false, mAutomataTypeConcurrency=FINITE_AUTOMATA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=All, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@6cfa337, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-02 20:18:14,032 INFO L358 AbstractCegarLoop]: Starting to check reachability of 152 error locations. [2022-11-02 20:18:14,039 INFO L276 IsEmpty]: Start isEmpty. Operand has 313 states, 160 states have (on average 2.1875) internal successors, (350), 312 states have internal predecessors, (350), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:18:14,056 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2022-11-02 20:18:14,060 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:18:14,061 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2022-11-02 20:18:14,061 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 149 more)] === [2022-11-02 20:18:14,068 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:18:14,068 INFO L85 PathProgramCache]: Analyzing trace with hash 28729512, now seen corresponding path program 1 times [2022-11-02 20:18:14,080 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:18:14,081 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [92774692] [2022-11-02 20:18:14,082 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:18:14,083 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:18:14,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:18: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. [2022-11-02 20:18:14,284 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:18:14,284 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [92774692] [2022-11-02 20:18:14,286 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [92774692] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:18:14,286 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:18:14,286 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-02 20:18:14,288 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1984039367] [2022-11-02 20:18:14,289 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:18:14,294 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-11-02 20:18:14,295 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:18:14,336 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-11-02 20:18:14,337 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-11-02 20:18:14,343 INFO L87 Difference]: Start difference. First operand has 313 states, 160 states have (on average 2.1875) internal successors, (350), 312 states have internal predecessors, (350), 0 states have call successors, (0), 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 2 states, 2 states have (on average 2.5) internal successors, (5), 2 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) [2022-11-02 20:18:14,403 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:18:14,403 INFO L93 Difference]: Finished difference Result 313 states and 340 transitions. [2022-11-02 20:18:14,404 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-02 20:18:14,406 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 2.5) internal successors, (5), 2 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 [2022-11-02 20:18:14,407 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:18:14,425 INFO L225 Difference]: With dead ends: 313 [2022-11-02 20:18:14,425 INFO L226 Difference]: Without dead ends: 311 [2022-11-02 20:18:14,428 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-11-02 20:18:14,433 INFO L413 NwaCegarLoop]: 340 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 340 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-02 20:18:14,435 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 340 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-02 20:18:14,462 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 311 states. [2022-11-02 20:18:14,509 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 311 to 311. [2022-11-02 20:18:14,511 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 311 states, 159 states have (on average 2.1257861635220126) internal successors, (338), 310 states have internal predecessors, (338), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:18:14,515 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 311 states to 311 states and 338 transitions. [2022-11-02 20:18:14,516 INFO L78 Accepts]: Start accepts. Automaton has 311 states and 338 transitions. Word has length 5 [2022-11-02 20:18:14,517 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:18:14,517 INFO L495 AbstractCegarLoop]: Abstraction has 311 states and 338 transitions. [2022-11-02 20:18:14,517 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 2.5) internal successors, (5), 2 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) [2022-11-02 20:18:14,518 INFO L276 IsEmpty]: Start isEmpty. Operand 311 states and 338 transitions. [2022-11-02 20:18:14,518 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2022-11-02 20:18:14,518 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:18:14,519 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2022-11-02 20:18:14,519 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-11-02 20:18:14,519 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 149 more)] === [2022-11-02 20:18:14,520 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:18:14,520 INFO L85 PathProgramCache]: Analyzing trace with hash 889570248, now seen corresponding path program 1 times [2022-11-02 20:18:14,520 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:18:14,520 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [690114106] [2022-11-02 20:18:14,521 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:18:14,521 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:18:14,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:18:14,623 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:18:14,623 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:18:14,624 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [690114106] [2022-11-02 20:18:14,624 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [690114106] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:18:14,624 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:18:14,624 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-02 20:18:14,625 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2132420080] [2022-11-02 20:18:14,625 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:18:14,626 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-02 20:18:14,626 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:18:14,627 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-02 20:18:14,627 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-02 20:18:14,628 INFO L87 Difference]: Start difference. First operand 311 states and 338 transitions. Second operand has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:18:15,006 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:18:15,006 INFO L93 Difference]: Finished difference Result 295 states and 322 transitions. [2022-11-02 20:18:15,007 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-02 20:18:15,007 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 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 6 [2022-11-02 20:18:15,008 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:18:15,009 INFO L225 Difference]: With dead ends: 295 [2022-11-02 20:18:15,013 INFO L226 Difference]: Without dead ends: 295 [2022-11-02 20:18:15,014 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-02 20:18:15,015 INFO L413 NwaCegarLoop]: 275 mSDtfsCounter, 77 mSDsluCounter, 131 mSDsCounter, 0 mSdLazyCounter, 160 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 77 SdHoareTripleChecker+Valid, 406 SdHoareTripleChecker+Invalid, 175 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 160 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-02 20:18:15,016 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [77 Valid, 406 Invalid, 175 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 160 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-11-02 20:18:15,018 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 295 states. [2022-11-02 20:18:15,030 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 295 to 295. [2022-11-02 20:18:15,037 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 295 states, 159 states have (on average 2.0251572327044025) internal successors, (322), 294 states have internal predecessors, (322), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:18:15,040 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 295 states to 295 states and 322 transitions. [2022-11-02 20:18:15,044 INFO L78 Accepts]: Start accepts. Automaton has 295 states and 322 transitions. Word has length 6 [2022-11-02 20:18:15,046 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:18:15,046 INFO L495 AbstractCegarLoop]: Abstraction has 295 states and 322 transitions. [2022-11-02 20:18:15,047 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:18:15,048 INFO L276 IsEmpty]: Start isEmpty. Operand 295 states and 322 transitions. [2022-11-02 20:18:15,048 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2022-11-02 20:18:15,049 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:18:15,050 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2022-11-02 20:18:15,051 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-11-02 20:18:15,051 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 149 more)] === [2022-11-02 20:18:15,052 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:18:15,057 INFO L85 PathProgramCache]: Analyzing trace with hash 889570249, now seen corresponding path program 1 times [2022-11-02 20:18:15,057 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:18:15,058 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [588389310] [2022-11-02 20:18:15,058 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:18:15,058 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:18:15,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:18:15,196 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:18:15,196 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:18:15,196 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [588389310] [2022-11-02 20:18:15,197 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [588389310] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:18:15,197 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:18:15,197 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-02 20:18:15,197 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1596066094] [2022-11-02 20:18:15,198 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:18:15,198 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-02 20:18:15,198 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:18:15,199 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-02 20:18:15,199 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-02 20:18:15,199 INFO L87 Difference]: Start difference. First operand 295 states and 322 transitions. Second operand has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:18:15,516 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:18:15,516 INFO L93 Difference]: Finished difference Result 279 states and 306 transitions. [2022-11-02 20:18:15,517 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-02 20:18:15,517 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 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 6 [2022-11-02 20:18:15,517 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:18:15,520 INFO L225 Difference]: With dead ends: 279 [2022-11-02 20:18:15,521 INFO L226 Difference]: Without dead ends: 279 [2022-11-02 20:18:15,521 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-02 20:18:15,529 INFO L413 NwaCegarLoop]: 275 mSDtfsCounter, 61 mSDsluCounter, 140 mSDsCounter, 0 mSdLazyCounter, 135 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 61 SdHoareTripleChecker+Valid, 415 SdHoareTripleChecker+Invalid, 150 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 135 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-02 20:18:15,531 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [61 Valid, 415 Invalid, 150 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 135 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-11-02 20:18:15,534 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 279 states. [2022-11-02 20:18:15,544 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 279 to 279. [2022-11-02 20:18:15,555 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 279 states, 159 states have (on average 1.9245283018867925) internal successors, (306), 278 states have internal predecessors, (306), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:18:15,557 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 279 states to 279 states and 306 transitions. [2022-11-02 20:18:15,560 INFO L78 Accepts]: Start accepts. Automaton has 279 states and 306 transitions. Word has length 6 [2022-11-02 20:18:15,560 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:18:15,560 INFO L495 AbstractCegarLoop]: Abstraction has 279 states and 306 transitions. [2022-11-02 20:18:15,561 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:18:15,561 INFO L276 IsEmpty]: Start isEmpty. Operand 279 states and 306 transitions. [2022-11-02 20:18:15,561 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2022-11-02 20:18:15,562 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:18:15,562 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2022-11-02 20:18:15,562 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-11-02 20:18:15,563 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 149 more)] === [2022-11-02 20:18:15,564 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:18:15,564 INFO L85 PathProgramCache]: Analyzing trace with hash 889571339, now seen corresponding path program 1 times [2022-11-02 20:18:15,564 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:18:15,565 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [201913517] [2022-11-02 20:18:15,565 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:18:15,566 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:18:15,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:18:15,669 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:18:15,670 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:18:15,670 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [201913517] [2022-11-02 20:18:15,670 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [201913517] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:18:15,671 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:18:15,671 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-02 20:18:15,671 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [17084543] [2022-11-02 20:18:15,671 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:18:15,672 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-02 20:18:15,672 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:18:15,672 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-02 20:18:15,673 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-02 20:18:15,673 INFO L87 Difference]: Start difference. First operand 279 states and 306 transitions. Second operand has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:18:16,005 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:18:16,006 INFO L93 Difference]: Finished difference Result 334 states and 370 transitions. [2022-11-02 20:18:16,007 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-02 20:18:16,007 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 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 6 [2022-11-02 20:18:16,007 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:18:16,009 INFO L225 Difference]: With dead ends: 334 [2022-11-02 20:18:16,009 INFO L226 Difference]: Without dead ends: 334 [2022-11-02 20:18:16,010 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-02 20:18:16,022 INFO L413 NwaCegarLoop]: 327 mSDtfsCounter, 76 mSDsluCounter, 154 mSDsCounter, 0 mSdLazyCounter, 178 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 76 SdHoareTripleChecker+Valid, 481 SdHoareTripleChecker+Invalid, 181 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 178 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-02 20:18:16,024 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [76 Valid, 481 Invalid, 181 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 178 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-11-02 20:18:16,026 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 334 states. [2022-11-02 20:18:16,036 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 334 to 277. [2022-11-02 20:18:16,049 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 277 states, 159 states have (on average 1.9119496855345912) internal successors, (304), 276 states have internal predecessors, (304), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:18:16,050 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 277 states to 277 states and 304 transitions. [2022-11-02 20:18:16,051 INFO L78 Accepts]: Start accepts. Automaton has 277 states and 304 transitions. Word has length 6 [2022-11-02 20:18:16,051 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:18:16,051 INFO L495 AbstractCegarLoop]: Abstraction has 277 states and 304 transitions. [2022-11-02 20:18:16,052 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:18:16,052 INFO L276 IsEmpty]: Start isEmpty. Operand 277 states and 304 transitions. [2022-11-02 20:18:16,052 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2022-11-02 20:18:16,053 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:18:16,053 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2022-11-02 20:18:16,053 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-11-02 20:18:16,056 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 149 more)] === [2022-11-02 20:18:16,056 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:18:16,057 INFO L85 PathProgramCache]: Analyzing trace with hash 889571340, now seen corresponding path program 1 times [2022-11-02 20:18:16,057 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:18:16,057 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [936291360] [2022-11-02 20:18:16,057 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:18:16,058 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:18:16,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:18:16,179 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:18:16,179 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:18:16,180 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [936291360] [2022-11-02 20:18:16,180 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [936291360] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:18:16,180 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:18:16,181 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-02 20:18:16,181 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2096507468] [2022-11-02 20:18:16,181 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:18:16,182 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-02 20:18:16,182 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:18:16,182 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-02 20:18:16,183 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-02 20:18:16,183 INFO L87 Difference]: Start difference. First operand 277 states and 304 transitions. Second operand has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:18:16,586 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:18:16,586 INFO L93 Difference]: Finished difference Result 466 states and 515 transitions. [2022-11-02 20:18:16,587 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-02 20:18:16,587 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 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 6 [2022-11-02 20:18:16,587 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:18:16,589 INFO L225 Difference]: With dead ends: 466 [2022-11-02 20:18:16,589 INFO L226 Difference]: Without dead ends: 466 [2022-11-02 20:18:16,590 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-02 20:18:16,591 INFO L413 NwaCegarLoop]: 415 mSDtfsCounter, 220 mSDsluCounter, 164 mSDsCounter, 0 mSdLazyCounter, 225 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 220 SdHoareTripleChecker+Valid, 579 SdHoareTripleChecker+Invalid, 229 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 225 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-11-02 20:18:16,591 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [220 Valid, 579 Invalid, 229 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 225 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-11-02 20:18:16,593 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 466 states. [2022-11-02 20:18:16,602 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 466 to 275. [2022-11-02 20:18:16,602 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 275 states, 159 states have (on average 1.89937106918239) internal successors, (302), 274 states have internal predecessors, (302), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:18:16,603 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 275 states to 275 states and 302 transitions. [2022-11-02 20:18:16,604 INFO L78 Accepts]: Start accepts. Automaton has 275 states and 302 transitions. Word has length 6 [2022-11-02 20:18:16,604 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:18:16,606 INFO L495 AbstractCegarLoop]: Abstraction has 275 states and 302 transitions. [2022-11-02 20:18:16,606 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:18:16,606 INFO L276 IsEmpty]: Start isEmpty. Operand 275 states and 302 transitions. [2022-11-02 20:18:16,606 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2022-11-02 20:18:16,607 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:18:16,607 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:18:16,607 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-11-02 20:18:16,607 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 149 more)] === [2022-11-02 20:18:16,608 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:18:16,608 INFO L85 PathProgramCache]: Analyzing trace with hash 178517033, now seen corresponding path program 1 times [2022-11-02 20:18:16,608 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:18:16,608 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [743343273] [2022-11-02 20:18:16,608 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:18:16,609 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:18:16,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:18:16,706 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:18:16,706 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:18:16,707 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [743343273] [2022-11-02 20:18:16,707 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [743343273] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:18:16,707 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:18:16,707 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-02 20:18:16,707 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1730763367] [2022-11-02 20:18:16,708 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:18:16,708 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-02 20:18:16,708 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:18:16,709 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-02 20:18:16,709 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-02 20:18:16,709 INFO L87 Difference]: Start difference. First operand 275 states and 302 transitions. Second operand has 4 states, 4 states have (on average 2.0) internal successors, (8), 4 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:18:16,789 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:18:16,789 INFO L93 Difference]: Finished difference Result 678 states and 747 transitions. [2022-11-02 20:18:16,790 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-02 20:18:16,790 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.0) internal successors, (8), 4 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 8 [2022-11-02 20:18:16,790 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:18:16,793 INFO L225 Difference]: With dead ends: 678 [2022-11-02 20:18:16,793 INFO L226 Difference]: Without dead ends: 678 [2022-11-02 20:18:16,793 INFO L412 NwaCegarLoop]: 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 [2022-11-02 20:18:16,795 INFO L413 NwaCegarLoop]: 297 mSDtfsCounter, 597 mSDsluCounter, 573 mSDsCounter, 0 mSdLazyCounter, 31 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 597 SdHoareTripleChecker+Valid, 870 SdHoareTripleChecker+Invalid, 34 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 31 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-02 20:18:16,796 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [597 Valid, 870 Invalid, 34 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 31 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-02 20:18:16,800 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 678 states. [2022-11-02 20:18:16,807 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 678 to 280. [2022-11-02 20:18:16,808 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 280 states, 164 states have (on average 1.8780487804878048) internal successors, (308), 279 states have internal predecessors, (308), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:18:16,809 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 280 states to 280 states and 308 transitions. [2022-11-02 20:18:16,809 INFO L78 Accepts]: Start accepts. Automaton has 280 states and 308 transitions. Word has length 8 [2022-11-02 20:18:16,809 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:18:16,809 INFO L495 AbstractCegarLoop]: Abstraction has 280 states and 308 transitions. [2022-11-02 20:18:16,810 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.0) internal successors, (8), 4 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:18:16,810 INFO L276 IsEmpty]: Start isEmpty. Operand 280 states and 308 transitions. [2022-11-02 20:18:16,810 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-11-02 20:18:16,810 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:18:16,811 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:18:16,811 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-11-02 20:18:16,811 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 149 more)] === [2022-11-02 20:18:16,811 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:18:16,812 INFO L85 PathProgramCache]: Analyzing trace with hash -2119660206, now seen corresponding path program 1 times [2022-11-02 20:18:16,812 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:18:16,812 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1545120915] [2022-11-02 20:18:16,812 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:18:16,813 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:18:16,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:18:16,884 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:18:16,884 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:18:16,885 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1545120915] [2022-11-02 20:18:16,885 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1545120915] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:18:16,886 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:18:16,886 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-02 20:18:16,886 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [308075402] [2022-11-02 20:18:16,886 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:18:16,887 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-02 20:18:16,887 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:18:16,887 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-02 20:18:16,888 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-02 20:18:16,888 INFO L87 Difference]: Start difference. First operand 280 states and 308 transitions. Second operand has 3 states, 2 states have (on average 5.5) internal successors, (11), 3 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) [2022-11-02 20:18:17,168 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:18:17,169 INFO L93 Difference]: Finished difference Result 330 states and 365 transitions. [2022-11-02 20:18:17,169 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-02 20:18:17,169 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 5.5) internal successors, (11), 3 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 [2022-11-02 20:18:17,170 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:18:17,171 INFO L225 Difference]: With dead ends: 330 [2022-11-02 20:18:17,171 INFO L226 Difference]: Without dead ends: 330 [2022-11-02 20:18:17,172 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-02 20:18:17,172 INFO L413 NwaCegarLoop]: 323 mSDtfsCounter, 72 mSDsluCounter, 153 mSDsCounter, 0 mSdLazyCounter, 177 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 72 SdHoareTripleChecker+Valid, 476 SdHoareTripleChecker+Invalid, 180 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 177 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-02 20:18:17,173 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [72 Valid, 476 Invalid, 180 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 177 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-11-02 20:18:17,174 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 330 states. [2022-11-02 20:18:17,180 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 330 to 278. [2022-11-02 20:18:17,181 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 278 states, 164 states have (on average 1.8658536585365855) internal successors, (306), 277 states have internal predecessors, (306), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:18:17,182 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 278 states to 278 states and 306 transitions. [2022-11-02 20:18:17,182 INFO L78 Accepts]: Start accepts. Automaton has 278 states and 306 transitions. Word has length 11 [2022-11-02 20:18:17,182 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:18:17,183 INFO L495 AbstractCegarLoop]: Abstraction has 278 states and 306 transitions. [2022-11-02 20:18:17,183 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 5.5) internal successors, (11), 3 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) [2022-11-02 20:18:17,184 INFO L276 IsEmpty]: Start isEmpty. Operand 278 states and 306 transitions. [2022-11-02 20:18:17,184 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-11-02 20:18:17,185 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:18:17,185 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:18:17,185 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-11-02 20:18:17,186 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 149 more)] === [2022-11-02 20:18:17,186 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:18:17,187 INFO L85 PathProgramCache]: Analyzing trace with hash -2119660205, now seen corresponding path program 1 times [2022-11-02 20:18:17,187 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:18:17,187 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1609028614] [2022-11-02 20:18:17,187 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:18:17,188 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:18:17,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:18:17,330 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:18:17,331 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:18:17,331 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1609028614] [2022-11-02 20:18:17,331 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1609028614] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:18:17,331 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:18:17,332 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-02 20:18:17,332 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [584339689] [2022-11-02 20:18:17,332 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:18:17,333 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-02 20:18:17,333 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:18:17,334 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-02 20:18:17,334 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-02 20:18:17,334 INFO L87 Difference]: Start difference. First operand 278 states and 306 transitions. Second operand has 3 states, 2 states have (on average 5.5) internal successors, (11), 3 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) [2022-11-02 20:18:17,722 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:18:17,722 INFO L93 Difference]: Finished difference Result 462 states and 510 transitions. [2022-11-02 20:18:17,723 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-02 20:18:17,723 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 5.5) internal successors, (11), 3 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 [2022-11-02 20:18:17,723 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:18:17,725 INFO L225 Difference]: With dead ends: 462 [2022-11-02 20:18:17,726 INFO L226 Difference]: Without dead ends: 462 [2022-11-02 20:18:17,726 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-02 20:18:17,727 INFO L413 NwaCegarLoop]: 411 mSDtfsCounter, 216 mSDsluCounter, 163 mSDsCounter, 0 mSdLazyCounter, 224 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 216 SdHoareTripleChecker+Valid, 574 SdHoareTripleChecker+Invalid, 228 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 224 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-11-02 20:18:17,727 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [216 Valid, 574 Invalid, 228 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 224 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-11-02 20:18:17,728 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 462 states. [2022-11-02 20:18:17,733 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 462 to 276. [2022-11-02 20:18:17,734 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 276 states, 164 states have (on average 1.853658536585366) internal successors, (304), 275 states have internal predecessors, (304), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:18:17,736 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 276 states to 276 states and 304 transitions. [2022-11-02 20:18:17,736 INFO L78 Accepts]: Start accepts. Automaton has 276 states and 304 transitions. Word has length 11 [2022-11-02 20:18:17,736 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:18:17,736 INFO L495 AbstractCegarLoop]: Abstraction has 276 states and 304 transitions. [2022-11-02 20:18:17,737 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 5.5) internal successors, (11), 3 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) [2022-11-02 20:18:17,737 INFO L276 IsEmpty]: Start isEmpty. Operand 276 states and 304 transitions. [2022-11-02 20:18:17,738 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-11-02 20:18:17,738 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:18:17,738 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:18:17,738 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-11-02 20:18:17,739 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr18REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 149 more)] === [2022-11-02 20:18:17,739 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:18:17,739 INFO L85 PathProgramCache]: Analyzing trace with hash -1231388841, now seen corresponding path program 1 times [2022-11-02 20:18:17,740 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:18:17,740 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [161495604] [2022-11-02 20:18:17,740 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:18:17,740 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:18:17,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:18:17,909 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:18:17,909 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:18:17,909 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [161495604] [2022-11-02 20:18:17,909 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [161495604] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:18:17,910 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:18:17,910 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-11-02 20:18:17,910 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1726223328] [2022-11-02 20:18:17,910 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:18:17,911 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-02 20:18:17,911 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:18:17,911 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-02 20:18:17,912 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-11-02 20:18:17,912 INFO L87 Difference]: Start difference. First operand 276 states and 304 transitions. Second operand has 6 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 6 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) [2022-11-02 20:18:18,217 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:18:18,218 INFO L93 Difference]: Finished difference Result 666 states and 735 transitions. [2022-11-02 20:18:18,219 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-02 20:18:18,219 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 6 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 [2022-11-02 20:18:18,220 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:18:18,223 INFO L225 Difference]: With dead ends: 666 [2022-11-02 20:18:18,223 INFO L226 Difference]: Without dead ends: 666 [2022-11-02 20:18:18,223 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2022-11-02 20:18:18,227 INFO L413 NwaCegarLoop]: 284 mSDtfsCounter, 576 mSDsluCounter, 1079 mSDsCounter, 0 mSdLazyCounter, 139 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 576 SdHoareTripleChecker+Valid, 1363 SdHoareTripleChecker+Invalid, 152 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 139 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-02 20:18:18,227 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [576 Valid, 1363 Invalid, 152 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 139 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-02 20:18:18,229 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 666 states. [2022-11-02 20:18:18,236 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 666 to 279. [2022-11-02 20:18:18,236 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 279 states, 167 states have (on average 1.8383233532934131) internal successors, (307), 278 states have internal predecessors, (307), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:18:18,238 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 279 states to 279 states and 307 transitions. [2022-11-02 20:18:18,243 INFO L78 Accepts]: Start accepts. Automaton has 279 states and 307 transitions. Word has length 13 [2022-11-02 20:18:18,244 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:18:18,244 INFO L495 AbstractCegarLoop]: Abstraction has 279 states and 307 transitions. [2022-11-02 20:18:18,244 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 6 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) [2022-11-02 20:18:18,244 INFO L276 IsEmpty]: Start isEmpty. Operand 279 states and 307 transitions. [2022-11-02 20:18:18,245 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-11-02 20:18:18,246 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:18:18,246 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:18:18,246 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-11-02 20:18:18,246 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr54REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 149 more)] === [2022-11-02 20:18:18,254 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:18:18,255 INFO L85 PathProgramCache]: Analyzing trace with hash 2035528525, now seen corresponding path program 1 times [2022-11-02 20:18:18,255 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:18:18,260 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1701169120] [2022-11-02 20:18:18,260 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:18:18,261 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:18:18,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:18:18,378 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:18:18,379 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:18:18,379 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1701169120] [2022-11-02 20:18:18,379 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1701169120] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:18:18,380 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:18:18,380 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-02 20:18:18,380 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2125628971] [2022-11-02 20:18:18,380 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:18:18,381 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-02 20:18:18,382 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:18:18,382 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-02 20:18:18,383 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-11-02 20:18:18,383 INFO L87 Difference]: Start difference. First operand 279 states and 307 transitions. Second operand has 5 states, 5 states have (on average 3.0) internal successors, (15), 5 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:18:18,511 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:18:18,511 INFO L93 Difference]: Finished difference Result 408 states and 447 transitions. [2022-11-02 20:18:18,512 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-02 20:18:18,512 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.0) internal successors, (15), 5 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 15 [2022-11-02 20:18:18,513 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:18:18,514 INFO L225 Difference]: With dead ends: 408 [2022-11-02 20:18:18,515 INFO L226 Difference]: Without dead ends: 408 [2022-11-02 20:18:18,516 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2022-11-02 20:18:18,517 INFO L413 NwaCegarLoop]: 290 mSDtfsCounter, 237 mSDsluCounter, 830 mSDsCounter, 0 mSdLazyCounter, 66 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 237 SdHoareTripleChecker+Valid, 1120 SdHoareTripleChecker+Invalid, 76 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 66 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-02 20:18:18,518 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [237 Valid, 1120 Invalid, 76 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 66 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-02 20:18:18,520 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 408 states. [2022-11-02 20:18:18,525 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 408 to 343. [2022-11-02 20:18:18,526 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 343 states, 231 states have (on average 1.8831168831168832) internal successors, (435), 342 states have internal predecessors, (435), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:18:18,528 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 343 states to 343 states and 435 transitions. [2022-11-02 20:18:18,528 INFO L78 Accepts]: Start accepts. Automaton has 343 states and 435 transitions. Word has length 15 [2022-11-02 20:18:18,528 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:18:18,529 INFO L495 AbstractCegarLoop]: Abstraction has 343 states and 435 transitions. [2022-11-02 20:18:18,529 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.0) internal successors, (15), 5 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:18:18,529 INFO L276 IsEmpty]: Start isEmpty. Operand 343 states and 435 transitions. [2022-11-02 20:18:18,531 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-11-02 20:18:18,531 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:18:18,532 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:18:18,532 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-11-02 20:18:18,532 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr38REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 149 more)] === [2022-11-02 20:18:18,533 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:18:18,533 INFO L85 PathProgramCache]: Analyzing trace with hash -1316385230, now seen corresponding path program 1 times [2022-11-02 20:18:18,533 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:18:18,534 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [284801574] [2022-11-02 20:18:18,534 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:18:18,534 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:18:18,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:18:18,585 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:18:18,585 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:18:18,586 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [284801574] [2022-11-02 20:18:18,586 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [284801574] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:18:18,586 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:18:18,586 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-02 20:18:18,587 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [382669198] [2022-11-02 20:18:18,587 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:18:18,587 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-02 20:18:18,587 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:18:18,588 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-02 20:18:18,589 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-02 20:18:18,589 INFO L87 Difference]: Start difference. First operand 343 states and 435 transitions. Second operand has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 3 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:18:18,607 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:18:18,607 INFO L93 Difference]: Finished difference Result 328 states and 410 transitions. [2022-11-02 20:18:18,607 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-02 20:18:18,608 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 3 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2022-11-02 20:18:18,608 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:18:18,610 INFO L225 Difference]: With dead ends: 328 [2022-11-02 20:18:18,610 INFO L226 Difference]: Without dead ends: 328 [2022-11-02 20:18:18,611 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-02 20:18:18,612 INFO L413 NwaCegarLoop]: 297 mSDtfsCounter, 223 mSDsluCounter, 66 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 223 SdHoareTripleChecker+Valid, 363 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-02 20:18:18,613 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [223 Valid, 363 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-02 20:18:18,614 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 328 states. [2022-11-02 20:18:18,619 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 328 to 328. [2022-11-02 20:18:18,620 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 328 states, 216 states have (on average 1.8981481481481481) internal successors, (410), 327 states have internal predecessors, (410), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:18:18,621 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 328 states to 328 states and 410 transitions. [2022-11-02 20:18:18,622 INFO L78 Accepts]: Start accepts. Automaton has 328 states and 410 transitions. Word has length 16 [2022-11-02 20:18:18,622 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:18:18,622 INFO L495 AbstractCegarLoop]: Abstraction has 328 states and 410 transitions. [2022-11-02 20:18:18,624 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 3 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:18:18,624 INFO L276 IsEmpty]: Start isEmpty. Operand 328 states and 410 transitions. [2022-11-02 20:18:18,625 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-11-02 20:18:18,625 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:18:18,626 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:18:18,626 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-11-02 20:18:18,626 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr93REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 149 more)] === [2022-11-02 20:18:18,627 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:18:18,627 INFO L85 PathProgramCache]: Analyzing trace with hash 1932989585, now seen corresponding path program 1 times [2022-11-02 20:18:18,628 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:18:18,628 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [291443829] [2022-11-02 20:18:18,629 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:18:18,629 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:18:18,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:18:18,723 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:18:18,723 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:18:18,723 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [291443829] [2022-11-02 20:18:18,724 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [291443829] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:18:18,724 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:18:18,724 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-02 20:18:18,724 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [139864784] [2022-11-02 20:18:18,725 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:18:18,725 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-02 20:18:18,725 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:18:18,726 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-02 20:18:18,726 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-02 20:18:18,726 INFO L87 Difference]: Start difference. First operand 328 states and 410 transitions. Second operand has 3 states, 2 states have (on average 8.5) internal successors, (17), 3 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:18:18,959 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:18:18,959 INFO L93 Difference]: Finished difference Result 312 states and 378 transitions. [2022-11-02 20:18:18,959 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-02 20:18:18,959 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 8.5) internal successors, (17), 3 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 17 [2022-11-02 20:18:18,960 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:18:18,961 INFO L225 Difference]: With dead ends: 312 [2022-11-02 20:18:18,961 INFO L226 Difference]: Without dead ends: 312 [2022-11-02 20:18:18,961 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-02 20:18:18,963 INFO L413 NwaCegarLoop]: 235 mSDtfsCounter, 77 mSDsluCounter, 111 mSDsCounter, 0 mSdLazyCounter, 140 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 77 SdHoareTripleChecker+Valid, 346 SdHoareTripleChecker+Invalid, 155 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 140 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-02 20:18:18,963 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [77 Valid, 346 Invalid, 155 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 140 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-02 20:18:18,964 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 312 states. [2022-11-02 20:18:18,981 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 312 to 312. [2022-11-02 20:18:18,982 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 312 states, 216 states have (on average 1.75) internal successors, (378), 311 states have internal predecessors, (378), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:18:18,983 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 312 states to 312 states and 378 transitions. [2022-11-02 20:18:18,983 INFO L78 Accepts]: Start accepts. Automaton has 312 states and 378 transitions. Word has length 17 [2022-11-02 20:18:18,984 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:18:18,984 INFO L495 AbstractCegarLoop]: Abstraction has 312 states and 378 transitions. [2022-11-02 20:18:18,984 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 8.5) internal successors, (17), 3 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:18:18,984 INFO L276 IsEmpty]: Start isEmpty. Operand 312 states and 378 transitions. [2022-11-02 20:18:18,989 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-11-02 20:18:18,989 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:18:18,989 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:18:18,989 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-11-02 20:18:18,990 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr94REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 149 more)] === [2022-11-02 20:18:18,990 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:18:18,990 INFO L85 PathProgramCache]: Analyzing trace with hash 1932989586, now seen corresponding path program 1 times [2022-11-02 20:18:18,991 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:18:18,991 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [162689586] [2022-11-02 20:18:18,991 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:18:18,991 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:18:19,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:18:19,101 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:18:19,102 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:18:19,102 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [162689586] [2022-11-02 20:18:19,102 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [162689586] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:18:19,102 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:18:19,103 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-02 20:18:19,103 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1553378954] [2022-11-02 20:18:19,103 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:18:19,103 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-02 20:18:19,104 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:18:19,104 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-02 20:18:19,104 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-02 20:18:19,105 INFO L87 Difference]: Start difference. First operand 312 states and 378 transitions. Second operand has 3 states, 2 states have (on average 8.5) internal successors, (17), 3 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:18:19,316 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:18:19,316 INFO L93 Difference]: Finished difference Result 296 states and 346 transitions. [2022-11-02 20:18:19,316 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-02 20:18:19,316 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 8.5) internal successors, (17), 3 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 17 [2022-11-02 20:18:19,317 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:18:19,318 INFO L225 Difference]: With dead ends: 296 [2022-11-02 20:18:19,318 INFO L226 Difference]: Without dead ends: 296 [2022-11-02 20:18:19,319 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-02 20:18:19,319 INFO L413 NwaCegarLoop]: 235 mSDtfsCounter, 61 mSDsluCounter, 120 mSDsCounter, 0 mSdLazyCounter, 115 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 61 SdHoareTripleChecker+Valid, 355 SdHoareTripleChecker+Invalid, 130 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 115 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-02 20:18:19,320 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [61 Valid, 355 Invalid, 130 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 115 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-02 20:18:19,321 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 296 states. [2022-11-02 20:18:19,325 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 296 to 296. [2022-11-02 20:18:19,326 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 296 states, 216 states have (on average 1.6018518518518519) internal successors, (346), 295 states have internal predecessors, (346), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:18:19,327 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 296 states to 296 states and 346 transitions. [2022-11-02 20:18:19,328 INFO L78 Accepts]: Start accepts. Automaton has 296 states and 346 transitions. Word has length 17 [2022-11-02 20:18:19,328 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:18:19,328 INFO L495 AbstractCegarLoop]: Abstraction has 296 states and 346 transitions. [2022-11-02 20:18:19,329 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 8.5) internal successors, (17), 3 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:18:19,329 INFO L276 IsEmpty]: Start isEmpty. Operand 296 states and 346 transitions. [2022-11-02 20:18:19,329 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-11-02 20:18:19,329 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:18:19,330 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:18:19,330 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-11-02 20:18:19,330 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr95REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 149 more)] === [2022-11-02 20:18:19,331 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:18:19,331 INFO L85 PathProgramCache]: Analyzing trace with hash -2117838446, now seen corresponding path program 1 times [2022-11-02 20:18:19,331 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:18:19,331 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [480723848] [2022-11-02 20:18:19,332 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:18:19,332 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:18:19,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:18:19,429 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:18:19,429 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:18:19,429 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [480723848] [2022-11-02 20:18:19,429 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [480723848] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:18:19,430 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:18:19,430 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-02 20:18:19,430 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [181246771] [2022-11-02 20:18:19,430 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:18:19,431 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-02 20:18:19,431 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:18:19,431 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-02 20:18:19,432 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-11-02 20:18:19,432 INFO L87 Difference]: Start difference. First operand 296 states and 346 transitions. Second operand has 5 states, 5 states have (on average 3.8) 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) [2022-11-02 20:18:19,575 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:18:19,575 INFO L93 Difference]: Finished difference Result 394 states and 436 transitions. [2022-11-02 20:18:19,576 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-11-02 20:18:19,576 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.8) 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 [2022-11-02 20:18:19,576 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:18:19,578 INFO L225 Difference]: With dead ends: 394 [2022-11-02 20:18:19,578 INFO L226 Difference]: Without dead ends: 394 [2022-11-02 20:18:19,578 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2022-11-02 20:18:19,579 INFO L413 NwaCegarLoop]: 258 mSDtfsCounter, 277 mSDsluCounter, 736 mSDsCounter, 0 mSdLazyCounter, 64 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 277 SdHoareTripleChecker+Valid, 994 SdHoareTripleChecker+Invalid, 70 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 64 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-02 20:18:19,580 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [277 Valid, 994 Invalid, 70 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 64 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-02 20:18:19,581 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 394 states. [2022-11-02 20:18:19,586 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 394 to 293. [2022-11-02 20:18:19,587 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 293 states, 213 states have (on average 1.596244131455399) internal successors, (340), 292 states have internal predecessors, (340), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:18:19,588 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 293 states to 293 states and 340 transitions. [2022-11-02 20:18:19,588 INFO L78 Accepts]: Start accepts. Automaton has 293 states and 340 transitions. Word has length 19 [2022-11-02 20:18:19,588 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:18:19,588 INFO L495 AbstractCegarLoop]: Abstraction has 293 states and 340 transitions. [2022-11-02 20:18:19,589 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.8) 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) [2022-11-02 20:18:19,589 INFO L276 IsEmpty]: Start isEmpty. Operand 293 states and 340 transitions. [2022-11-02 20:18:19,589 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-11-02 20:18:19,590 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:18:19,590 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:18:19,590 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-11-02 20:18:19,590 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 149 more)] === [2022-11-02 20:18:19,591 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:18:19,591 INFO L85 PathProgramCache]: Analyzing trace with hash -1413279430, now seen corresponding path program 1 times [2022-11-02 20:18:19,591 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:18:19,591 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2100354446] [2022-11-02 20:18:19,592 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:18:19,592 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:18:19,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:18:19,750 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:18:19,750 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:18:19,750 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2100354446] [2022-11-02 20:18:19,751 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2100354446] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:18:19,751 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:18:19,751 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-02 20:18:19,751 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [949640042] [2022-11-02 20:18:19,751 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:18:19,752 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-02 20:18:19,752 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:18:19,752 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-02 20:18:19,752 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-11-02 20:18:19,752 INFO L87 Difference]: Start difference. First operand 293 states and 340 transitions. Second operand has 6 states, 5 states have (on average 3.8) internal successors, (19), 6 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) [2022-11-02 20:18:20,153 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:18:20,153 INFO L93 Difference]: Finished difference Result 316 states and 364 transitions. [2022-11-02 20:18:20,153 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-02 20:18:20,154 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 3.8) internal successors, (19), 6 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 [2022-11-02 20:18:20,154 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:18:20,155 INFO L225 Difference]: With dead ends: 316 [2022-11-02 20:18:20,155 INFO L226 Difference]: Without dead ends: 316 [2022-11-02 20:18:20,156 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2022-11-02 20:18:20,156 INFO L413 NwaCegarLoop]: 229 mSDtfsCounter, 271 mSDsluCounter, 328 mSDsCounter, 0 mSdLazyCounter, 361 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 271 SdHoareTripleChecker+Valid, 557 SdHoareTripleChecker+Invalid, 370 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 361 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-11-02 20:18:20,157 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [271 Valid, 557 Invalid, 370 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 361 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-11-02 20:18:20,157 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 316 states. [2022-11-02 20:18:20,161 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 316 to 295. [2022-11-02 20:18:20,162 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 295 states, 217 states have (on average 1.5898617511520738) internal successors, (345), 294 states have internal predecessors, (345), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:18:20,163 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 295 states to 295 states and 345 transitions. [2022-11-02 20:18:20,163 INFO L78 Accepts]: Start accepts. Automaton has 295 states and 345 transitions. Word has length 19 [2022-11-02 20:18:20,163 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:18:20,163 INFO L495 AbstractCegarLoop]: Abstraction has 295 states and 345 transitions. [2022-11-02 20:18:20,164 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 3.8) internal successors, (19), 6 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) [2022-11-02 20:18:20,164 INFO L276 IsEmpty]: Start isEmpty. Operand 295 states and 345 transitions. [2022-11-02 20:18:20,164 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-11-02 20:18:20,164 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:18:20,165 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:18:20,165 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-11-02 20:18:20,165 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 149 more)] === [2022-11-02 20:18:20,165 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:18:20,166 INFO L85 PathProgramCache]: Analyzing trace with hash -1413279429, now seen corresponding path program 1 times [2022-11-02 20:18:20,166 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:18:20,166 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1494817076] [2022-11-02 20:18:20,166 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:18:20,166 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:18:20,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:18:20,346 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:18:20,347 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:18:20,347 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1494817076] [2022-11-02 20:18:20,349 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1494817076] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:18:20,349 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:18:20,350 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-02 20:18:20,350 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [990348794] [2022-11-02 20:18:20,350 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:18:20,350 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-02 20:18:20,351 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:18:20,351 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-02 20:18:20,351 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-11-02 20:18:20,351 INFO L87 Difference]: Start difference. First operand 295 states and 345 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) [2022-11-02 20:18:20,850 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:18:20,851 INFO L93 Difference]: Finished difference Result 409 states and 475 transitions. [2022-11-02 20:18:20,855 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-02 20:18:20,855 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 [2022-11-02 20:18:20,856 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:18:20,858 INFO L225 Difference]: With dead ends: 409 [2022-11-02 20:18:20,858 INFO L226 Difference]: Without dead ends: 409 [2022-11-02 20:18:20,858 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2022-11-02 20:18:20,859 INFO L413 NwaCegarLoop]: 257 mSDtfsCounter, 437 mSDsluCounter, 390 mSDsCounter, 0 mSdLazyCounter, 395 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 437 SdHoareTripleChecker+Valid, 647 SdHoareTripleChecker+Invalid, 402 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 395 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-11-02 20:18:20,860 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [437 Valid, 647 Invalid, 402 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 395 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-11-02 20:18:20,861 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 409 states. [2022-11-02 20:18:20,868 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 409 to 294. [2022-11-02 20:18:20,868 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 294 states, 217 states have (on average 1.5852534562211982) internal successors, (344), 293 states have internal predecessors, (344), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:18:20,870 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 294 states to 294 states and 344 transitions. [2022-11-02 20:18:20,870 INFO L78 Accepts]: Start accepts. Automaton has 294 states and 344 transitions. Word has length 19 [2022-11-02 20:18:20,871 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:18:20,871 INFO L495 AbstractCegarLoop]: Abstraction has 294 states and 344 transitions. [2022-11-02 20:18:20,871 INFO L496 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) [2022-11-02 20:18:20,872 INFO L276 IsEmpty]: Start isEmpty. Operand 294 states and 344 transitions. [2022-11-02 20:18:20,872 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-11-02 20:18:20,872 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:18:20,873 INFO L195 NwaCegarLoop]: 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] [2022-11-02 20:18:20,873 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2022-11-02 20:18:20,873 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr103REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 149 more)] === [2022-11-02 20:18:20,874 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:18:20,874 INFO L85 PathProgramCache]: Analyzing trace with hash -805519643, now seen corresponding path program 1 times [2022-11-02 20:18:20,874 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:18:20,874 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1455656601] [2022-11-02 20:18:20,875 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:18:20,875 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:18:20,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:18:21,104 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:18:21,104 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:18:21,105 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1455656601] [2022-11-02 20:18:21,105 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1455656601] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:18:21,105 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:18:21,105 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-11-02 20:18:21,105 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1027819597] [2022-11-02 20:18:21,106 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:18:21,106 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-02 20:18:21,106 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:18:21,107 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-02 20:18:21,107 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-11-02 20:18:21,107 INFO L87 Difference]: Start difference. First operand 294 states and 344 transitions. Second operand has 7 states, 7 states have (on average 3.4285714285714284) internal successors, (24), 7 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:18:21,456 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:18:21,457 INFO L93 Difference]: Finished difference Result 394 states and 442 transitions. [2022-11-02 20:18:21,457 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-11-02 20:18:21,457 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 3.4285714285714284) internal successors, (24), 7 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 24 [2022-11-02 20:18:21,457 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:18:21,459 INFO L225 Difference]: With dead ends: 394 [2022-11-02 20:18:21,459 INFO L226 Difference]: Without dead ends: 394 [2022-11-02 20:18:21,459 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=46, Invalid=86, Unknown=0, NotChecked=0, Total=132 [2022-11-02 20:18:21,460 INFO L413 NwaCegarLoop]: 245 mSDtfsCounter, 251 mSDsluCounter, 1164 mSDsCounter, 0 mSdLazyCounter, 180 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 251 SdHoareTripleChecker+Valid, 1409 SdHoareTripleChecker+Invalid, 200 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 180 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-02 20:18:21,460 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [251 Valid, 1409 Invalid, 200 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 180 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-02 20:18:21,461 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 394 states. [2022-11-02 20:18:21,464 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 394 to 280. [2022-11-02 20:18:21,465 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 280 states, 203 states have (on average 1.5812807881773399) internal successors, (321), 279 states have internal predecessors, (321), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:18:21,465 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 280 states to 280 states and 321 transitions. [2022-11-02 20:18:21,466 INFO L78 Accepts]: Start accepts. Automaton has 280 states and 321 transitions. Word has length 24 [2022-11-02 20:18:21,466 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:18:21,466 INFO L495 AbstractCegarLoop]: Abstraction has 280 states and 321 transitions. [2022-11-02 20:18:21,466 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 3.4285714285714284) internal successors, (24), 7 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:18:21,466 INFO L276 IsEmpty]: Start isEmpty. Operand 280 states and 321 transitions. [2022-11-02 20:18:21,466 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-11-02 20:18:21,467 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:18:21,467 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:18:21,467 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2022-11-02 20:18:21,467 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr18REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 149 more)] === [2022-11-02 20:18:21,467 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:18:21,467 INFO L85 PathProgramCache]: Analyzing trace with hash -1972902682, now seen corresponding path program 1 times [2022-11-02 20:18:21,467 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:18:21,468 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [143311607] [2022-11-02 20:18:21,468 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:18:21,468 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:18:21,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:18:21,529 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:18:21,529 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:18:21,529 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [143311607] [2022-11-02 20:18:21,529 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [143311607] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:18:21,530 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:18:21,530 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-02 20:18:21,530 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2039746654] [2022-11-02 20:18:21,530 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:18:21,530 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-02 20:18:21,531 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:18:21,531 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-02 20:18:21,531 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-11-02 20:18:21,531 INFO L87 Difference]: Start difference. First operand 280 states and 321 transitions. Second operand has 5 states, 5 states have (on average 4.8) internal successors, (24), 5 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:18:21,604 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:18:21,604 INFO L93 Difference]: Finished difference Result 298 states and 331 transitions. [2022-11-02 20:18:21,604 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-02 20:18:21,605 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 4.8) internal successors, (24), 5 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 24 [2022-11-02 20:18:21,605 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:18:21,606 INFO L225 Difference]: With dead ends: 298 [2022-11-02 20:18:21,606 INFO L226 Difference]: Without dead ends: 298 [2022-11-02 20:18:21,607 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2022-11-02 20:18:21,607 INFO L413 NwaCegarLoop]: 309 mSDtfsCounter, 667 mSDsluCounter, 251 mSDsCounter, 0 mSdLazyCounter, 45 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 667 SdHoareTripleChecker+Valid, 560 SdHoareTripleChecker+Invalid, 46 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 45 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-02 20:18:21,608 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [667 Valid, 560 Invalid, 46 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 45 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-02 20:18:21,609 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 298 states. [2022-11-02 20:18:21,612 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 298 to 280. [2022-11-02 20:18:21,613 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 280 states, 203 states have (on average 1.5763546798029557) internal successors, (320), 279 states have internal predecessors, (320), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:18:21,614 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 280 states to 280 states and 320 transitions. [2022-11-02 20:18:21,614 INFO L78 Accepts]: Start accepts. Automaton has 280 states and 320 transitions. Word has length 24 [2022-11-02 20:18:21,614 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:18:21,614 INFO L495 AbstractCegarLoop]: Abstraction has 280 states and 320 transitions. [2022-11-02 20:18:21,615 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 4.8) internal successors, (24), 5 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:18:21,615 INFO L276 IsEmpty]: Start isEmpty. Operand 280 states and 320 transitions. [2022-11-02 20:18:21,615 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-11-02 20:18:21,615 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:18:21,616 INFO L195 NwaCegarLoop]: 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] [2022-11-02 20:18:21,616 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2022-11-02 20:18:21,616 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr151ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 149 more)] === [2022-11-02 20:18:21,617 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:18:21,617 INFO L85 PathProgramCache]: Analyzing trace with hash -1021020451, now seen corresponding path program 1 times [2022-11-02 20:18:21,617 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:18:21,617 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1654714256] [2022-11-02 20:18:21,617 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:18:21,618 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:18:21,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:18:21,773 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:18:21,773 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:18:21,773 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1654714256] [2022-11-02 20:18:21,774 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1654714256] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:18:21,774 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:18:21,774 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-02 20:18:21,774 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [115997674] [2022-11-02 20:18:21,774 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:18:21,775 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-02 20:18:21,775 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:18:21,775 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-02 20:18:21,776 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-11-02 20:18:21,776 INFO L87 Difference]: Start difference. First operand 280 states and 320 transitions. Second operand has 5 states, 4 states have (on average 6.5) internal successors, (26), 5 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) [2022-11-02 20:18:22,134 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:18:22,134 INFO L93 Difference]: Finished difference Result 288 states and 321 transitions. [2022-11-02 20:18:22,135 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-02 20:18:22,135 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 6.5) internal successors, (26), 5 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 [2022-11-02 20:18:22,135 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:18:22,136 INFO L225 Difference]: With dead ends: 288 [2022-11-02 20:18:22,136 INFO L226 Difference]: Without dead ends: 284 [2022-11-02 20:18:22,137 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-11-02 20:18:22,137 INFO L413 NwaCegarLoop]: 241 mSDtfsCounter, 26 mSDsluCounter, 422 mSDsCounter, 0 mSdLazyCounter, 387 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 663 SdHoareTripleChecker+Invalid, 387 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 387 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-02 20:18:22,138 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [26 Valid, 663 Invalid, 387 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 387 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-11-02 20:18:22,138 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 284 states. [2022-11-02 20:18:22,142 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 284 to 278. [2022-11-02 20:18:22,143 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 278 states, 201 states have (on average 1.5771144278606966) internal successors, (317), 277 states have internal predecessors, (317), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:18:22,144 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 278 states to 278 states and 317 transitions. [2022-11-02 20:18:22,144 INFO L78 Accepts]: Start accepts. Automaton has 278 states and 317 transitions. Word has length 26 [2022-11-02 20:18:22,144 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:18:22,144 INFO L495 AbstractCegarLoop]: Abstraction has 278 states and 317 transitions. [2022-11-02 20:18:22,144 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 6.5) internal successors, (26), 5 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) [2022-11-02 20:18:22,144 INFO L276 IsEmpty]: Start isEmpty. Operand 278 states and 317 transitions. [2022-11-02 20:18:22,145 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2022-11-02 20:18:22,145 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:18:22,145 INFO L195 NwaCegarLoop]: 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] [2022-11-02 20:18:22,145 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2022-11-02 20:18:22,145 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr123REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 149 more)] === [2022-11-02 20:18:22,146 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:18:22,146 INFO L85 PathProgramCache]: Analyzing trace with hash -1580222949, now seen corresponding path program 1 times [2022-11-02 20:18:22,146 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:18:22,146 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [170496513] [2022-11-02 20:18:22,146 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:18:22,146 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:18:22,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:18:22,187 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:18:22,188 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:18:22,188 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [170496513] [2022-11-02 20:18:22,188 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [170496513] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:18:22,188 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:18:22,189 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-02 20:18:22,189 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [756156623] [2022-11-02 20:18:22,189 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:18:22,189 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-02 20:18:22,190 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:18:22,190 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-02 20:18:22,190 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-02 20:18:22,190 INFO L87 Difference]: Start difference. First operand 278 states and 317 transitions. Second operand has 3 states, 3 states have (on average 9.0) internal successors, (27), 3 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) [2022-11-02 20:18:22,206 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:18:22,206 INFO L93 Difference]: Finished difference Result 263 states and 292 transitions. [2022-11-02 20:18:22,206 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-02 20:18:22,207 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 9.0) internal successors, (27), 3 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 [2022-11-02 20:18:22,207 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:18:22,208 INFO L225 Difference]: With dead ends: 263 [2022-11-02 20:18:22,208 INFO L226 Difference]: Without dead ends: 245 [2022-11-02 20:18:22,208 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-02 20:18:22,209 INFO L413 NwaCegarLoop]: 262 mSDtfsCounter, 31 mSDsluCounter, 223 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 31 SdHoareTripleChecker+Valid, 485 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-02 20:18:22,210 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [31 Valid, 485 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-02 20:18:22,211 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 245 states. [2022-11-02 20:18:22,214 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 245 to 245. [2022-11-02 20:18:22,214 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 245 states, 168 states have (on average 1.630952380952381) internal successors, (274), 244 states have internal predecessors, (274), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:18:22,215 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 245 states to 245 states and 274 transitions. [2022-11-02 20:18:22,215 INFO L78 Accepts]: Start accepts. Automaton has 245 states and 274 transitions. Word has length 27 [2022-11-02 20:18:22,216 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:18:22,216 INFO L495 AbstractCegarLoop]: Abstraction has 245 states and 274 transitions. [2022-11-02 20:18:22,216 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 9.0) internal successors, (27), 3 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) [2022-11-02 20:18:22,216 INFO L276 IsEmpty]: Start isEmpty. Operand 245 states and 274 transitions. [2022-11-02 20:18:22,217 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2022-11-02 20:18:22,217 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:18:22,217 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:18:22,217 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2022-11-02 20:18:22,217 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr18REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 149 more)] === [2022-11-02 20:18:22,218 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:18:22,218 INFO L85 PathProgramCache]: Analyzing trace with hash 1161321696, now seen corresponding path program 1 times [2022-11-02 20:18:22,218 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:18:22,218 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [601440391] [2022-11-02 20:18:22,219 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:18:22,219 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:18:22,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:18:22,788 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:18:22,788 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:18:22,788 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [601440391] [2022-11-02 20:18:22,789 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [601440391] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:18:22,789 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:18:22,789 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-11-02 20:18:22,789 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [254137802] [2022-11-02 20:18:22,789 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:18:22,790 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-11-02 20:18:22,790 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:18:22,791 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-11-02 20:18:22,791 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=110, Unknown=0, NotChecked=0, Total=132 [2022-11-02 20:18:22,791 INFO L87 Difference]: Start difference. First operand 245 states and 274 transitions. Second operand has 12 states, 11 states have (on average 2.4545454545454546) internal successors, (27), 12 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) [2022-11-02 20:18:23,997 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:18:23,997 INFO L93 Difference]: Finished difference Result 251 states and 280 transitions. [2022-11-02 20:18:23,998 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-11-02 20:18:23,998 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 2.4545454545454546) internal successors, (27), 12 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 [2022-11-02 20:18:23,998 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:18:23,999 INFO L225 Difference]: With dead ends: 251 [2022-11-02 20:18:23,999 INFO L226 Difference]: Without dead ends: 251 [2022-11-02 20:18:23,999 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 41 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=107, Invalid=355, Unknown=0, NotChecked=0, Total=462 [2022-11-02 20:18:24,000 INFO L413 NwaCegarLoop]: 221 mSDtfsCounter, 257 mSDsluCounter, 1093 mSDsCounter, 0 mSdLazyCounter, 1118 mSolverCounterSat, 58 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 257 SdHoareTripleChecker+Valid, 1314 SdHoareTripleChecker+Invalid, 1176 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 58 IncrementalHoareTripleChecker+Valid, 1118 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2022-11-02 20:18:24,001 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [257 Valid, 1314 Invalid, 1176 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [58 Valid, 1118 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2022-11-02 20:18:24,002 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 251 states. [2022-11-02 20:18:24,005 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 251 to 244. [2022-11-02 20:18:24,005 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 244 states, 168 states have (on average 1.625) internal successors, (273), 243 states have internal predecessors, (273), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:18:24,007 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 244 states to 244 states and 273 transitions. [2022-11-02 20:18:24,007 INFO L78 Accepts]: Start accepts. Automaton has 244 states and 273 transitions. Word has length 27 [2022-11-02 20:18:24,007 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:18:24,007 INFO L495 AbstractCegarLoop]: Abstraction has 244 states and 273 transitions. [2022-11-02 20:18:24,008 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 2.4545454545454546) internal successors, (27), 12 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) [2022-11-02 20:18:24,008 INFO L276 IsEmpty]: Start isEmpty. Operand 244 states and 273 transitions. [2022-11-02 20:18:24,008 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2022-11-02 20:18:24,008 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:18:24,009 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:18:24,009 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2022-11-02 20:18:24,009 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr19REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 149 more)] === [2022-11-02 20:18:24,010 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:18:24,010 INFO L85 PathProgramCache]: Analyzing trace with hash 1161321697, now seen corresponding path program 1 times [2022-11-02 20:18:24,010 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:18:24,010 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2100542660] [2022-11-02 20:18:24,010 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:18:24,011 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:18:24,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:18:25,060 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:18:25,060 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:18:25,060 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2100542660] [2022-11-02 20:18:25,060 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2100542660] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:18:25,061 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:18:25,061 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2022-11-02 20:18:25,061 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1697600633] [2022-11-02 20:18:25,061 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:18:25,062 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-11-02 20:18:25,062 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:18:25,062 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-11-02 20:18:25,063 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=130, Unknown=0, NotChecked=0, Total=156 [2022-11-02 20:18:25,063 INFO L87 Difference]: Start difference. First operand 244 states and 273 transitions. Second operand has 13 states, 12 states have (on average 2.25) internal successors, (27), 13 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) [2022-11-02 20:18:27,272 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:18:27,272 INFO L93 Difference]: Finished difference Result 504 states and 573 transitions. [2022-11-02 20:18:27,276 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2022-11-02 20:18:27,276 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 12 states have (on average 2.25) internal successors, (27), 13 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 [2022-11-02 20:18:27,276 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:18:27,278 INFO L225 Difference]: With dead ends: 504 [2022-11-02 20:18:27,278 INFO L226 Difference]: Without dead ends: 504 [2022-11-02 20:18:27,279 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 92 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=166, Invalid=536, Unknown=0, NotChecked=0, Total=702 [2022-11-02 20:18:27,280 INFO L413 NwaCegarLoop]: 242 mSDtfsCounter, 673 mSDsluCounter, 1622 mSDsCounter, 0 mSdLazyCounter, 1700 mSolverCounterSat, 83 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 673 SdHoareTripleChecker+Valid, 1864 SdHoareTripleChecker+Invalid, 1783 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 83 IncrementalHoareTripleChecker+Valid, 1700 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2022-11-02 20:18:27,280 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [673 Valid, 1864 Invalid, 1783 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [83 Valid, 1700 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2022-11-02 20:18:27,281 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 504 states. [2022-11-02 20:18:27,285 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 504 to 243. [2022-11-02 20:18:27,286 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 243 states, 168 states have (on average 1.619047619047619) internal successors, (272), 242 states have internal predecessors, (272), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:18:27,288 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 243 states to 243 states and 272 transitions. [2022-11-02 20:18:27,288 INFO L78 Accepts]: Start accepts. Automaton has 243 states and 272 transitions. Word has length 27 [2022-11-02 20:18:27,288 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:18:27,288 INFO L495 AbstractCegarLoop]: Abstraction has 243 states and 272 transitions. [2022-11-02 20:18:27,289 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 12 states have (on average 2.25) internal successors, (27), 13 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) [2022-11-02 20:18:27,289 INFO L276 IsEmpty]: Start isEmpty. Operand 243 states and 272 transitions. [2022-11-02 20:18:27,289 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2022-11-02 20:18:27,289 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:18:27,289 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:18:27,289 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2022-11-02 20:18:27,290 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr54REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 149 more)] === [2022-11-02 20:18:27,290 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:18:27,290 INFO L85 PathProgramCache]: Analyzing trace with hash -672116074, now seen corresponding path program 1 times [2022-11-02 20:18:27,290 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:18:27,290 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [834811087] [2022-11-02 20:18:27,291 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:18:27,291 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:18:27,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:18:27,497 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:18:27,497 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:18:27,497 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [834811087] [2022-11-02 20:18:27,497 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [834811087] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:18:27,497 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:18:27,498 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-11-02 20:18:27,499 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1751878690] [2022-11-02 20:18:27,499 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:18:27,500 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-11-02 20:18:27,500 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:18:27,500 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-11-02 20:18:27,501 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2022-11-02 20:18:27,501 INFO L87 Difference]: Start difference. First operand 243 states and 272 transitions. Second operand has 8 states, 8 states have (on average 3.625) internal successors, (29), 8 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) [2022-11-02 20:18:27,850 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:18:27,850 INFO L93 Difference]: Finished difference Result 265 states and 296 transitions. [2022-11-02 20:18:27,851 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-11-02 20:18:27,851 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 3.625) internal successors, (29), 8 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 [2022-11-02 20:18:27,851 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:18:27,852 INFO L225 Difference]: With dead ends: 265 [2022-11-02 20:18:27,852 INFO L226 Difference]: Without dead ends: 265 [2022-11-02 20:18:27,852 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=62, Invalid=120, Unknown=0, NotChecked=0, Total=182 [2022-11-02 20:18:27,853 INFO L413 NwaCegarLoop]: 241 mSDtfsCounter, 725 mSDsluCounter, 693 mSDsCounter, 0 mSdLazyCounter, 209 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 725 SdHoareTripleChecker+Valid, 934 SdHoareTripleChecker+Invalid, 237 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 209 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-02 20:18:27,853 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [725 Valid, 934 Invalid, 237 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 209 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-11-02 20:18:27,854 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 265 states. [2022-11-02 20:18:27,857 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 265 to 243. [2022-11-02 20:18:27,860 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 243 states, 168 states have (on average 1.6130952380952381) internal successors, (271), 242 states have internal predecessors, (271), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:18:27,861 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 243 states to 243 states and 271 transitions. [2022-11-02 20:18:27,861 INFO L78 Accepts]: Start accepts. Automaton has 243 states and 271 transitions. Word has length 29 [2022-11-02 20:18:27,862 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:18:27,862 INFO L495 AbstractCegarLoop]: Abstraction has 243 states and 271 transitions. [2022-11-02 20:18:27,862 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 3.625) internal successors, (29), 8 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) [2022-11-02 20:18:27,862 INFO L276 IsEmpty]: Start isEmpty. Operand 243 states and 271 transitions. [2022-11-02 20:18:27,863 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2022-11-02 20:18:27,864 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:18:27,864 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:18:27,864 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2022-11-02 20:18:27,865 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr24REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 149 more)] === [2022-11-02 20:18:27,865 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:18:27,865 INFO L85 PathProgramCache]: Analyzing trace with hash 102015914, now seen corresponding path program 1 times [2022-11-02 20:18:27,865 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:18:27,866 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1126863837] [2022-11-02 20:18:27,866 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:18:27,866 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:18:27,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:18:28,088 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-11-02 20:18:28,088 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:18:28,089 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1126863837] [2022-11-02 20:18:28,089 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1126863837] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:18:28,089 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:18:28,089 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-02 20:18:28,090 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [891164546] [2022-11-02 20:18:28,090 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:18:28,090 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-02 20:18:28,090 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:18:28,091 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-02 20:18:28,091 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-11-02 20:18:28,091 INFO L87 Difference]: Start difference. First operand 243 states and 271 transitions. Second operand has 5 states, 4 states have (on average 7.5) internal successors, (30), 5 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:18:28,434 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:18:28,434 INFO L93 Difference]: Finished difference Result 259 states and 290 transitions. [2022-11-02 20:18:28,435 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-02 20:18:28,435 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 7.5) internal successors, (30), 5 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 31 [2022-11-02 20:18:28,435 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:18:28,436 INFO L225 Difference]: With dead ends: 259 [2022-11-02 20:18:28,436 INFO L226 Difference]: Without dead ends: 259 [2022-11-02 20:18:28,436 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2022-11-02 20:18:28,437 INFO L413 NwaCegarLoop]: 237 mSDtfsCounter, 51 mSDsluCounter, 436 mSDsCounter, 0 mSdLazyCounter, 323 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 51 SdHoareTripleChecker+Valid, 673 SdHoareTripleChecker+Invalid, 328 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 323 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-02 20:18:28,437 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [51 Valid, 673 Invalid, 328 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 323 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-11-02 20:18:28,438 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 259 states. [2022-11-02 20:18:28,441 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 259 to 242. [2022-11-02 20:18:28,442 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 242 states, 168 states have (on average 1.6071428571428572) internal successors, (270), 241 states have internal predecessors, (270), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:18:28,442 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 242 states to 242 states and 270 transitions. [2022-11-02 20:18:28,442 INFO L78 Accepts]: Start accepts. Automaton has 242 states and 270 transitions. Word has length 31 [2022-11-02 20:18:28,443 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:18:28,443 INFO L495 AbstractCegarLoop]: Abstraction has 242 states and 270 transitions. [2022-11-02 20:18:28,443 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 7.5) internal successors, (30), 5 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:18:28,443 INFO L276 IsEmpty]: Start isEmpty. Operand 242 states and 270 transitions. [2022-11-02 20:18:28,443 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2022-11-02 20:18:28,443 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:18:28,443 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:18:28,444 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2022-11-02 20:18:28,444 INFO L420 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr25REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 149 more)] === [2022-11-02 20:18:28,444 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:18:28,444 INFO L85 PathProgramCache]: Analyzing trace with hash 102015915, now seen corresponding path program 1 times [2022-11-02 20:18:28,444 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:18:28,445 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [645609180] [2022-11-02 20:18:28,445 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:18:28,445 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:18:28,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:18:29,122 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:18:29,122 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:18:29,123 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [645609180] [2022-11-02 20:18:29,124 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [645609180] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:18:29,125 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:18:29,125 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-11-02 20:18:29,125 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1086406986] [2022-11-02 20:18:29,125 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:18:29,126 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-11-02 20:18:29,126 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:18:29,126 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-11-02 20:18:29,126 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2022-11-02 20:18:29,127 INFO L87 Difference]: Start difference. First operand 242 states and 270 transitions. Second operand has 9 states, 8 states have (on average 3.875) internal successors, (31), 9 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) [2022-11-02 20:18:30,061 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:18:30,062 INFO L93 Difference]: Finished difference Result 374 states and 421 transitions. [2022-11-02 20:18:30,062 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-11-02 20:18:30,062 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 3.875) internal successors, (31), 9 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 [2022-11-02 20:18:30,062 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:18:30,064 INFO L225 Difference]: With dead ends: 374 [2022-11-02 20:18:30,064 INFO L226 Difference]: Without dead ends: 374 [2022-11-02 20:18:30,065 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=69, Invalid=141, Unknown=0, NotChecked=0, Total=210 [2022-11-02 20:18:30,065 INFO L413 NwaCegarLoop]: 178 mSDtfsCounter, 542 mSDsluCounter, 769 mSDsCounter, 0 mSdLazyCounter, 814 mSolverCounterSat, 39 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 542 SdHoareTripleChecker+Valid, 947 SdHoareTripleChecker+Invalid, 853 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 39 IncrementalHoareTripleChecker+Valid, 814 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2022-11-02 20:18:30,066 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [542 Valid, 947 Invalid, 853 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [39 Valid, 814 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2022-11-02 20:18:30,066 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 374 states. [2022-11-02 20:18:30,070 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 374 to 241. [2022-11-02 20:18:30,071 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 241 states, 168 states have (on average 1.6011904761904763) internal successors, (269), 240 states have internal predecessors, (269), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:18:30,071 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 241 states to 241 states and 269 transitions. [2022-11-02 20:18:30,072 INFO L78 Accepts]: Start accepts. Automaton has 241 states and 269 transitions. Word has length 31 [2022-11-02 20:18:30,072 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:18:30,072 INFO L495 AbstractCegarLoop]: Abstraction has 241 states and 269 transitions. [2022-11-02 20:18:30,072 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 3.875) internal successors, (31), 9 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) [2022-11-02 20:18:30,073 INFO L276 IsEmpty]: Start isEmpty. Operand 241 states and 269 transitions. [2022-11-02 20:18:30,073 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2022-11-02 20:18:30,073 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:18:30,073 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:18:30,073 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2022-11-02 20:18:30,074 INFO L420 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr54REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 149 more)] === [2022-11-02 20:18:30,074 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:18:30,074 INFO L85 PathProgramCache]: Analyzing trace with hash -1705778921, now seen corresponding path program 1 times [2022-11-02 20:18:30,075 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:18:30,075 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1932524276] [2022-11-02 20:18:30,075 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:18:30,075 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:18:30,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:18:30,332 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:18:30,332 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:18:30,332 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1932524276] [2022-11-02 20:18:30,333 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1932524276] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:18:30,333 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:18:30,333 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-11-02 20:18:30,333 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2146130810] [2022-11-02 20:18:30,333 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:18:30,334 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-02 20:18:30,334 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:18:30,336 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-02 20:18:30,336 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-11-02 20:18:30,341 INFO L87 Difference]: Start difference. First operand 241 states and 269 transitions. Second operand has 7 states, 6 states have (on average 5.666666666666667) internal successors, (34), 7 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:18:30,961 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:18:30,961 INFO L93 Difference]: Finished difference Result 398 states and 443 transitions. [2022-11-02 20:18:30,961 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-11-02 20:18:30,962 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 5.666666666666667) internal successors, (34), 7 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 34 [2022-11-02 20:18:30,962 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:18:30,963 INFO L225 Difference]: With dead ends: 398 [2022-11-02 20:18:30,964 INFO L226 Difference]: Without dead ends: 398 [2022-11-02 20:18:30,964 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2022-11-02 20:18:30,964 INFO L413 NwaCegarLoop]: 140 mSDtfsCounter, 580 mSDsluCounter, 474 mSDsCounter, 0 mSdLazyCounter, 624 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 580 SdHoareTripleChecker+Valid, 614 SdHoareTripleChecker+Invalid, 653 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 624 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-11-02 20:18:30,965 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [580 Valid, 614 Invalid, 653 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 624 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-11-02 20:18:30,966 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 398 states. [2022-11-02 20:18:30,969 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 398 to 244. [2022-11-02 20:18:30,970 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 244 states, 173 states have (on average 1.5953757225433527) internal successors, (276), 243 states have internal predecessors, (276), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:18:30,971 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 244 states to 244 states and 276 transitions. [2022-11-02 20:18:30,971 INFO L78 Accepts]: Start accepts. Automaton has 244 states and 276 transitions. Word has length 34 [2022-11-02 20:18:30,971 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:18:30,971 INFO L495 AbstractCegarLoop]: Abstraction has 244 states and 276 transitions. [2022-11-02 20:18:30,971 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 5.666666666666667) internal successors, (34), 7 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:18:30,972 INFO L276 IsEmpty]: Start isEmpty. Operand 244 states and 276 transitions. [2022-11-02 20:18:30,972 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2022-11-02 20:18:30,972 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:18:30,972 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:18:30,972 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2022-11-02 20:18:30,973 INFO L420 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr55REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 149 more)] === [2022-11-02 20:18:30,973 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:18:30,973 INFO L85 PathProgramCache]: Analyzing trace with hash -1705778920, now seen corresponding path program 1 times [2022-11-02 20:18:30,973 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:18:30,973 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [490643006] [2022-11-02 20:18:30,973 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:18:30,974 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:18:30,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:18:31,273 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:18:31,273 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:18:31,274 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [490643006] [2022-11-02 20:18:31,274 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [490643006] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:18:31,274 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:18:31,274 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-11-02 20:18:31,274 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1073524727] [2022-11-02 20:18:31,275 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:18:31,275 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-11-02 20:18:31,275 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:18:31,276 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-11-02 20:18:31,276 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2022-11-02 20:18:31,276 INFO L87 Difference]: Start difference. First operand 244 states and 276 transitions. Second operand has 8 states, 7 states have (on average 4.857142857142857) internal successors, (34), 8 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) [2022-11-02 20:18:32,203 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:18:32,203 INFO L93 Difference]: Finished difference Result 496 states and 560 transitions. [2022-11-02 20:18:32,204 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-11-02 20:18:32,204 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 4.857142857142857) internal successors, (34), 8 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 [2022-11-02 20:18:32,204 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:18:32,206 INFO L225 Difference]: With dead ends: 496 [2022-11-02 20:18:32,206 INFO L226 Difference]: Without dead ends: 496 [2022-11-02 20:18:32,207 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=63, Invalid=147, Unknown=0, NotChecked=0, Total=210 [2022-11-02 20:18:32,207 INFO L413 NwaCegarLoop]: 162 mSDtfsCounter, 712 mSDsluCounter, 553 mSDsCounter, 0 mSdLazyCounter, 744 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 712 SdHoareTripleChecker+Valid, 715 SdHoareTripleChecker+Invalid, 772 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 744 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2022-11-02 20:18:32,207 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [712 Valid, 715 Invalid, 772 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 744 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2022-11-02 20:18:32,208 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 496 states. [2022-11-02 20:18:32,214 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 496 to 308. [2022-11-02 20:18:32,215 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 308 states, 237 states have (on average 1.5738396624472575) internal successors, (373), 307 states have internal predecessors, (373), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:18:32,216 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 308 states to 308 states and 373 transitions. [2022-11-02 20:18:32,216 INFO L78 Accepts]: Start accepts. Automaton has 308 states and 373 transitions. Word has length 34 [2022-11-02 20:18:32,216 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:18:32,216 INFO L495 AbstractCegarLoop]: Abstraction has 308 states and 373 transitions. [2022-11-02 20:18:32,217 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 4.857142857142857) internal successors, (34), 8 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) [2022-11-02 20:18:32,217 INFO L276 IsEmpty]: Start isEmpty. Operand 308 states and 373 transitions. [2022-11-02 20:18:32,217 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2022-11-02 20:18:32,217 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:18:32,218 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:18:32,218 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2022-11-02 20:18:32,218 INFO L420 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr38REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 149 more)] === [2022-11-02 20:18:32,218 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:18:32,219 INFO L85 PathProgramCache]: Analyzing trace with hash -1332799064, now seen corresponding path program 1 times [2022-11-02 20:18:32,219 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:18:32,219 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1810417007] [2022-11-02 20:18:32,219 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:18:32,219 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:18:32,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:18:33,395 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:18:33,395 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:18:33,395 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1810417007] [2022-11-02 20:18:33,395 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1810417007] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:18:33,395 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:18:33,395 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2022-11-02 20:18:33,396 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [668715496] [2022-11-02 20:18:33,396 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:18:33,396 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-11-02 20:18:33,396 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:18:33,396 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-11-02 20:18:33,397 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=179, Unknown=0, NotChecked=0, Total=210 [2022-11-02 20:18:33,397 INFO L87 Difference]: Start difference. First operand 308 states and 373 transitions. Second operand has 15 states, 15 states have (on average 2.3333333333333335) internal successors, (35), 15 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:18:35,154 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:18:35,155 INFO L93 Difference]: Finished difference Result 310 states and 374 transitions. [2022-11-02 20:18:35,155 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2022-11-02 20:18:35,155 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 2.3333333333333335) internal successors, (35), 15 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 35 [2022-11-02 20:18:35,155 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:18:35,158 INFO L225 Difference]: With dead ends: 310 [2022-11-02 20:18:35,158 INFO L226 Difference]: Without dead ends: 310 [2022-11-02 20:18:35,158 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 106 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=153, Invalid=659, Unknown=0, NotChecked=0, Total=812 [2022-11-02 20:18:35,159 INFO L413 NwaCegarLoop]: 210 mSDtfsCounter, 293 mSDsluCounter, 1655 mSDsCounter, 0 mSdLazyCounter, 1075 mSolverCounterSat, 42 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 293 SdHoareTripleChecker+Valid, 1865 SdHoareTripleChecker+Invalid, 1117 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 42 IncrementalHoareTripleChecker+Valid, 1075 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2022-11-02 20:18:35,159 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [293 Valid, 1865 Invalid, 1117 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [42 Valid, 1075 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2022-11-02 20:18:35,160 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 310 states. [2022-11-02 20:18:35,165 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 310 to 308. [2022-11-02 20:18:35,166 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 308 states, 237 states have (on average 1.5696202531645569) internal successors, (372), 307 states have internal predecessors, (372), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:18:35,167 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 308 states to 308 states and 372 transitions. [2022-11-02 20:18:35,167 INFO L78 Accepts]: Start accepts. Automaton has 308 states and 372 transitions. Word has length 35 [2022-11-02 20:18:35,167 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:18:35,168 INFO L495 AbstractCegarLoop]: Abstraction has 308 states and 372 transitions. [2022-11-02 20:18:35,168 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 2.3333333333333335) internal successors, (35), 15 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:18:35,168 INFO L276 IsEmpty]: Start isEmpty. Operand 308 states and 372 transitions. [2022-11-02 20:18:35,168 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2022-11-02 20:18:35,169 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:18:35,169 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:18:35,169 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2022-11-02 20:18:35,169 INFO L420 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr30REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 149 more)] === [2022-11-02 20:18:35,170 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:18:35,170 INFO L85 PathProgramCache]: Analyzing trace with hash -561839822, now seen corresponding path program 1 times [2022-11-02 20:18:35,170 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:18:35,170 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1627691323] [2022-11-02 20:18:35,171 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:18:35,171 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:18:35,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:18:36,404 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:18:36,404 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:18:36,404 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1627691323] [2022-11-02 20:18:36,404 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1627691323] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-02 20:18:36,404 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1356469707] [2022-11-02 20:18:36,405 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:18:36,405 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-02 20:18:36,405 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_480cfb37-46ef-4eba-97f5-ce88cab73a92/bin/uautomizer-Dbtcem3rbc/z3 [2022-11-02 20:18:36,412 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_480cfb37-46ef-4eba-97f5-ce88cab73a92/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-02 20:18:36,447 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_480cfb37-46ef-4eba-97f5-ce88cab73a92/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-11-02 20:18:36,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:18:36,642 INFO L263 TraceCheckSpWp]: Trace formula consists of 279 conjuncts, 54 conjunts are in the unsatisfiable core [2022-11-02 20:18:36,656 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-02 20:18:36,826 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-11-02 20:18:36,874 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-02 20:18:36,885 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-02 20:18:36,954 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-11-02 20:18:36,955 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2022-11-02 20:18:36,996 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 18 [2022-11-02 20:18:37,010 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2022-11-02 20:18:37,081 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 34 [2022-11-02 20:18:37,104 INFO L356 Elim1Store]: treesize reduction 37, result has 15.9 percent of original size [2022-11-02 20:18:37,104 INFO L390 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 3 new quantified variables, introduced 2 case distinctions, treesize of input 44 treesize of output 41 [2022-11-02 20:18:37,236 INFO L356 Elim1Store]: treesize reduction 37, result has 15.9 percent of original size [2022-11-02 20:18:37,236 INFO L390 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 44 treesize of output 41 [2022-11-02 20:18:37,249 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 34 [2022-11-02 20:18:37,406 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-02 20:18:37,415 INFO L356 Elim1Store]: treesize reduction 31, result has 8.8 percent of original size [2022-11-02 20:18:37,416 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 65 treesize of output 37 [2022-11-02 20:18:37,430 INFO L356 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2022-11-02 20:18:37,430 INFO L390 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 1 case distinctions, treesize of input 28 treesize of output 18 [2022-11-02 20:18:37,440 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:18:37,440 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-02 20:18:47,538 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-02 20:18:47,682 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:18:47,682 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1356469707] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-02 20:18:47,683 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-02 20:18:47,683 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 10, 11] total 22 [2022-11-02 20:18:47,683 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1596721580] [2022-11-02 20:18:47,683 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-02 20:18:47,684 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2022-11-02 20:18:47,684 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:18:47,685 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2022-11-02 20:18:47,685 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=400, Unknown=1, NotChecked=0, Total=462 [2022-11-02 20:18:47,685 INFO L87 Difference]: Start difference. First operand 308 states and 372 transitions. Second operand has 22 states, 22 states have (on average 3.3181818181818183) internal successors, (73), 22 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:18:48,550 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:18:48,551 INFO L93 Difference]: Finished difference Result 341 states and 406 transitions. [2022-11-02 20:18:48,551 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-11-02 20:18:48,551 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 22 states have (on average 3.3181818181818183) internal successors, (73), 22 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 35 [2022-11-02 20:18:48,551 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:18:48,553 INFO L225 Difference]: With dead ends: 341 [2022-11-02 20:18:48,553 INFO L226 Difference]: Without dead ends: 341 [2022-11-02 20:18:48,553 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 88 GetRequests, 62 SyntacticMatches, 1 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 126 ImplicationChecksByTransitivity, 10.1s TimeCoverageRelationStatistics Valid=102, Invalid=599, Unknown=1, NotChecked=0, Total=702 [2022-11-02 20:18:48,554 INFO L413 NwaCegarLoop]: 237 mSDtfsCounter, 26 mSDsluCounter, 2545 mSDsCounter, 0 mSdLazyCounter, 554 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 2782 SdHoareTripleChecker+Invalid, 1249 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 554 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 684 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-11-02 20:18:48,554 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [26 Valid, 2782 Invalid, 1249 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 554 Invalid, 0 Unknown, 684 Unchecked, 0.6s Time] [2022-11-02 20:18:48,555 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 341 states. [2022-11-02 20:18:48,561 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 341 to 337. [2022-11-02 20:18:48,561 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 337 states, 266 states have (on average 1.5112781954887218) internal successors, (402), 336 states have internal predecessors, (402), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:18:48,562 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 337 states to 337 states and 402 transitions. [2022-11-02 20:18:48,562 INFO L78 Accepts]: Start accepts. Automaton has 337 states and 402 transitions. Word has length 35 [2022-11-02 20:18:48,563 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:18:48,563 INFO L495 AbstractCegarLoop]: Abstraction has 337 states and 402 transitions. [2022-11-02 20:18:48,563 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 22 states have (on average 3.3181818181818183) internal successors, (73), 22 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:18:48,563 INFO L276 IsEmpty]: Start isEmpty. Operand 337 states and 402 transitions. [2022-11-02 20:18:48,564 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2022-11-02 20:18:48,564 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:18:48,564 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:18:48,608 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_480cfb37-46ef-4eba-97f5-ce88cab73a92/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-11-02 20:18:48,765 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_480cfb37-46ef-4eba-97f5-ce88cab73a92/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable28 [2022-11-02 20:18:48,765 INFO L420 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr38REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 149 more)] === [2022-11-02 20:18:48,766 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:18:48,766 INFO L85 PathProgramCache]: Analyzing trace with hash 2034656951, now seen corresponding path program 1 times [2022-11-02 20:18:48,766 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:18:48,766 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [755179726] [2022-11-02 20:18:48,766 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:18:48,766 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:18:48,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:18:49,042 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-11-02 20:18:49,042 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:18:49,043 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [755179726] [2022-11-02 20:18:49,043 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [755179726] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:18:49,043 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:18:49,043 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-02 20:18:49,043 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [350387605] [2022-11-02 20:18:49,044 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:18:49,044 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-02 20:18:49,044 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:18:49,044 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-02 20:18:49,045 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-11-02 20:18:49,045 INFO L87 Difference]: Start difference. First operand 337 states and 402 transitions. Second operand has 5 states, 5 states have (on average 7.8) internal successors, (39), 5 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:18:49,282 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:18:49,282 INFO L93 Difference]: Finished difference Result 343 states and 409 transitions. [2022-11-02 20:18:49,283 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-02 20:18:49,283 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 7.8) internal successors, (39), 5 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 40 [2022-11-02 20:18:49,283 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:18:49,285 INFO L225 Difference]: With dead ends: 343 [2022-11-02 20:18:49,285 INFO L226 Difference]: Without dead ends: 343 [2022-11-02 20:18:49,285 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-11-02 20:18:49,286 INFO L413 NwaCegarLoop]: 249 mSDtfsCounter, 2 mSDsluCounter, 596 mSDsCounter, 0 mSdLazyCounter, 169 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 845 SdHoareTripleChecker+Invalid, 170 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 169 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-02 20:18:49,286 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 845 Invalid, 170 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 169 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-02 20:18:49,287 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 343 states. [2022-11-02 20:18:49,292 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 343 to 341. [2022-11-02 20:18:49,293 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 341 states, 270 states have (on average 1.5074074074074073) internal successors, (407), 340 states have internal predecessors, (407), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:18:49,294 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 341 states to 341 states and 407 transitions. [2022-11-02 20:18:49,294 INFO L78 Accepts]: Start accepts. Automaton has 341 states and 407 transitions. Word has length 40 [2022-11-02 20:18:49,294 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:18:49,295 INFO L495 AbstractCegarLoop]: Abstraction has 341 states and 407 transitions. [2022-11-02 20:18:49,295 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 7.8) internal successors, (39), 5 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:18:49,295 INFO L276 IsEmpty]: Start isEmpty. Operand 341 states and 407 transitions. [2022-11-02 20:18:49,295 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2022-11-02 20:18:49,296 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:18:49,296 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:18:49,296 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2022-11-02 20:18:49,296 INFO L420 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr95REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 149 more)] === [2022-11-02 20:18:49,297 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:18:49,297 INFO L85 PathProgramCache]: Analyzing trace with hash 854914797, now seen corresponding path program 1 times [2022-11-02 20:18:49,297 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:18:49,297 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1058237003] [2022-11-02 20:18:49,297 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:18:49,298 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:18:49,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:18:49,497 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:18:49,498 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:18:49,498 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1058237003] [2022-11-02 20:18:49,498 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1058237003] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:18:49,498 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:18:49,498 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-11-02 20:18:49,499 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [476118217] [2022-11-02 20:18:49,499 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:18:49,499 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-11-02 20:18:49,499 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:18:49,500 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-11-02 20:18:49,500 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2022-11-02 20:18:49,500 INFO L87 Difference]: Start difference. First operand 341 states and 407 transitions. Second operand has 8 states, 8 states have (on average 5.375) internal successors, (43), 8 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:18:49,859 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:18:49,860 INFO L93 Difference]: Finished difference Result 461 states and 515 transitions. [2022-11-02 20:18:49,860 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-11-02 20:18:49,860 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 5.375) internal successors, (43), 8 states have internal predecessors, (43), 0 states have call successors, (0), 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 43 [2022-11-02 20:18:49,860 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:18:49,862 INFO L225 Difference]: With dead ends: 461 [2022-11-02 20:18:49,862 INFO L226 Difference]: Without dead ends: 461 [2022-11-02 20:18:49,862 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=110, Invalid=232, Unknown=0, NotChecked=0, Total=342 [2022-11-02 20:18:49,863 INFO L413 NwaCegarLoop]: 229 mSDtfsCounter, 1409 mSDsluCounter, 727 mSDsCounter, 0 mSdLazyCounter, 143 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1409 SdHoareTripleChecker+Valid, 956 SdHoareTripleChecker+Invalid, 160 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 143 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-02 20:18:49,863 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1409 Valid, 956 Invalid, 160 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 143 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-02 20:18:49,864 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 461 states. [2022-11-02 20:18:49,869 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 461 to 340. [2022-11-02 20:18:49,870 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 340 states, 269 states have (on average 1.4981412639405205) internal successors, (403), 339 states have internal predecessors, (403), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:18:49,871 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 340 states to 340 states and 403 transitions. [2022-11-02 20:18:49,871 INFO L78 Accepts]: Start accepts. Automaton has 340 states and 403 transitions. Word has length 43 [2022-11-02 20:18:49,872 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:18:49,872 INFO L495 AbstractCegarLoop]: Abstraction has 340 states and 403 transitions. [2022-11-02 20:18:49,872 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 5.375) internal successors, (43), 8 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:18:49,872 INFO L276 IsEmpty]: Start isEmpty. Operand 340 states and 403 transitions. [2022-11-02 20:18:49,873 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2022-11-02 20:18:49,873 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:18:49,873 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:18:49,873 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2022-11-02 20:18:49,874 INFO L420 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr95REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 149 more)] === [2022-11-02 20:18:49,874 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:18:49,874 INFO L85 PathProgramCache]: Analyzing trace with hash 190981616, now seen corresponding path program 1 times [2022-11-02 20:18:49,874 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:18:49,875 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1447075278] [2022-11-02 20:18:49,875 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:18:49,875 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:18:49,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:18:50,034 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-11-02 20:18:50,034 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:18:50,034 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1447075278] [2022-11-02 20:18:50,035 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1447075278] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:18:50,035 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:18:50,035 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-02 20:18:50,035 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2146657746] [2022-11-02 20:18:50,035 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:18:50,036 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-02 20:18:50,036 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:18:50,037 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-02 20:18:50,037 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-11-02 20:18:50,037 INFO L87 Difference]: Start difference. First operand 340 states and 403 transitions. Second operand has 5 states, 4 states have (on average 11.0) internal successors, (44), 5 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:18:50,495 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:18:50,495 INFO L93 Difference]: Finished difference Result 445 states and 521 transitions. [2022-11-02 20:18:50,496 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-02 20:18:50,496 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 11.0) internal successors, (44), 5 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 45 [2022-11-02 20:18:50,496 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:18:50,498 INFO L225 Difference]: With dead ends: 445 [2022-11-02 20:18:50,498 INFO L226 Difference]: Without dead ends: 445 [2022-11-02 20:18:50,498 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2022-11-02 20:18:50,499 INFO L413 NwaCegarLoop]: 181 mSDtfsCounter, 359 mSDsluCounter, 240 mSDsCounter, 0 mSdLazyCounter, 318 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 359 SdHoareTripleChecker+Valid, 421 SdHoareTripleChecker+Invalid, 326 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 318 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-11-02 20:18:50,499 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [359 Valid, 421 Invalid, 326 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 318 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-11-02 20:18:50,500 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 445 states. [2022-11-02 20:18:50,508 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 445 to 344. [2022-11-02 20:18:50,510 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 344 states, 273 states have (on average 1.4945054945054945) internal successors, (408), 343 states have internal predecessors, (408), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:18:50,511 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 344 states to 344 states and 408 transitions. [2022-11-02 20:18:50,511 INFO L78 Accepts]: Start accepts. Automaton has 344 states and 408 transitions. Word has length 45 [2022-11-02 20:18:50,512 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:18:50,512 INFO L495 AbstractCegarLoop]: Abstraction has 344 states and 408 transitions. [2022-11-02 20:18:50,512 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 11.0) internal successors, (44), 5 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:18:50,512 INFO L276 IsEmpty]: Start isEmpty. Operand 344 states and 408 transitions. [2022-11-02 20:18:50,513 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2022-11-02 20:18:50,513 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:18:50,513 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:18:50,514 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2022-11-02 20:18:50,514 INFO L420 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr96REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 149 more)] === [2022-11-02 20:18:50,514 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:18:50,514 INFO L85 PathProgramCache]: Analyzing trace with hash 190981617, now seen corresponding path program 1 times [2022-11-02 20:18:50,515 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:18:50,515 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [49150108] [2022-11-02 20:18:50,515 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:18:50,515 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:18:50,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:18:51,139 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:18:51,139 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:18:51,139 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [49150108] [2022-11-02 20:18:51,139 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [49150108] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:18:51,139 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:18:51,139 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2022-11-02 20:18:51,139 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1536426982] [2022-11-02 20:18:51,140 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:18:51,140 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-11-02 20:18:51,140 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:18:51,140 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-11-02 20:18:51,140 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=149, Unknown=0, NotChecked=0, Total=182 [2022-11-02 20:18:51,141 INFO L87 Difference]: Start difference. First operand 344 states and 408 transitions. Second operand has 14 states, 14 states have (on average 3.2142857142857144) internal successors, (45), 14 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:18:52,260 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:18:52,260 INFO L93 Difference]: Finished difference Result 371 states and 438 transitions. [2022-11-02 20:18:52,261 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-11-02 20:18:52,261 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 3.2142857142857144) internal successors, (45), 14 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 45 [2022-11-02 20:18:52,261 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:18:52,263 INFO L225 Difference]: With dead ends: 371 [2022-11-02 20:18:52,263 INFO L226 Difference]: Without dead ends: 367 [2022-11-02 20:18:52,263 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 79 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=140, Invalid=562, Unknown=0, NotChecked=0, Total=702 [2022-11-02 20:18:52,264 INFO L413 NwaCegarLoop]: 219 mSDtfsCounter, 414 mSDsluCounter, 1675 mSDsCounter, 0 mSdLazyCounter, 772 mSolverCounterSat, 43 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 414 SdHoareTripleChecker+Valid, 1894 SdHoareTripleChecker+Invalid, 815 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 43 IncrementalHoareTripleChecker+Valid, 772 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2022-11-02 20:18:52,264 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [414 Valid, 1894 Invalid, 815 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [43 Valid, 772 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2022-11-02 20:18:52,265 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 367 states. [2022-11-02 20:18:52,269 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 367 to 345. [2022-11-02 20:18:52,273 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 345 states, 274 states have (on average 1.489051094890511) internal successors, (408), 344 states have internal predecessors, (408), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:18:52,274 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 345 states to 345 states and 408 transitions. [2022-11-02 20:18:52,274 INFO L78 Accepts]: Start accepts. Automaton has 345 states and 408 transitions. Word has length 45 [2022-11-02 20:18:52,274 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:18:52,274 INFO L495 AbstractCegarLoop]: Abstraction has 345 states and 408 transitions. [2022-11-02 20:18:52,275 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 3.2142857142857144) internal successors, (45), 14 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:18:52,275 INFO L276 IsEmpty]: Start isEmpty. Operand 345 states and 408 transitions. [2022-11-02 20:18:52,275 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2022-11-02 20:18:52,275 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:18:52,275 INFO L195 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:18:52,276 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2022-11-02 20:18:52,276 INFO L420 AbstractCegarLoop]: === Iteration 34 === Targeting ULTIMATE.startErr30REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 149 more)] === [2022-11-02 20:18:52,276 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:18:52,276 INFO L85 PathProgramCache]: Analyzing trace with hash 767246721, now seen corresponding path program 2 times [2022-11-02 20:18:52,277 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:18:52,277 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [32057584] [2022-11-02 20:18:52,277 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:18:52,277 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:18:52,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:18:54,581 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 8 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:18:54,581 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:18:54,581 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [32057584] [2022-11-02 20:18:54,581 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [32057584] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-02 20:18:54,582 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [169227023] [2022-11-02 20:18:54,582 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-11-02 20:18:54,582 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-02 20:18:54,582 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_480cfb37-46ef-4eba-97f5-ce88cab73a92/bin/uautomizer-Dbtcem3rbc/z3 [2022-11-02 20:18:54,583 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_480cfb37-46ef-4eba-97f5-ce88cab73a92/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-02 20:18:54,625 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_480cfb37-46ef-4eba-97f5-ce88cab73a92/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-11-02 20:18:54,846 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-11-02 20:18:54,846 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-02 20:18:54,850 INFO L263 TraceCheckSpWp]: Trace formula consists of 378 conjuncts, 72 conjunts are in the unsatisfiable core [2022-11-02 20:18:54,856 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-02 20:18:54,862 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-11-02 20:18:54,890 INFO L356 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-11-02 20:18:54,891 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 18 [2022-11-02 20:18:54,940 INFO L356 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-11-02 20:18:54,941 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 16 treesize of output 22 [2022-11-02 20:18:55,030 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-02 20:18:55,105 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-02 20:18:55,106 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 29 [2022-11-02 20:18:55,318 INFO L356 Elim1Store]: treesize reduction 19, result has 47.2 percent of original size [2022-11-02 20:18:55,318 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 35 treesize of output 45 [2022-11-02 20:18:55,429 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-02 20:18:55,431 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 37 [2022-11-02 20:18:55,453 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-02 20:18:55,686 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2022-11-02 20:18:55,728 INFO L356 Elim1Store]: treesize reduction 76, result has 16.5 percent of original size [2022-11-02 20:18:55,728 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 5 case distinctions, treesize of input 90 treesize of output 54 [2022-11-02 20:18:56,467 INFO L356 Elim1Store]: treesize reduction 102, result has 12.8 percent of original size [2022-11-02 20:18:56,468 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 8 case distinctions, treesize of input 80 treesize of output 56 [2022-11-02 20:18:56,491 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2022-11-02 20:18:56,641 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-11-02 20:18:56,897 INFO L356 Elim1Store]: treesize reduction 72, result has 17.2 percent of original size [2022-11-02 20:18:56,897 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 5 case distinctions, treesize of input 64 treesize of output 45 [2022-11-02 20:18:57,052 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-02 20:18:57,053 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 17 [2022-11-02 20:18:57,178 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 9 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:18:57,178 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-02 20:19:04,832 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 9 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:19:04,832 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [169227023] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-02 20:19:04,832 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-02 20:19:04,832 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 21, 21] total 53 [2022-11-02 20:19:04,832 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [93428101] [2022-11-02 20:19:04,833 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-02 20:19:04,833 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 54 states [2022-11-02 20:19:04,833 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:19:04,834 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 54 interpolants. [2022-11-02 20:19:04,835 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=191, Invalid=2669, Unknown=2, NotChecked=0, Total=2862 [2022-11-02 20:19:04,835 INFO L87 Difference]: Start difference. First operand 345 states and 408 transitions. Second operand has 54 states, 53 states have (on average 1.9622641509433962) internal successors, (104), 54 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:19:10,373 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:19:10,373 INFO L93 Difference]: Finished difference Result 631 states and 756 transitions. [2022-11-02 20:19:10,374 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2022-11-02 20:19:10,374 INFO L78 Accepts]: Start accepts. Automaton has has 54 states, 53 states have (on average 1.9622641509433962) internal successors, (104), 54 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 46 [2022-11-02 20:19:10,374 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:19:10,377 INFO L225 Difference]: With dead ends: 631 [2022-11-02 20:19:10,377 INFO L226 Difference]: Without dead ends: 631 [2022-11-02 20:19:10,379 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 139 GetRequests, 60 SyntacticMatches, 8 SemanticMatches, 71 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1018 ImplicationChecksByTransitivity, 11.8s TimeCoverageRelationStatistics Valid=709, Invalid=4545, Unknown=2, NotChecked=0, Total=5256 [2022-11-02 20:19:10,380 INFO L413 NwaCegarLoop]: 229 mSDtfsCounter, 486 mSDsluCounter, 3874 mSDsCounter, 0 mSdLazyCounter, 2452 mSolverCounterSat, 67 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 486 SdHoareTripleChecker+Valid, 4103 SdHoareTripleChecker+Invalid, 4014 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 67 IncrementalHoareTripleChecker+Valid, 2452 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 1495 IncrementalHoareTripleChecker+Unchecked, 2.4s IncrementalHoareTripleChecker+Time [2022-11-02 20:19:10,380 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [486 Valid, 4103 Invalid, 4014 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [67 Valid, 2452 Invalid, 0 Unknown, 1495 Unchecked, 2.4s Time] [2022-11-02 20:19:10,382 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 631 states. [2022-11-02 20:19:10,388 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 631 to 344. [2022-11-02 20:19:10,389 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 344 states, 274 states have (on average 1.4854014598540146) internal successors, (407), 343 states have internal predecessors, (407), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:19:10,390 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 344 states to 344 states and 407 transitions. [2022-11-02 20:19:10,390 INFO L78 Accepts]: Start accepts. Automaton has 344 states and 407 transitions. Word has length 46 [2022-11-02 20:19:10,390 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:19:10,391 INFO L495 AbstractCegarLoop]: Abstraction has 344 states and 407 transitions. [2022-11-02 20:19:10,391 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 54 states, 53 states have (on average 1.9622641509433962) internal successors, (104), 54 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:19:10,391 INFO L276 IsEmpty]: Start isEmpty. Operand 344 states and 407 transitions. [2022-11-02 20:19:10,392 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2022-11-02 20:19:10,392 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:19:10,392 INFO L195 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:19:10,437 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_480cfb37-46ef-4eba-97f5-ce88cab73a92/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-11-02 20:19:10,605 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_480cfb37-46ef-4eba-97f5-ce88cab73a92/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable33 [2022-11-02 20:19:10,606 INFO L420 AbstractCegarLoop]: === Iteration 35 === Targeting ULTIMATE.startErr31REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 149 more)] === [2022-11-02 20:19:10,606 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:19:10,606 INFO L85 PathProgramCache]: Analyzing trace with hash 767246722, now seen corresponding path program 1 times [2022-11-02 20:19:10,606 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:19:10,607 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [416479764] [2022-11-02 20:19:10,607 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:19:10,607 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:19:10,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:19:13,530 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 4 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:19:13,530 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:19:13,531 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [416479764] [2022-11-02 20:19:13,532 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [416479764] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-02 20:19:13,532 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2117458521] [2022-11-02 20:19:13,532 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:19:13,532 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-02 20:19:13,533 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_480cfb37-46ef-4eba-97f5-ce88cab73a92/bin/uautomizer-Dbtcem3rbc/z3 [2022-11-02 20:19:13,535 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_480cfb37-46ef-4eba-97f5-ce88cab73a92/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-02 20:19:13,538 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_480cfb37-46ef-4eba-97f5-ce88cab73a92/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-11-02 20:19:13,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:19:13,754 INFO L263 TraceCheckSpWp]: Trace formula consists of 378 conjuncts, 84 conjunts are in the unsatisfiable core [2022-11-02 20:19:13,762 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-02 20:19:13,770 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-11-02 20:19:13,944 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-02 20:19:13,945 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-11-02 20:19:13,973 INFO L356 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-11-02 20:19:13,974 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2022-11-02 20:19:14,181 INFO L356 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-11-02 20:19:14,181 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 20 [2022-11-02 20:19:14,226 INFO L356 Elim1Store]: treesize reduction 36, result has 34.5 percent of original size [2022-11-02 20:19:14,226 INFO L390 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 22 treesize of output 33 [2022-11-02 20:19:14,415 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-02 20:19:14,424 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 3 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 [2022-11-02 20:19:14,756 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-02 20:19:14,758 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-11-02 20:19:14,783 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-02 20:19:14,802 INFO L356 Elim1Store]: treesize reduction 8, result has 52.9 percent of original size [2022-11-02 20:19:14,802 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 2 case distinctions, treesize of input 25 treesize of output 21 [2022-11-02 20:19:14,891 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 29 [2022-11-02 20:19:14,902 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2022-11-02 20:19:15,085 INFO L356 Elim1Store]: treesize reduction 37, result has 15.9 percent of original size [2022-11-02 20:19:15,085 INFO L390 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 75 treesize of output 52 [2022-11-02 20:19:15,100 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 34 [2022-11-02 20:19:15,278 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 34 [2022-11-02 20:19:15,301 INFO L356 Elim1Store]: treesize reduction 37, result has 15.9 percent of original size [2022-11-02 20:19:15,301 INFO L390 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 75 treesize of output 52 [2022-11-02 20:19:15,561 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-02 20:19:15,588 INFO L356 Elim1Store]: treesize reduction 109, result has 9.2 percent of original size [2022-11-02 20:19:15,589 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 5 case distinctions, treesize of input 112 treesize of output 67 [2022-11-02 20:19:15,600 INFO L356 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-11-02 20:19:15,601 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 1 case distinctions, treesize of input 36 treesize of output 33 [2022-11-02 20:19:15,737 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 10 [2022-11-02 20:19:15,742 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 21 [2022-11-02 20:19:15,748 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 9 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:19:15,748 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-02 20:19:18,309 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~#iter~0#1.base|)) (.cse2 (+ |c_ULTIMATE.start_main_~list~0#1.offset| 4))) (and (forall ((|ULTIMATE.start_main_~#iter~0#1.offset| Int) (v_ArrVal_1381 Int) (v_ArrVal_1380 Int)) (let ((.cse1 (+ |ULTIMATE.start_main_~#iter~0#1.offset| 4))) (<= (+ (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~#iter~0#1.base| (store (store .cse0 |ULTIMATE.start_main_~#iter~0#1.offset| |c_ULTIMATE.start_main_~list~0#1.offset|) .cse1 v_ArrVal_1380)) |c_ULTIMATE.start_main_~list~0#1.base|) .cse2) 4) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#iter~0#1.base| (store (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#iter~0#1.base|) |ULTIMATE.start_main_~#iter~0#1.offset| |c_ULTIMATE.start_main_~list~0#1.base|) .cse1 v_ArrVal_1381)) |c_ULTIMATE.start_main_~list~0#1.base|) .cse2))))) (forall ((|ULTIMATE.start_main_~#iter~0#1.offset| Int) (v_ArrVal_1380 Int)) (<= 0 (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~#iter~0#1.base| (store (store .cse0 |ULTIMATE.start_main_~#iter~0#1.offset| |c_ULTIMATE.start_main_~list~0#1.offset|) (+ |ULTIMATE.start_main_~#iter~0#1.offset| 4) v_ArrVal_1380)) |c_ULTIMATE.start_main_~list~0#1.base|) .cse2))))) is different from false [2022-11-02 20:19:28,893 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-02 20:19:28,897 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-02 20:19:40,069 WARN L234 SmtUtils]: Spent 6.25s on a formula simplification that was a NOOP. DAG size: 44 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-02 20:19:48,451 WARN L234 SmtUtils]: Spent 8.03s on a formula simplification that was a NOOP. DAG size: 44 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-02 20:19:48,483 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 554 treesize of output 544 [2022-11-02 20:19:53,298 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 9 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:19:53,299 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2117458521] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-02 20:19:53,299 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-02 20:19:53,299 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 14, 15] total 45 [2022-11-02 20:19:53,301 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [925044687] [2022-11-02 20:19:53,301 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-02 20:19:53,302 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 46 states [2022-11-02 20:19:53,302 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:19:53,303 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2022-11-02 20:19:53,304 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=159, Invalid=1821, Unknown=4, NotChecked=86, Total=2070 [2022-11-02 20:19:53,304 INFO L87 Difference]: Start difference. First operand 344 states and 407 transitions. Second operand has 46 states, 45 states have (on average 2.8) internal successors, (126), 46 states have internal predecessors, (126), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:20:00,104 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:20:00,104 INFO L93 Difference]: Finished difference Result 700 states and 837 transitions. [2022-11-02 20:20:00,105 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2022-11-02 20:20:00,105 INFO L78 Accepts]: Start accepts. Automaton has has 46 states, 45 states have (on average 2.8) internal successors, (126), 46 states have internal predecessors, (126), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 46 [2022-11-02 20:20:00,105 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:20:00,108 INFO L225 Difference]: With dead ends: 700 [2022-11-02 20:20:00,108 INFO L226 Difference]: Without dead ends: 700 [2022-11-02 20:20:00,111 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 138 GetRequests, 73 SyntacticMatches, 5 SemanticMatches, 60 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 861 ImplicationChecksByTransitivity, 41.8s TimeCoverageRelationStatistics Valid=445, Invalid=3215, Unknown=4, NotChecked=118, Total=3782 [2022-11-02 20:20:00,112 INFO L413 NwaCegarLoop]: 193 mSDtfsCounter, 686 mSDsluCounter, 3279 mSDsCounter, 0 mSdLazyCounter, 2011 mSolverCounterSat, 40 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 686 SdHoareTripleChecker+Valid, 3472 SdHoareTripleChecker+Invalid, 3833 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 40 IncrementalHoareTripleChecker+Valid, 2011 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 1782 IncrementalHoareTripleChecker+Unchecked, 2.1s IncrementalHoareTripleChecker+Time [2022-11-02 20:20:00,117 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [686 Valid, 3472 Invalid, 3833 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [40 Valid, 2011 Invalid, 0 Unknown, 1782 Unchecked, 2.1s Time] [2022-11-02 20:20:00,119 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 700 states. [2022-11-02 20:20:00,126 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 700 to 343. [2022-11-02 20:20:00,127 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 343 states, 274 states have (on average 1.4817518248175183) internal successors, (406), 342 states have internal predecessors, (406), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:20:00,129 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 343 states to 343 states and 406 transitions. [2022-11-02 20:20:00,129 INFO L78 Accepts]: Start accepts. Automaton has 343 states and 406 transitions. Word has length 46 [2022-11-02 20:20:00,130 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:20:00,130 INFO L495 AbstractCegarLoop]: Abstraction has 343 states and 406 transitions. [2022-11-02 20:20:00,130 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 46 states, 45 states have (on average 2.8) internal successors, (126), 46 states have internal predecessors, (126), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:20:00,130 INFO L276 IsEmpty]: Start isEmpty. Operand 343 states and 406 transitions. [2022-11-02 20:20:00,131 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2022-11-02 20:20:00,131 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:20:00,131 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:20:00,180 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_480cfb37-46ef-4eba-97f5-ce88cab73a92/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-11-02 20:20:00,358 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_480cfb37-46ef-4eba-97f5-ce88cab73a92/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable34 [2022-11-02 20:20:00,358 INFO L420 AbstractCegarLoop]: === Iteration 36 === Targeting ULTIMATE.startErr96REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 149 more)] === [2022-11-02 20:20:00,359 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:20:00,359 INFO L85 PathProgramCache]: Analyzing trace with hash 2037167036, now seen corresponding path program 1 times [2022-11-02 20:20:00,359 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:20:00,359 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [753800640] [2022-11-02 20:20:00,359 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:20:00,360 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:20:00,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:20:01,123 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-02 20:20:01,123 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:20:01,123 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [753800640] [2022-11-02 20:20:01,124 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [753800640] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:20:01,124 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:20:01,124 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-11-02 20:20:01,124 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1778456302] [2022-11-02 20:20:01,124 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:20:01,125 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-11-02 20:20:01,125 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:20:01,125 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-11-02 20:20:01,125 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=104, Unknown=0, NotChecked=0, Total=132 [2022-11-02 20:20:01,125 INFO L87 Difference]: Start difference. First operand 343 states and 406 transitions. Second operand has 12 states, 11 states have (on average 4.363636363636363) internal successors, (48), 12 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:20:02,628 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:20:02,628 INFO L93 Difference]: Finished difference Result 480 states and 538 transitions. [2022-11-02 20:20:02,628 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2022-11-02 20:20:02,628 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 4.363636363636363) internal successors, (48), 12 states have internal predecessors, (48), 0 states have call successors, (0), 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 48 [2022-11-02 20:20:02,629 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:20:02,630 INFO L225 Difference]: With dead ends: 480 [2022-11-02 20:20:02,631 INFO L226 Difference]: Without dead ends: 480 [2022-11-02 20:20:02,631 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 110 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=169, Invalid=533, Unknown=0, NotChecked=0, Total=702 [2022-11-02 20:20:02,631 INFO L413 NwaCegarLoop]: 119 mSDtfsCounter, 1453 mSDsluCounter, 837 mSDsCounter, 0 mSdLazyCounter, 1159 mSolverCounterSat, 47 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1453 SdHoareTripleChecker+Valid, 956 SdHoareTripleChecker+Invalid, 1206 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 47 IncrementalHoareTripleChecker+Valid, 1159 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2022-11-02 20:20:02,632 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1453 Valid, 956 Invalid, 1206 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [47 Valid, 1159 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2022-11-02 20:20:02,633 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 480 states. [2022-11-02 20:20:02,647 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 480 to 373. [2022-11-02 20:20:02,648 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 373 states, 304 states have (on average 1.5296052631578947) internal successors, (465), 372 states have internal predecessors, (465), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:20:02,649 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 373 states to 373 states and 465 transitions. [2022-11-02 20:20:02,650 INFO L78 Accepts]: Start accepts. Automaton has 373 states and 465 transitions. Word has length 48 [2022-11-02 20:20:02,650 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:20:02,651 INFO L495 AbstractCegarLoop]: Abstraction has 373 states and 465 transitions. [2022-11-02 20:20:02,651 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 4.363636363636363) internal successors, (48), 12 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:20:02,651 INFO L276 IsEmpty]: Start isEmpty. Operand 373 states and 465 transitions. [2022-11-02 20:20:02,651 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2022-11-02 20:20:02,652 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:20:02,652 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:20:02,652 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35 [2022-11-02 20:20:02,652 INFO L420 AbstractCegarLoop]: === Iteration 37 === Targeting ULTIMATE.startErr62REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 149 more)] === [2022-11-02 20:20:02,653 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:20:02,653 INFO L85 PathProgramCache]: Analyzing trace with hash 1246142357, now seen corresponding path program 1 times [2022-11-02 20:20:02,653 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:20:02,653 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1970722793] [2022-11-02 20:20:02,654 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:20:02,654 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:20:02,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:20:03,935 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-02 20:20:03,936 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:20:03,936 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1970722793] [2022-11-02 20:20:03,936 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1970722793] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-02 20:20:03,936 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [543941107] [2022-11-02 20:20:03,936 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:20:03,937 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-02 20:20:03,937 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_480cfb37-46ef-4eba-97f5-ce88cab73a92/bin/uautomizer-Dbtcem3rbc/z3 [2022-11-02 20:20:03,938 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_480cfb37-46ef-4eba-97f5-ce88cab73a92/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-02 20:20:03,939 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_480cfb37-46ef-4eba-97f5-ce88cab73a92/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-11-02 20:20:04,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:20:04,177 INFO L263 TraceCheckSpWp]: Trace formula consists of 388 conjuncts, 48 conjunts are in the unsatisfiable core [2022-11-02 20:20:04,194 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-02 20:20:04,308 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-02 20:20:04,316 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-02 20:20:04,504 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-02 20:20:04,505 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2022-11-02 20:20:04,522 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-02 20:20:04,524 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-11-02 20:20:04,612 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-02 20:20:04,614 INFO L390 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 0 case distinctions, treesize of input 30 treesize of output 32 [2022-11-02 20:20:04,631 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-02 20:20:04,632 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-11-02 20:20:04,755 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-02 20:20:04,756 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-11-02 20:20:04,771 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-02 20:20:04,773 INFO L390 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 0 case distinctions, treesize of input 30 treesize of output 32 [2022-11-02 20:20:04,914 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-02 20:20:04,916 INFO L390 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 0 case distinctions, treesize of input 23 treesize of output 23 [2022-11-02 20:20:04,926 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-02 20:20:04,927 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-11-02 20:20:04,937 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-11-02 20:20:05,066 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-02 20:20:05,066 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 7 [2022-11-02 20:20:05,072 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-02 20:20:05,075 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-02 20:20:05,075 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 17 treesize of output 10 [2022-11-02 20:20:05,100 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-02 20:20:05,100 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-02 20:20:05,987 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-02 20:20:05,988 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 22 treesize of output 23 [2022-11-02 20:20:05,993 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 24 [2022-11-02 20:20:06,000 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-02 20:20:06,017 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-02 20:20:06,017 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 22 treesize of output 23 [2022-11-02 20:20:06,020 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-02 20:20:06,023 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 8 [2022-11-02 20:20:06,141 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-02 20:20:06,141 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [543941107] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-02 20:20:06,141 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-02 20:20:06,141 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 13, 12] total 32 [2022-11-02 20:20:06,141 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [331055842] [2022-11-02 20:20:06,141 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-02 20:20:06,142 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2022-11-02 20:20:06,142 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:20:06,143 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2022-11-02 20:20:06,143 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=105, Invalid=884, Unknown=3, NotChecked=0, Total=992 [2022-11-02 20:20:06,143 INFO L87 Difference]: Start difference. First operand 373 states and 465 transitions. Second operand has 32 states, 32 states have (on average 4.09375) internal successors, (131), 32 states have internal predecessors, (131), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:20:07,899 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:20:07,900 INFO L93 Difference]: Finished difference Result 390 states and 482 transitions. [2022-11-02 20:20:07,900 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-11-02 20:20:07,900 INFO L78 Accepts]: Start accepts. Automaton has has 32 states, 32 states have (on average 4.09375) internal successors, (131), 32 states have internal predecessors, (131), 0 states have call successors, (0), 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 51 [2022-11-02 20:20:07,900 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:20:07,902 INFO L225 Difference]: With dead ends: 390 [2022-11-02 20:20:07,903 INFO L226 Difference]: Without dead ends: 390 [2022-11-02 20:20:07,903 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 133 GetRequests, 90 SyntacticMatches, 1 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 443 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=254, Invalid=1635, Unknown=3, NotChecked=0, Total=1892 [2022-11-02 20:20:07,904 INFO L413 NwaCegarLoop]: 228 mSDtfsCounter, 110 mSDsluCounter, 2851 mSDsCounter, 0 mSdLazyCounter, 1051 mSolverCounterSat, 33 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 110 SdHoareTripleChecker+Valid, 3079 SdHoareTripleChecker+Invalid, 1436 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 33 IncrementalHoareTripleChecker+Valid, 1051 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 352 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2022-11-02 20:20:07,904 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [110 Valid, 3079 Invalid, 1436 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [33 Valid, 1051 Invalid, 0 Unknown, 352 Unchecked, 1.0s Time] [2022-11-02 20:20:07,905 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 390 states. [2022-11-02 20:20:07,909 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 390 to 384. [2022-11-02 20:20:07,910 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 384 states, 315 states have (on average 1.511111111111111) internal successors, (476), 383 states have internal predecessors, (476), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:20:07,911 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 384 states to 384 states and 476 transitions. [2022-11-02 20:20:07,911 INFO L78 Accepts]: Start accepts. Automaton has 384 states and 476 transitions. Word has length 51 [2022-11-02 20:20:07,912 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:20:07,912 INFO L495 AbstractCegarLoop]: Abstraction has 384 states and 476 transitions. [2022-11-02 20:20:07,912 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 32 states, 32 states have (on average 4.09375) internal successors, (131), 32 states have internal predecessors, (131), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:20:07,912 INFO L276 IsEmpty]: Start isEmpty. Operand 384 states and 476 transitions. [2022-11-02 20:20:07,913 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2022-11-02 20:20:07,913 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:20:07,913 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:20:07,962 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_480cfb37-46ef-4eba-97f5-ce88cab73a92/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2022-11-02 20:20:08,128 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable36,5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_480cfb37-46ef-4eba-97f5-ce88cab73a92/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-02 20:20:08,128 INFO L420 AbstractCegarLoop]: === Iteration 38 === Targeting ULTIMATE.startErr103REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 149 more)] === [2022-11-02 20:20:08,128 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:20:08,128 INFO L85 PathProgramCache]: Analyzing trace with hash 997414492, now seen corresponding path program 1 times [2022-11-02 20:20:08,129 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:20:08,129 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [315897399] [2022-11-02 20:20:08,129 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:20:08,129 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:20:08,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:20:08,303 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-02 20:20:08,303 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:20:08,303 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [315897399] [2022-11-02 20:20:08,303 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [315897399] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:20:08,303 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:20:08,304 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-11-02 20:20:08,304 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [741977976] [2022-11-02 20:20:08,304 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:20:08,305 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-11-02 20:20:08,306 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:20:08,306 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-11-02 20:20:08,306 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2022-11-02 20:20:08,307 INFO L87 Difference]: Start difference. First operand 384 states and 476 transitions. Second operand has 8 states, 8 states have (on average 6.625) internal successors, (53), 8 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:20:08,593 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:20:08,593 INFO L93 Difference]: Finished difference Result 471 states and 525 transitions. [2022-11-02 20:20:08,594 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-11-02 20:20:08,594 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 6.625) internal successors, (53), 8 states have internal predecessors, (53), 0 states have call successors, (0), 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 53 [2022-11-02 20:20:08,594 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:20:08,597 INFO L225 Difference]: With dead ends: 471 [2022-11-02 20:20:08,597 INFO L226 Difference]: Without dead ends: 471 [2022-11-02 20:20:08,597 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=81, Invalid=191, Unknown=0, NotChecked=0, Total=272 [2022-11-02 20:20:08,597 INFO L413 NwaCegarLoop]: 227 mSDtfsCounter, 1478 mSDsluCounter, 728 mSDsCounter, 0 mSdLazyCounter, 142 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1478 SdHoareTripleChecker+Valid, 955 SdHoareTripleChecker+Invalid, 157 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 142 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-02 20:20:08,598 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1478 Valid, 955 Invalid, 157 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 142 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-02 20:20:08,599 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 471 states. [2022-11-02 20:20:08,604 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 471 to 384. [2022-11-02 20:20:08,604 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 384 states, 315 states have (on average 1.507936507936508) internal successors, (475), 383 states have internal predecessors, (475), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:20:08,605 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 384 states to 384 states and 475 transitions. [2022-11-02 20:20:08,606 INFO L78 Accepts]: Start accepts. Automaton has 384 states and 475 transitions. Word has length 53 [2022-11-02 20:20:08,606 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:20:08,606 INFO L495 AbstractCegarLoop]: Abstraction has 384 states and 475 transitions. [2022-11-02 20:20:08,606 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 6.625) internal successors, (53), 8 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:20:08,607 INFO L276 IsEmpty]: Start isEmpty. Operand 384 states and 475 transitions. [2022-11-02 20:20:08,607 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2022-11-02 20:20:08,607 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:20:08,607 INFO L195 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:20:08,608 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable37 [2022-11-02 20:20:08,608 INFO L420 AbstractCegarLoop]: === Iteration 39 === Targeting ULTIMATE.startErr38REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 149 more)] === [2022-11-02 20:20:08,608 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:20:08,608 INFO L85 PathProgramCache]: Analyzing trace with hash -471775986, now seen corresponding path program 1 times [2022-11-02 20:20:08,609 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:20:08,609 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [381493143] [2022-11-02 20:20:08,609 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:20:08,609 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:20:08,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:20:13,047 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 4 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:20:13,047 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:20:13,047 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [381493143] [2022-11-02 20:20:13,047 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [381493143] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-02 20:20:13,047 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [179876864] [2022-11-02 20:20:13,048 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:20:13,048 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-02 20:20:13,048 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_480cfb37-46ef-4eba-97f5-ce88cab73a92/bin/uautomizer-Dbtcem3rbc/z3 [2022-11-02 20:20:13,051 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_480cfb37-46ef-4eba-97f5-ce88cab73a92/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-02 20:20:13,076 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_480cfb37-46ef-4eba-97f5-ce88cab73a92/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-11-02 20:20:13,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:20:13,348 INFO L263 TraceCheckSpWp]: Trace formula consists of 429 conjuncts, 117 conjunts are in the unsatisfiable core [2022-11-02 20:20:13,355 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-02 20:20:13,359 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-11-02 20:20:13,447 INFO L356 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-11-02 20:20:13,448 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2022-11-02 20:20:13,559 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-02 20:20:13,639 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-02 20:20:13,640 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 26 [2022-11-02 20:20:13,775 INFO L356 Elim1Store]: treesize reduction 48, result has 36.0 percent of original size [2022-11-02 20:20:13,775 INFO L390 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 [2022-11-02 20:20:13,883 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 30 [2022-11-02 20:20:13,922 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 30 [2022-11-02 20:20:13,960 INFO L356 Elim1Store]: treesize reduction 40, result has 27.3 percent of original size [2022-11-02 20:20:13,961 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 21 treesize of output 26 [2022-11-02 20:20:14,108 INFO L356 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-11-02 20:20:14,109 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 24 treesize of output 28 [2022-11-02 20:20:14,127 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 10 [2022-11-02 20:20:14,264 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-02 20:20:14,272 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-02 20:20:14,273 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 41 [2022-11-02 20:20:14,752 INFO L356 Elim1Store]: treesize reduction 168, result has 33.6 percent of original size [2022-11-02 20:20:14,752 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 14 case distinctions, treesize of input 78 treesize of output 139 [2022-11-02 20:20:15,134 INFO L356 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2022-11-02 20:20:15,135 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 97 treesize of output 66 [2022-11-02 20:20:15,180 INFO L390 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 19 treesize of output 18 [2022-11-02 20:20:15,669 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-02 20:20:15,672 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 34 [2022-11-02 20:20:15,679 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-02 20:20:15,680 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-02 20:20:15,693 INFO L356 Elim1Store]: treesize reduction 41, result has 14.6 percent of original size [2022-11-02 20:20:15,694 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 6 new quantified variables, introduced 7 case distinctions, treesize of input 171 treesize of output 101 [2022-11-02 20:20:16,914 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-02 20:20:16,916 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-02 20:20:16,943 INFO L356 Elim1Store]: treesize reduction 44, result has 21.4 percent of original size [2022-11-02 20:20:16,944 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 1 disjoint index pairs (out of 10 index pairs), introduced 7 new quantified variables, introduced 10 case distinctions, treesize of input 183 treesize of output 109 [2022-11-02 20:20:16,965 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-02 20:20:16,967 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 34 [2022-11-02 20:20:17,820 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-02 20:20:17,822 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-02 20:20:17,844 INFO L356 Elim1Store]: treesize reduction 59, result has 20.3 percent of original size [2022-11-02 20:20:17,844 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 1 disjoint index pairs (out of 10 index pairs), introduced 7 new quantified variables, introduced 12 case distinctions, treesize of input 213 treesize of output 131 [2022-11-02 20:20:17,866 INFO L356 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-11-02 20:20:17,866 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 1 case distinctions, treesize of input 53 treesize of output 46 [2022-11-02 20:20:18,302 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-02 20:20:18,302 INFO L390 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 3 new quantified variables, introduced 3 case distinctions, treesize of input 183 treesize of output 163 [2022-11-02 20:20:18,955 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-02 20:20:18,956 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-02 20:20:19,012 INFO L356 Elim1Store]: treesize reduction 112, result has 17.0 percent of original size [2022-11-02 20:20:19,013 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 7 select indices, 7 select index equivalence classes, 1 disjoint index pairs (out of 21 index pairs), introduced 9 new quantified variables, introduced 23 case distinctions, treesize of input 166 treesize of output 145 [2022-11-02 20:20:19,834 INFO L356 Elim1Store]: treesize reduction 4, result has 94.5 percent of original size [2022-11-02 20:20:19,834 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 7 select indices, 7 select index equivalence classes, 1 disjoint index pairs (out of 21 index pairs), introduced 8 new quantified variables, introduced 20 case distinctions, treesize of input 164 treesize of output 143 [2022-11-02 20:20:21,081 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 4 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:20:21,081 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-02 20:21:05,300 WARN L234 SmtUtils]: Spent 13.62s on a formula simplification. DAG size of input: 98 DAG size of output: 82 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-02 20:21:05,346 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-02 20:21:05,346 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 296 treesize of output 224 [2022-11-02 20:21:05,394 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-02 20:21:05,395 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-02 20:21:05,399 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-02 20:21:05,400 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-02 20:21:05,406 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-02 20:21:05,407 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 39 treesize of output 39 [2022-11-02 20:21:05,426 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-02 20:21:05,426 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 188 treesize of output 146 [2022-11-02 20:21:06,200 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((|v_ULTIMATE.start_main_~#iter~0#1.base_59| Int) (v_arrayElimArr_5 (Array Int Int)) (|v_ULTIMATE.start_main_~item~0#1.base_20| Int) (v_ArrVal_1853 Int)) (let ((.cse3 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_main_~item~0#1.base_20| v_arrayElimArr_5))) (let ((.cse5 (store (select .cse3 |v_ULTIMATE.start_main_~#iter~0#1.base_59|) 0 |v_ULTIMATE.start_main_~item~0#1.base_20|))) (let ((.cse2 (store |c_#valid| |v_ULTIMATE.start_main_~item~0#1.base_20| 1)) (.cse4 (store .cse5 4 v_ArrVal_1853))) (let ((.cse1 (select (select (store .cse3 |v_ULTIMATE.start_main_~#iter~0#1.base_59| .cse4) |v_ULTIMATE.start_main_~item~0#1.base_20|) 4)) (.cse0 (store .cse2 |v_ULTIMATE.start_main_~#iter~0#1.base_59| 1))) (or (not (= (select .cse0 .cse1) 1)) (not (= (select .cse2 |v_ULTIMATE.start_main_~#iter~0#1.base_59|) 0)) (= (select .cse0 (select (select (store .cse3 |v_ULTIMATE.start_main_~#iter~0#1.base_59| (store .cse4 0 .cse1)) .cse1) |c_ULTIMATE.start_main_~data~0#1.offset|)) 1) (not (= (select .cse0 (select (select (store .cse3 |v_ULTIMATE.start_main_~#iter~0#1.base_59| .cse5) |v_ULTIMATE.start_main_~item~0#1.base_20|) 0)) 1)) (not (= (select v_arrayElimArr_5 4) |c_ULTIMATE.start_main_~data~0#1.base|)))))))) (forall ((|v_ULTIMATE.start_main_~#iter~0#1.base_59| Int) (|v_ULTIMATE.start_main_~item~0#1.base_20| Int) (v_arrayElimArr_3 (Array Int Int)) (v_ArrVal_1853 Int) (v_ArrVal_1855 Int)) (let ((.cse7 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_main_~item~0#1.base_20| v_arrayElimArr_3))) (let ((.cse8 (store (select .cse7 |v_ULTIMATE.start_main_~#iter~0#1.base_59|) 0 |v_ULTIMATE.start_main_~item~0#1.base_20|))) (let ((.cse12 (store .cse8 4 v_ArrVal_1853))) (let ((.cse10 (select (select (store .cse7 |v_ULTIMATE.start_main_~#iter~0#1.base_59| .cse12) |v_ULTIMATE.start_main_~item~0#1.base_20|) 4)) (.cse9 (store |c_#valid| |v_ULTIMATE.start_main_~item~0#1.base_20| 1))) (let ((.cse6 (store .cse9 |v_ULTIMATE.start_main_~#iter~0#1.base_59| 1)) (.cse11 (select (store .cse7 |v_ULTIMATE.start_main_~#iter~0#1.base_59| (store .cse12 0 .cse10)) .cse10))) (or (not (= (select .cse6 (select (select (store .cse7 |v_ULTIMATE.start_main_~#iter~0#1.base_59| .cse8) |v_ULTIMATE.start_main_~item~0#1.base_20|) 0)) 1)) (not (= (select v_arrayElimArr_3 4) |c_ULTIMATE.start_main_~data~0#1.base|)) (not (= (select .cse9 |v_ULTIMATE.start_main_~#iter~0#1.base_59|) 0)) (not (= (select .cse6 .cse10) 1)) (= (select .cse6 (select .cse11 v_ArrVal_1855)) 1) (= (select .cse6 (select .cse11 |c_ULTIMATE.start_main_~data~0#1.offset|)) 1))))))))) is different from false [2022-11-02 20:21:06,319 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((|v_ULTIMATE.start_main_~#iter~0#1.base_59| Int) (v_arrayElimArr_5 (Array Int Int)) (|v_ULTIMATE.start_main_~item~0#1.base_20| Int) (v_ArrVal_1853 Int) (v_ArrVal_1837 (Array Int Int))) (let ((.cse1 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~node~0#1.base| v_ArrVal_1837) |v_ULTIMATE.start_main_~item~0#1.base_20| v_arrayElimArr_5))) (let ((.cse2 (store (select .cse1 |v_ULTIMATE.start_main_~#iter~0#1.base_59|) 0 |v_ULTIMATE.start_main_~item~0#1.base_20|))) (let ((.cse4 (store .cse2 4 v_ArrVal_1853)) (.cse3 (store |c_#valid| |v_ULTIMATE.start_main_~item~0#1.base_20| 1))) (let ((.cse0 (store .cse3 |v_ULTIMATE.start_main_~#iter~0#1.base_59| 1)) (.cse5 (select (select (store .cse1 |v_ULTIMATE.start_main_~#iter~0#1.base_59| .cse4) |v_ULTIMATE.start_main_~item~0#1.base_20|) 4))) (or (not (= (select .cse0 (select (select (store .cse1 |v_ULTIMATE.start_main_~#iter~0#1.base_59| .cse2) |v_ULTIMATE.start_main_~item~0#1.base_20|) 0)) 1)) (not (= (select .cse3 |v_ULTIMATE.start_main_~#iter~0#1.base_59|) 0)) (= (select .cse0 (select (select (store .cse1 |v_ULTIMATE.start_main_~#iter~0#1.base_59| (store .cse4 0 .cse5)) .cse5) |c_ULTIMATE.start_main_~data~0#1.offset|)) 1) (not (= (select .cse0 .cse5) 1)) (not (= (select v_arrayElimArr_5 4) |c_ULTIMATE.start_main_~data~0#1.base|)))))))) (forall ((|v_ULTIMATE.start_main_~#iter~0#1.base_59| Int) (|v_ULTIMATE.start_main_~item~0#1.base_20| Int) (v_arrayElimArr_3 (Array Int Int)) (v_ArrVal_1853 Int) (v_ArrVal_1855 Int) (v_ArrVal_1837 (Array Int Int))) (let ((.cse7 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~node~0#1.base| v_ArrVal_1837) |v_ULTIMATE.start_main_~item~0#1.base_20| v_arrayElimArr_3))) (let ((.cse8 (store (select .cse7 |v_ULTIMATE.start_main_~#iter~0#1.base_59|) 0 |v_ULTIMATE.start_main_~item~0#1.base_20|))) (let ((.cse12 (store .cse8 4 v_ArrVal_1853))) (let ((.cse10 (store |c_#valid| |v_ULTIMATE.start_main_~item~0#1.base_20| 1)) (.cse11 (select (select (store .cse7 |v_ULTIMATE.start_main_~#iter~0#1.base_59| .cse12) |v_ULTIMATE.start_main_~item~0#1.base_20|) 4))) (let ((.cse9 (select (store .cse7 |v_ULTIMATE.start_main_~#iter~0#1.base_59| (store .cse12 0 .cse11)) .cse11)) (.cse6 (store .cse10 |v_ULTIMATE.start_main_~#iter~0#1.base_59| 1))) (or (not (= (select .cse6 (select (select (store .cse7 |v_ULTIMATE.start_main_~#iter~0#1.base_59| .cse8) |v_ULTIMATE.start_main_~item~0#1.base_20|) 0)) 1)) (= (select .cse6 (select .cse9 |c_ULTIMATE.start_main_~data~0#1.offset|)) 1) (not (= (select v_arrayElimArr_3 4) |c_ULTIMATE.start_main_~data~0#1.base|)) (not (= (select .cse10 |v_ULTIMATE.start_main_~#iter~0#1.base_59|) 0)) (= (select .cse6 (select .cse9 v_ArrVal_1855)) 1) (not (= (select .cse6 .cse11) 1)))))))))) is different from false [2022-11-02 20:21:10,137 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-02 20:21:10,137 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 310 treesize of output 198 [2022-11-02 20:21:10,145 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-02 20:21:10,169 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-02 20:21:10,170 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 5102 treesize of output 4912 [2022-11-02 20:21:10,229 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-02 20:21:10,230 INFO L390 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 4904 treesize of output 4170 [2022-11-02 20:21:10,300 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7034 treesize of output 6968 [2022-11-02 20:21:10,752 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 100886 treesize of output 99862 [2022-11-02 20:21:36,420 WARN L234 SmtUtils]: Spent 5.22s on a formula simplification. DAG size of input: 205 DAG size of output: 205 (called from [L 800] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify)