./Ultimate.py --spec ../../sv-benchmarks/c/properties/valid-memsafety.prp --file ../../sv-benchmarks/c/memsafety/test-0214.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 5e519f3a Calling Ultimate with: /usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eacac830-ac89-42b6-ba82-d293b55624ad/bin/uautomizer-Dbtcem3rbc/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eacac830-ac89-42b6-ba82-d293b55624ad/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_eacac830-ac89-42b6-ba82-d293b55624ad/bin/uautomizer-Dbtcem3rbc/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eacac830-ac89-42b6-ba82-d293b55624ad/bin/uautomizer-Dbtcem3rbc/config/AutomizerMemDerefMemtrack.xml -i ../../sv-benchmarks/c/memsafety/test-0214.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eacac830-ac89-42b6-ba82-d293b55624ad/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_eacac830-ac89-42b6-ba82-d293b55624ad/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 3f6f146d76d903376288fe056dbbc9e1a8443f92d5e8b82343734efc8a9842e4 --- 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:40:51,659 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-02 20:40:51,662 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-02 20:40:51,711 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-02 20:40:51,712 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-02 20:40:51,713 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-02 20:40:51,715 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-02 20:40:51,717 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-02 20:40:51,720 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-02 20:40:51,721 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-02 20:40:51,722 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-02 20:40:51,724 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-02 20:40:51,725 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-02 20:40:51,726 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-02 20:40:51,728 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-02 20:40:51,729 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-02 20:40:51,731 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-02 20:40:51,732 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-02 20:40:51,735 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-02 20:40:51,738 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-02 20:40:51,740 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-02 20:40:51,742 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-02 20:40:51,743 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-02 20:40:51,744 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-02 20:40:51,749 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-02 20:40:51,750 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-02 20:40:51,750 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-02 20:40:51,752 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-02 20:40:51,752 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-02 20:40:51,754 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-02 20:40:51,754 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-02 20:40:51,755 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-02 20:40:51,757 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-02 20:40:51,758 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-02 20:40:51,759 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-02 20:40:51,760 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-02 20:40:51,761 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-02 20:40:51,762 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-02 20:40:51,762 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-02 20:40:51,763 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-02 20:40:51,764 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-02 20:40:51,766 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eacac830-ac89-42b6-ba82-d293b55624ad/bin/uautomizer-Dbtcem3rbc/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2022-11-02 20:40:51,793 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-02 20:40:51,793 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-02 20:40:51,794 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-02 20:40:51,794 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-02 20:40:51,795 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-11-02 20:40:51,795 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-11-02 20:40:51,796 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-11-02 20:40:51,796 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-11-02 20:40:51,797 INFO L138 SettingsManager]: * Use SBE=true [2022-11-02 20:40:51,797 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-02 20:40:51,798 INFO L138 SettingsManager]: * sizeof long=4 [2022-11-02 20:40:51,798 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-11-02 20:40:51,798 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-11-02 20:40:51,798 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-11-02 20:40:51,799 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-02 20:40:51,799 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2022-11-02 20:40:51,799 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2022-11-02 20:40:51,799 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2022-11-02 20:40:51,800 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-11-02 20:40:51,800 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-11-02 20:40:51,800 INFO L138 SettingsManager]: * sizeof long double=12 [2022-11-02 20:40:51,801 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-02 20:40:51,801 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-02 20:40:51,801 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-11-02 20:40:51,802 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-11-02 20:40:51,802 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-02 20:40:51,802 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-02 20:40:51,803 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-11-02 20:40:51,803 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-11-02 20:40:51,803 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-11-02 20:40:51,803 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_eacac830-ac89-42b6-ba82-d293b55624ad/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_eacac830-ac89-42b6-ba82-d293b55624ad/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 -> 3f6f146d76d903376288fe056dbbc9e1a8443f92d5e8b82343734efc8a9842e4 [2022-11-02 20:40:52,186 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-02 20:40:52,233 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-02 20:40:52,238 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-02 20:40:52,241 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-02 20:40:52,242 INFO L275 PluginConnector]: CDTParser initialized [2022-11-02 20:40:52,244 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eacac830-ac89-42b6-ba82-d293b55624ad/bin/uautomizer-Dbtcem3rbc/../../sv-benchmarks/c/memsafety/test-0214.i [2022-11-02 20:40:52,344 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eacac830-ac89-42b6-ba82-d293b55624ad/bin/uautomizer-Dbtcem3rbc/data/29af11730/f48ae44225324a08a3be5f35f1a4b51a/FLAG8d31190d0 [2022-11-02 20:40:53,059 INFO L306 CDTParser]: Found 1 translation units. [2022-11-02 20:40:53,060 INFO L160 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eacac830-ac89-42b6-ba82-d293b55624ad/sv-benchmarks/c/memsafety/test-0214.i [2022-11-02 20:40:53,076 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eacac830-ac89-42b6-ba82-d293b55624ad/bin/uautomizer-Dbtcem3rbc/data/29af11730/f48ae44225324a08a3be5f35f1a4b51a/FLAG8d31190d0 [2022-11-02 20:40:53,306 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eacac830-ac89-42b6-ba82-d293b55624ad/bin/uautomizer-Dbtcem3rbc/data/29af11730/f48ae44225324a08a3be5f35f1a4b51a [2022-11-02 20:40:53,309 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-02 20:40:53,311 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-02 20:40:53,313 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-02 20:40:53,313 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-02 20:40:53,318 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-02 20:40:53,319 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.11 08:40:53" (1/1) ... [2022-11-02 20:40:53,320 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5e1c2999 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:40:53, skipping insertion in model container [2022-11-02 20:40:53,321 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.11 08:40:53" (1/1) ... [2022-11-02 20:40:53,330 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-02 20:40:53,372 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-02 20:40:53,867 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-02 20:40:53,879 INFO L203 MainTranslator]: Completed pre-run [2022-11-02 20:40:53,937 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-02 20:40:53,996 INFO L208 MainTranslator]: Completed translation [2022-11-02 20:40:53,997 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:40:53 WrapperNode [2022-11-02 20:40:53,997 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-02 20:40:53,999 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-11-02 20:40:53,999 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-11-02 20:40:53,999 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-11-02 20:40:54,010 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:40:53" (1/1) ... [2022-11-02 20:40:54,029 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:40:53" (1/1) ... [2022-11-02 20:40:54,063 INFO L138 Inliner]: procedures = 181, calls = 42, calls flagged for inlining = 7, calls inlined = 7, statements flattened = 181 [2022-11-02 20:40:54,064 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-11-02 20:40:54,065 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-11-02 20:40:54,065 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-11-02 20:40:54,065 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-11-02 20:40:54,083 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:40:53" (1/1) ... [2022-11-02 20:40:54,083 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:40:53" (1/1) ... [2022-11-02 20:40:54,088 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:40:53" (1/1) ... [2022-11-02 20:40:54,088 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:40:53" (1/1) ... [2022-11-02 20:40:54,120 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:40:53" (1/1) ... [2022-11-02 20:40:54,125 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:40:53" (1/1) ... [2022-11-02 20:40:54,127 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:40:53" (1/1) ... [2022-11-02 20:40:54,129 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:40:53" (1/1) ... [2022-11-02 20:40:54,145 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-11-02 20:40:54,146 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-11-02 20:40:54,146 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-11-02 20:40:54,146 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-11-02 20:40:54,147 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:40:53" (1/1) ... [2022-11-02 20:40:54,158 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-02 20:40:54,174 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eacac830-ac89-42b6-ba82-d293b55624ad/bin/uautomizer-Dbtcem3rbc/z3 [2022-11-02 20:40:54,189 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eacac830-ac89-42b6-ba82-d293b55624ad/bin/uautomizer-Dbtcem3rbc/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-11-02 20:40:54,213 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eacac830-ac89-42b6-ba82-d293b55624ad/bin/uautomizer-Dbtcem3rbc/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-11-02 20:40:54,241 INFO L130 BoogieDeclarations]: Found specification of procedure rand_end_point [2022-11-02 20:40:54,241 INFO L138 BoogieDeclarations]: Found implementation of procedure rand_end_point [2022-11-02 20:40:54,241 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-11-02 20:40:54,242 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-11-02 20:40:54,242 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-11-02 20:40:54,242 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-11-02 20:40:54,242 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-11-02 20:40:54,242 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-11-02 20:40:54,243 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2022-11-02 20:40:54,243 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-11-02 20:40:54,243 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-11-02 20:40:54,243 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-11-02 20:40:54,388 INFO L235 CfgBuilder]: Building ICFG [2022-11-02 20:40:54,391 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-11-02 20:40:55,169 INFO L276 CfgBuilder]: Performing block encoding [2022-11-02 20:40:55,179 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-11-02 20:40:55,179 INFO L300 CfgBuilder]: Removed 4 assume(true) statements. [2022-11-02 20:40:55,182 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.11 08:40:55 BoogieIcfgContainer [2022-11-02 20:40:55,182 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-11-02 20:40:55,193 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-11-02 20:40:55,193 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-11-02 20:40:55,197 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-11-02 20:40:55,198 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 02.11 08:40:53" (1/3) ... [2022-11-02 20:40:55,199 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@11c7631c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.11 08:40:55, skipping insertion in model container [2022-11-02 20:40:55,200 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:40:53" (2/3) ... [2022-11-02 20:40:55,200 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@11c7631c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.11 08:40:55, skipping insertion in model container [2022-11-02 20:40:55,200 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.11 08:40:55" (3/3) ... [2022-11-02 20:40:55,202 INFO L112 eAbstractionObserver]: Analyzing ICFG test-0214.i [2022-11-02 20:40:55,230 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-11-02 20:40:55,230 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 57 error locations. [2022-11-02 20:40:55,310 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-11-02 20:40:55,318 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;@6b4281da, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-02 20:40:55,319 INFO L358 AbstractCegarLoop]: Starting to check reachability of 57 error locations. [2022-11-02 20:40:55,325 INFO L276 IsEmpty]: Start isEmpty. Operand has 146 states, 85 states have (on average 1.9294117647058824) internal successors, (164), 142 states have internal predecessors, (164), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-11-02 20:40:55,333 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2022-11-02 20:40:55,333 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:40:55,334 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2022-11-02 20:40:55,335 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr49REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 54 more)] === [2022-11-02 20:40:55,342 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:40:55,342 INFO L85 PathProgramCache]: Analyzing trace with hash 1073379816, now seen corresponding path program 1 times [2022-11-02 20:40:55,358 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:40:55,359 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [829453352] [2022-11-02 20:40:55,359 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:40:55,360 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:40:55,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:40:55,572 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:40:55,573 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:40:55,574 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [829453352] [2022-11-02 20:40:55,574 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [829453352] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:40:55,575 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:40:55,575 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-02 20:40:55,577 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1156296993] [2022-11-02 20:40:55,578 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:40:55,586 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-11-02 20:40:55,588 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:40:55,631 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-11-02 20:40:55,632 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-11-02 20:40:55,636 INFO L87 Difference]: Start difference. First operand has 146 states, 85 states have (on average 1.9294117647058824) internal successors, (164), 142 states have internal predecessors, (164), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand has 2 states, 2 states have (on average 3.0) internal successors, (6), 2 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:40:55,695 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:40:55,696 INFO L93 Difference]: Finished difference Result 146 states and 163 transitions. [2022-11-02 20:40:55,697 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-02 20:40:55,699 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 3.0) internal successors, (6), 2 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:40:55,700 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:40:55,720 INFO L225 Difference]: With dead ends: 146 [2022-11-02 20:40:55,721 INFO L226 Difference]: Without dead ends: 144 [2022-11-02 20:40:55,723 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:40:55,727 INFO L413 NwaCegarLoop]: 163 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, 163 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:40:55,728 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 163 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-02 20:40:55,753 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 144 states. [2022-11-02 20:40:55,797 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 144 to 144. [2022-11-02 20:40:55,799 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 144 states, 84 states have (on average 1.869047619047619) internal successors, (157), 140 states have internal predecessors, (157), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-11-02 20:40:55,814 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 144 states to 144 states and 161 transitions. [2022-11-02 20:40:55,816 INFO L78 Accepts]: Start accepts. Automaton has 144 states and 161 transitions. Word has length 6 [2022-11-02 20:40:55,816 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:40:55,817 INFO L495 AbstractCegarLoop]: Abstraction has 144 states and 161 transitions. [2022-11-02 20:40:55,817 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 3.0) internal successors, (6), 2 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:40:55,818 INFO L276 IsEmpty]: Start isEmpty. Operand 144 states and 161 transitions. [2022-11-02 20:40:55,819 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2022-11-02 20:40:55,819 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:40:55,819 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:40:55,820 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-11-02 20:40:55,821 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr49REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 54 more)] === [2022-11-02 20:40:55,823 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:40:55,823 INFO L85 PathProgramCache]: Analyzing trace with hash -1280367911, now seen corresponding path program 1 times [2022-11-02 20:40:55,824 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:40:55,825 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [582761012] [2022-11-02 20:40:55,825 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:40:55,825 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:40:55,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:40:56,010 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:40:56,011 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:40:56,011 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [582761012] [2022-11-02 20:40:56,012 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [582761012] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:40:56,012 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:40:56,012 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-11-02 20:40:56,012 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [605381484] [2022-11-02 20:40:56,013 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:40:56,014 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-02 20:40:56,014 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:40:56,015 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-02 20:40:56,016 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-02 20:40:56,016 INFO L87 Difference]: Start difference. First operand 144 states and 161 transitions. Second operand has 3 states, 2 states have (on average 3.5) internal successors, (7), 2 states have internal predecessors, (7), 0 states have call successors, (0), 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:40:56,391 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:40:56,392 INFO L93 Difference]: Finished difference Result 279 states and 312 transitions. [2022-11-02 20:40:56,393 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-02 20:40:56,395 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 3.5) internal successors, (7), 2 states have internal predecessors, (7), 0 states have call successors, (0), 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 7 [2022-11-02 20:40:56,395 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:40:56,405 INFO L225 Difference]: With dead ends: 279 [2022-11-02 20:40:56,406 INFO L226 Difference]: Without dead ends: 279 [2022-11-02 20:40:56,411 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 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:40:56,413 INFO L413 NwaCegarLoop]: 108 mSDtfsCounter, 142 mSDsluCounter, 101 mSDsCounter, 0 mSdLazyCounter, 113 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 142 SdHoareTripleChecker+Valid, 209 SdHoareTripleChecker+Invalid, 114 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 113 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-02 20:40:56,414 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [142 Valid, 209 Invalid, 114 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 113 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-11-02 20:40:56,417 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 279 states. [2022-11-02 20:40:56,450 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 279 to 193. [2022-11-02 20:40:56,454 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 193 states, 130 states have (on average 1.8461538461538463) internal successors, (240), 186 states have internal predecessors, (240), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-11-02 20:40:56,459 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 193 states to 193 states and 248 transitions. [2022-11-02 20:40:56,462 INFO L78 Accepts]: Start accepts. Automaton has 193 states and 248 transitions. Word has length 7 [2022-11-02 20:40:56,462 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:40:56,462 INFO L495 AbstractCegarLoop]: Abstraction has 193 states and 248 transitions. [2022-11-02 20:40:56,463 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 3.5) internal successors, (7), 2 states have internal predecessors, (7), 0 states have call successors, (0), 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:40:56,464 INFO L276 IsEmpty]: Start isEmpty. Operand 193 states and 248 transitions. [2022-11-02 20:40:56,466 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2022-11-02 20:40:56,466 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:40:56,466 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:40:56,466 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-11-02 20:40:56,467 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr50REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 54 more)] === [2022-11-02 20:40:56,468 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:40:56,469 INFO L85 PathProgramCache]: Analyzing trace with hash -1280367910, now seen corresponding path program 1 times [2022-11-02 20:40:56,469 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:40:56,470 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1448692792] [2022-11-02 20:40:56,471 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:40:56,471 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:40:56,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:40:56,851 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:40:56,852 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:40:56,852 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1448692792] [2022-11-02 20:40:56,852 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1448692792] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:40:56,852 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:40:56,853 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-02 20:40:56,853 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [678908338] [2022-11-02 20:40:56,853 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:40:56,854 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-02 20:40:56,854 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:40:56,854 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-02 20:40:56,855 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-02 20:40:56,855 INFO L87 Difference]: Start difference. First operand 193 states and 248 transitions. Second operand has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 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:40:57,148 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:40:57,148 INFO L93 Difference]: Finished difference Result 342 states and 424 transitions. [2022-11-02 20:40:57,149 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-02 20:40:57,149 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 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 7 [2022-11-02 20:40:57,149 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:40:57,151 INFO L225 Difference]: With dead ends: 342 [2022-11-02 20:40:57,151 INFO L226 Difference]: Without dead ends: 342 [2022-11-02 20:40:57,152 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-11-02 20:40:57,162 INFO L413 NwaCegarLoop]: 133 mSDtfsCounter, 145 mSDsluCounter, 217 mSDsCounter, 0 mSdLazyCounter, 135 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 145 SdHoareTripleChecker+Valid, 350 SdHoareTripleChecker+Invalid, 135 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 135 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-02 20:40:57,163 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [145 Valid, 350 Invalid, 135 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 135 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-02 20:40:57,171 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 342 states. [2022-11-02 20:40:57,201 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 342 to 270. [2022-11-02 20:40:57,202 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 270 states, 201 states have (on average 1.8059701492537314) internal successors, (363), 259 states have internal predecessors, (363), 8 states have call successors, (8), 4 states have call predecessors, (8), 4 states have return successors, (8), 6 states have call predecessors, (8), 8 states have call successors, (8) [2022-11-02 20:40:57,204 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 270 states to 270 states and 379 transitions. [2022-11-02 20:40:57,205 INFO L78 Accepts]: Start accepts. Automaton has 270 states and 379 transitions. Word has length 7 [2022-11-02 20:40:57,205 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:40:57,205 INFO L495 AbstractCegarLoop]: Abstraction has 270 states and 379 transitions. [2022-11-02 20:40:57,206 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 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:40:57,206 INFO L276 IsEmpty]: Start isEmpty. Operand 270 states and 379 transitions. [2022-11-02 20:40:57,206 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2022-11-02 20:40:57,206 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:40:57,206 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:40:57,207 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-11-02 20:40:57,207 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr50REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 54 more)] === [2022-11-02 20:40:57,208 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:40:57,208 INFO L85 PathProgramCache]: Analyzing trace with hash -1280367972, now seen corresponding path program 1 times [2022-11-02 20:40:57,213 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:40:57,214 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1942288447] [2022-11-02 20:40:57,214 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:40:57,214 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:40:57,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:40:57,382 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:40:57,383 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:40:57,383 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1942288447] [2022-11-02 20:40:57,384 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1942288447] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:40:57,384 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:40:57,384 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-02 20:40:57,385 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1868728461] [2022-11-02 20:40:57,385 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:40:57,385 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-02 20:40:57,386 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:40:57,386 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-02 20:40:57,387 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-02 20:40:57,387 INFO L87 Difference]: Start difference. First operand 270 states and 379 transitions. Second operand has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 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:40:57,652 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:40:57,652 INFO L93 Difference]: Finished difference Result 341 states and 422 transitions. [2022-11-02 20:40:57,653 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-02 20:40:57,653 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 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 7 [2022-11-02 20:40:57,655 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:40:57,657 INFO L225 Difference]: With dead ends: 341 [2022-11-02 20:40:57,657 INFO L226 Difference]: Without dead ends: 341 [2022-11-02 20:40:57,658 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 0 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:40:57,667 INFO L413 NwaCegarLoop]: 147 mSDtfsCounter, 127 mSDsluCounter, 217 mSDsCounter, 0 mSdLazyCounter, 138 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 127 SdHoareTripleChecker+Valid, 364 SdHoareTripleChecker+Invalid, 138 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 138 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-02 20:40:57,669 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [127 Valid, 364 Invalid, 138 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 138 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-02 20:40:57,671 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 341 states. [2022-11-02 20:40:57,691 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 341 to 270. [2022-11-02 20:40:57,696 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 270 states, 201 states have (on average 1.8059701492537314) internal successors, (363), 259 states have internal predecessors, (363), 8 states have call successors, (8), 4 states have call predecessors, (8), 4 states have return successors, (8), 6 states have call predecessors, (8), 8 states have call successors, (8) [2022-11-02 20:40:57,698 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 270 states to 270 states and 379 transitions. [2022-11-02 20:40:57,702 INFO L78 Accepts]: Start accepts. Automaton has 270 states and 379 transitions. Word has length 7 [2022-11-02 20:40:57,702 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:40:57,703 INFO L495 AbstractCegarLoop]: Abstraction has 270 states and 379 transitions. [2022-11-02 20:40:57,703 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 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:40:57,703 INFO L276 IsEmpty]: Start isEmpty. Operand 270 states and 379 transitions. [2022-11-02 20:40:57,704 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2022-11-02 20:40:57,704 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:40:57,704 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:40:57,705 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-11-02 20:40:57,705 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr51REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 54 more)] === [2022-11-02 20:40:57,706 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:40:57,707 INFO L85 PathProgramCache]: Analyzing trace with hash 164318064, now seen corresponding path program 1 times [2022-11-02 20:40:57,707 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:40:57,707 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [251567721] [2022-11-02 20:40:57,708 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:40:57,708 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:40:57,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:40:57,988 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:40:57,988 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:40:57,989 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [251567721] [2022-11-02 20:40:57,989 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [251567721] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:40:57,989 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:40:57,989 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-02 20:40:57,989 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1324293105] [2022-11-02 20:40:57,990 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:40:57,990 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-02 20:40:57,990 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:40:57,991 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-02 20:40:57,991 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-11-02 20:40:57,991 INFO L87 Difference]: Start difference. First operand 270 states and 379 transitions. Second operand has 6 states, 6 states have (on average 1.6666666666666667) internal successors, (10), 5 states have internal predecessors, (10), 0 states have call successors, (0), 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:40:58,268 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:40:58,268 INFO L93 Difference]: Finished difference Result 391 states and 519 transitions. [2022-11-02 20:40:58,269 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-11-02 20:40:58,269 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 1.6666666666666667) internal successors, (10), 5 states have internal predecessors, (10), 0 states have call successors, (0), 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 10 [2022-11-02 20:40:58,269 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:40:58,273 INFO L225 Difference]: With dead ends: 391 [2022-11-02 20:40:58,273 INFO L226 Difference]: Without dead ends: 391 [2022-11-02 20:40:58,273 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2022-11-02 20:40:58,274 INFO L413 NwaCegarLoop]: 144 mSDtfsCounter, 123 mSDsluCounter, 536 mSDsCounter, 0 mSdLazyCounter, 128 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 123 SdHoareTripleChecker+Valid, 680 SdHoareTripleChecker+Invalid, 132 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 128 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-02 20:40:58,275 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [123 Valid, 680 Invalid, 132 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 128 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-02 20:40:58,276 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 391 states. [2022-11-02 20:40:58,284 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 391 to 312. [2022-11-02 20:40:58,285 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 312 states, 240 states have (on average 1.7916666666666667) internal successors, (430), 299 states have internal predecessors, (430), 10 states have call successors, (10), 5 states have call predecessors, (10), 5 states have return successors, (10), 7 states have call predecessors, (10), 10 states have call successors, (10) [2022-11-02 20:40:58,287 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 312 states to 312 states and 450 transitions. [2022-11-02 20:40:58,287 INFO L78 Accepts]: Start accepts. Automaton has 312 states and 450 transitions. Word has length 10 [2022-11-02 20:40:58,287 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:40:58,288 INFO L495 AbstractCegarLoop]: Abstraction has 312 states and 450 transitions. [2022-11-02 20:40:58,288 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 1.6666666666666667) internal successors, (10), 5 states have internal predecessors, (10), 0 states have call successors, (0), 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:40:58,288 INFO L276 IsEmpty]: Start isEmpty. Operand 312 states and 450 transitions. [2022-11-02 20:40:58,289 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2022-11-02 20:40:58,289 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:40:58,289 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:40:58,289 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-11-02 20:40:58,289 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr51REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 54 more)] === [2022-11-02 20:40:58,290 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:40:58,290 INFO L85 PathProgramCache]: Analyzing trace with hash 162471022, now seen corresponding path program 1 times [2022-11-02 20:40:58,290 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:40:58,291 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [325462411] [2022-11-02 20:40:58,291 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:40:58,291 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:40:58,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:40:58,527 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:40:58,528 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:40:58,528 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [325462411] [2022-11-02 20:40:58,528 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [325462411] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:40:58,528 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:40:58,528 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-02 20:40:58,529 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [370321804] [2022-11-02 20:40:58,529 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:40:58,529 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-02 20:40:58,529 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:40:58,530 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-02 20:40:58,530 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-11-02 20:40:58,530 INFO L87 Difference]: Start difference. First operand 312 states and 450 transitions. Second operand has 6 states, 6 states have (on average 1.6666666666666667) internal successors, (10), 5 states have internal predecessors, (10), 0 states have call successors, (0), 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:40:58,864 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:40:58,864 INFO L93 Difference]: Finished difference Result 381 states and 508 transitions. [2022-11-02 20:40:58,865 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-11-02 20:40:58,865 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 1.6666666666666667) internal successors, (10), 5 states have internal predecessors, (10), 0 states have call successors, (0), 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 10 [2022-11-02 20:40:58,865 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:40:58,867 INFO L225 Difference]: With dead ends: 381 [2022-11-02 20:40:58,867 INFO L226 Difference]: Without dead ends: 381 [2022-11-02 20:40:58,868 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2022-11-02 20:40:58,869 INFO L413 NwaCegarLoop]: 149 mSDtfsCounter, 109 mSDsluCounter, 540 mSDsCounter, 0 mSdLazyCounter, 132 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 109 SdHoareTripleChecker+Valid, 689 SdHoareTripleChecker+Invalid, 136 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 132 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-02 20:40:58,869 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [109 Valid, 689 Invalid, 136 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 132 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-02 20:40:58,870 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 381 states. [2022-11-02 20:40:58,877 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 381 to 311. [2022-11-02 20:40:58,878 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 311 states, 239 states have (on average 1.794979079497908) internal successors, (429), 298 states have internal predecessors, (429), 10 states have call successors, (10), 5 states have call predecessors, (10), 5 states have return successors, (10), 7 states have call predecessors, (10), 10 states have call successors, (10) [2022-11-02 20:40:58,880 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 311 states to 311 states and 449 transitions. [2022-11-02 20:40:58,880 INFO L78 Accepts]: Start accepts. Automaton has 311 states and 449 transitions. Word has length 10 [2022-11-02 20:40:58,880 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:40:58,880 INFO L495 AbstractCegarLoop]: Abstraction has 311 states and 449 transitions. [2022-11-02 20:40:58,881 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 1.6666666666666667) internal successors, (10), 5 states have internal predecessors, (10), 0 states have call successors, (0), 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:40:58,881 INFO L276 IsEmpty]: Start isEmpty. Operand 311 states and 449 transitions. [2022-11-02 20:40:58,881 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-11-02 20:40:58,881 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:40:58,881 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:40:58,882 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-11-02 20:40:58,882 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr56ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 54 more)] === [2022-11-02 20:40:58,882 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:40:58,883 INFO L85 PathProgramCache]: Analyzing trace with hash 798891393, now seen corresponding path program 1 times [2022-11-02 20:40:58,883 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:40:58,883 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [849556926] [2022-11-02 20:40:58,883 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:40:58,883 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:40:58,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:40:58,906 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:40:58,907 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:40:58,907 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [849556926] [2022-11-02 20:40:58,907 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [849556926] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:40:58,907 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:40:58,907 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-02 20:40:58,908 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [217613432] [2022-11-02 20:40:58,908 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:40:58,908 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-02 20:40:58,908 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:40:58,909 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-02 20:40:58,909 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-02 20:40:58,909 INFO L87 Difference]: Start difference. First operand 311 states and 449 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:40:59,045 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:40:59,046 INFO L93 Difference]: Finished difference Result 370 states and 506 transitions. [2022-11-02 20:40:59,046 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-02 20:40:59,047 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:40:59,047 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:40:59,049 INFO L225 Difference]: With dead ends: 370 [2022-11-02 20:40:59,049 INFO L226 Difference]: Without dead ends: 363 [2022-11-02 20:40:59,049 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:40:59,050 INFO L413 NwaCegarLoop]: 135 mSDtfsCounter, 74 mSDsluCounter, 102 mSDsCounter, 0 mSdLazyCounter, 86 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 76 SdHoareTripleChecker+Valid, 237 SdHoareTripleChecker+Invalid, 86 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 86 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-02 20:40:59,051 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [76 Valid, 237 Invalid, 86 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 86 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-02 20:40:59,052 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 363 states. [2022-11-02 20:40:59,058 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 363 to 308. [2022-11-02 20:40:59,059 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 308 states, 236 states have (on average 1.7966101694915255) internal successors, (424), 295 states have internal predecessors, (424), 10 states have call successors, (10), 5 states have call predecessors, (10), 5 states have return successors, (10), 7 states have call predecessors, (10), 10 states have call successors, (10) [2022-11-02 20:40:59,061 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 308 states to 308 states and 444 transitions. [2022-11-02 20:40:59,061 INFO L78 Accepts]: Start accepts. Automaton has 308 states and 444 transitions. Word has length 11 [2022-11-02 20:40:59,061 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:40:59,061 INFO L495 AbstractCegarLoop]: Abstraction has 308 states and 444 transitions. [2022-11-02 20:40:59,062 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:40:59,062 INFO L276 IsEmpty]: Start isEmpty. Operand 308 states and 444 transitions. [2022-11-02 20:40:59,062 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-11-02 20:40:59,063 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:40:59,063 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:40:59,063 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-11-02 20:40:59,063 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 54 more)] === [2022-11-02 20:40:59,064 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:40:59,064 INFO L85 PathProgramCache]: Analyzing trace with hash 1916999928, now seen corresponding path program 1 times [2022-11-02 20:40:59,064 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:40:59,064 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [77582042] [2022-11-02 20:40:59,064 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:40:59,065 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:40:59,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:40:59,124 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-02 20:40:59,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:40:59,132 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:40:59,132 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:40:59,133 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [77582042] [2022-11-02 20:40:59,133 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [77582042] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:40:59,133 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:40:59,133 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-02 20:40:59,133 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [217740082] [2022-11-02 20:40:59,133 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:40:59,134 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-02 20:40:59,134 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:40:59,135 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-02 20:40:59,135 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-02 20:40:59,135 INFO L87 Difference]: Start difference. First operand 308 states and 444 transitions. Second operand has 4 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 4 states have internal predecessors, (11), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-11-02 20:40:59,492 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:40:59,492 INFO L93 Difference]: Finished difference Result 439 states and 552 transitions. [2022-11-02 20:40:59,493 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-02 20:40:59,493 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 4 states have internal predecessors, (11), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 13 [2022-11-02 20:40:59,493 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:40:59,496 INFO L225 Difference]: With dead ends: 439 [2022-11-02 20:40:59,496 INFO L226 Difference]: Without dead ends: 439 [2022-11-02 20:40:59,496 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:40:59,497 INFO L413 NwaCegarLoop]: 158 mSDtfsCounter, 267 mSDsluCounter, 195 mSDsCounter, 0 mSdLazyCounter, 218 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 267 SdHoareTripleChecker+Valid, 353 SdHoareTripleChecker+Invalid, 227 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 218 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-02 20:40:59,497 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [267 Valid, 353 Invalid, 227 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 218 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-11-02 20:40:59,498 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 439 states. [2022-11-02 20:40:59,513 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 439 to 308. [2022-11-02 20:40:59,514 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 308 states, 236 states have (on average 1.771186440677966) internal successors, (418), 295 states have internal predecessors, (418), 10 states have call successors, (10), 5 states have call predecessors, (10), 5 states have return successors, (10), 7 states have call predecessors, (10), 10 states have call successors, (10) [2022-11-02 20:40:59,517 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 308 states to 308 states and 438 transitions. [2022-11-02 20:40:59,518 INFO L78 Accepts]: Start accepts. Automaton has 308 states and 438 transitions. Word has length 13 [2022-11-02 20:40:59,518 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:40:59,519 INFO L495 AbstractCegarLoop]: Abstraction has 308 states and 438 transitions. [2022-11-02 20:40:59,519 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 4 states have internal predecessors, (11), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-11-02 20:40:59,526 INFO L276 IsEmpty]: Start isEmpty. Operand 308 states and 438 transitions. [2022-11-02 20:40:59,527 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-11-02 20:40:59,528 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:40:59,528 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:40:59,528 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-11-02 20:40:59,529 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 54 more)] === [2022-11-02 20:40:59,530 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:40:59,531 INFO L85 PathProgramCache]: Analyzing trace with hash 1916999929, now seen corresponding path program 1 times [2022-11-02 20:40:59,531 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:40:59,531 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1715641669] [2022-11-02 20:40:59,532 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:40:59,532 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:40:59,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:40:59,803 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-02 20:40:59,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:40:59,844 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:40:59,844 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:40:59,844 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1715641669] [2022-11-02 20:40:59,844 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1715641669] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:40:59,845 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:40:59,845 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-02 20:40:59,845 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [828365103] [2022-11-02 20:40:59,845 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:40:59,846 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-02 20:40:59,846 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:40:59,847 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-02 20:40:59,847 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-11-02 20:40:59,848 INFO L87 Difference]: Start difference. First operand 308 states and 438 transitions. Second operand has 6 states, 5 states have (on average 2.2) internal successors, (11), 5 states have internal predecessors, (11), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-11-02 20:41:00,235 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:41:00,235 INFO L93 Difference]: Finished difference Result 378 states and 484 transitions. [2022-11-02 20:41:00,236 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-02 20:41:00,236 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 2.2) internal successors, (11), 5 states have internal predecessors, (11), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 13 [2022-11-02 20:41:00,236 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:41:00,238 INFO L225 Difference]: With dead ends: 378 [2022-11-02 20:41:00,238 INFO L226 Difference]: Without dead ends: 378 [2022-11-02 20:41:00,239 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2022-11-02 20:41:00,239 INFO L413 NwaCegarLoop]: 153 mSDtfsCounter, 118 mSDsluCounter, 503 mSDsCounter, 0 mSdLazyCounter, 234 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 120 SdHoareTripleChecker+Valid, 656 SdHoareTripleChecker+Invalid, 234 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 234 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-02 20:41:00,240 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [120 Valid, 656 Invalid, 234 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 234 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-11-02 20:41:00,241 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 378 states. [2022-11-02 20:41:00,258 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 378 to 318. [2022-11-02 20:41:00,262 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 318 states, 243 states have (on average 1.7530864197530864) internal successors, (426), 303 states have internal predecessors, (426), 10 states have call successors, (10), 5 states have call predecessors, (10), 8 states have return successors, (16), 9 states have call predecessors, (16), 10 states have call successors, (16) [2022-11-02 20:41:00,264 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 318 states to 318 states and 452 transitions. [2022-11-02 20:41:00,264 INFO L78 Accepts]: Start accepts. Automaton has 318 states and 452 transitions. Word has length 13 [2022-11-02 20:41:00,264 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:41:00,264 INFO L495 AbstractCegarLoop]: Abstraction has 318 states and 452 transitions. [2022-11-02 20:41:00,265 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.2) internal successors, (11), 5 states have internal predecessors, (11), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-11-02 20:41:00,265 INFO L276 IsEmpty]: Start isEmpty. Operand 318 states and 452 transitions. [2022-11-02 20:41:00,266 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-11-02 20:41:00,266 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:41:00,266 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:41:00,267 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-11-02 20:41:00,267 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 54 more)] === [2022-11-02 20:41:00,267 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:41:00,268 INFO L85 PathProgramCache]: Analyzing trace with hash 1917923450, now seen corresponding path program 1 times [2022-11-02 20:41:00,268 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:41:00,268 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1408113076] [2022-11-02 20:41:00,268 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:41:00,269 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:41:00,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:41:00,510 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-02 20:41:00,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:41:00,546 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:41:00,546 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:41:00,546 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1408113076] [2022-11-02 20:41:00,546 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1408113076] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:41:00,547 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:41:00,547 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-02 20:41:00,547 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1586479541] [2022-11-02 20:41:00,547 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:41:00,548 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-02 20:41:00,549 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:41:00,549 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-02 20:41:00,549 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-11-02 20:41:00,550 INFO L87 Difference]: Start difference. First operand 318 states and 452 transitions. Second operand has 6 states, 5 states have (on average 2.2) internal successors, (11), 5 states have internal predecessors, (11), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-11-02 20:41:00,988 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:41:00,988 INFO L93 Difference]: Finished difference Result 377 states and 482 transitions. [2022-11-02 20:41:00,988 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-02 20:41:00,989 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 2.2) internal successors, (11), 5 states have internal predecessors, (11), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 13 [2022-11-02 20:41:00,989 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:41:00,991 INFO L225 Difference]: With dead ends: 377 [2022-11-02 20:41:00,991 INFO L226 Difference]: Without dead ends: 377 [2022-11-02 20:41:00,992 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2022-11-02 20:41:00,992 INFO L413 NwaCegarLoop]: 160 mSDtfsCounter, 113 mSDsluCounter, 518 mSDsCounter, 0 mSdLazyCounter, 244 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 113 SdHoareTripleChecker+Valid, 678 SdHoareTripleChecker+Invalid, 244 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 244 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-02 20:41:00,993 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [113 Valid, 678 Invalid, 244 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 244 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-11-02 20:41:00,994 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 377 states. [2022-11-02 20:41:01,006 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 377 to 312. [2022-11-02 20:41:01,007 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 312 states, 240 states have (on average 1.7625) internal successors, (423), 297 states have internal predecessors, (423), 10 states have call successors, (10), 5 states have call predecessors, (10), 5 states have return successors, (10), 9 states have call predecessors, (10), 10 states have call successors, (10) [2022-11-02 20:41:01,009 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 312 states to 312 states and 443 transitions. [2022-11-02 20:41:01,010 INFO L78 Accepts]: Start accepts. Automaton has 312 states and 443 transitions. Word has length 13 [2022-11-02 20:41:01,010 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:41:01,010 INFO L495 AbstractCegarLoop]: Abstraction has 312 states and 443 transitions. [2022-11-02 20:41:01,011 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.2) internal successors, (11), 5 states have internal predecessors, (11), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-11-02 20:41:01,011 INFO L276 IsEmpty]: Start isEmpty. Operand 312 states and 443 transitions. [2022-11-02 20:41:01,011 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-11-02 20:41:01,012 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:41:01,012 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:41:01,012 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-11-02 20:41:01,012 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr20REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 54 more)] === [2022-11-02 20:41:01,013 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:41:01,013 INFO L85 PathProgramCache]: Analyzing trace with hash -60907143, now seen corresponding path program 1 times [2022-11-02 20:41:01,013 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:41:01,014 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1284045914] [2022-11-02 20:41:01,014 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:41:01,014 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:41:01,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:41:01,076 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-11-02 20:41:01,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:41:01,083 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:41:01,083 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:41:01,083 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1284045914] [2022-11-02 20:41:01,083 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1284045914] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:41:01,084 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:41:01,084 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-02 20:41:01,084 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [9085089] [2022-11-02 20:41:01,084 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:41:01,085 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-02 20:41:01,085 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:41:01,085 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-02 20:41:01,086 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-02 20:41:01,086 INFO L87 Difference]: Start difference. First operand 312 states and 443 transitions. Second operand has 4 states, 3 states have (on average 4.333333333333333) internal successors, (13), 4 states have internal predecessors, (13), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-11-02 20:41:01,415 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:41:01,415 INFO L93 Difference]: Finished difference Result 489 states and 642 transitions. [2022-11-02 20:41:01,415 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-02 20:41:01,416 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 4.333333333333333) internal successors, (13), 4 states have internal predecessors, (13), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 15 [2022-11-02 20:41:01,416 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:41:01,418 INFO L225 Difference]: With dead ends: 489 [2022-11-02 20:41:01,418 INFO L226 Difference]: Without dead ends: 489 [2022-11-02 20:41:01,419 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:41:01,420 INFO L413 NwaCegarLoop]: 164 mSDtfsCounter, 259 mSDsluCounter, 196 mSDsCounter, 0 mSdLazyCounter, 206 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 259 SdHoareTripleChecker+Valid, 360 SdHoareTripleChecker+Invalid, 212 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 206 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-02 20:41:01,420 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [259 Valid, 360 Invalid, 212 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 206 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-11-02 20:41:01,421 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 489 states. [2022-11-02 20:41:01,431 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 489 to 318. [2022-11-02 20:41:01,432 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 318 states, 246 states have (on average 1.7439024390243902) internal successors, (429), 303 states have internal predecessors, (429), 10 states have call successors, (10), 5 states have call predecessors, (10), 5 states have return successors, (10), 9 states have call predecessors, (10), 10 states have call successors, (10) [2022-11-02 20:41:01,435 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 318 states to 318 states and 449 transitions. [2022-11-02 20:41:01,435 INFO L78 Accepts]: Start accepts. Automaton has 318 states and 449 transitions. Word has length 15 [2022-11-02 20:41:01,435 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:41:01,435 INFO L495 AbstractCegarLoop]: Abstraction has 318 states and 449 transitions. [2022-11-02 20:41:01,436 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 4.333333333333333) internal successors, (13), 4 states have internal predecessors, (13), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-11-02 20:41:01,436 INFO L276 IsEmpty]: Start isEmpty. Operand 318 states and 449 transitions. [2022-11-02 20:41:01,437 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-11-02 20:41:01,437 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:41:01,437 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:41:01,437 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-11-02 20:41:01,438 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr21REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 54 more)] === [2022-11-02 20:41:01,438 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:41:01,438 INFO L85 PathProgramCache]: Analyzing trace with hash -60907142, now seen corresponding path program 1 times [2022-11-02 20:41:01,439 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:41:01,439 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1119936319] [2022-11-02 20:41:01,439 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:41:01,439 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:41:01,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:41:01,590 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-11-02 20:41:01,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:41:01,598 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:41:01,599 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:41:01,599 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1119936319] [2022-11-02 20:41:01,599 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1119936319] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:41:01,599 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:41:01,599 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-02 20:41:01,600 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [494495685] [2022-11-02 20:41:01,600 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:41:01,600 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-02 20:41:01,600 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:41:01,601 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-02 20:41:01,601 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-02 20:41:01,602 INFO L87 Difference]: Start difference. First operand 318 states and 449 transitions. Second operand has 4 states, 3 states have (on average 4.333333333333333) internal successors, (13), 4 states have internal predecessors, (13), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-11-02 20:41:01,860 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:41:01,860 INFO L93 Difference]: Finished difference Result 375 states and 473 transitions. [2022-11-02 20:41:01,861 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-02 20:41:01,861 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 4.333333333333333) internal successors, (13), 4 states have internal predecessors, (13), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 15 [2022-11-02 20:41:01,861 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:41:01,863 INFO L225 Difference]: With dead ends: 375 [2022-11-02 20:41:01,863 INFO L226 Difference]: Without dead ends: 375 [2022-11-02 20:41:01,864 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:41:01,864 INFO L413 NwaCegarLoop]: 160 mSDtfsCounter, 203 mSDsluCounter, 214 mSDsCounter, 0 mSdLazyCounter, 151 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 203 SdHoareTripleChecker+Valid, 374 SdHoareTripleChecker+Invalid, 155 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 151 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-02 20:41:01,865 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [203 Valid, 374 Invalid, 155 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 151 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-02 20:41:01,866 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 375 states. [2022-11-02 20:41:01,875 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 375 to 318. [2022-11-02 20:41:01,875 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 318 states, 246 states have (on average 1.7073170731707317) internal successors, (420), 303 states have internal predecessors, (420), 10 states have call successors, (10), 5 states have call predecessors, (10), 5 states have return successors, (10), 9 states have call predecessors, (10), 10 states have call successors, (10) [2022-11-02 20:41:01,878 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 318 states to 318 states and 440 transitions. [2022-11-02 20:41:01,878 INFO L78 Accepts]: Start accepts. Automaton has 318 states and 440 transitions. Word has length 15 [2022-11-02 20:41:01,878 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:41:01,878 INFO L495 AbstractCegarLoop]: Abstraction has 318 states and 440 transitions. [2022-11-02 20:41:01,879 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 4.333333333333333) internal successors, (13), 4 states have internal predecessors, (13), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-11-02 20:41:01,879 INFO L276 IsEmpty]: Start isEmpty. Operand 318 states and 440 transitions. [2022-11-02 20:41:01,879 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-11-02 20:41:01,880 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:41:01,880 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:41:01,880 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-11-02 20:41:01,880 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 54 more)] === [2022-11-02 20:41:01,881 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:41:01,881 INFO L85 PathProgramCache]: Analyzing trace with hash 1341254785, now seen corresponding path program 1 times [2022-11-02 20:41:01,881 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:41:01,882 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1205667010] [2022-11-02 20:41:01,882 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:41:01,882 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:41:01,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:41:01,922 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-02 20:41:01,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:41:01,926 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:41:01,926 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:41:01,927 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1205667010] [2022-11-02 20:41:01,927 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1205667010] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:41:01,927 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:41:01,927 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-02 20:41:01,927 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [467246532] [2022-11-02 20:41:01,928 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:41:01,928 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-02 20:41:01,928 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:41:01,929 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-02 20:41:01,929 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-02 20:41:01,929 INFO L87 Difference]: Start difference. First operand 318 states and 440 transitions. Second operand has 3 states, 2 states have (on average 8.5) internal successors, (17), 3 states have internal predecessors, (17), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-11-02 20:41:02,085 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:41:02,085 INFO L93 Difference]: Finished difference Result 409 states and 539 transitions. [2022-11-02 20:41:02,086 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-02 20:41:02,086 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), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 19 [2022-11-02 20:41:02,088 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:41:02,090 INFO L225 Difference]: With dead ends: 409 [2022-11-02 20:41:02,091 INFO L226 Difference]: Without dead ends: 409 [2022-11-02 20:41:02,091 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 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:41:02,094 INFO L413 NwaCegarLoop]: 183 mSDtfsCounter, 132 mSDsluCounter, 78 mSDsCounter, 0 mSdLazyCounter, 97 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 134 SdHoareTripleChecker+Valid, 261 SdHoareTripleChecker+Invalid, 99 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 97 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-02 20:41:02,095 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [134 Valid, 261 Invalid, 99 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 97 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-02 20:41:02,097 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 409 states. [2022-11-02 20:41:02,112 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 409 to 315. [2022-11-02 20:41:02,113 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 315 states, 246 states have (on average 1.6829268292682926) internal successors, (414), 300 states have internal predecessors, (414), 10 states have call successors, (10), 5 states have call predecessors, (10), 5 states have return successors, (10), 9 states have call predecessors, (10), 10 states have call successors, (10) [2022-11-02 20:41:02,119 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 315 states to 315 states and 434 transitions. [2022-11-02 20:41:02,120 INFO L78 Accepts]: Start accepts. Automaton has 315 states and 434 transitions. Word has length 19 [2022-11-02 20:41:02,120 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:41:02,121 INFO L495 AbstractCegarLoop]: Abstraction has 315 states and 434 transitions. [2022-11-02 20:41:02,121 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), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-11-02 20:41:02,122 INFO L276 IsEmpty]: Start isEmpty. Operand 315 states and 434 transitions. [2022-11-02 20:41:02,122 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-11-02 20:41:02,123 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:41:02,123 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:41:02,123 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-11-02 20:41:02,123 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 54 more)] === [2022-11-02 20:41:02,124 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:41:02,124 INFO L85 PathProgramCache]: Analyzing trace with hash 1341254786, now seen corresponding path program 1 times [2022-11-02 20:41:02,124 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:41:02,125 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [926089057] [2022-11-02 20:41:02,125 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:41:02,125 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:41:02,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:41:02,258 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-02 20:41:02,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:41:02,263 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:41:02,263 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:41:02,264 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [926089057] [2022-11-02 20:41:02,264 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [926089057] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:41:02,264 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:41:02,264 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-02 20:41:02,264 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1117587930] [2022-11-02 20:41:02,265 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:41:02,265 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-02 20:41:02,265 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:41:02,266 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-02 20:41:02,266 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-11-02 20:41:02,266 INFO L87 Difference]: Start difference. First operand 315 states and 434 transitions. Second operand has 4 states, 3 states have (on average 5.666666666666667) internal successors, (17), 4 states have internal predecessors, (17), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-11-02 20:41:02,549 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:41:02,549 INFO L93 Difference]: Finished difference Result 532 states and 662 transitions. [2022-11-02 20:41:02,549 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-02 20:41:02,550 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 5.666666666666667) internal successors, (17), 4 states have internal predecessors, (17), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 19 [2022-11-02 20:41:02,550 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:41:02,552 INFO L225 Difference]: With dead ends: 532 [2022-11-02 20:41:02,552 INFO L226 Difference]: Without dead ends: 532 [2022-11-02 20:41:02,553 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-11-02 20:41:02,553 INFO L413 NwaCegarLoop]: 202 mSDtfsCounter, 283 mSDsluCounter, 257 mSDsCounter, 0 mSdLazyCounter, 144 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 287 SdHoareTripleChecker+Valid, 459 SdHoareTripleChecker+Invalid, 146 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 144 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-02 20:41:02,554 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [287 Valid, 459 Invalid, 146 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 144 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-11-02 20:41:02,555 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 532 states. [2022-11-02 20:41:02,565 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 532 to 318. [2022-11-02 20:41:02,566 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 318 states, 250 states have (on average 1.664) internal successors, (416), 303 states have internal predecessors, (416), 10 states have call successors, (10), 5 states have call predecessors, (10), 5 states have return successors, (10), 9 states have call predecessors, (10), 10 states have call successors, (10) [2022-11-02 20:41:02,568 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 318 states to 318 states and 436 transitions. [2022-11-02 20:41:02,568 INFO L78 Accepts]: Start accepts. Automaton has 318 states and 436 transitions. Word has length 19 [2022-11-02 20:41:02,568 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:41:02,569 INFO L495 AbstractCegarLoop]: Abstraction has 318 states and 436 transitions. [2022-11-02 20:41:02,569 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 5.666666666666667) internal successors, (17), 4 states have internal predecessors, (17), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-11-02 20:41:02,569 INFO L276 IsEmpty]: Start isEmpty. Operand 318 states and 436 transitions. [2022-11-02 20:41:02,570 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-11-02 20:41:02,570 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:41:02,570 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] [2022-11-02 20:41:02,570 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-11-02 20:41:02,571 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 54 more)] === [2022-11-02 20:41:02,571 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:41:02,571 INFO L85 PathProgramCache]: Analyzing trace with hash -1370774597, now seen corresponding path program 1 times [2022-11-02 20:41:02,572 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:41:02,572 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1650166689] [2022-11-02 20:41:02,572 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:41:02,572 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:41:02,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:41:02,678 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-02 20:41:02,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:41:02,682 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:41:02,683 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:41:02,683 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1650166689] [2022-11-02 20:41:02,683 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1650166689] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:41:02,683 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:41:02,684 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-02 20:41:02,684 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1854728039] [2022-11-02 20:41:02,684 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:41:02,684 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-02 20:41:02,685 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:41:02,685 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-02 20:41:02,685 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-11-02 20:41:02,686 INFO L87 Difference]: Start difference. First operand 318 states and 436 transitions. Second operand has 4 states, 3 states have (on average 6.0) internal successors, (18), 4 states have internal predecessors, (18), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-11-02 20:41:02,935 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:41:02,936 INFO L93 Difference]: Finished difference Result 531 states and 660 transitions. [2022-11-02 20:41:02,936 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-02 20:41:02,936 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 6.0) internal successors, (18), 4 states have internal predecessors, (18), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 20 [2022-11-02 20:41:02,937 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:41:02,939 INFO L225 Difference]: With dead ends: 531 [2022-11-02 20:41:02,939 INFO L226 Difference]: Without dead ends: 531 [2022-11-02 20:41:02,940 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-11-02 20:41:02,941 INFO L413 NwaCegarLoop]: 253 mSDtfsCounter, 344 mSDsluCounter, 186 mSDsCounter, 0 mSdLazyCounter, 142 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 348 SdHoareTripleChecker+Valid, 439 SdHoareTripleChecker+Invalid, 144 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 142 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-02 20:41:02,941 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [348 Valid, 439 Invalid, 144 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 142 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-02 20:41:02,942 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 531 states. [2022-11-02 20:41:02,952 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 531 to 320. [2022-11-02 20:41:02,953 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 320 states, 252 states have (on average 1.6587301587301588) internal successors, (418), 305 states have internal predecessors, (418), 10 states have call successors, (10), 5 states have call predecessors, (10), 5 states have return successors, (10), 9 states have call predecessors, (10), 10 states have call successors, (10) [2022-11-02 20:41:02,955 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 320 states to 320 states and 438 transitions. [2022-11-02 20:41:02,955 INFO L78 Accepts]: Start accepts. Automaton has 320 states and 438 transitions. Word has length 20 [2022-11-02 20:41:02,955 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:41:02,955 INFO L495 AbstractCegarLoop]: Abstraction has 320 states and 438 transitions. [2022-11-02 20:41:02,956 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 6.0) internal successors, (18), 4 states have internal predecessors, (18), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-11-02 20:41:02,956 INFO L276 IsEmpty]: Start isEmpty. Operand 320 states and 438 transitions. [2022-11-02 20:41:02,957 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-11-02 20:41:02,957 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:41:02,957 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] [2022-11-02 20:41:02,957 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-11-02 20:41:02,958 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 54 more)] === [2022-11-02 20:41:02,958 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:41:02,958 INFO L85 PathProgramCache]: Analyzing trace with hash -1370718893, now seen corresponding path program 1 times [2022-11-02 20:41:02,959 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:41:02,959 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1416451378] [2022-11-02 20:41:02,959 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:41:02,959 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:41:02,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:41:03,112 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-02 20:41:03,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:41:03,130 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:41:03,131 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:41:03,131 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1416451378] [2022-11-02 20:41:03,131 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1416451378] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:41:03,132 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:41:03,132 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-11-02 20:41:03,132 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2098069594] [2022-11-02 20:41:03,132 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:41:03,133 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-02 20:41:03,133 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:41:03,134 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-02 20:41:03,134 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-11-02 20:41:03,134 INFO L87 Difference]: Start difference. First operand 320 states and 438 transitions. Second operand has 7 states, 7 states have (on average 2.5714285714285716) internal successors, (18), 6 states have internal predecessors, (18), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-11-02 20:41:03,284 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:41:03,284 INFO L93 Difference]: Finished difference Result 540 states and 713 transitions. [2022-11-02 20:41:03,285 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-11-02 20:41:03,285 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.5714285714285716) internal successors, (18), 6 states have internal predecessors, (18), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 20 [2022-11-02 20:41:03,286 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:41:03,288 INFO L225 Difference]: With dead ends: 540 [2022-11-02 20:41:03,289 INFO L226 Difference]: Without dead ends: 540 [2022-11-02 20:41:03,289 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2022-11-02 20:41:03,290 INFO L413 NwaCegarLoop]: 232 mSDtfsCounter, 336 mSDsluCounter, 1003 mSDsCounter, 0 mSdLazyCounter, 64 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 336 SdHoareTripleChecker+Valid, 1235 SdHoareTripleChecker+Invalid, 74 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 64 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-02 20:41:03,290 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [336 Valid, 1235 Invalid, 74 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 64 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-02 20:41:03,292 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 540 states. [2022-11-02 20:41:03,303 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 540 to 348. [2022-11-02 20:41:03,304 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 348 states, 275 states have (on average 1.6254545454545455) internal successors, (447), 329 states have internal predecessors, (447), 10 states have call successors, (10), 5 states have call predecessors, (10), 10 states have return successors, (20), 13 states have call predecessors, (20), 10 states have call successors, (20) [2022-11-02 20:41:03,306 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 348 states to 348 states and 477 transitions. [2022-11-02 20:41:03,306 INFO L78 Accepts]: Start accepts. Automaton has 348 states and 477 transitions. Word has length 20 [2022-11-02 20:41:03,307 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:41:03,307 INFO L495 AbstractCegarLoop]: Abstraction has 348 states and 477 transitions. [2022-11-02 20:41:03,307 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 2.5714285714285716) internal successors, (18), 6 states have internal predecessors, (18), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-11-02 20:41:03,307 INFO L276 IsEmpty]: Start isEmpty. Operand 348 states and 477 transitions. [2022-11-02 20:41:03,308 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-11-02 20:41:03,308 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:41:03,308 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] [2022-11-02 20:41:03,309 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2022-11-02 20:41:03,309 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 54 more)] === [2022-11-02 20:41:03,309 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:41:03,310 INFO L85 PathProgramCache]: Analyzing trace with hash -1370716971, now seen corresponding path program 1 times [2022-11-02 20:41:03,310 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:41:03,310 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1973035207] [2022-11-02 20:41:03,310 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:41:03,311 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:41:03,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:41:03,449 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-02 20:41:03,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:41:03,471 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:41:03,471 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:41:03,471 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1973035207] [2022-11-02 20:41:03,472 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1973035207] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:41:03,472 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:41:03,472 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-11-02 20:41:03,472 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [957639043] [2022-11-02 20:41:03,472 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:41:03,473 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-02 20:41:03,473 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:41:03,474 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-02 20:41:03,474 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-11-02 20:41:03,474 INFO L87 Difference]: Start difference. First operand 348 states and 477 transitions. Second operand has 7 states, 7 states have (on average 2.5714285714285716) internal successors, (18), 6 states have internal predecessors, (18), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-11-02 20:41:03,623 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:41:03,623 INFO L93 Difference]: Finished difference Result 530 states and 699 transitions. [2022-11-02 20:41:03,624 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-11-02 20:41:03,624 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.5714285714285716) internal successors, (18), 6 states have internal predecessors, (18), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 20 [2022-11-02 20:41:03,624 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:41:03,627 INFO L225 Difference]: With dead ends: 530 [2022-11-02 20:41:03,627 INFO L226 Difference]: Without dead ends: 530 [2022-11-02 20:41:03,628 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2022-11-02 20:41:03,628 INFO L413 NwaCegarLoop]: 232 mSDtfsCounter, 323 mSDsluCounter, 1001 mSDsCounter, 0 mSdLazyCounter, 64 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 323 SdHoareTripleChecker+Valid, 1233 SdHoareTripleChecker+Invalid, 75 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 64 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-02 20:41:03,629 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [323 Valid, 1233 Invalid, 75 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 64 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-02 20:41:03,630 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 530 states. [2022-11-02 20:41:03,640 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 530 to 346. [2022-11-02 20:41:03,641 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 346 states, 273 states have (on average 1.6227106227106227) internal successors, (443), 327 states have internal predecessors, (443), 10 states have call successors, (10), 5 states have call predecessors, (10), 10 states have return successors, (20), 13 states have call predecessors, (20), 10 states have call successors, (20) [2022-11-02 20:41:03,643 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 346 states to 346 states and 473 transitions. [2022-11-02 20:41:03,644 INFO L78 Accepts]: Start accepts. Automaton has 346 states and 473 transitions. Word has length 20 [2022-11-02 20:41:03,644 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:41:03,644 INFO L495 AbstractCegarLoop]: Abstraction has 346 states and 473 transitions. [2022-11-02 20:41:03,644 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 2.5714285714285716) internal successors, (18), 6 states have internal predecessors, (18), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-11-02 20:41:03,645 INFO L276 IsEmpty]: Start isEmpty. Operand 346 states and 473 transitions. [2022-11-02 20:41:03,645 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-11-02 20:41:03,645 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:41:03,646 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] [2022-11-02 20:41:03,646 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2022-11-02 20:41:03,646 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 54 more)] === [2022-11-02 20:41:03,647 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:41:03,647 INFO L85 PathProgramCache]: Analyzing trace with hash -1241636174, now seen corresponding path program 1 times [2022-11-02 20:41:03,647 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:41:03,647 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [658312079] [2022-11-02 20:41:03,648 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:41:03,648 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:41:03,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:41:03,752 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-02 20:41:03,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:41:03,756 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:41:03,757 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:41:03,757 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [658312079] [2022-11-02 20:41:03,757 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [658312079] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:41:03,757 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:41:03,757 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-02 20:41:03,758 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1455070843] [2022-11-02 20:41:03,758 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:41:03,758 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-02 20:41:03,758 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:41:03,759 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-02 20:41:03,759 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-11-02 20:41:03,759 INFO L87 Difference]: Start difference. First operand 346 states and 473 transitions. Second operand has 4 states, 3 states have (on average 6.0) internal successors, (18), 4 states have internal predecessors, (18), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-11-02 20:41:04,010 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:41:04,010 INFO L93 Difference]: Finished difference Result 572 states and 718 transitions. [2022-11-02 20:41:04,011 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-02 20:41:04,011 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 6.0) internal successors, (18), 4 states have internal predecessors, (18), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 20 [2022-11-02 20:41:04,011 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:41:04,014 INFO L225 Difference]: With dead ends: 572 [2022-11-02 20:41:04,014 INFO L226 Difference]: Without dead ends: 572 [2022-11-02 20:41:04,014 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-11-02 20:41:04,015 INFO L413 NwaCegarLoop]: 244 mSDtfsCounter, 355 mSDsluCounter, 186 mSDsCounter, 0 mSdLazyCounter, 148 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 359 SdHoareTripleChecker+Valid, 430 SdHoareTripleChecker+Invalid, 150 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 148 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-02 20:41:04,015 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [359 Valid, 430 Invalid, 150 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 148 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-02 20:41:04,016 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 572 states. [2022-11-02 20:41:04,027 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 572 to 350. [2022-11-02 20:41:04,028 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 350 states, 277 states have (on average 1.6137184115523466) internal successors, (447), 331 states have internal predecessors, (447), 10 states have call successors, (10), 5 states have call predecessors, (10), 10 states have return successors, (20), 13 states have call predecessors, (20), 10 states have call successors, (20) [2022-11-02 20:41:04,030 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 350 states to 350 states and 477 transitions. [2022-11-02 20:41:04,030 INFO L78 Accepts]: Start accepts. Automaton has 350 states and 477 transitions. Word has length 20 [2022-11-02 20:41:04,030 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:41:04,031 INFO L495 AbstractCegarLoop]: Abstraction has 350 states and 477 transitions. [2022-11-02 20:41:04,031 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 6.0) internal successors, (18), 4 states have internal predecessors, (18), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-11-02 20:41:04,031 INFO L276 IsEmpty]: Start isEmpty. Operand 350 states and 477 transitions. [2022-11-02 20:41:04,032 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-11-02 20:41:04,032 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:41:04,032 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] [2022-11-02 20:41:04,032 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2022-11-02 20:41:04,033 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 54 more)] === [2022-11-02 20:41:04,033 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:41:04,033 INFO L85 PathProgramCache]: Analyzing trace with hash -1241634252, now seen corresponding path program 1 times [2022-11-02 20:41:04,033 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:41:04,034 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [79383371] [2022-11-02 20:41:04,034 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:41:04,034 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:41:04,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:41:04,169 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-02 20:41:04,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:41:04,191 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:41:04,191 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:41:04,192 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [79383371] [2022-11-02 20:41:04,192 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [79383371] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:41:04,192 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:41:04,192 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-11-02 20:41:04,192 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [678751418] [2022-11-02 20:41:04,193 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:41:04,193 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-02 20:41:04,193 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:41:04,194 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-02 20:41:04,194 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-11-02 20:41:04,194 INFO L87 Difference]: Start difference. First operand 350 states and 477 transitions. Second operand has 7 states, 7 states have (on average 2.5714285714285716) internal successors, (18), 6 states have internal predecessors, (18), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-11-02 20:41:04,345 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:41:04,346 INFO L93 Difference]: Finished difference Result 527 states and 693 transitions. [2022-11-02 20:41:04,346 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-11-02 20:41:04,347 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.5714285714285716) internal successors, (18), 6 states have internal predecessors, (18), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 20 [2022-11-02 20:41:04,347 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:41:04,349 INFO L225 Difference]: With dead ends: 527 [2022-11-02 20:41:04,350 INFO L226 Difference]: Without dead ends: 527 [2022-11-02 20:41:04,350 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2022-11-02 20:41:04,351 INFO L413 NwaCegarLoop]: 302 mSDtfsCounter, 330 mSDsluCounter, 1159 mSDsCounter, 0 mSdLazyCounter, 64 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 330 SdHoareTripleChecker+Valid, 1461 SdHoareTripleChecker+Invalid, 69 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 64 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-02 20:41:04,351 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [330 Valid, 1461 Invalid, 69 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 64 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-02 20:41:04,352 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 527 states. [2022-11-02 20:41:04,362 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 527 to 345. [2022-11-02 20:41:04,363 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 345 states, 273 states have (on average 1.6080586080586081) internal successors, (439), 326 states have internal predecessors, (439), 10 states have call successors, (10), 5 states have call predecessors, (10), 10 states have return successors, (20), 13 states have call predecessors, (20), 10 states have call successors, (20) [2022-11-02 20:41:04,365 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 345 states to 345 states and 469 transitions. [2022-11-02 20:41:04,365 INFO L78 Accepts]: Start accepts. Automaton has 345 states and 469 transitions. Word has length 20 [2022-11-02 20:41:04,366 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:41:04,366 INFO L495 AbstractCegarLoop]: Abstraction has 345 states and 469 transitions. [2022-11-02 20:41:04,366 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 2.5714285714285716) internal successors, (18), 6 states have internal predecessors, (18), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-11-02 20:41:04,366 INFO L276 IsEmpty]: Start isEmpty. Operand 345 states and 469 transitions. [2022-11-02 20:41:04,367 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-11-02 20:41:04,367 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:41:04,367 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] [2022-11-02 20:41:04,368 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2022-11-02 20:41:04,372 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr25ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 54 more)] === [2022-11-02 20:41:04,373 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:41:04,373 INFO L85 PathProgramCache]: Analyzing trace with hash 712638781, now seen corresponding path program 1 times [2022-11-02 20:41:04,373 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:41:04,374 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1277383594] [2022-11-02 20:41:04,374 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:41:04,374 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:41:04,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:41:04,959 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-11-02 20:41:04,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:41:04,969 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:41:04,969 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:41:04,969 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1277383594] [2022-11-02 20:41:04,970 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1277383594] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:41:04,970 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:41:04,970 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-11-02 20:41:04,970 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [930991163] [2022-11-02 20:41:04,970 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:41:04,971 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-11-02 20:41:04,971 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:41:04,972 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-11-02 20:41:04,972 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2022-11-02 20:41:04,972 INFO L87 Difference]: Start difference. First operand 345 states and 469 transitions. Second operand has 9 states, 9 states have (on average 2.111111111111111) internal successors, (19), 9 states have internal predecessors, (19), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-11-02 20:41:05,947 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:41:05,947 INFO L93 Difference]: Finished difference Result 649 states and 845 transitions. [2022-11-02 20:41:05,948 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-11-02 20:41:05,948 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 2.111111111111111) internal successors, (19), 9 states have internal predecessors, (19), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 21 [2022-11-02 20:41:05,949 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:41:05,952 INFO L225 Difference]: With dead ends: 649 [2022-11-02 20:41:05,952 INFO L226 Difference]: Without dead ends: 647 [2022-11-02 20:41:05,952 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=66, Invalid=144, Unknown=0, NotChecked=0, Total=210 [2022-11-02 20:41:05,953 INFO L413 NwaCegarLoop]: 201 mSDtfsCounter, 445 mSDsluCounter, 1027 mSDsCounter, 0 mSdLazyCounter, 297 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 447 SdHoareTripleChecker+Valid, 1228 SdHoareTripleChecker+Invalid, 323 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 297 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-11-02 20:41:05,953 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [447 Valid, 1228 Invalid, 323 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 297 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-11-02 20:41:05,954 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 647 states. [2022-11-02 20:41:05,974 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 647 to 339. [2022-11-02 20:41:05,975 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 339 states, 267 states have (on average 1.6029962546816479) internal successors, (428), 320 states have internal predecessors, (428), 10 states have call successors, (10), 5 states have call predecessors, (10), 10 states have return successors, (20), 13 states have call predecessors, (20), 10 states have call successors, (20) [2022-11-02 20:41:05,978 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 339 states to 339 states and 458 transitions. [2022-11-02 20:41:05,979 INFO L78 Accepts]: Start accepts. Automaton has 339 states and 458 transitions. Word has length 21 [2022-11-02 20:41:05,979 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:41:05,979 INFO L495 AbstractCegarLoop]: Abstraction has 339 states and 458 transitions. [2022-11-02 20:41:05,979 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 2.111111111111111) internal successors, (19), 9 states have internal predecessors, (19), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-11-02 20:41:05,980 INFO L276 IsEmpty]: Start isEmpty. Operand 339 states and 458 transitions. [2022-11-02 20:41:05,980 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-11-02 20:41:05,980 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:41:05,980 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] [2022-11-02 20:41:05,981 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2022-11-02 20:41:05,981 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 54 more)] === [2022-11-02 20:41:05,981 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:41:05,982 INFO L85 PathProgramCache]: Analyzing trace with hash 163984267, now seen corresponding path program 1 times [2022-11-02 20:41:05,982 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:41:05,982 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [170496513] [2022-11-02 20:41:05,982 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:41:05,983 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:41:06,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:41:06,126 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-02 20:41:06,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:41:06,131 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:41:06,131 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:41:06,132 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [170496513] [2022-11-02 20:41:06,132 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [170496513] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:41:06,133 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:41:06,133 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-02 20:41:06,133 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [137331508] [2022-11-02 20:41:06,133 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:41:06,134 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-02 20:41:06,135 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:41:06,135 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-02 20:41:06,135 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-11-02 20:41:06,136 INFO L87 Difference]: Start difference. First operand 339 states and 458 transitions. Second operand has 4 states, 3 states have (on average 6.333333333333333) internal successors, (19), 4 states have internal predecessors, (19), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-11-02 20:41:06,396 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:41:06,396 INFO L93 Difference]: Finished difference Result 557 states and 693 transitions. [2022-11-02 20:41:06,398 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-02 20:41:06,398 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 6.333333333333333) internal successors, (19), 4 states have internal predecessors, (19), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 21 [2022-11-02 20:41:06,399 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:41:06,401 INFO L225 Difference]: With dead ends: 557 [2022-11-02 20:41:06,401 INFO L226 Difference]: Without dead ends: 557 [2022-11-02 20:41:06,402 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-11-02 20:41:06,402 INFO L413 NwaCegarLoop]: 245 mSDtfsCounter, 347 mSDsluCounter, 185 mSDsCounter, 0 mSdLazyCounter, 144 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 351 SdHoareTripleChecker+Valid, 430 SdHoareTripleChecker+Invalid, 146 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 144 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-02 20:41:06,402 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [351 Valid, 430 Invalid, 146 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 144 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-02 20:41:06,404 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 557 states. [2022-11-02 20:41:06,414 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 557 to 332. [2022-11-02 20:41:06,415 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 332 states, 261 states have (on average 1.6091954022988506) internal successors, (420), 313 states have internal predecessors, (420), 10 states have call successors, (10), 5 states have call predecessors, (10), 10 states have return successors, (20), 13 states have call predecessors, (20), 10 states have call successors, (20) [2022-11-02 20:41:06,417 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 332 states to 332 states and 450 transitions. [2022-11-02 20:41:06,417 INFO L78 Accepts]: Start accepts. Automaton has 332 states and 450 transitions. Word has length 21 [2022-11-02 20:41:06,417 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:41:06,417 INFO L495 AbstractCegarLoop]: Abstraction has 332 states and 450 transitions. [2022-11-02 20:41:06,418 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 6.333333333333333) internal successors, (19), 4 states have internal predecessors, (19), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-11-02 20:41:06,418 INFO L276 IsEmpty]: Start isEmpty. Operand 332 states and 450 transitions. [2022-11-02 20:41:06,418 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-11-02 20:41:06,419 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:41:06,419 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] [2022-11-02 20:41:06,419 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2022-11-02 20:41:06,419 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr27REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 54 more)] === [2022-11-02 20:41:06,420 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:41:06,420 INFO L85 PathProgramCache]: Analyzing trace with hash 1953708264, now seen corresponding path program 1 times [2022-11-02 20:41:06,420 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:41:06,420 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1256707163] [2022-11-02 20:41:06,421 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:41:06,421 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:41:06,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:41:06,484 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-11-02 20:41:06,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:41:06,489 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:41:06,489 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:41:06,490 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1256707163] [2022-11-02 20:41:06,490 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1256707163] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:41:06,490 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:41:06,490 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-02 20:41:06,491 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [934803505] [2022-11-02 20:41:06,491 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:41:06,491 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-02 20:41:06,491 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:41:06,492 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-02 20:41:06,492 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-02 20:41:06,492 INFO L87 Difference]: Start difference. First operand 332 states and 450 transitions. Second operand has 4 states, 3 states have (on average 7.0) internal successors, (21), 4 states have internal predecessors, (21), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-11-02 20:41:06,782 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:41:06,782 INFO L93 Difference]: Finished difference Result 494 states and 639 transitions. [2022-11-02 20:41:06,785 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-02 20:41:06,786 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 7.0) internal successors, (21), 4 states have internal predecessors, (21), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 23 [2022-11-02 20:41:06,786 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:41:06,788 INFO L225 Difference]: With dead ends: 494 [2022-11-02 20:41:06,788 INFO L226 Difference]: Without dead ends: 494 [2022-11-02 20:41:06,789 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:41:06,789 INFO L413 NwaCegarLoop]: 165 mSDtfsCounter, 227 mSDsluCounter, 187 mSDsCounter, 0 mSdLazyCounter, 193 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 227 SdHoareTripleChecker+Valid, 352 SdHoareTripleChecker+Invalid, 201 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 193 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-02 20:41:06,790 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [227 Valid, 352 Invalid, 201 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 193 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-11-02 20:41:06,791 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 494 states. [2022-11-02 20:41:06,802 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 494 to 360. [2022-11-02 20:41:06,803 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 360 states, 289 states have (on average 1.6332179930795847) internal successors, (472), 341 states have internal predecessors, (472), 10 states have call successors, (10), 5 states have call predecessors, (10), 10 states have return successors, (20), 13 states have call predecessors, (20), 10 states have call successors, (20) [2022-11-02 20:41:06,805 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 360 states to 360 states and 502 transitions. [2022-11-02 20:41:06,805 INFO L78 Accepts]: Start accepts. Automaton has 360 states and 502 transitions. Word has length 23 [2022-11-02 20:41:06,805 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:41:06,805 INFO L495 AbstractCegarLoop]: Abstraction has 360 states and 502 transitions. [2022-11-02 20:41:06,806 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 7.0) internal successors, (21), 4 states have internal predecessors, (21), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-11-02 20:41:06,806 INFO L276 IsEmpty]: Start isEmpty. Operand 360 states and 502 transitions. [2022-11-02 20:41:06,806 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-11-02 20:41:06,807 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:41:06,807 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] [2022-11-02 20:41:06,807 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2022-11-02 20:41:06,807 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr28REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 54 more)] === [2022-11-02 20:41:06,808 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:41:06,808 INFO L85 PathProgramCache]: Analyzing trace with hash 1953708265, now seen corresponding path program 1 times [2022-11-02 20:41:06,808 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:41:06,808 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1091337080] [2022-11-02 20:41:06,809 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:41:06,809 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:41:06,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:41:07,087 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-11-02 20:41:07,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:41:07,093 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:41:07,093 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:41:07,093 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1091337080] [2022-11-02 20:41:07,094 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1091337080] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:41:07,094 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:41:07,094 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-02 20:41:07,094 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [564835707] [2022-11-02 20:41:07,094 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:41:07,095 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-02 20:41:07,095 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:41:07,095 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-02 20:41:07,096 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-11-02 20:41:07,096 INFO L87 Difference]: Start difference. First operand 360 states and 502 transitions. Second operand has 6 states, 5 states have (on average 4.2) internal successors, (21), 6 states have internal predecessors, (21), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-11-02 20:41:07,458 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:41:07,458 INFO L93 Difference]: Finished difference Result 419 states and 533 transitions. [2022-11-02 20:41:07,459 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-02 20:41:07,459 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 4.2) internal successors, (21), 6 states have internal predecessors, (21), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 23 [2022-11-02 20:41:07,459 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:41:07,461 INFO L225 Difference]: With dead ends: 419 [2022-11-02 20:41:07,461 INFO L226 Difference]: Without dead ends: 419 [2022-11-02 20:41:07,461 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2022-11-02 20:41:07,462 INFO L413 NwaCegarLoop]: 150 mSDtfsCounter, 378 mSDsluCounter, 299 mSDsCounter, 0 mSdLazyCounter, 218 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 378 SdHoareTripleChecker+Valid, 449 SdHoareTripleChecker+Invalid, 226 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 218 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-02 20:41:07,462 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [378 Valid, 449 Invalid, 226 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 218 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-11-02 20:41:07,463 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 419 states. [2022-11-02 20:41:07,475 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 419 to 360. [2022-11-02 20:41:07,476 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 360 states, 289 states have (on average 1.602076124567474) internal successors, (463), 341 states have internal predecessors, (463), 10 states have call successors, (10), 5 states have call predecessors, (10), 10 states have return successors, (20), 13 states have call predecessors, (20), 10 states have call successors, (20) [2022-11-02 20:41:07,478 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 360 states to 360 states and 493 transitions. [2022-11-02 20:41:07,478 INFO L78 Accepts]: Start accepts. Automaton has 360 states and 493 transitions. Word has length 23 [2022-11-02 20:41:07,478 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:41:07,478 INFO L495 AbstractCegarLoop]: Abstraction has 360 states and 493 transitions. [2022-11-02 20:41:07,479 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 4.2) internal successors, (21), 6 states have internal predecessors, (21), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-11-02 20:41:07,479 INFO L276 IsEmpty]: Start isEmpty. Operand 360 states and 493 transitions. [2022-11-02 20:41:07,481 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-11-02 20:41:07,481 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:41:07,481 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:41:07,481 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2022-11-02 20:41:07,483 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 54 more)] === [2022-11-02 20:41:07,483 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:41:07,484 INFO L85 PathProgramCache]: Analyzing trace with hash -1811064258, now seen corresponding path program 1 times [2022-11-02 20:41:07,484 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:41:07,484 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [293060599] [2022-11-02 20:41:07,484 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:41:07,484 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:41:07,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:41:07,937 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-02 20:41:07,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:41:07,943 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:41:07,943 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:41:07,944 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [293060599] [2022-11-02 20:41:07,944 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [293060599] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:41:07,944 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:41:07,944 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-11-02 20:41:07,945 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1974021684] [2022-11-02 20:41:07,945 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:41:07,945 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-11-02 20:41:07,946 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:41:07,946 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-11-02 20:41:07,946 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2022-11-02 20:41:07,947 INFO L87 Difference]: Start difference. First operand 360 states and 493 transitions. Second operand has 8 states, 8 states have (on average 2.75) internal successors, (22), 8 states have internal predecessors, (22), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-11-02 20:41:08,513 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:41:08,514 INFO L93 Difference]: Finished difference Result 799 states and 1037 transitions. [2022-11-02 20:41:08,514 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-11-02 20:41:08,514 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 2.75) internal successors, (22), 8 states have internal predecessors, (22), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 24 [2022-11-02 20:41:08,514 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:41:08,518 INFO L225 Difference]: With dead ends: 799 [2022-11-02 20:41:08,518 INFO L226 Difference]: Without dead ends: 799 [2022-11-02 20:41:08,518 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=70, Invalid=140, Unknown=0, NotChecked=0, Total=210 [2022-11-02 20:41:08,519 INFO L413 NwaCegarLoop]: 223 mSDtfsCounter, 647 mSDsluCounter, 964 mSDsCounter, 0 mSdLazyCounter, 207 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 651 SdHoareTripleChecker+Valid, 1187 SdHoareTripleChecker+Invalid, 236 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 207 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-02 20:41:08,520 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [651 Valid, 1187 Invalid, 236 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 207 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-11-02 20:41:08,521 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 799 states. [2022-11-02 20:41:08,534 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 799 to 392. [2022-11-02 20:41:08,535 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 392 states, 321 states have (on average 1.5545171339563864) internal successors, (499), 371 states have internal predecessors, (499), 10 states have call successors, (10), 5 states have call predecessors, (10), 10 states have return successors, (20), 15 states have call predecessors, (20), 10 states have call successors, (20) [2022-11-02 20:41:08,537 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 392 states to 392 states and 529 transitions. [2022-11-02 20:41:08,537 INFO L78 Accepts]: Start accepts. Automaton has 392 states and 529 transitions. Word has length 24 [2022-11-02 20:41:08,537 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:41:08,537 INFO L495 AbstractCegarLoop]: Abstraction has 392 states and 529 transitions. [2022-11-02 20:41:08,538 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 2.75) internal successors, (22), 8 states have internal predecessors, (22), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-11-02 20:41:08,538 INFO L276 IsEmpty]: Start isEmpty. Operand 392 states and 529 transitions. [2022-11-02 20:41:08,538 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-11-02 20:41:08,538 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:41:08,539 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] [2022-11-02 20:41:08,539 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2022-11-02 20:41:08,539 INFO L420 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 54 more)] === [2022-11-02 20:41:08,540 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:41:08,540 INFO L85 PathProgramCache]: Analyzing trace with hash -1927577074, now seen corresponding path program 1 times [2022-11-02 20:41:08,540 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:41:08,540 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1036617826] [2022-11-02 20:41:08,540 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:41:08,541 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:41:08,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:41:08,867 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-02 20:41:08,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:41:08,892 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:41:08,893 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:41:08,893 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1036617826] [2022-11-02 20:41:08,893 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1036617826] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:41:08,893 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:41:08,894 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-11-02 20:41:08,894 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1630674598] [2022-11-02 20:41:08,894 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:41:08,894 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-11-02 20:41:08,895 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:41:08,895 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-11-02 20:41:08,895 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2022-11-02 20:41:08,895 INFO L87 Difference]: Start difference. First operand 392 states and 529 transitions. Second operand has 8 states, 8 states have (on average 2.875) internal successors, (23), 7 states have internal predecessors, (23), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-11-02 20:41:09,325 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:41:09,325 INFO L93 Difference]: Finished difference Result 632 states and 811 transitions. [2022-11-02 20:41:09,326 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-11-02 20:41:09,326 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 2.875) internal successors, (23), 7 states have internal predecessors, (23), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 25 [2022-11-02 20:41:09,326 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:41:09,329 INFO L225 Difference]: With dead ends: 632 [2022-11-02 20:41:09,329 INFO L226 Difference]: Without dead ends: 632 [2022-11-02 20:41:09,330 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=44, Invalid=112, Unknown=0, NotChecked=0, Total=156 [2022-11-02 20:41:09,330 INFO L413 NwaCegarLoop]: 246 mSDtfsCounter, 241 mSDsluCounter, 1081 mSDsCounter, 0 mSdLazyCounter, 226 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 243 SdHoareTripleChecker+Valid, 1327 SdHoareTripleChecker+Invalid, 237 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 226 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-02 20:41:09,330 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [243 Valid, 1327 Invalid, 237 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 226 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-11-02 20:41:09,332 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 632 states. [2022-11-02 20:41:09,346 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 632 to 394. [2022-11-02 20:41:09,353 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 394 states, 323 states have (on average 1.5510835913312693) internal successors, (501), 373 states have internal predecessors, (501), 10 states have call successors, (10), 5 states have call predecessors, (10), 10 states have return successors, (20), 15 states have call predecessors, (20), 10 states have call successors, (20) [2022-11-02 20:41:09,355 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 394 states to 394 states and 531 transitions. [2022-11-02 20:41:09,356 INFO L78 Accepts]: Start accepts. Automaton has 394 states and 531 transitions. Word has length 25 [2022-11-02 20:41:09,356 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:41:09,356 INFO L495 AbstractCegarLoop]: Abstraction has 394 states and 531 transitions. [2022-11-02 20:41:09,356 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 2.875) internal successors, (23), 7 states have internal predecessors, (23), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-11-02 20:41:09,357 INFO L276 IsEmpty]: Start isEmpty. Operand 394 states and 531 transitions. [2022-11-02 20:41:09,357 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-11-02 20:41:09,357 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:41:09,357 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:41:09,358 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2022-11-02 20:41:09,358 INFO L420 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 54 more)] === [2022-11-02 20:41:09,358 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:41:09,359 INFO L85 PathProgramCache]: Analyzing trace with hash -970840895, now seen corresponding path program 1 times [2022-11-02 20:41:09,359 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:41:09,359 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1814510031] [2022-11-02 20:41:09,359 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:41:09,359 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:41:09,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:41:09,610 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-02 20:41:09,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:41:09,615 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:41:09,616 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:41:09,616 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1814510031] [2022-11-02 20:41:09,616 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1814510031] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:41:09,616 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:41:09,616 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-02 20:41:09,617 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1026590113] [2022-11-02 20:41:09,617 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:41:09,617 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-02 20:41:09,617 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:41:09,618 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-02 20:41:09,618 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-11-02 20:41:09,618 INFO L87 Difference]: Start difference. First operand 394 states and 531 transitions. Second operand has 6 states, 5 states have (on average 4.8) internal successors, (24), 6 states have internal predecessors, (24), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-11-02 20:41:10,091 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:41:10,091 INFO L93 Difference]: Finished difference Result 515 states and 640 transitions. [2022-11-02 20:41:10,092 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-02 20:41:10,092 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 4.8) internal successors, (24), 6 states have internal predecessors, (24), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 26 [2022-11-02 20:41:10,092 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:41:10,094 INFO L225 Difference]: With dead ends: 515 [2022-11-02 20:41:10,094 INFO L226 Difference]: Without dead ends: 515 [2022-11-02 20:41:10,095 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=29, Invalid=43, Unknown=0, NotChecked=0, Total=72 [2022-11-02 20:41:10,095 INFO L413 NwaCegarLoop]: 151 mSDtfsCounter, 506 mSDsluCounter, 264 mSDsCounter, 0 mSdLazyCounter, 240 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 506 SdHoareTripleChecker+Valid, 415 SdHoareTripleChecker+Invalid, 265 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 240 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-11-02 20:41:10,095 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [506 Valid, 415 Invalid, 265 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 240 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-11-02 20:41:10,096 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 515 states. [2022-11-02 20:41:10,109 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 515 to 405. [2022-11-02 20:41:10,110 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 405 states, 339 states have (on average 1.5309734513274336) internal successors, (519), 383 states have internal predecessors, (519), 11 states have call successors, (11), 5 states have call predecessors, (11), 10 states have return successors, (22), 16 states have call predecessors, (22), 11 states have call successors, (22) [2022-11-02 20:41:10,112 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 405 states to 405 states and 552 transitions. [2022-11-02 20:41:10,112 INFO L78 Accepts]: Start accepts. Automaton has 405 states and 552 transitions. Word has length 26 [2022-11-02 20:41:10,113 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:41:10,113 INFO L495 AbstractCegarLoop]: Abstraction has 405 states and 552 transitions. [2022-11-02 20:41:10,114 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 4.8) internal successors, (24), 6 states have internal predecessors, (24), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-11-02 20:41:10,114 INFO L276 IsEmpty]: Start isEmpty. Operand 405 states and 552 transitions. [2022-11-02 20:41:10,114 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2022-11-02 20:41:10,114 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:41:10,115 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:41:10,115 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2022-11-02 20:41:10,115 INFO L420 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr33ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 54 more)] === [2022-11-02 20:41:10,115 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:41:10,115 INFO L85 PathProgramCache]: Analyzing trace with hash 622100015, now seen corresponding path program 1 times [2022-11-02 20:41:10,116 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:41:10,116 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [785084269] [2022-11-02 20:41:10,116 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:41:10,116 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:41:10,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:41:10,280 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-11-02 20:41:10,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:41:10,285 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:41:10,286 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:41:10,286 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [785084269] [2022-11-02 20:41:10,286 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [785084269] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:41:10,286 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:41:10,287 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-02 20:41:10,287 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [387897584] [2022-11-02 20:41:10,287 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:41:10,287 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-02 20:41:10,288 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:41:10,288 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-02 20:41:10,288 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-11-02 20:41:10,288 INFO L87 Difference]: Start difference. First operand 405 states and 552 transitions. Second operand has 5 states, 4 states have (on average 6.25) internal successors, (25), 5 states have internal predecessors, (25), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-11-02 20:41:10,499 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:41:10,499 INFO L93 Difference]: Finished difference Result 461 states and 604 transitions. [2022-11-02 20:41:10,500 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-02 20:41:10,500 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 6.25) internal successors, (25), 5 states have internal predecessors, (25), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 27 [2022-11-02 20:41:10,500 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:41:10,502 INFO L225 Difference]: With dead ends: 461 [2022-11-02 20:41:10,502 INFO L226 Difference]: Without dead ends: 461 [2022-11-02 20:41:10,502 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:41:10,503 INFO L413 NwaCegarLoop]: 151 mSDtfsCounter, 151 mSDsluCounter, 377 mSDsCounter, 0 mSdLazyCounter, 132 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 151 SdHoareTripleChecker+Valid, 528 SdHoareTripleChecker+Invalid, 139 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 132 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-02 20:41:10,503 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [151 Valid, 528 Invalid, 139 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 132 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-02 20:41:10,504 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 461 states. [2022-11-02 20:41:10,520 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 461 to 405. [2022-11-02 20:41:10,521 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 405 states, 339 states have (on average 1.528023598820059) internal successors, (518), 383 states have internal predecessors, (518), 11 states have call successors, (11), 5 states have call predecessors, (11), 10 states have return successors, (22), 16 states have call predecessors, (22), 11 states have call successors, (22) [2022-11-02 20:41:10,524 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 405 states to 405 states and 551 transitions. [2022-11-02 20:41:10,524 INFO L78 Accepts]: Start accepts. Automaton has 405 states and 551 transitions. Word has length 27 [2022-11-02 20:41:10,526 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:41:10,526 INFO L495 AbstractCegarLoop]: Abstraction has 405 states and 551 transitions. [2022-11-02 20:41:10,526 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 6.25) internal successors, (25), 5 states have internal predecessors, (25), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-11-02 20:41:10,526 INFO L276 IsEmpty]: Start isEmpty. Operand 405 states and 551 transitions. [2022-11-02 20:41:10,527 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2022-11-02 20:41:10,527 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:41:10,527 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:41:10,527 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2022-11-02 20:41:10,528 INFO L420 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 54 more)] === [2022-11-02 20:41:10,528 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:41:10,528 INFO L85 PathProgramCache]: Analyzing trace with hash -31296654, now seen corresponding path program 1 times [2022-11-02 20:41:10,528 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:41:10,529 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [467801341] [2022-11-02 20:41:10,529 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:41:10,529 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:41:10,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:41:10,689 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-02 20:41:10,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:41:10,705 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:41:10,706 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:41:10,706 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [467801341] [2022-11-02 20:41:10,706 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [467801341] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:41:10,706 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:41:10,707 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-11-02 20:41:10,707 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [651002534] [2022-11-02 20:41:10,707 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:41:10,709 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-02 20:41:10,710 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:41:10,710 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-02 20:41:10,710 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-11-02 20:41:10,711 INFO L87 Difference]: Start difference. First operand 405 states and 551 transitions. Second operand has 7 states, 6 states have (on average 4.166666666666667) internal successors, (25), 6 states have internal predecessors, (25), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-11-02 20:41:10,956 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:41:10,956 INFO L93 Difference]: Finished difference Result 442 states and 562 transitions. [2022-11-02 20:41:10,956 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-11-02 20:41:10,957 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 4.166666666666667) internal successors, (25), 6 states have internal predecessors, (25), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 27 [2022-11-02 20:41:10,957 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:41:10,959 INFO L225 Difference]: With dead ends: 442 [2022-11-02 20:41:10,959 INFO L226 Difference]: Without dead ends: 442 [2022-11-02 20:41:10,959 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=34, Invalid=76, Unknown=0, NotChecked=0, Total=110 [2022-11-02 20:41:10,960 INFO L413 NwaCegarLoop]: 186 mSDtfsCounter, 424 mSDsluCounter, 538 mSDsCounter, 0 mSdLazyCounter, 151 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 426 SdHoareTripleChecker+Valid, 724 SdHoareTripleChecker+Invalid, 162 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 151 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-02 20:41:10,960 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [426 Valid, 724 Invalid, 162 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 151 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-02 20:41:10,961 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 442 states. [2022-11-02 20:41:10,971 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 442 to 403. [2022-11-02 20:41:10,972 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 403 states, 339 states have (on average 1.5162241887905605) internal successors, (514), 381 states have internal predecessors, (514), 11 states have call successors, (11), 5 states have call predecessors, (11), 10 states have return successors, (22), 16 states have call predecessors, (22), 11 states have call successors, (22) [2022-11-02 20:41:10,974 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 403 states to 403 states and 547 transitions. [2022-11-02 20:41:10,974 INFO L78 Accepts]: Start accepts. Automaton has 403 states and 547 transitions. Word has length 27 [2022-11-02 20:41:10,975 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:41:10,975 INFO L495 AbstractCegarLoop]: Abstraction has 403 states and 547 transitions. [2022-11-02 20:41:10,975 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 4.166666666666667) internal successors, (25), 6 states have internal predecessors, (25), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-11-02 20:41:10,975 INFO L276 IsEmpty]: Start isEmpty. Operand 403 states and 547 transitions. [2022-11-02 20:41:10,976 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2022-11-02 20:41:10,976 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:41:10,976 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, 1] [2022-11-02 20:41:10,976 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2022-11-02 20:41:10,976 INFO L420 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr34ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 54 more)] === [2022-11-02 20:41:10,977 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:41:10,977 INFO L85 PathProgramCache]: Analyzing trace with hash 2105231472, now seen corresponding path program 1 times [2022-11-02 20:41:10,977 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:41:10,977 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1771266270] [2022-11-02 20:41:10,978 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:41:10,978 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:41:10,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:41:11,164 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-11-02 20:41:11,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:41:11,169 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:41:11,170 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:41:11,170 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1771266270] [2022-11-02 20:41:11,170 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1771266270] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:41:11,170 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:41:11,171 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-02 20:41:11,171 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1172524225] [2022-11-02 20:41:11,171 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:41:11,171 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-02 20:41:11,171 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:41:11,172 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-02 20:41:11,172 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-11-02 20:41:11,173 INFO L87 Difference]: Start difference. First operand 403 states and 547 transitions. Second operand has 5 states, 4 states have (on average 6.5) internal successors, (26), 5 states have internal predecessors, (26), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-11-02 20:41:11,390 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:41:11,391 INFO L93 Difference]: Finished difference Result 528 states and 692 transitions. [2022-11-02 20:41:11,391 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-02 20:41:11,391 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), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 28 [2022-11-02 20:41:11,391 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:41:11,393 INFO L225 Difference]: With dead ends: 528 [2022-11-02 20:41:11,393 INFO L226 Difference]: Without dead ends: 528 [2022-11-02 20:41:11,394 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:41:11,394 INFO L413 NwaCegarLoop]: 153 mSDtfsCounter, 178 mSDsluCounter, 348 mSDsCounter, 0 mSdLazyCounter, 177 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 178 SdHoareTripleChecker+Valid, 501 SdHoareTripleChecker+Invalid, 186 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 177 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-02 20:41:11,394 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [178 Valid, 501 Invalid, 186 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 177 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-02 20:41:11,395 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 528 states. [2022-11-02 20:41:11,403 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 528 to 441. [2022-11-02 20:41:11,404 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 441 states, 373 states have (on average 1.5120643431635388) internal successors, (564), 417 states have internal predecessors, (564), 13 states have call successors, (13), 6 states have call predecessors, (13), 12 states have return successors, (26), 17 states have call predecessors, (26), 13 states have call successors, (26) [2022-11-02 20:41:11,406 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 441 states to 441 states and 603 transitions. [2022-11-02 20:41:11,406 INFO L78 Accepts]: Start accepts. Automaton has 441 states and 603 transitions. Word has length 28 [2022-11-02 20:41:11,406 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:41:11,406 INFO L495 AbstractCegarLoop]: Abstraction has 441 states and 603 transitions. [2022-11-02 20:41:11,406 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), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-11-02 20:41:11,406 INFO L276 IsEmpty]: Start isEmpty. Operand 441 states and 603 transitions. [2022-11-02 20:41:11,407 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2022-11-02 20:41:11,407 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:41:11,407 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, 1, 1] [2022-11-02 20:41:11,407 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2022-11-02 20:41:11,408 INFO L420 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr17REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 54 more)] === [2022-11-02 20:41:11,408 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:41:11,408 INFO L85 PathProgramCache]: Analyzing trace with hash -11312492, now seen corresponding path program 1 times [2022-11-02 20:41:11,408 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:41:11,409 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2036803838] [2022-11-02 20:41:11,409 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:41:11,409 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:41:11,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:41:11,623 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-02 20:41:11,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:41:11,629 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:41:11,629 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:41:11,629 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2036803838] [2022-11-02 20:41:11,629 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2036803838] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:41:11,629 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:41:11,630 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-11-02 20:41:11,630 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1534850505] [2022-11-02 20:41:11,630 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:41:11,630 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-02 20:41:11,630 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:41:11,631 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-02 20:41:11,631 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2022-11-02 20:41:11,631 INFO L87 Difference]: Start difference. First operand 441 states and 603 transitions. Second operand has 7 states, 6 states have (on average 4.5) internal successors, (27), 7 states have internal predecessors, (27), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-11-02 20:41:12,045 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:41:12,045 INFO L93 Difference]: Finished difference Result 552 states and 688 transitions. [2022-11-02 20:41:12,046 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-02 20:41:12,046 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 4.5) internal successors, (27), 7 states have internal predecessors, (27), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 29 [2022-11-02 20:41:12,046 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:41:12,049 INFO L225 Difference]: With dead ends: 552 [2022-11-02 20:41:12,049 INFO L226 Difference]: Without dead ends: 552 [2022-11-02 20:41:12,049 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=44, Invalid=66, Unknown=0, NotChecked=0, Total=110 [2022-11-02 20:41:12,050 INFO L413 NwaCegarLoop]: 149 mSDtfsCounter, 719 mSDsluCounter, 214 mSDsCounter, 0 mSdLazyCounter, 198 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 719 SdHoareTripleChecker+Valid, 363 SdHoareTripleChecker+Invalid, 227 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 198 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-02 20:41:12,050 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [719 Valid, 363 Invalid, 227 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 198 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-11-02 20:41:12,051 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 552 states. [2022-11-02 20:41:12,062 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 552 to 444. [2022-11-02 20:41:12,063 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 444 states, 377 states have (on average 1.5013262599469497) internal successors, (566), 418 states have internal predecessors, (566), 14 states have call successors, (14), 6 states have call predecessors, (14), 12 states have return successors, (28), 19 states have call predecessors, (28), 14 states have call successors, (28) [2022-11-02 20:41:12,065 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 444 states to 444 states and 608 transitions. [2022-11-02 20:41:12,065 INFO L78 Accepts]: Start accepts. Automaton has 444 states and 608 transitions. Word has length 29 [2022-11-02 20:41:12,066 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:41:12,066 INFO L495 AbstractCegarLoop]: Abstraction has 444 states and 608 transitions. [2022-11-02 20:41:12,066 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 4.5) internal successors, (27), 7 states have internal predecessors, (27), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-11-02 20:41:12,066 INFO L276 IsEmpty]: Start isEmpty. Operand 444 states and 608 transitions. [2022-11-02 20:41:12,067 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2022-11-02 20:41:12,067 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:41:12,067 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, 1, 1, 1] [2022-11-02 20:41:12,067 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2022-11-02 20:41:12,068 INFO L420 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr39REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 54 more)] === [2022-11-02 20:41:12,068 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:41:12,068 INFO L85 PathProgramCache]: Analyzing trace with hash 880183511, now seen corresponding path program 1 times [2022-11-02 20:41:12,069 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:41:12,069 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [255904918] [2022-11-02 20:41:12,069 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:41:12,069 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:41:12,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:41:12,172 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-11-02 20:41:12,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:41:12,189 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:41:12,189 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:41:12,190 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [255904918] [2022-11-02 20:41:12,190 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [255904918] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:41:12,190 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:41:12,190 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-02 20:41:12,190 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [456133659] [2022-11-02 20:41:12,191 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:41:12,191 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-02 20:41:12,191 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:41:12,192 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-02 20:41:12,192 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-11-02 20:41:12,192 INFO L87 Difference]: Start difference. First operand 444 states and 608 transitions. Second operand has 5 states, 5 states have (on average 5.6) internal successors, (28), 4 states have internal predecessors, (28), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-11-02 20:41:12,253 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:41:12,253 INFO L93 Difference]: Finished difference Result 919 states and 1272 transitions. [2022-11-02 20:41:12,253 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-02 20:41:12,254 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 5.6) internal successors, (28), 4 states have internal predecessors, (28), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 30 [2022-11-02 20:41:12,254 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:41:12,258 INFO L225 Difference]: With dead ends: 919 [2022-11-02 20:41:12,258 INFO L226 Difference]: Without dead ends: 919 [2022-11-02 20:41:12,258 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 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:41:12,259 INFO L413 NwaCegarLoop]: 201 mSDtfsCounter, 212 mSDsluCounter, 533 mSDsCounter, 0 mSdLazyCounter, 39 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 216 SdHoareTripleChecker+Valid, 734 SdHoareTripleChecker+Invalid, 40 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 39 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-02 20:41:12,259 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [216 Valid, 734 Invalid, 40 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 39 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-02 20:41:12,261 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 919 states. [2022-11-02 20:41:12,276 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 919 to 549. [2022-11-02 20:41:12,278 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 549 states, 482 states have (on average 1.5145228215767634) internal successors, (730), 516 states have internal predecessors, (730), 14 states have call successors, (14), 6 states have call predecessors, (14), 12 states have return successors, (28), 26 states have call predecessors, (28), 14 states have call successors, (28) [2022-11-02 20:41:12,280 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 549 states to 549 states and 772 transitions. [2022-11-02 20:41:12,280 INFO L78 Accepts]: Start accepts. Automaton has 549 states and 772 transitions. Word has length 30 [2022-11-02 20:41:12,280 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:41:12,281 INFO L495 AbstractCegarLoop]: Abstraction has 549 states and 772 transitions. [2022-11-02 20:41:12,281 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.6) internal successors, (28), 4 states have internal predecessors, (28), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-11-02 20:41:12,281 INFO L276 IsEmpty]: Start isEmpty. Operand 549 states and 772 transitions. [2022-11-02 20:41:12,281 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2022-11-02 20:41:12,282 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:41:12,282 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, 1, 1, 1] [2022-11-02 20:41:12,282 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2022-11-02 20:41:12,282 INFO L420 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr39REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 54 more)] === [2022-11-02 20:41:12,283 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:41:12,283 INFO L85 PathProgramCache]: Analyzing trace with hash 880185433, now seen corresponding path program 1 times [2022-11-02 20:41:12,283 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:41:12,283 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [50316990] [2022-11-02 20:41:12,283 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:41:12,284 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:41:12,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:41:12,417 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-11-02 20:41:12,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:41:12,437 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:41:12,438 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:41:12,438 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [50316990] [2022-11-02 20:41:12,438 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [50316990] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:41:12,438 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:41:12,438 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-11-02 20:41:12,439 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2038807291] [2022-11-02 20:41:12,439 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:41:12,439 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-02 20:41:12,439 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:41:12,440 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-02 20:41:12,440 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-11-02 20:41:12,440 INFO L87 Difference]: Start difference. First operand 549 states and 772 transitions. Second operand has 7 states, 6 states have (on average 4.666666666666667) internal successors, (28), 6 states have internal predecessors, (28), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-11-02 20:41:12,840 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:41:12,840 INFO L93 Difference]: Finished difference Result 1117 states and 1535 transitions. [2022-11-02 20:41:12,841 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-11-02 20:41:12,841 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 4.666666666666667) internal successors, (28), 6 states have internal predecessors, (28), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 30 [2022-11-02 20:41:12,841 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:41:12,846 INFO L225 Difference]: With dead ends: 1117 [2022-11-02 20:41:12,847 INFO L226 Difference]: Without dead ends: 1117 [2022-11-02 20:41:12,847 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=42, Invalid=90, Unknown=0, NotChecked=0, Total=132 [2022-11-02 20:41:12,848 INFO L413 NwaCegarLoop]: 228 mSDtfsCounter, 458 mSDsluCounter, 974 mSDsCounter, 0 mSdLazyCounter, 198 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 462 SdHoareTripleChecker+Valid, 1202 SdHoareTripleChecker+Invalid, 224 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 198 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-02 20:41:12,848 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [462 Valid, 1202 Invalid, 224 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 198 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-11-02 20:41:12,850 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1117 states. [2022-11-02 20:41:12,869 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1117 to 587. [2022-11-02 20:41:12,870 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 587 states, 520 states have (on average 1.5096153846153846) internal successors, (785), 554 states have internal predecessors, (785), 14 states have call successors, (14), 6 states have call predecessors, (14), 12 states have return successors, (28), 26 states have call predecessors, (28), 14 states have call successors, (28) [2022-11-02 20:41:12,873 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 587 states to 587 states and 827 transitions. [2022-11-02 20:41:12,873 INFO L78 Accepts]: Start accepts. Automaton has 587 states and 827 transitions. Word has length 30 [2022-11-02 20:41:12,873 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:41:12,874 INFO L495 AbstractCegarLoop]: Abstraction has 587 states and 827 transitions. [2022-11-02 20:41:12,874 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 4.666666666666667) internal successors, (28), 6 states have internal predecessors, (28), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-11-02 20:41:12,874 INFO L276 IsEmpty]: Start isEmpty. Operand 587 states and 827 transitions. [2022-11-02 20:41:12,875 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2022-11-02 20:41:12,875 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:41:12,875 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, 1, 1, 1] [2022-11-02 20:41:12,875 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2022-11-02 20:41:12,875 INFO L420 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr36ASSERT_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 54 more)] === [2022-11-02 20:41:12,876 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:41:12,876 INFO L85 PathProgramCache]: Analyzing trace with hash 197854354, now seen corresponding path program 1 times [2022-11-02 20:41:12,876 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:41:12,877 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [423024996] [2022-11-02 20:41:12,877 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:41:12,877 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:41:12,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:41:13,125 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-11-02 20:41:13,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:41:13,131 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:41:13,132 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:41:13,132 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [423024996] [2022-11-02 20:41:13,132 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [423024996] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:41:13,132 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:41:13,133 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-02 20:41:13,133 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [101574888] [2022-11-02 20:41:13,133 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:41:13,133 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-02 20:41:13,133 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:41:13,134 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-02 20:41:13,134 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-11-02 20:41:13,134 INFO L87 Difference]: Start difference. First operand 587 states and 827 transitions. Second operand has 6 states, 5 states have (on average 5.6) internal successors, (28), 6 states have internal predecessors, (28), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-11-02 20:41:13,826 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:41:13,827 INFO L93 Difference]: Finished difference Result 1044 states and 1446 transitions. [2022-11-02 20:41:13,827 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-11-02 20:41:13,827 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 5.6) internal successors, (28), 6 states have internal predecessors, (28), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 30 [2022-11-02 20:41:13,828 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:41:13,832 INFO L225 Difference]: With dead ends: 1044 [2022-11-02 20:41:13,832 INFO L226 Difference]: Without dead ends: 1044 [2022-11-02 20:41:13,832 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=34, Invalid=56, Unknown=0, NotChecked=0, Total=90 [2022-11-02 20:41:13,833 INFO L413 NwaCegarLoop]: 206 mSDtfsCounter, 375 mSDsluCounter, 594 mSDsCounter, 0 mSdLazyCounter, 499 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 377 SdHoareTripleChecker+Valid, 800 SdHoareTripleChecker+Invalid, 527 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 499 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-11-02 20:41:13,833 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [377 Valid, 800 Invalid, 527 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 499 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-11-02 20:41:13,835 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1044 states. [2022-11-02 20:41:13,854 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1044 to 630. [2022-11-02 20:41:13,855 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 630 states, 559 states have (on average 1.4901610017889089) internal successors, (833), 594 states have internal predecessors, (833), 16 states have call successors, (16), 7 states have call predecessors, (16), 14 states have return successors, (32), 28 states have call predecessors, (32), 16 states have call successors, (32) [2022-11-02 20:41:13,858 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 630 states to 630 states and 881 transitions. [2022-11-02 20:41:13,858 INFO L78 Accepts]: Start accepts. Automaton has 630 states and 881 transitions. Word has length 30 [2022-11-02 20:41:13,859 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:41:13,859 INFO L495 AbstractCegarLoop]: Abstraction has 630 states and 881 transitions. [2022-11-02 20:41:13,859 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 5.6) internal successors, (28), 6 states have internal predecessors, (28), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-11-02 20:41:13,859 INFO L276 IsEmpty]: Start isEmpty. Operand 630 states and 881 transitions. [2022-11-02 20:41:13,860 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2022-11-02 20:41:13,860 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:41:13,860 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, 1, 1, 1] [2022-11-02 20:41:13,860 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2022-11-02 20:41:13,861 INFO L420 AbstractCegarLoop]: === Iteration 34 === Targeting ULTIMATE.startErr39REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 54 more)] === [2022-11-02 20:41:13,861 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:41:13,861 INFO L85 PathProgramCache]: Analyzing trace with hash 471361208, now seen corresponding path program 1 times [2022-11-02 20:41:13,862 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:41:13,862 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1697363712] [2022-11-02 20:41:13,862 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:41:13,862 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:41:13,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:41:13,941 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-11-02 20:41:13,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:41:13,954 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:41:13,954 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:41:13,954 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1697363712] [2022-11-02 20:41:13,954 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1697363712] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:41:13,955 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:41:13,955 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-02 20:41:13,955 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1166700447] [2022-11-02 20:41:13,955 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:41:13,956 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-02 20:41:13,956 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:41:13,956 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-02 20:41:13,957 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-11-02 20:41:13,957 INFO L87 Difference]: Start difference. First operand 630 states and 881 transitions. Second operand has 5 states, 5 states have (on average 5.6) internal successors, (28), 4 states have internal predecessors, (28), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-11-02 20:41:14,018 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:41:14,019 INFO L93 Difference]: Finished difference Result 925 states and 1259 transitions. [2022-11-02 20:41:14,019 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-02 20:41:14,020 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 5.6) internal successors, (28), 4 states have internal predecessors, (28), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 30 [2022-11-02 20:41:14,020 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:41:14,024 INFO L225 Difference]: With dead ends: 925 [2022-11-02 20:41:14,024 INFO L226 Difference]: Without dead ends: 925 [2022-11-02 20:41:14,025 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 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:41:14,025 INFO L413 NwaCegarLoop]: 273 mSDtfsCounter, 191 mSDsluCounter, 609 mSDsCounter, 0 mSdLazyCounter, 34 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 193 SdHoareTripleChecker+Valid, 882 SdHoareTripleChecker+Invalid, 34 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 34 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-02 20:41:14,026 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [193 Valid, 882 Invalid, 34 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 34 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-02 20:41:14,027 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 925 states. [2022-11-02 20:41:14,043 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 925 to 622. [2022-11-02 20:41:14,045 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 622 states, 551 states have (on average 1.4900181488203266) internal successors, (821), 586 states have internal predecessors, (821), 16 states have call successors, (16), 7 states have call predecessors, (16), 14 states have return successors, (32), 28 states have call predecessors, (32), 16 states have call successors, (32) [2022-11-02 20:41:14,047 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 622 states to 622 states and 869 transitions. [2022-11-02 20:41:14,047 INFO L78 Accepts]: Start accepts. Automaton has 622 states and 869 transitions. Word has length 30 [2022-11-02 20:41:14,048 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:41:14,048 INFO L495 AbstractCegarLoop]: Abstraction has 622 states and 869 transitions. [2022-11-02 20:41:14,048 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.6) internal successors, (28), 4 states have internal predecessors, (28), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-11-02 20:41:14,048 INFO L276 IsEmpty]: Start isEmpty. Operand 622 states and 869 transitions. [2022-11-02 20:41:14,049 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2022-11-02 20:41:14,049 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:41:14,049 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, 1, 1, 1] [2022-11-02 20:41:14,049 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33 [2022-11-02 20:41:14,050 INFO L420 AbstractCegarLoop]: === Iteration 35 === Targeting ULTIMATE.startErr39REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 54 more)] === [2022-11-02 20:41:14,050 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:41:14,050 INFO L85 PathProgramCache]: Analyzing trace with hash 473206328, now seen corresponding path program 1 times [2022-11-02 20:41:14,051 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:41:14,051 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [974477054] [2022-11-02 20:41:14,051 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:41:14,051 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:41:14,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:41:14,190 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-11-02 20:41:14,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:41:14,214 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:41:14,214 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:41:14,214 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [974477054] [2022-11-02 20:41:14,215 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [974477054] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:41:14,215 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:41:14,215 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-11-02 20:41:14,215 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1351716187] [2022-11-02 20:41:14,215 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:41:14,216 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-02 20:41:14,216 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:41:14,216 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-02 20:41:14,217 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-11-02 20:41:14,217 INFO L87 Difference]: Start difference. First operand 622 states and 869 transitions. Second operand has 7 states, 6 states have (on average 4.666666666666667) internal successors, (28), 6 states have internal predecessors, (28), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-11-02 20:41:14,607 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:41:14,608 INFO L93 Difference]: Finished difference Result 1101 states and 1484 transitions. [2022-11-02 20:41:14,608 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-11-02 20:41:14,609 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 4.666666666666667) internal successors, (28), 6 states have internal predecessors, (28), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 30 [2022-11-02 20:41:14,609 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:41:14,614 INFO L225 Difference]: With dead ends: 1101 [2022-11-02 20:41:14,614 INFO L226 Difference]: Without dead ends: 1101 [2022-11-02 20:41:14,615 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=42, Invalid=90, Unknown=0, NotChecked=0, Total=132 [2022-11-02 20:41:14,615 INFO L413 NwaCegarLoop]: 299 mSDtfsCounter, 419 mSDsluCounter, 1078 mSDsCounter, 0 mSdLazyCounter, 198 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 421 SdHoareTripleChecker+Valid, 1377 SdHoareTripleChecker+Invalid, 213 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 198 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-02 20:41:14,616 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [421 Valid, 1377 Invalid, 213 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 198 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-11-02 20:41:14,617 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1101 states. [2022-11-02 20:41:14,635 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1101 to 589. [2022-11-02 20:41:14,636 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 589 states, 521 states have (on average 1.4510556621881) internal successors, (756), 553 states have internal predecessors, (756), 16 states have call successors, (16), 7 states have call predecessors, (16), 14 states have return successors, (32), 28 states have call predecessors, (32), 16 states have call successors, (32) [2022-11-02 20:41:14,638 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 589 states to 589 states and 804 transitions. [2022-11-02 20:41:14,638 INFO L78 Accepts]: Start accepts. Automaton has 589 states and 804 transitions. Word has length 30 [2022-11-02 20:41:14,639 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:41:14,639 INFO L495 AbstractCegarLoop]: Abstraction has 589 states and 804 transitions. [2022-11-02 20:41:14,639 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 4.666666666666667) internal successors, (28), 6 states have internal predecessors, (28), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-11-02 20:41:14,639 INFO L276 IsEmpty]: Start isEmpty. Operand 589 states and 804 transitions. [2022-11-02 20:41:14,640 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2022-11-02 20:41:14,640 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:41:14,640 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, 1, 1, 1, 1] [2022-11-02 20:41:14,640 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34 [2022-11-02 20:41:14,641 INFO L420 AbstractCegarLoop]: === Iteration 36 === Targeting ULTIMATE.startErr37ASSERT_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 54 more)] === [2022-11-02 20:41:14,641 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:41:14,642 INFO L85 PathProgramCache]: Analyzing trace with hash 1838517875, now seen corresponding path program 1 times [2022-11-02 20:41:14,642 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:41:14,642 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1690392964] [2022-11-02 20:41:14,642 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:41:14,642 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:41:14,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:41:14,944 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-11-02 20:41:14,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:41:14,948 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:41:14,948 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:41:14,949 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1690392964] [2022-11-02 20:41:14,949 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1690392964] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:41:14,949 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:41:14,949 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-11-02 20:41:14,949 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [724543881] [2022-11-02 20:41:14,950 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:41:14,950 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-02 20:41:14,950 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:41:14,950 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-02 20:41:14,951 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-11-02 20:41:14,951 INFO L87 Difference]: Start difference. First operand 589 states and 804 transitions. Second operand has 7 states, 6 states have (on average 4.833333333333333) internal successors, (29), 7 states have internal predecessors, (29), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-11-02 20:41:15,489 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:41:15,490 INFO L93 Difference]: Finished difference Result 771 states and 993 transitions. [2022-11-02 20:41:15,496 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-11-02 20:41:15,496 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 4.833333333333333) internal successors, (29), 7 states have internal predecessors, (29), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 31 [2022-11-02 20:41:15,497 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:41:15,501 INFO L225 Difference]: With dead ends: 771 [2022-11-02 20:41:15,501 INFO L226 Difference]: Without dead ends: 771 [2022-11-02 20:41:15,502 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=57, Invalid=99, Unknown=0, NotChecked=0, Total=156 [2022-11-02 20:41:15,503 INFO L413 NwaCegarLoop]: 173 mSDtfsCounter, 598 mSDsluCounter, 393 mSDsCounter, 0 mSdLazyCounter, 296 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 598 SdHoareTripleChecker+Valid, 566 SdHoareTripleChecker+Invalid, 311 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 296 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-11-02 20:41:15,503 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [598 Valid, 566 Invalid, 311 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 296 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-11-02 20:41:15,504 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 771 states. [2022-11-02 20:41:15,519 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 771 to 589. [2022-11-02 20:41:15,520 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 589 states, 521 states have (on average 1.4433781190019195) internal successors, (752), 553 states have internal predecessors, (752), 16 states have call successors, (16), 7 states have call predecessors, (16), 14 states have return successors, (32), 28 states have call predecessors, (32), 16 states have call successors, (32) [2022-11-02 20:41:15,522 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 589 states to 589 states and 800 transitions. [2022-11-02 20:41:15,522 INFO L78 Accepts]: Start accepts. Automaton has 589 states and 800 transitions. Word has length 31 [2022-11-02 20:41:15,523 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:41:15,523 INFO L495 AbstractCegarLoop]: Abstraction has 589 states and 800 transitions. [2022-11-02 20:41:15,523 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 4.833333333333333) internal successors, (29), 7 states have internal predecessors, (29), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-11-02 20:41:15,523 INFO L276 IsEmpty]: Start isEmpty. Operand 589 states and 800 transitions. [2022-11-02 20:41:15,524 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2022-11-02 20:41:15,524 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:41:15,524 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, 1, 1, 1, 1, 1] [2022-11-02 20:41:15,525 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35 [2022-11-02 20:41:15,525 INFO L420 AbstractCegarLoop]: === Iteration 37 === Targeting ULTIMATE.startErr40REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 54 more)] === [2022-11-02 20:41:15,525 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:41:15,526 INFO L85 PathProgramCache]: Analyzing trace with hash -250351879, now seen corresponding path program 1 times [2022-11-02 20:41:15,526 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:41:15,526 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [670109333] [2022-11-02 20:41:15,526 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:41:15,526 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:41:15,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:41:15,937 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-11-02 20:41:15,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:41:15,944 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:41:15,944 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:41:15,944 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [670109333] [2022-11-02 20:41:15,944 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [670109333] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:41:15,945 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:41:15,945 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-11-02 20:41:15,945 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1651053988] [2022-11-02 20:41:15,945 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:41:15,946 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-02 20:41:15,947 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:41:15,949 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-02 20:41:15,949 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-11-02 20:41:15,949 INFO L87 Difference]: Start difference. First operand 589 states and 800 transitions. Second operand has 6 states, 6 states have (on average 5.0) internal successors, (30), 6 states have internal predecessors, (30), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-11-02 20:41:16,258 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:41:16,258 INFO L93 Difference]: Finished difference Result 620 states and 832 transitions. [2022-11-02 20:41:16,259 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-02 20:41:16,259 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 5.0) internal successors, (30), 6 states have internal predecessors, (30), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 32 [2022-11-02 20:41:16,259 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:41:16,262 INFO L225 Difference]: With dead ends: 620 [2022-11-02 20:41:16,262 INFO L226 Difference]: Without dead ends: 620 [2022-11-02 20:41:16,262 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 4 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:41:16,263 INFO L413 NwaCegarLoop]: 156 mSDtfsCounter, 94 mSDsluCounter, 497 mSDsCounter, 0 mSdLazyCounter, 158 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 94 SdHoareTripleChecker+Valid, 653 SdHoareTripleChecker+Invalid, 162 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 158 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-02 20:41:16,263 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [94 Valid, 653 Invalid, 162 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 158 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-02 20:41:16,264 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 620 states. [2022-11-02 20:41:16,274 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 620 to 568. [2022-11-02 20:41:16,275 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 568 states, 500 states have (on average 1.45) internal successors, (725), 534 states have internal predecessors, (725), 16 states have call successors, (16), 7 states have call predecessors, (16), 14 states have return successors, (32), 26 states have call predecessors, (32), 16 states have call successors, (32) [2022-11-02 20:41:16,277 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 568 states to 568 states and 773 transitions. [2022-11-02 20:41:16,278 INFO L78 Accepts]: Start accepts. Automaton has 568 states and 773 transitions. Word has length 32 [2022-11-02 20:41:16,278 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:41:16,278 INFO L495 AbstractCegarLoop]: Abstraction has 568 states and 773 transitions. [2022-11-02 20:41:16,278 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 5.0) internal successors, (30), 6 states have internal predecessors, (30), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-11-02 20:41:16,279 INFO L276 IsEmpty]: Start isEmpty. Operand 568 states and 773 transitions. [2022-11-02 20:41:16,279 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2022-11-02 20:41:16,279 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:41:16,280 INFO L195 NwaCegarLoop]: trace histogram [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] [2022-11-02 20:41:16,280 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable36 [2022-11-02 20:41:16,280 INFO L420 AbstractCegarLoop]: === Iteration 38 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 54 more)] === [2022-11-02 20:41:16,281 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:41:16,281 INFO L85 PathProgramCache]: Analyzing trace with hash -1439584979, now seen corresponding path program 1 times [2022-11-02 20:41:16,281 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:41:16,282 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1786269786] [2022-11-02 20:41:16,282 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:41:16,282 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:41:16,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:41:16,873 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-02 20:41:16,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:41:16,900 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-11-02 20:41:16,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:41:16,920 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-11-02 20:41:16,921 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:41:16,921 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1786269786] [2022-11-02 20:41:16,921 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1786269786] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-02 20:41:16,921 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2121541516] [2022-11-02 20:41:16,922 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:41:16,922 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-02 20:41:16,922 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eacac830-ac89-42b6-ba82-d293b55624ad/bin/uautomizer-Dbtcem3rbc/z3 [2022-11-02 20:41:16,928 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eacac830-ac89-42b6-ba82-d293b55624ad/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-02 20:41:16,960 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eacac830-ac89-42b6-ba82-d293b55624ad/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-11-02 20:41:17,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:41:17,097 INFO L263 TraceCheckSpWp]: Trace formula consists of 237 conjuncts, 27 conjunts are in the unsatisfiable core [2022-11-02 20:41:17,104 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-02 20:41:17,770 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 8 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:41:17,770 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-02 20:41:18,040 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-02 20:41:18,042 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 30 treesize of output 34 [2022-11-02 20:41:18,378 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 2 proven. 5 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-11-02 20:41:18,379 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2121541516] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-02 20:41:18,379 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-02 20:41:18,379 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 7, 8] total 26 [2022-11-02 20:41:18,380 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1518901905] [2022-11-02 20:41:18,381 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-02 20:41:18,383 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2022-11-02 20:41:18,383 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:41:18,384 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2022-11-02 20:41:18,384 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=116, Invalid=586, Unknown=0, NotChecked=0, Total=702 [2022-11-02 20:41:18,386 INFO L87 Difference]: Start difference. First operand 568 states and 773 transitions. Second operand has 27 states, 26 states have (on average 3.9615384615384617) internal successors, (103), 23 states have internal predecessors, (103), 6 states have call successors, (6), 3 states have call predecessors, (6), 5 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-11-02 20:41:19,900 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:41:19,901 INFO L93 Difference]: Finished difference Result 856 states and 1118 transitions. [2022-11-02 20:41:19,901 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-11-02 20:41:19,901 INFO L78 Accepts]: Start accepts. Automaton has has 27 states, 26 states have (on average 3.9615384615384617) internal successors, (103), 23 states have internal predecessors, (103), 6 states have call successors, (6), 3 states have call predecessors, (6), 5 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Word has length 40 [2022-11-02 20:41:19,902 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:41:19,906 INFO L225 Difference]: With dead ends: 856 [2022-11-02 20:41:19,906 INFO L226 Difference]: Without dead ends: 856 [2022-11-02 20:41:19,907 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 105 GetRequests, 70 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 275 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=312, Invalid=1020, Unknown=0, NotChecked=0, Total=1332 [2022-11-02 20:41:19,907 INFO L413 NwaCegarLoop]: 208 mSDtfsCounter, 1465 mSDsluCounter, 1847 mSDsCounter, 0 mSdLazyCounter, 832 mSolverCounterSat, 79 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1469 SdHoareTripleChecker+Valid, 2055 SdHoareTripleChecker+Invalid, 911 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 79 IncrementalHoareTripleChecker+Valid, 832 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2022-11-02 20:41:19,908 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1469 Valid, 2055 Invalid, 911 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [79 Valid, 832 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2022-11-02 20:41:19,910 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 856 states. [2022-11-02 20:41:19,924 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 856 to 563. [2022-11-02 20:41:19,926 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 563 states, 496 states have (on average 1.4375) internal successors, (713), 531 states have internal predecessors, (713), 16 states have call successors, (16), 7 states have call predecessors, (16), 14 states have return successors, (32), 24 states have call predecessors, (32), 16 states have call successors, (32) [2022-11-02 20:41:19,928 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 563 states to 563 states and 761 transitions. [2022-11-02 20:41:19,928 INFO L78 Accepts]: Start accepts. Automaton has 563 states and 761 transitions. Word has length 40 [2022-11-02 20:41:19,928 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:41:19,929 INFO L495 AbstractCegarLoop]: Abstraction has 563 states and 761 transitions. [2022-11-02 20:41:19,929 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 26 states have (on average 3.9615384615384617) internal successors, (103), 23 states have internal predecessors, (103), 6 states have call successors, (6), 3 states have call predecessors, (6), 5 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-11-02 20:41:19,929 INFO L276 IsEmpty]: Start isEmpty. Operand 563 states and 761 transitions. [2022-11-02 20:41:19,930 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2022-11-02 20:41:19,930 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:41:19,930 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:41:19,979 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eacac830-ac89-42b6-ba82-d293b55624ad/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-11-02 20:41:20,152 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eacac830-ac89-42b6-ba82-d293b55624ad/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable37 [2022-11-02 20:41:20,152 INFO L420 AbstractCegarLoop]: === Iteration 39 === Targeting ULTIMATE.startErr50REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 54 more)] === [2022-11-02 20:41:20,153 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:41:20,153 INFO L85 PathProgramCache]: Analyzing trace with hash 112861475, now seen corresponding path program 1 times [2022-11-02 20:41:20,153 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:41:20,153 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [397156460] [2022-11-02 20:41:20,153 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:41:20,153 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:41:20,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:41:20,356 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-02 20:41:20,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:41:20,360 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:41:20,360 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:41:20,360 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [397156460] [2022-11-02 20:41:20,361 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [397156460] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:41:20,361 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:41:20,361 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-11-02 20:41:20,361 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1562199340] [2022-11-02 20:41:20,362 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:41:20,362 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-02 20:41:20,362 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:41:20,363 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-02 20:41:20,363 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2022-11-02 20:41:20,363 INFO L87 Difference]: Start difference. First operand 563 states and 761 transitions. Second operand has 7 states, 6 states have (on average 6.333333333333333) internal successors, (38), 7 states have internal predecessors, (38), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-11-02 20:41:20,574 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:41:20,574 INFO L93 Difference]: Finished difference Result 640 states and 817 transitions. [2022-11-02 20:41:20,575 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-02 20:41:20,575 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 6.333333333333333) internal successors, (38), 7 states have internal predecessors, (38), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 40 [2022-11-02 20:41:20,575 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:41:20,578 INFO L225 Difference]: With dead ends: 640 [2022-11-02 20:41:20,578 INFO L226 Difference]: Without dead ends: 640 [2022-11-02 20:41:20,578 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=35, Invalid=55, Unknown=0, NotChecked=0, Total=90 [2022-11-02 20:41:20,579 INFO L413 NwaCegarLoop]: 168 mSDtfsCounter, 472 mSDsluCounter, 246 mSDsCounter, 0 mSdLazyCounter, 146 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 472 SdHoareTripleChecker+Valid, 414 SdHoareTripleChecker+Invalid, 153 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 146 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-02 20:41:20,579 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [472 Valid, 414 Invalid, 153 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 146 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-02 20:41:20,580 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 640 states. [2022-11-02 20:41:20,590 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 640 to 563. [2022-11-02 20:41:20,591 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 563 states, 496 states have (on average 1.4375) internal successors, (713), 531 states have internal predecessors, (713), 16 states have call successors, (16), 7 states have call predecessors, (16), 14 states have return successors, (32), 24 states have call predecessors, (32), 16 states have call successors, (32) [2022-11-02 20:41:20,593 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 563 states to 563 states and 761 transitions. [2022-11-02 20:41:20,593 INFO L78 Accepts]: Start accepts. Automaton has 563 states and 761 transitions. Word has length 40 [2022-11-02 20:41:20,593 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:41:20,593 INFO L495 AbstractCegarLoop]: Abstraction has 563 states and 761 transitions. [2022-11-02 20:41:20,594 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 6.333333333333333) internal successors, (38), 7 states have internal predecessors, (38), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-11-02 20:41:20,594 INFO L276 IsEmpty]: Start isEmpty. Operand 563 states and 761 transitions. [2022-11-02 20:41:20,594 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2022-11-02 20:41:20,594 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:41:20,595 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:41:20,595 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable38 [2022-11-02 20:41:20,595 INFO L420 AbstractCegarLoop]: === Iteration 40 === Targeting ULTIMATE.startErr50REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 54 more)] === [2022-11-02 20:41:20,595 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:41:20,596 INFO L85 PathProgramCache]: Analyzing trace with hash 112861413, now seen corresponding path program 1 times [2022-11-02 20:41:20,596 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:41:20,596 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [763099835] [2022-11-02 20:41:20,596 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:41:20,596 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:41:20,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:41:21,050 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-02 20:41:21,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:41:21,072 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:41:21,073 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:41:21,073 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [763099835] [2022-11-02 20:41:21,073 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [763099835] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:41:21,073 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:41:21,074 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-11-02 20:41:21,074 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1956910620] [2022-11-02 20:41:21,074 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:41:21,074 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-11-02 20:41:21,074 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:41:21,075 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-11-02 20:41:21,075 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=99, Unknown=0, NotChecked=0, Total=132 [2022-11-02 20:41:21,075 INFO L87 Difference]: Start difference. First operand 563 states and 761 transitions. Second operand has 12 states, 11 states have (on average 3.4545454545454546) internal successors, (38), 11 states have internal predecessors, (38), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-11-02 20:41:21,877 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:41:21,877 INFO L93 Difference]: Finished difference Result 912 states and 1170 transitions. [2022-11-02 20:41:21,878 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2022-11-02 20:41:21,878 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 3.4545454545454546) internal successors, (38), 11 states have internal predecessors, (38), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 40 [2022-11-02 20:41:21,878 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:41:21,882 INFO L225 Difference]: With dead ends: 912 [2022-11-02 20:41:21,882 INFO L226 Difference]: Without dead ends: 912 [2022-11-02 20:41:21,882 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 97 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=145, Invalid=455, Unknown=0, NotChecked=0, Total=600 [2022-11-02 20:41:21,883 INFO L413 NwaCegarLoop]: 181 mSDtfsCounter, 953 mSDsluCounter, 848 mSDsCounter, 0 mSdLazyCounter, 407 mSolverCounterSat, 39 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 957 SdHoareTripleChecker+Valid, 1029 SdHoareTripleChecker+Invalid, 446 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 39 IncrementalHoareTripleChecker+Valid, 407 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-11-02 20:41:21,883 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [957 Valid, 1029 Invalid, 446 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [39 Valid, 407 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-11-02 20:41:21,884 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 912 states. [2022-11-02 20:41:21,902 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 912 to 764. [2022-11-02 20:41:21,904 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 764 states, 687 states have (on average 1.4599708879184863) internal successors, (1003), 724 states have internal predecessors, (1003), 22 states have call successors, (22), 9 states have call predecessors, (22), 18 states have return successors, (44), 30 states have call predecessors, (44), 22 states have call successors, (44) [2022-11-02 20:41:21,906 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 764 states to 764 states and 1069 transitions. [2022-11-02 20:41:21,907 INFO L78 Accepts]: Start accepts. Automaton has 764 states and 1069 transitions. Word has length 40 [2022-11-02 20:41:21,907 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:41:21,907 INFO L495 AbstractCegarLoop]: Abstraction has 764 states and 1069 transitions. [2022-11-02 20:41:21,907 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 3.4545454545454546) internal successors, (38), 11 states have internal predecessors, (38), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-11-02 20:41:21,907 INFO L276 IsEmpty]: Start isEmpty. Operand 764 states and 1069 transitions. [2022-11-02 20:41:21,908 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2022-11-02 20:41:21,908 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:41:21,909 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:41:21,909 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable39 [2022-11-02 20:41:21,909 INFO L420 AbstractCegarLoop]: === Iteration 41 === Targeting ULTIMATE.startErr50REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 54 more)] === [2022-11-02 20:41:21,909 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:41:21,910 INFO L85 PathProgramCache]: Analyzing trace with hash -1897242428, now seen corresponding path program 1 times [2022-11-02 20:41:21,910 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:41:21,910 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1998515491] [2022-11-02 20:41:21,910 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:41:21,911 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:41:21,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:41:22,079 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-02 20:41:22,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:41:22,090 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:41:22,091 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:41:22,091 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1998515491] [2022-11-02 20:41:22,091 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1998515491] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:41:22,091 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:41:22,091 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-11-02 20:41:22,092 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [644639177] [2022-11-02 20:41:22,092 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:41:22,092 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-02 20:41:22,092 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:41:22,094 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-02 20:41:22,095 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-11-02 20:41:22,095 INFO L87 Difference]: Start difference. First operand 764 states and 1069 transitions. Second operand has 7 states, 7 states have (on average 5.428571428571429) internal successors, (38), 6 states have internal predecessors, (38), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-11-02 20:41:22,171 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:41:22,171 INFO L93 Difference]: Finished difference Result 817 states and 1089 transitions. [2022-11-02 20:41:22,172 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-11-02 20:41:22,172 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 5.428571428571429) internal successors, (38), 6 states have internal predecessors, (38), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 40 [2022-11-02 20:41:22,172 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:41:22,175 INFO L225 Difference]: With dead ends: 817 [2022-11-02 20:41:22,175 INFO L226 Difference]: Without dead ends: 817 [2022-11-02 20:41:22,175 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=31, Invalid=59, Unknown=0, NotChecked=0, Total=90 [2022-11-02 20:41:22,176 INFO L413 NwaCegarLoop]: 270 mSDtfsCounter, 154 mSDsluCounter, 1035 mSDsCounter, 0 mSdLazyCounter, 58 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 156 SdHoareTripleChecker+Valid, 1305 SdHoareTripleChecker+Invalid, 60 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 58 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-02 20:41:22,176 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [156 Valid, 1305 Invalid, 60 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 58 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-02 20:41:22,177 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 817 states. [2022-11-02 20:41:22,190 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 817 to 764. [2022-11-02 20:41:22,191 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 764 states, 687 states have (on average 1.4541484716157205) internal successors, (999), 724 states have internal predecessors, (999), 22 states have call successors, (22), 9 states have call predecessors, (22), 18 states have return successors, (44), 30 states have call predecessors, (44), 22 states have call successors, (44) [2022-11-02 20:41:22,193 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 764 states to 764 states and 1065 transitions. [2022-11-02 20:41:22,193 INFO L78 Accepts]: Start accepts. Automaton has 764 states and 1065 transitions. Word has length 40 [2022-11-02 20:41:22,193 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:41:22,193 INFO L495 AbstractCegarLoop]: Abstraction has 764 states and 1065 transitions. [2022-11-02 20:41:22,194 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 5.428571428571429) internal successors, (38), 6 states have internal predecessors, (38), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-11-02 20:41:22,194 INFO L276 IsEmpty]: Start isEmpty. Operand 764 states and 1065 transitions. [2022-11-02 20:41:22,194 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2022-11-02 20:41:22,194 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:41:22,195 INFO L195 NwaCegarLoop]: trace histogram [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, 1, 1] [2022-11-02 20:41:22,195 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable40 [2022-11-02 20:41:22,195 INFO L420 AbstractCegarLoop]: === Iteration 42 === Targeting ULTIMATE.startErr21REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 54 more)] === [2022-11-02 20:41:22,195 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:41:22,195 INFO L85 PathProgramCache]: Analyzing trace with hash -218564434, now seen corresponding path program 1 times [2022-11-02 20:41:22,196 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:41:22,196 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [974420666] [2022-11-02 20:41:22,196 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:41:22,196 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:41:22,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:41:22,400 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-02 20:41:22,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:41:22,403 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-11-02 20:41:22,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:41:22,408 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-11-02 20:41:22,408 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:41:22,409 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [974420666] [2022-11-02 20:41:22,409 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [974420666] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:41:22,409 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:41:22,409 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-02 20:41:22,409 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1373040321] [2022-11-02 20:41:22,409 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:41:22,410 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-02 20:41:22,410 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:41:22,410 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-02 20:41:22,410 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-11-02 20:41:22,411 INFO L87 Difference]: Start difference. First operand 764 states and 1065 transitions. Second operand has 6 states, 5 states have (on average 7.0) internal successors, (35), 6 states have internal predecessors, (35), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-11-02 20:41:22,653 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:41:22,653 INFO L93 Difference]: Finished difference Result 895 states and 1192 transitions. [2022-11-02 20:41:22,653 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-02 20:41:22,653 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 7.0) internal successors, (35), 6 states have internal predecessors, (35), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 42 [2022-11-02 20:41:22,654 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:41:22,657 INFO L225 Difference]: With dead ends: 895 [2022-11-02 20:41:22,657 INFO L226 Difference]: Without dead ends: 895 [2022-11-02 20:41:22,657 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=29, Invalid=43, Unknown=0, NotChecked=0, Total=72 [2022-11-02 20:41:22,658 INFO L413 NwaCegarLoop]: 207 mSDtfsCounter, 486 mSDsluCounter, 150 mSDsCounter, 0 mSdLazyCounter, 159 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 486 SdHoareTripleChecker+Valid, 357 SdHoareTripleChecker+Invalid, 176 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 159 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-02 20:41:22,658 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [486 Valid, 357 Invalid, 176 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 159 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-02 20:41:22,659 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 895 states. [2022-11-02 20:41:22,677 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 895 to 762. [2022-11-02 20:41:22,679 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 762 states, 687 states have (on average 1.4192139737991267) internal successors, (975), 722 states have internal predecessors, (975), 22 states have call successors, (22), 9 states have call predecessors, (22), 18 states have return successors, (44), 30 states have call predecessors, (44), 22 states have call successors, (44) [2022-11-02 20:41:22,681 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 762 states to 762 states and 1041 transitions. [2022-11-02 20:41:22,681 INFO L78 Accepts]: Start accepts. Automaton has 762 states and 1041 transitions. Word has length 42 [2022-11-02 20:41:22,681 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:41:22,682 INFO L495 AbstractCegarLoop]: Abstraction has 762 states and 1041 transitions. [2022-11-02 20:41:22,682 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 7.0) internal successors, (35), 6 states have internal predecessors, (35), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-11-02 20:41:22,682 INFO L276 IsEmpty]: Start isEmpty. Operand 762 states and 1041 transitions. [2022-11-02 20:41:22,683 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2022-11-02 20:41:22,683 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:41:22,683 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:41:22,683 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable41 [2022-11-02 20:41:22,683 INFO L420 AbstractCegarLoop]: === Iteration 43 === Targeting ULTIMATE.startErr50REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 54 more)] === [2022-11-02 20:41:22,684 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:41:22,684 INFO L85 PathProgramCache]: Analyzing trace with hash -1902204747, now seen corresponding path program 1 times [2022-11-02 20:41:22,684 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:41:22,685 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1585084015] [2022-11-02 20:41:22,685 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:41:22,685 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:41:22,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:41:22,883 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-02 20:41:22,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:41:22,887 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:41:22,888 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:41:22,888 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1585084015] [2022-11-02 20:41:22,888 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1585084015] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:41:22,888 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:41:22,888 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-11-02 20:41:22,888 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [564740557] [2022-11-02 20:41:22,889 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:41:22,889 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-02 20:41:22,889 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:41:22,890 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-02 20:41:22,890 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2022-11-02 20:41:22,890 INFO L87 Difference]: Start difference. First operand 762 states and 1041 transitions. Second operand has 7 states, 6 states have (on average 6.5) internal successors, (39), 7 states have internal predecessors, (39), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-11-02 20:41:23,079 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:41:23,080 INFO L93 Difference]: Finished difference Result 844 states and 1104 transitions. [2022-11-02 20:41:23,080 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-02 20:41:23,080 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 6.5) internal successors, (39), 7 states have internal predecessors, (39), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 41 [2022-11-02 20:41:23,080 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:41:23,083 INFO L225 Difference]: With dead ends: 844 [2022-11-02 20:41:23,083 INFO L226 Difference]: Without dead ends: 844 [2022-11-02 20:41:23,084 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2022-11-02 20:41:23,089 INFO L413 NwaCegarLoop]: 181 mSDtfsCounter, 395 mSDsluCounter, 245 mSDsCounter, 0 mSdLazyCounter, 140 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 395 SdHoareTripleChecker+Valid, 426 SdHoareTripleChecker+Invalid, 147 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 140 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-02 20:41:23,090 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [395 Valid, 426 Invalid, 147 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 140 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-02 20:41:23,091 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 844 states. [2022-11-02 20:41:23,102 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 844 to 554. [2022-11-02 20:41:23,103 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 554 states, 490 states have (on average 1.4) internal successors, (686), 522 states have internal predecessors, (686), 16 states have call successors, (16), 7 states have call predecessors, (16), 14 states have return successors, (32), 24 states have call predecessors, (32), 16 states have call successors, (32) [2022-11-02 20:41:23,104 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 554 states to 554 states and 734 transitions. [2022-11-02 20:41:23,104 INFO L78 Accepts]: Start accepts. Automaton has 554 states and 734 transitions. Word has length 41 [2022-11-02 20:41:23,104 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:41:23,106 INFO L495 AbstractCegarLoop]: Abstraction has 554 states and 734 transitions. [2022-11-02 20:41:23,106 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 6.5) internal successors, (39), 7 states have internal predecessors, (39), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-11-02 20:41:23,106 INFO L276 IsEmpty]: Start isEmpty. Operand 554 states and 734 transitions. [2022-11-02 20:41:23,107 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2022-11-02 20:41:23,107 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:41:23,107 INFO L195 NwaCegarLoop]: trace histogram [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] [2022-11-02 20:41:23,107 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable42 [2022-11-02 20:41:23,108 INFO L420 AbstractCegarLoop]: === Iteration 44 === Targeting ULTIMATE.startErr20REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 54 more)] === [2022-11-02 20:41:23,108 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:41:23,108 INFO L85 PathProgramCache]: Analyzing trace with hash -853472827, now seen corresponding path program 1 times [2022-11-02 20:41:23,108 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:41:23,108 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [893078962] [2022-11-02 20:41:23,109 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:41:23,109 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:41:23,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:41:23,236 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-11-02 20:41:23,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:41:23,239 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2022-11-02 20:41:23,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:41:23,244 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-11-02 20:41:23,244 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:41:23,244 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [893078962] [2022-11-02 20:41:23,245 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [893078962] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-02 20:41:23,245 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1118026154] [2022-11-02 20:41:23,245 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:41:23,245 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-02 20:41:23,245 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eacac830-ac89-42b6-ba82-d293b55624ad/bin/uautomizer-Dbtcem3rbc/z3 [2022-11-02 20:41:23,246 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eacac830-ac89-42b6-ba82-d293b55624ad/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-02 20:41:23,264 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eacac830-ac89-42b6-ba82-d293b55624ad/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-11-02 20:41:23,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:41:23,352 INFO L263 TraceCheckSpWp]: Trace formula consists of 205 conjuncts, 19 conjunts are in the unsatisfiable core [2022-11-02 20:41:23,355 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-02 20:41:23,542 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 8 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:41:23,542 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-02 20:41:23,571 INFO L356 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2022-11-02 20:41:23,571 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 12 treesize of output 11 [2022-11-02 20:41:23,600 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-11-02 20:41:23,600 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1118026154] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-02 20:41:23,600 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-02 20:41:23,601 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 5] total 11 [2022-11-02 20:41:23,601 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1888815036] [2022-11-02 20:41:23,601 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-02 20:41:23,601 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-11-02 20:41:23,601 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:41:23,602 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-11-02 20:41:23,602 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=102, Unknown=0, NotChecked=0, Total=132 [2022-11-02 20:41:23,602 INFO L87 Difference]: Start difference. First operand 554 states and 734 transitions. Second operand has 12 states, 11 states have (on average 7.181818181818182) internal successors, (79), 12 states have internal predecessors, (79), 4 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-11-02 20:41:24,453 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:41:24,453 INFO L93 Difference]: Finished difference Result 1615 states and 2028 transitions. [2022-11-02 20:41:24,455 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-11-02 20:41:24,455 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 7.181818181818182) internal successors, (79), 12 states have internal predecessors, (79), 4 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Word has length 43 [2022-11-02 20:41:24,455 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:41:24,460 INFO L225 Difference]: With dead ends: 1615 [2022-11-02 20:41:24,460 INFO L226 Difference]: Without dead ends: 1615 [2022-11-02 20:41:24,461 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 109 GetRequests, 90 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 63 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=131, Invalid=289, Unknown=0, NotChecked=0, Total=420 [2022-11-02 20:41:24,461 INFO L413 NwaCegarLoop]: 187 mSDtfsCounter, 1600 mSDsluCounter, 901 mSDsCounter, 0 mSdLazyCounter, 764 mSolverCounterSat, 104 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1602 SdHoareTripleChecker+Valid, 1088 SdHoareTripleChecker+Invalid, 868 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 104 IncrementalHoareTripleChecker+Valid, 764 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-11-02 20:41:24,462 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1602 Valid, 1088 Invalid, 868 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [104 Valid, 764 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2022-11-02 20:41:24,464 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1615 states. [2022-11-02 20:41:24,482 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1615 to 675. [2022-11-02 20:41:24,483 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 675 states, 603 states have (on average 1.306799336650083) internal successors, (788), 628 states have internal predecessors, (788), 24 states have call successors, (24), 10 states have call predecessors, (24), 20 states have return successors, (48), 36 states have call predecessors, (48), 24 states have call successors, (48) [2022-11-02 20:41:24,485 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 675 states to 675 states and 860 transitions. [2022-11-02 20:41:24,486 INFO L78 Accepts]: Start accepts. Automaton has 675 states and 860 transitions. Word has length 43 [2022-11-02 20:41:24,486 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:41:24,486 INFO L495 AbstractCegarLoop]: Abstraction has 675 states and 860 transitions. [2022-11-02 20:41:24,486 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 7.181818181818182) internal successors, (79), 12 states have internal predecessors, (79), 4 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-11-02 20:41:24,486 INFO L276 IsEmpty]: Start isEmpty. Operand 675 states and 860 transitions. [2022-11-02 20:41:24,487 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2022-11-02 20:41:24,487 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:41:24,487 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:41:24,528 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eacac830-ac89-42b6-ba82-d293b55624ad/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-11-02 20:41:24,712 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eacac830-ac89-42b6-ba82-d293b55624ad/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable43 [2022-11-02 20:41:24,712 INFO L420 AbstractCegarLoop]: === Iteration 45 === Targeting ULTIMATE.startErr51REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 54 more)] === [2022-11-02 20:41:24,713 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:41:24,713 INFO L85 PathProgramCache]: Analyzing trace with hash -703021945, now seen corresponding path program 1 times [2022-11-02 20:41:24,713 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:41:24,713 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1711473775] [2022-11-02 20:41:24,713 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:41:24,713 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:41:24,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:41:26,464 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-02 20:41:26,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:41:26,471 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:41:26,472 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:41:26,472 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1711473775] [2022-11-02 20:41:26,472 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1711473775] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:41:26,472 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:41:26,472 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2022-11-02 20:41:26,472 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1314967624] [2022-11-02 20:41:26,473 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:41:26,473 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-11-02 20:41:26,473 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:41:26,473 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-11-02 20:41:26,474 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=166, Unknown=0, NotChecked=0, Total=210 [2022-11-02 20:41:26,474 INFO L87 Difference]: Start difference. First operand 675 states and 860 transitions. Second operand has 15 states, 15 states have (on average 2.7333333333333334) internal successors, (41), 15 states have internal predecessors, (41), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-11-02 20:41:27,585 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:41:27,586 INFO L93 Difference]: Finished difference Result 697 states and 882 transitions. [2022-11-02 20:41:27,586 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-11-02 20:41:27,586 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 2.7333333333333334) internal successors, (41), 15 states have internal predecessors, (41), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 43 [2022-11-02 20:41:27,587 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:41:27,589 INFO L225 Difference]: With dead ends: 697 [2022-11-02 20:41:27,589 INFO L226 Difference]: Without dead ends: 697 [2022-11-02 20:41:27,589 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 5 SyntacticMatches, 1 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 82 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=146, Invalid=406, Unknown=0, NotChecked=0, Total=552 [2022-11-02 20:41:27,590 INFO L413 NwaCegarLoop]: 114 mSDtfsCounter, 108 mSDsluCounter, 646 mSDsCounter, 0 mSdLazyCounter, 275 mSolverCounterSat, 50 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 108 SdHoareTripleChecker+Valid, 760 SdHoareTripleChecker+Invalid, 325 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 50 IncrementalHoareTripleChecker+Valid, 275 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-02 20:41:27,590 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [108 Valid, 760 Invalid, 325 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [50 Valid, 275 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-11-02 20:41:27,591 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 697 states. [2022-11-02 20:41:27,602 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 697 to 689. [2022-11-02 20:41:27,603 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 689 states, 617 states have (on average 1.3030794165316046) internal successors, (804), 642 states have internal predecessors, (804), 24 states have call successors, (24), 10 states have call predecessors, (24), 20 states have return successors, (48), 36 states have call predecessors, (48), 24 states have call successors, (48) [2022-11-02 20:41:27,605 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 689 states to 689 states and 876 transitions. [2022-11-02 20:41:27,605 INFO L78 Accepts]: Start accepts. Automaton has 689 states and 876 transitions. Word has length 43 [2022-11-02 20:41:27,605 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:41:27,606 INFO L495 AbstractCegarLoop]: Abstraction has 689 states and 876 transitions. [2022-11-02 20:41:27,606 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 2.7333333333333334) internal successors, (41), 15 states have internal predecessors, (41), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-11-02 20:41:27,606 INFO L276 IsEmpty]: Start isEmpty. Operand 689 states and 876 transitions. [2022-11-02 20:41:27,607 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2022-11-02 20:41:27,607 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:41:27,607 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:41:27,607 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable44 [2022-11-02 20:41:27,607 INFO L420 AbstractCegarLoop]: === Iteration 46 === Targeting ULTIMATE.startErr51REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 54 more)] === [2022-11-02 20:41:27,608 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:41:27,608 INFO L85 PathProgramCache]: Analyzing trace with hash 115696767, now seen corresponding path program 1 times [2022-11-02 20:41:27,608 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:41:27,608 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1460414856] [2022-11-02 20:41:27,608 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:41:27,609 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:41:27,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:41:28,046 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-02 20:41:28,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:41:28,061 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:41:28,062 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:41:28,062 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1460414856] [2022-11-02 20:41:28,062 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1460414856] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:41:28,062 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:41:28,062 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2022-11-02 20:41:28,063 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1379489906] [2022-11-02 20:41:28,063 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:41:28,063 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-11-02 20:41:28,063 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:41:28,064 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-11-02 20:41:28,064 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=123, Unknown=0, NotChecked=0, Total=156 [2022-11-02 20:41:28,064 INFO L87 Difference]: Start difference. First operand 689 states and 876 transitions. Second operand has 13 states, 13 states have (on average 3.230769230769231) internal successors, (42), 12 states have internal predecessors, (42), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-11-02 20:41:28,511 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:41:28,512 INFO L93 Difference]: Finished difference Result 1118 states and 1419 transitions. [2022-11-02 20:41:28,512 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-11-02 20:41:28,512 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 3.230769230769231) internal successors, (42), 12 states have internal predecessors, (42), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 44 [2022-11-02 20:41:28,513 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:41:28,515 INFO L225 Difference]: With dead ends: 1118 [2022-11-02 20:41:28,515 INFO L226 Difference]: Without dead ends: 1118 [2022-11-02 20:41:28,516 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 63 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=158, Invalid=394, Unknown=0, NotChecked=0, Total=552 [2022-11-02 20:41:28,516 INFO L413 NwaCegarLoop]: 171 mSDtfsCounter, 1197 mSDsluCounter, 829 mSDsCounter, 0 mSdLazyCounter, 223 mSolverCounterSat, 72 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1199 SdHoareTripleChecker+Valid, 1000 SdHoareTripleChecker+Invalid, 295 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 72 IncrementalHoareTripleChecker+Valid, 223 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-02 20:41:28,516 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1199 Valid, 1000 Invalid, 295 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [72 Valid, 223 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-02 20:41:28,518 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1118 states. [2022-11-02 20:41:28,539 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1118 to 747. [2022-11-02 20:41:28,544 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 747 states, 675 states have (on average 1.2903703703703704) internal successors, (871), 700 states have internal predecessors, (871), 24 states have call successors, (24), 10 states have call predecessors, (24), 20 states have return successors, (48), 36 states have call predecessors, (48), 24 states have call successors, (48) [2022-11-02 20:41:28,545 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 747 states to 747 states and 943 transitions. [2022-11-02 20:41:28,546 INFO L78 Accepts]: Start accepts. Automaton has 747 states and 943 transitions. Word has length 44 [2022-11-02 20:41:28,546 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:41:28,546 INFO L495 AbstractCegarLoop]: Abstraction has 747 states and 943 transitions. [2022-11-02 20:41:28,546 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 3.230769230769231) internal successors, (42), 12 states have internal predecessors, (42), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-11-02 20:41:28,546 INFO L276 IsEmpty]: Start isEmpty. Operand 747 states and 943 transitions. [2022-11-02 20:41:28,552 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2022-11-02 20:41:28,553 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:41:28,553 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:41:28,553 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable45 [2022-11-02 20:41:28,553 INFO L420 AbstractCegarLoop]: === Iteration 47 === Targeting ULTIMATE.startErr51REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 54 more)] === [2022-11-02 20:41:28,554 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:41:28,554 INFO L85 PathProgramCache]: Analyzing trace with hash 494131847, now seen corresponding path program 1 times [2022-11-02 20:41:28,554 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:41:28,554 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1251580917] [2022-11-02 20:41:28,554 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:41:28,554 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:41:28,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:41:29,903 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-02 20:41:29,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:41:29,928 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:41:29,928 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:41:29,928 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1251580917] [2022-11-02 20:41:29,928 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1251580917] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-02 20:41:29,928 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1408215577] [2022-11-02 20:41:29,929 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:41:29,929 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-02 20:41:29,929 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eacac830-ac89-42b6-ba82-d293b55624ad/bin/uautomizer-Dbtcem3rbc/z3 [2022-11-02 20:41:29,933 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eacac830-ac89-42b6-ba82-d293b55624ad/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-02 20:41:29,980 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eacac830-ac89-42b6-ba82-d293b55624ad/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-11-02 20:41:30,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:41:30,086 INFO L263 TraceCheckSpWp]: Trace formula consists of 261 conjuncts, 30 conjunts are in the unsatisfiable core [2022-11-02 20:41:30,093 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-02 20:41:30,222 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:41:30,630 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 15 treesize of output 11 [2022-11-02 20:41:30,933 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-02 20:41:30,934 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 25 treesize of output 9 [2022-11-02 20:41:30,971 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:41:30,972 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-02 20:41:30,972 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1408215577] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:41:30,972 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-11-02 20:41:30,972 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [17] total 27 [2022-11-02 20:41:30,973 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [709470872] [2022-11-02 20:41:30,973 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:41:30,973 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-11-02 20:41:30,973 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:41:30,973 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-11-02 20:41:30,974 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=87, Invalid=669, Unknown=0, NotChecked=0, Total=756 [2022-11-02 20:41:30,974 INFO L87 Difference]: Start difference. First operand 747 states and 943 transitions. Second operand has 13 states, 12 states have (on average 3.5) internal successors, (42), 12 states have internal predecessors, (42), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-11-02 20:41:31,615 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:41:31,615 INFO L93 Difference]: Finished difference Result 1233 states and 1540 transitions. [2022-11-02 20:41:31,616 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-11-02 20:41:31,616 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 12 states have (on average 3.5) internal successors, (42), 12 states have internal predecessors, (42), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 44 [2022-11-02 20:41:31,616 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:41:31,619 INFO L225 Difference]: With dead ends: 1233 [2022-11-02 20:41:31,619 INFO L226 Difference]: Without dead ends: 1233 [2022-11-02 20:41:31,619 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 40 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 212 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=159, Invalid=963, Unknown=0, NotChecked=0, Total=1122 [2022-11-02 20:41:31,620 INFO L413 NwaCegarLoop]: 159 mSDtfsCounter, 547 mSDsluCounter, 944 mSDsCounter, 0 mSdLazyCounter, 493 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 549 SdHoareTripleChecker+Valid, 1103 SdHoareTripleChecker+Invalid, 600 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 493 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 91 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-11-02 20:41:31,620 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [549 Valid, 1103 Invalid, 600 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 493 Invalid, 0 Unknown, 91 Unchecked, 0.4s Time] [2022-11-02 20:41:31,622 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1233 states. [2022-11-02 20:41:31,646 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1233 to 1101. [2022-11-02 20:41:31,648 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1101 states, 1011 states have (on average 1.3006923837784372) internal successors, (1315), 1031 states have internal predecessors, (1315), 37 states have call successors, (37), 13 states have call predecessors, (37), 26 states have return successors, (74), 56 states have call predecessors, (74), 37 states have call successors, (74) [2022-11-02 20:41:31,650 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1101 states to 1101 states and 1426 transitions. [2022-11-02 20:41:31,651 INFO L78 Accepts]: Start accepts. Automaton has 1101 states and 1426 transitions. Word has length 44 [2022-11-02 20:41:31,651 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:41:31,651 INFO L495 AbstractCegarLoop]: Abstraction has 1101 states and 1426 transitions. [2022-11-02 20:41:31,651 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 12 states have (on average 3.5) internal successors, (42), 12 states have internal predecessors, (42), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-11-02 20:41:31,651 INFO L276 IsEmpty]: Start isEmpty. Operand 1101 states and 1426 transitions. [2022-11-02 20:41:31,652 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2022-11-02 20:41:31,652 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:41:31,653 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:41:31,689 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eacac830-ac89-42b6-ba82-d293b55624ad/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-11-02 20:41:31,868 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eacac830-ac89-42b6-ba82-d293b55624ad/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable46 [2022-11-02 20:41:31,868 INFO L420 AbstractCegarLoop]: === Iteration 48 === Targeting ULTIMATE.startErr52REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 54 more)] === [2022-11-02 20:41:31,869 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:41:31,869 INFO L85 PathProgramCache]: Analyzing trace with hash 494131848, now seen corresponding path program 1 times [2022-11-02 20:41:31,869 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:41:31,869 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [118121438] [2022-11-02 20:41:31,869 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:41:31,870 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:41:31,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:41:33,653 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-02 20:41:33,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:41:33,685 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:41:33,685 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:41:33,685 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [118121438] [2022-11-02 20:41:33,685 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [118121438] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-02 20:41:33,686 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1804235862] [2022-11-02 20:41:33,686 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:41:33,686 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-02 20:41:33,686 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eacac830-ac89-42b6-ba82-d293b55624ad/bin/uautomizer-Dbtcem3rbc/z3 [2022-11-02 20:41:33,689 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eacac830-ac89-42b6-ba82-d293b55624ad/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-02 20:41:33,705 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eacac830-ac89-42b6-ba82-d293b55624ad/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-11-02 20:41:33,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:41:33,832 INFO L263 TraceCheckSpWp]: Trace formula consists of 261 conjuncts, 47 conjunts are in the unsatisfiable core [2022-11-02 20:41:33,835 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-02 20:41:33,973 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:41:34,488 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 15 treesize of output 11 [2022-11-02 20:41:34,494 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 15 treesize of output 11 [2022-11-02 20:41:34,825 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-02 20:41:34,827 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 23 treesize of output 7 [2022-11-02 20:41:34,834 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-02 20:41:34,834 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 25 treesize of output 9 [2022-11-02 20:41:34,929 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:41:34,929 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-02 20:41:34,929 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1804235862] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:41:34,930 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-11-02 20:41:34,930 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [19] total 30 [2022-11-02 20:41:34,930 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [830402938] [2022-11-02 20:41:34,930 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:41:34,930 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-11-02 20:41:34,930 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:41:34,931 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-11-02 20:41:34,931 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=91, Invalid=839, Unknown=0, NotChecked=0, Total=930 [2022-11-02 20:41:34,931 INFO L87 Difference]: Start difference. First operand 1101 states and 1426 transitions. Second operand has 13 states, 12 states have (on average 3.5) internal successors, (42), 12 states have internal predecessors, (42), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-11-02 20:41:35,549 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:41:35,549 INFO L93 Difference]: Finished difference Result 1189 states and 1490 transitions. [2022-11-02 20:41:35,550 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-11-02 20:41:35,551 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 12 states have (on average 3.5) internal successors, (42), 12 states have internal predecessors, (42), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 44 [2022-11-02 20:41:35,551 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:41:35,554 INFO L225 Difference]: With dead ends: 1189 [2022-11-02 20:41:35,554 INFO L226 Difference]: Without dead ends: 1189 [2022-11-02 20:41:35,554 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 35 SyntacticMatches, 2 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 284 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=157, Invalid=1175, Unknown=0, NotChecked=0, Total=1332 [2022-11-02 20:41:35,555 INFO L413 NwaCegarLoop]: 159 mSDtfsCounter, 512 mSDsluCounter, 856 mSDsCounter, 0 mSdLazyCounter, 334 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 512 SdHoareTripleChecker+Valid, 1015 SdHoareTripleChecker+Invalid, 544 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 334 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 198 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-02 20:41:35,555 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [512 Valid, 1015 Invalid, 544 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 334 Invalid, 0 Unknown, 198 Unchecked, 0.3s Time] [2022-11-02 20:41:35,558 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1189 states. [2022-11-02 20:41:35,574 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1189 to 1103. [2022-11-02 20:41:35,576 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1103 states, 1013 states have (on average 1.299111549851925) internal successors, (1316), 1033 states have internal predecessors, (1316), 37 states have call successors, (37), 13 states have call predecessors, (37), 26 states have return successors, (74), 56 states have call predecessors, (74), 37 states have call successors, (74) [2022-11-02 20:41:35,579 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1103 states to 1103 states and 1427 transitions. [2022-11-02 20:41:35,579 INFO L78 Accepts]: Start accepts. Automaton has 1103 states and 1427 transitions. Word has length 44 [2022-11-02 20:41:35,579 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:41:35,580 INFO L495 AbstractCegarLoop]: Abstraction has 1103 states and 1427 transitions. [2022-11-02 20:41:35,580 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 12 states have (on average 3.5) internal successors, (42), 12 states have internal predecessors, (42), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-11-02 20:41:35,580 INFO L276 IsEmpty]: Start isEmpty. Operand 1103 states and 1427 transitions. [2022-11-02 20:41:35,581 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2022-11-02 20:41:35,581 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:41:35,581 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:41:35,616 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eacac830-ac89-42b6-ba82-d293b55624ad/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2022-11-02 20:41:35,804 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eacac830-ac89-42b6-ba82-d293b55624ad/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable47 [2022-11-02 20:41:35,804 INFO L420 AbstractCegarLoop]: === Iteration 49 === Targeting ULTIMATE.startErr51REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 54 more)] === [2022-11-02 20:41:35,805 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:41:35,805 INFO L85 PathProgramCache]: Analyzing trace with hash 492284805, now seen corresponding path program 1 times [2022-11-02 20:41:35,805 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:41:35,805 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1278063557] [2022-11-02 20:41:35,805 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:41:35,805 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:41:35,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:41:37,704 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-02 20:41:37,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:41:37,739 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:41:37,739 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:41:37,740 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1278063557] [2022-11-02 20:41:37,740 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1278063557] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-02 20:41:37,740 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1711681375] [2022-11-02 20:41:37,740 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:41:37,740 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-02 20:41:37,740 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eacac830-ac89-42b6-ba82-d293b55624ad/bin/uautomizer-Dbtcem3rbc/z3 [2022-11-02 20:41:37,741 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eacac830-ac89-42b6-ba82-d293b55624ad/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-02 20:41:37,742 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eacac830-ac89-42b6-ba82-d293b55624ad/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-11-02 20:41:37,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:41:37,863 INFO L263 TraceCheckSpWp]: Trace formula consists of 260 conjuncts, 40 conjunts are in the unsatisfiable core [2022-11-02 20:41:37,876 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-02 20:41:38,087 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:41:38,486 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 15 treesize of output 11 [2022-11-02 20:41:38,654 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-02 20:41:38,655 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 29 treesize of output 28 [2022-11-02 20:41:38,886 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-02 20:41:38,886 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 21 treesize of output 9 [2022-11-02 20:41:38,893 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:41:38,893 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-02 20:41:38,893 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1711681375] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:41:38,893 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-11-02 20:41:38,893 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [20] total 32 [2022-11-02 20:41:38,894 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1682525300] [2022-11-02 20:41:38,894 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:41:38,894 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-11-02 20:41:38,894 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:41:38,895 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-11-02 20:41:38,895 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=115, Invalid=941, Unknown=0, NotChecked=0, Total=1056 [2022-11-02 20:41:38,895 INFO L87 Difference]: Start difference. First operand 1103 states and 1427 transitions. Second operand has 16 states, 15 states have (on average 2.8) internal successors, (42), 14 states have internal predecessors, (42), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-11-02 20:41:39,366 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:41:39,366 INFO L93 Difference]: Finished difference Result 1324 states and 1693 transitions. [2022-11-02 20:41:39,372 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2022-11-02 20:41:39,372 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 15 states have (on average 2.8) internal successors, (42), 14 states have internal predecessors, (42), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 44 [2022-11-02 20:41:39,373 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:41:39,381 INFO L225 Difference]: With dead ends: 1324 [2022-11-02 20:41:39,381 INFO L226 Difference]: Without dead ends: 1324 [2022-11-02 20:41:39,383 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 35 SyntacticMatches, 1 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 343 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=217, Invalid=1423, Unknown=0, NotChecked=0, Total=1640 [2022-11-02 20:41:39,389 INFO L413 NwaCegarLoop]: 135 mSDtfsCounter, 195 mSDsluCounter, 1199 mSDsCounter, 0 mSdLazyCounter, 342 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 197 SdHoareTripleChecker+Valid, 1334 SdHoareTripleChecker+Invalid, 564 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 342 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 221 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-02 20:41:39,390 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [197 Valid, 1334 Invalid, 564 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 342 Invalid, 0 Unknown, 221 Unchecked, 0.2s Time] [2022-11-02 20:41:39,392 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1324 states. [2022-11-02 20:41:39,409 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1324 to 1251. [2022-11-02 20:41:39,411 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1251 states, 1146 states have (on average 1.2984293193717278) internal successors, (1488), 1173 states have internal predecessors, (1488), 46 states have call successors, (46), 16 states have call predecessors, (46), 32 states have return successors, (92), 61 states have call predecessors, (92), 46 states have call successors, (92) [2022-11-02 20:41:39,414 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1251 states to 1251 states and 1626 transitions. [2022-11-02 20:41:39,414 INFO L78 Accepts]: Start accepts. Automaton has 1251 states and 1626 transitions. Word has length 44 [2022-11-02 20:41:39,415 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:41:39,415 INFO L495 AbstractCegarLoop]: Abstraction has 1251 states and 1626 transitions. [2022-11-02 20:41:39,415 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 15 states have (on average 2.8) internal successors, (42), 14 states have internal predecessors, (42), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-11-02 20:41:39,415 INFO L276 IsEmpty]: Start isEmpty. Operand 1251 states and 1626 transitions. [2022-11-02 20:41:39,416 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2022-11-02 20:41:39,416 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:41:39,416 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:41:39,451 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eacac830-ac89-42b6-ba82-d293b55624ad/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2022-11-02 20:41:39,636 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eacac830-ac89-42b6-ba82-d293b55624ad/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable48 [2022-11-02 20:41:39,636 INFO L420 AbstractCegarLoop]: === Iteration 50 === Targeting ULTIMATE.startErr52REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 54 more)] === [2022-11-02 20:41:39,637 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:41:39,637 INFO L85 PathProgramCache]: Analyzing trace with hash 492284806, now seen corresponding path program 1 times [2022-11-02 20:41:39,637 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:41:39,637 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1383719073] [2022-11-02 20:41:39,637 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:41:39,637 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:41:39,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:41:41,958 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-02 20:41:41,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:41:41,996 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:41:41,997 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:41:41,997 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1383719073] [2022-11-02 20:41:41,997 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1383719073] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-02 20:41:41,997 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2058619705] [2022-11-02 20:41:41,997 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:41:41,997 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-02 20:41:41,998 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eacac830-ac89-42b6-ba82-d293b55624ad/bin/uautomizer-Dbtcem3rbc/z3 [2022-11-02 20:41:42,001 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eacac830-ac89-42b6-ba82-d293b55624ad/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-02 20:41:42,020 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eacac830-ac89-42b6-ba82-d293b55624ad/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2022-11-02 20:41:42,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:41:42,150 INFO L263 TraceCheckSpWp]: Trace formula consists of 260 conjuncts, 64 conjunts are in the unsatisfiable core [2022-11-02 20:41:42,166 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-02 20:41:42,383 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:41:42,764 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 15 treesize of output 11 [2022-11-02 20:41:42,774 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 15 treesize of output 11 [2022-11-02 20:41:42,911 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-02 20:41:42,913 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 29 treesize of output 28 [2022-11-02 20:41:42,925 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-02 20:41:42,928 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 26 [2022-11-02 20:41:43,161 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 21 treesize of output 9 [2022-11-02 20:41:43,166 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 19 treesize of output 7 [2022-11-02 20:41:43,267 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:41:43,267 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-02 20:41:43,267 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2058619705] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:41:43,268 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-11-02 20:41:43,268 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [23] total 36 [2022-11-02 20:41:43,268 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [166381873] [2022-11-02 20:41:43,268 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:41:43,268 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-11-02 20:41:43,268 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:41:43,269 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-11-02 20:41:43,269 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=111, Invalid=1221, Unknown=0, NotChecked=0, Total=1332 [2022-11-02 20:41:43,269 INFO L87 Difference]: Start difference. First operand 1251 states and 1626 transitions. Second operand has 15 states, 14 states have (on average 3.0) internal successors, (42), 13 states have internal predecessors, (42), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-11-02 20:41:44,753 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:41:44,753 INFO L93 Difference]: Finished difference Result 2120 states and 2756 transitions. [2022-11-02 20:41:44,754 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2022-11-02 20:41:44,755 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 14 states have (on average 3.0) internal successors, (42), 13 states have internal predecessors, (42), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 44 [2022-11-02 20:41:44,755 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:41:44,759 INFO L225 Difference]: With dead ends: 2120 [2022-11-02 20:41:44,760 INFO L226 Difference]: Without dead ends: 2120 [2022-11-02 20:41:44,761 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 83 GetRequests, 33 SyntacticMatches, 1 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 531 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=270, Invalid=2280, Unknown=0, NotChecked=0, Total=2550 [2022-11-02 20:41:44,761 INFO L413 NwaCegarLoop]: 176 mSDtfsCounter, 1115 mSDsluCounter, 1194 mSDsCounter, 0 mSdLazyCounter, 612 mSolverCounterSat, 72 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1117 SdHoareTripleChecker+Valid, 1370 SdHoareTripleChecker+Invalid, 684 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 72 IncrementalHoareTripleChecker+Valid, 612 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-11-02 20:41:44,762 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1117 Valid, 1370 Invalid, 684 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [72 Valid, 612 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-11-02 20:41:44,763 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2120 states. [2022-11-02 20:41:44,795 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2120 to 1656. [2022-11-02 20:41:44,797 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1656 states, 1516 states have (on average 1.3199208443271768) internal successors, (2001), 1552 states have internal predecessors, (2001), 69 states have call successors, (69), 22 states have call predecessors, (69), 44 states have return successors, (138), 81 states have call predecessors, (138), 69 states have call successors, (138) [2022-11-02 20:41:44,802 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1656 states to 1656 states and 2208 transitions. [2022-11-02 20:41:44,802 INFO L78 Accepts]: Start accepts. Automaton has 1656 states and 2208 transitions. Word has length 44 [2022-11-02 20:41:44,803 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:41:44,803 INFO L495 AbstractCegarLoop]: Abstraction has 1656 states and 2208 transitions. [2022-11-02 20:41:44,803 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 14 states have (on average 3.0) internal successors, (42), 13 states have internal predecessors, (42), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-11-02 20:41:44,803 INFO L276 IsEmpty]: Start isEmpty. Operand 1656 states and 2208 transitions. [2022-11-02 20:41:44,804 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2022-11-02 20:41:44,805 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:41:44,805 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:41:44,855 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eacac830-ac89-42b6-ba82-d293b55624ad/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2022-11-02 20:41:45,016 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eacac830-ac89-42b6-ba82-d293b55624ad/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable49 [2022-11-02 20:41:45,016 INFO L420 AbstractCegarLoop]: === Iteration 51 === Targeting ULTIMATE.startErr51REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 54 more)] === [2022-11-02 20:41:45,017 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:41:45,017 INFO L85 PathProgramCache]: Analyzing trace with hash -1503059700, now seen corresponding path program 1 times [2022-11-02 20:41:45,017 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:41:45,017 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1164788679] [2022-11-02 20:41:45,017 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:41:45,017 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:41:45,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:41:45,195 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-11-02 20:41:45,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:41:45,198 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:41:45,198 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:41:45,198 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1164788679] [2022-11-02 20:41:45,199 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1164788679] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-02 20:41:45,199 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1121087271] [2022-11-02 20:41:45,199 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:41:45,199 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-02 20:41:45,199 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eacac830-ac89-42b6-ba82-d293b55624ad/bin/uautomizer-Dbtcem3rbc/z3 [2022-11-02 20:41:45,200 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eacac830-ac89-42b6-ba82-d293b55624ad/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-02 20:41:45,220 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eacac830-ac89-42b6-ba82-d293b55624ad/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2022-11-02 20:41:45,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:41:45,337 INFO L263 TraceCheckSpWp]: Trace formula consists of 213 conjuncts, 32 conjunts are in the unsatisfiable core [2022-11-02 20:41:45,341 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-02 20:41:45,471 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-02 20:41:45,472 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:41:45,476 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-02 20:41:45,477 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:41:45,526 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-02 20:41:45,526 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-02 20:41:45,526 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1121087271] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:41:45,526 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-11-02 20:41:45,527 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [5] total 11 [2022-11-02 20:41:45,527 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [286696441] [2022-11-02 20:41:45,527 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:41:45,527 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-11-02 20:41:45,528 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:41:45,528 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-11-02 20:41:45,528 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2022-11-02 20:41:45,528 INFO L87 Difference]: Start difference. First operand 1656 states and 2208 transitions. Second operand has 8 states, 8 states have (on average 5.375) internal successors, (43), 7 states have internal predecessors, (43), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-11-02 20:41:45,903 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:41:45,903 INFO L93 Difference]: Finished difference Result 1457 states and 1942 transitions. [2022-11-02 20:41:45,906 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-11-02 20:41:45,906 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 5.375) internal successors, (43), 7 states have internal predecessors, (43), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 45 [2022-11-02 20:41:45,907 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:41:45,910 INFO L225 Difference]: With dead ends: 1457 [2022-11-02 20:41:45,910 INFO L226 Difference]: Without dead ends: 1457 [2022-11-02 20:41:45,911 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 42 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 39 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=62, Invalid=210, Unknown=0, NotChecked=0, Total=272 [2022-11-02 20:41:45,911 INFO L413 NwaCegarLoop]: 179 mSDtfsCounter, 200 mSDsluCounter, 901 mSDsCounter, 0 mSdLazyCounter, 162 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 200 SdHoareTripleChecker+Valid, 1080 SdHoareTripleChecker+Invalid, 180 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 162 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-02 20:41:45,912 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [200 Valid, 1080 Invalid, 180 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 162 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-02 20:41:45,913 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1457 states. [2022-11-02 20:41:45,934 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1457 to 1246. [2022-11-02 20:41:45,937 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1246 states, 1140 states have (on average 1.3289473684210527) internal successors, (1515), 1167 states have internal predecessors, (1515), 51 states have call successors, (51), 14 states have call predecessors, (51), 28 states have return successors, (102), 64 states have call predecessors, (102), 51 states have call successors, (102) [2022-11-02 20:41:45,940 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1246 states to 1246 states and 1668 transitions. [2022-11-02 20:41:45,940 INFO L78 Accepts]: Start accepts. Automaton has 1246 states and 1668 transitions. Word has length 45 [2022-11-02 20:41:45,940 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:41:45,941 INFO L495 AbstractCegarLoop]: Abstraction has 1246 states and 1668 transitions. [2022-11-02 20:41:45,941 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 5.375) internal successors, (43), 7 states have internal predecessors, (43), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-11-02 20:41:45,941 INFO L276 IsEmpty]: Start isEmpty. Operand 1246 states and 1668 transitions. [2022-11-02 20:41:45,942 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2022-11-02 20:41:45,942 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:41:45,942 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:41:45,988 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eacac830-ac89-42b6-ba82-d293b55624ad/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2022-11-02 20:41:46,168 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable50,8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eacac830-ac89-42b6-ba82-d293b55624ad/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-02 20:41:46,169 INFO L420 AbstractCegarLoop]: === Iteration 52 === Targeting ULTIMATE.startErr56ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 54 more)] === [2022-11-02 20:41:46,169 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:41:46,169 INFO L85 PathProgramCache]: Analyzing trace with hash -1861783222, now seen corresponding path program 1 times [2022-11-02 20:41:46,169 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:41:46,169 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2048504199] [2022-11-02 20:41:46,169 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:41:46,169 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:41:46,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:41:46,630 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-02 20:41:46,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:41:46,634 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:41:46,634 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:41:46,634 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2048504199] [2022-11-02 20:41:46,635 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2048504199] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:41:46,635 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:41:46,635 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2022-11-02 20:41:46,635 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [837512878] [2022-11-02 20:41:46,635 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:41:46,636 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-11-02 20:41:46,636 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:41:46,636 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-11-02 20:41:46,636 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=99, Unknown=0, NotChecked=0, Total=132 [2022-11-02 20:41:46,637 INFO L87 Difference]: Start difference. First operand 1246 states and 1668 transitions. Second operand has 12 states, 12 states have (on average 3.5833333333333335) internal successors, (43), 12 states have internal predecessors, (43), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-11-02 20:41:47,124 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:41:47,125 INFO L93 Difference]: Finished difference Result 1866 states and 2447 transitions. [2022-11-02 20:41:47,125 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-11-02 20:41:47,126 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 3.5833333333333335) internal successors, (43), 12 states have internal predecessors, (43), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 45 [2022-11-02 20:41:47,126 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:41:47,130 INFO L225 Difference]: With dead ends: 1866 [2022-11-02 20:41:47,131 INFO L226 Difference]: Without dead ends: 1866 [2022-11-02 20:41:47,131 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 43 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=140, Invalid=280, Unknown=0, NotChecked=0, Total=420 [2022-11-02 20:41:47,135 INFO L413 NwaCegarLoop]: 135 mSDtfsCounter, 933 mSDsluCounter, 619 mSDsCounter, 0 mSdLazyCounter, 291 mSolverCounterSat, 45 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 933 SdHoareTripleChecker+Valid, 754 SdHoareTripleChecker+Invalid, 336 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 45 IncrementalHoareTripleChecker+Valid, 291 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-02 20:41:47,135 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [933 Valid, 754 Invalid, 336 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [45 Valid, 291 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-11-02 20:41:47,137 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1866 states. [2022-11-02 20:41:47,163 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1866 to 1666. [2022-11-02 20:41:47,165 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1666 states, 1507 states have (on average 1.3390842733908428) internal successors, (2018), 1554 states have internal predecessors, (2018), 78 states have call successors, (78), 27 states have call predecessors, (78), 54 states have return successors, (156), 84 states have call predecessors, (156), 78 states have call successors, (156) [2022-11-02 20:41:47,169 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1666 states to 1666 states and 2252 transitions. [2022-11-02 20:41:47,169 INFO L78 Accepts]: Start accepts. Automaton has 1666 states and 2252 transitions. Word has length 45 [2022-11-02 20:41:47,170 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:41:47,170 INFO L495 AbstractCegarLoop]: Abstraction has 1666 states and 2252 transitions. [2022-11-02 20:41:47,170 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 3.5833333333333335) internal successors, (43), 12 states have internal predecessors, (43), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-11-02 20:41:47,170 INFO L276 IsEmpty]: Start isEmpty. Operand 1666 states and 2252 transitions. [2022-11-02 20:41:47,171 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2022-11-02 20:41:47,171 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:41:47,171 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:41:47,172 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable51 [2022-11-02 20:41:47,172 INFO L420 AbstractCegarLoop]: === Iteration 53 === Targeting ULTIMATE.startErr56ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 54 more)] === [2022-11-02 20:41:47,173 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:41:47,173 INFO L85 PathProgramCache]: Analyzing trace with hash -1919041524, now seen corresponding path program 1 times [2022-11-02 20:41:47,173 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:41:47,173 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [538751860] [2022-11-02 20:41:47,173 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:41:47,173 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:41:47,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:41:49,060 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-02 20:41:49,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:41:49,088 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:41:49,089 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:41:49,089 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [538751860] [2022-11-02 20:41:49,089 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [538751860] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-02 20:41:49,089 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [172945162] [2022-11-02 20:41:49,089 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:41:49,090 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-02 20:41:49,090 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eacac830-ac89-42b6-ba82-d293b55624ad/bin/uautomizer-Dbtcem3rbc/z3 [2022-11-02 20:41:49,093 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eacac830-ac89-42b6-ba82-d293b55624ad/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-02 20:41:49,094 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eacac830-ac89-42b6-ba82-d293b55624ad/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2022-11-02 20:41:49,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:41:49,234 INFO L263 TraceCheckSpWp]: Trace formula consists of 265 conjuncts, 36 conjunts are in the unsatisfiable core [2022-11-02 20:41:49,237 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-02 20:41:49,615 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-02 20:41:49,617 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 41 treesize of output 40 [2022-11-02 20:41:49,623 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-02 20:41:49,624 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 41 treesize of output 40 [2022-11-02 20:41:49,845 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 31 treesize of output 19 [2022-11-02 20:41:49,854 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2022-11-02 20:41:49,915 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:41:49,915 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-02 20:41:49,915 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [172945162] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:41:49,915 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-11-02 20:41:49,916 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [22] total 30 [2022-11-02 20:41:49,916 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [417167184] [2022-11-02 20:41:49,916 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:41:49,916 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-11-02 20:41:49,916 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:41:49,917 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-11-02 20:41:49,917 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=92, Invalid=778, Unknown=0, NotChecked=0, Total=870 [2022-11-02 20:41:49,917 INFO L87 Difference]: Start difference. First operand 1666 states and 2252 transitions. Second operand has 10 states, 10 states have (on average 4.3) internal successors, (43), 9 states have internal predecessors, (43), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-11-02 20:41:50,433 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:41:50,433 INFO L93 Difference]: Finished difference Result 2479 states and 3321 transitions. [2022-11-02 20:41:50,434 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-11-02 20:41:50,434 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 4.3) internal successors, (43), 9 states have internal predecessors, (43), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 45 [2022-11-02 20:41:50,434 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:41:50,440 INFO L225 Difference]: With dead ends: 2479 [2022-11-02 20:41:50,440 INFO L226 Difference]: Without dead ends: 2479 [2022-11-02 20:41:50,440 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 74 GetRequests, 40 SyntacticMatches, 1 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 256 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=132, Invalid=1058, Unknown=0, NotChecked=0, Total=1190 [2022-11-02 20:41:50,441 INFO L413 NwaCegarLoop]: 138 mSDtfsCounter, 425 mSDsluCounter, 570 mSDsCounter, 0 mSdLazyCounter, 279 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 429 SdHoareTripleChecker+Valid, 708 SdHoareTripleChecker+Invalid, 300 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 279 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-02 20:41:50,441 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [429 Valid, 708 Invalid, 300 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 279 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-11-02 20:41:50,443 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2479 states. [2022-11-02 20:41:50,486 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2479 to 2270. [2022-11-02 20:41:50,489 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2270 states, 2051 states have (on average 1.3500731350560702) internal successors, (2769), 2116 states have internal predecessors, (2769), 114 states have call successors, (114), 39 states have call predecessors, (114), 78 states have return successors, (228), 114 states have call predecessors, (228), 114 states have call successors, (228) [2022-11-02 20:41:50,495 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2270 states to 2270 states and 3111 transitions. [2022-11-02 20:41:50,496 INFO L78 Accepts]: Start accepts. Automaton has 2270 states and 3111 transitions. Word has length 45 [2022-11-02 20:41:50,496 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:41:50,496 INFO L495 AbstractCegarLoop]: Abstraction has 2270 states and 3111 transitions. [2022-11-02 20:41:50,496 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 4.3) internal successors, (43), 9 states have internal predecessors, (43), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-11-02 20:41:50,496 INFO L276 IsEmpty]: Start isEmpty. Operand 2270 states and 3111 transitions. [2022-11-02 20:41:50,497 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2022-11-02 20:41:50,497 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:41:50,498 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:41:50,545 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eacac830-ac89-42b6-ba82-d293b55624ad/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2022-11-02 20:41:50,712 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable52,9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eacac830-ac89-42b6-ba82-d293b55624ad/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-02 20:41:50,712 INFO L420 AbstractCegarLoop]: === Iteration 54 === Targeting ULTIMATE.startErr51REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 54 more)] === [2022-11-02 20:41:50,713 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:41:50,713 INFO L85 PathProgramCache]: Analyzing trace with hash 1990296655, now seen corresponding path program 1 times [2022-11-02 20:41:50,713 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:41:50,713 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1545081917] [2022-11-02 20:41:50,713 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:41:50,713 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:41:50,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:41:51,651 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-02 20:41:51,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:41:51,679 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:41:51,680 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:41:51,680 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1545081917] [2022-11-02 20:41:51,680 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1545081917] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-02 20:41:51,680 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [463771465] [2022-11-02 20:41:51,680 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:41:51,680 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-02 20:41:51,681 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eacac830-ac89-42b6-ba82-d293b55624ad/bin/uautomizer-Dbtcem3rbc/z3 [2022-11-02 20:41:51,681 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eacac830-ac89-42b6-ba82-d293b55624ad/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-02 20:41:51,682 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eacac830-ac89-42b6-ba82-d293b55624ad/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2022-11-02 20:41:51,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:41:51,823 INFO L263 TraceCheckSpWp]: Trace formula consists of 264 conjuncts, 42 conjunts are in the unsatisfiable core [2022-11-02 20:41:51,825 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-02 20:41:51,982 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:41:52,324 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 15 treesize of output 11 [2022-11-02 20:41:52,399 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-02 20:41:52,400 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 29 treesize of output 28 [2022-11-02 20:41:52,557 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 21 treesize of output 9 [2022-11-02 20:41:52,563 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:41:52,564 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-02 20:41:52,564 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [463771465] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:41:52,564 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-11-02 20:41:52,564 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [16] total 27 [2022-11-02 20:41:52,564 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2048845941] [2022-11-02 20:41:52,564 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:41:52,565 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-11-02 20:41:52,565 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:41:52,565 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-11-02 20:41:52,565 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=107, Invalid=649, Unknown=0, NotChecked=0, Total=756 [2022-11-02 20:41:52,565 INFO L87 Difference]: Start difference. First operand 2270 states and 3111 transitions. Second operand has 15 states, 14 states have (on average 3.0714285714285716) internal successors, (43), 13 states have internal predecessors, (43), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-11-02 20:41:53,981 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:41:53,981 INFO L93 Difference]: Finished difference Result 2887 states and 3904 transitions. [2022-11-02 20:41:53,982 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2022-11-02 20:41:53,982 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 14 states have (on average 3.0714285714285716) internal successors, (43), 13 states have internal predecessors, (43), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 45 [2022-11-02 20:41:53,982 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:41:53,989 INFO L225 Difference]: With dead ends: 2887 [2022-11-02 20:41:53,989 INFO L226 Difference]: Without dead ends: 2887 [2022-11-02 20:41:53,989 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 36 SyntacticMatches, 1 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 378 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=404, Invalid=1576, Unknown=0, NotChecked=0, Total=1980 [2022-11-02 20:41:53,990 INFO L413 NwaCegarLoop]: 204 mSDtfsCounter, 784 mSDsluCounter, 1673 mSDsCounter, 0 mSdLazyCounter, 1113 mSolverCounterSat, 51 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 786 SdHoareTripleChecker+Valid, 1877 SdHoareTripleChecker+Invalid, 1164 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 51 IncrementalHoareTripleChecker+Valid, 1113 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2022-11-02 20:41:53,990 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [786 Valid, 1877 Invalid, 1164 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [51 Valid, 1113 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2022-11-02 20:41:53,993 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2887 states. [2022-11-02 20:41:54,034 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2887 to 2357. [2022-11-02 20:41:54,038 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2357 states, 2114 states have (on average 1.348155156102176) internal successors, (2850), 2191 states have internal predecessors, (2850), 114 states have call successors, (114), 51 states have call predecessors, (114), 102 states have return successors, (228), 114 states have call predecessors, (228), 114 states have call successors, (228) [2022-11-02 20:41:54,047 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2357 states to 2357 states and 3192 transitions. [2022-11-02 20:41:54,047 INFO L78 Accepts]: Start accepts. Automaton has 2357 states and 3192 transitions. Word has length 45 [2022-11-02 20:41:54,047 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:41:54,048 INFO L495 AbstractCegarLoop]: Abstraction has 2357 states and 3192 transitions. [2022-11-02 20:41:54,048 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 14 states have (on average 3.0714285714285716) internal successors, (43), 13 states have internal predecessors, (43), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-11-02 20:41:54,048 INFO L276 IsEmpty]: Start isEmpty. Operand 2357 states and 3192 transitions. [2022-11-02 20:41:54,062 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2022-11-02 20:41:54,062 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:41:54,063 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:41:54,107 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eacac830-ac89-42b6-ba82-d293b55624ad/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2022-11-02 20:41:54,263 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable53,10 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eacac830-ac89-42b6-ba82-d293b55624ad/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-02 20:41:54,263 INFO L420 AbstractCegarLoop]: === Iteration 55 === Targeting ULTIMATE.startErr52REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 54 more)] === [2022-11-02 20:41:54,264 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:41:54,264 INFO L85 PathProgramCache]: Analyzing trace with hash 1990296656, now seen corresponding path program 1 times [2022-11-02 20:41:54,264 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:41:54,264 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [349310734] [2022-11-02 20:41:54,264 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:41:54,264 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:41:54,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:41:55,730 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-02 20:41:55,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:41:55,764 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:41:55,764 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:41:55,765 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [349310734] [2022-11-02 20:41:55,765 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [349310734] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-02 20:41:55,765 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1026795322] [2022-11-02 20:41:55,765 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:41:55,765 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-02 20:41:55,765 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eacac830-ac89-42b6-ba82-d293b55624ad/bin/uautomizer-Dbtcem3rbc/z3 [2022-11-02 20:41:55,767 INFO L229 MonitoredProcess]: Starting monitored process 11 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eacac830-ac89-42b6-ba82-d293b55624ad/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-02 20:41:55,800 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eacac830-ac89-42b6-ba82-d293b55624ad/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2022-11-02 20:41:55,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:41:55,966 INFO L263 TraceCheckSpWp]: Trace formula consists of 264 conjuncts, 61 conjunts are in the unsatisfiable core [2022-11-02 20:41:55,970 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-02 20:41:56,174 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:41:56,603 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 15 treesize of output 11 [2022-11-02 20:41:56,613 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 15 treesize of output 11 [2022-11-02 20:41:56,703 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-02 20:41:56,704 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 28 [2022-11-02 20:41:56,712 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-02 20:41:56,716 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 27 treesize of output 26 [2022-11-02 20:41:56,900 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 19 treesize of output 7 [2022-11-02 20:41:56,904 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 21 treesize of output 9 [2022-11-02 20:41:56,976 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:41:56,976 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-02 20:41:56,977 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1026795322] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:41:56,977 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-11-02 20:41:56,977 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [18] total 31 [2022-11-02 20:41:56,977 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1039981439] [2022-11-02 20:41:56,977 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:41:56,977 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-11-02 20:41:56,977 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:41:56,978 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-11-02 20:41:56,978 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=122, Invalid=870, Unknown=0, NotChecked=0, Total=992 [2022-11-02 20:41:56,978 INFO L87 Difference]: Start difference. First operand 2357 states and 3192 transitions. Second operand has 15 states, 14 states have (on average 3.0714285714285716) internal successors, (43), 13 states have internal predecessors, (43), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-11-02 20:41:58,458 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:41:58,458 INFO L93 Difference]: Finished difference Result 2998 states and 4005 transitions. [2022-11-02 20:41:58,458 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2022-11-02 20:41:58,458 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 14 states have (on average 3.0714285714285716) internal successors, (43), 13 states have internal predecessors, (43), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 45 [2022-11-02 20:41:58,459 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:41:58,465 INFO L225 Difference]: With dead ends: 2998 [2022-11-02 20:41:58,466 INFO L226 Difference]: Without dead ends: 2998 [2022-11-02 20:41:58,466 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 78 GetRequests, 33 SyntacticMatches, 1 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 441 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=379, Invalid=1691, Unknown=0, NotChecked=0, Total=2070 [2022-11-02 20:41:58,467 INFO L413 NwaCegarLoop]: 208 mSDtfsCounter, 1091 mSDsluCounter, 1456 mSDsCounter, 0 mSdLazyCounter, 848 mSolverCounterSat, 65 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1091 SdHoareTripleChecker+Valid, 1664 SdHoareTripleChecker+Invalid, 913 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 65 IncrementalHoareTripleChecker+Valid, 848 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2022-11-02 20:41:58,467 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1091 Valid, 1664 Invalid, 913 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [65 Valid, 848 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2022-11-02 20:41:58,470 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2998 states. [2022-11-02 20:41:58,512 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2998 to 2533. [2022-11-02 20:41:58,515 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2533 states, 2274 states have (on average 1.3575197889182058) internal successors, (3087), 2355 states have internal predecessors, (3087), 122 states have call successors, (122), 55 states have call predecessors, (122), 110 states have return successors, (244), 122 states have call predecessors, (244), 122 states have call successors, (244) [2022-11-02 20:41:58,521 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2533 states to 2533 states and 3453 transitions. [2022-11-02 20:41:58,522 INFO L78 Accepts]: Start accepts. Automaton has 2533 states and 3453 transitions. Word has length 45 [2022-11-02 20:41:58,522 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:41:58,522 INFO L495 AbstractCegarLoop]: Abstraction has 2533 states and 3453 transitions. [2022-11-02 20:41:58,522 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 14 states have (on average 3.0714285714285716) internal successors, (43), 13 states have internal predecessors, (43), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-11-02 20:41:58,522 INFO L276 IsEmpty]: Start isEmpty. Operand 2533 states and 3453 transitions. [2022-11-02 20:41:58,523 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2022-11-02 20:41:58,523 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:41:58,524 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:41:58,564 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eacac830-ac89-42b6-ba82-d293b55624ad/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2022-11-02 20:41:58,740 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable54,11 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eacac830-ac89-42b6-ba82-d293b55624ad/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-02 20:41:58,740 INFO L420 AbstractCegarLoop]: === Iteration 56 === Targeting ULTIMATE.startErr51REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 54 more)] === [2022-11-02 20:41:58,741 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:41:58,741 INFO L85 PathProgramCache]: Analyzing trace with hash 1988449613, now seen corresponding path program 1 times [2022-11-02 20:41:58,741 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:41:58,741 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1925401047] [2022-11-02 20:41:58,741 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:41:58,741 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:41:58,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:41:59,317 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-02 20:41:59,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:41:59,320 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:41:59,321 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:41:59,321 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1925401047] [2022-11-02 20:41:59,321 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1925401047] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:41:59,321 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:41:59,321 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2022-11-02 20:41:59,321 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1755423134] [2022-11-02 20:41:59,321 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:41:59,321 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-11-02 20:41:59,322 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:41:59,322 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-11-02 20:41:59,322 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=141, Unknown=0, NotChecked=0, Total=182 [2022-11-02 20:41:59,322 INFO L87 Difference]: Start difference. First operand 2533 states and 3453 transitions. Second operand has 14 states, 13 states have (on average 3.3076923076923075) internal successors, (43), 14 states have internal predecessors, (43), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-11-02 20:42:00,841 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:42:00,842 INFO L93 Difference]: Finished difference Result 2947 states and 4016 transitions. [2022-11-02 20:42:00,848 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2022-11-02 20:42:00,848 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 3.3076923076923075) internal successors, (43), 14 states have internal predecessors, (43), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 45 [2022-11-02 20:42:00,848 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:42:00,853 INFO L225 Difference]: With dead ends: 2947 [2022-11-02 20:42:00,853 INFO L226 Difference]: Without dead ends: 2947 [2022-11-02 20:42:00,854 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 83 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=218, Invalid=484, Unknown=0, NotChecked=0, Total=702 [2022-11-02 20:42:00,854 INFO L413 NwaCegarLoop]: 169 mSDtfsCounter, 696 mSDsluCounter, 1087 mSDsCounter, 0 mSdLazyCounter, 873 mSolverCounterSat, 41 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 698 SdHoareTripleChecker+Valid, 1256 SdHoareTripleChecker+Invalid, 914 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 41 IncrementalHoareTripleChecker+Valid, 873 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-11-02 20:42:00,855 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [698 Valid, 1256 Invalid, 914 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [41 Valid, 873 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2022-11-02 20:42:00,857 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2947 states. [2022-11-02 20:42:00,903 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2947 to 2537. [2022-11-02 20:42:00,907 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2537 states, 2278 states have (on average 1.3577699736611062) internal successors, (3093), 2359 states have internal predecessors, (3093), 122 states have call successors, (122), 55 states have call predecessors, (122), 110 states have return successors, (244), 122 states have call predecessors, (244), 122 states have call successors, (244) [2022-11-02 20:42:00,919 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2537 states to 2537 states and 3459 transitions. [2022-11-02 20:42:00,920 INFO L78 Accepts]: Start accepts. Automaton has 2537 states and 3459 transitions. Word has length 45 [2022-11-02 20:42:00,920 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:42:00,920 INFO L495 AbstractCegarLoop]: Abstraction has 2537 states and 3459 transitions. [2022-11-02 20:42:00,920 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 3.3076923076923075) internal successors, (43), 14 states have internal predecessors, (43), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-11-02 20:42:00,921 INFO L276 IsEmpty]: Start isEmpty. Operand 2537 states and 3459 transitions. [2022-11-02 20:42:00,921 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2022-11-02 20:42:00,922 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:42:00,922 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:42:00,922 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable55 [2022-11-02 20:42:00,922 INFO L420 AbstractCegarLoop]: === Iteration 57 === Targeting ULTIMATE.startErr52REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 54 more)] === [2022-11-02 20:42:00,922 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:42:00,923 INFO L85 PathProgramCache]: Analyzing trace with hash 1988449614, now seen corresponding path program 1 times [2022-11-02 20:42:00,923 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:42:00,923 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [319282928] [2022-11-02 20:42:00,923 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:42:00,923 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:42:00,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:42:01,723 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-02 20:42:01,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:42:01,728 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:42:01,728 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:42:01,728 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [319282928] [2022-11-02 20:42:01,728 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [319282928] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:42:01,729 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:42:01,729 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2022-11-02 20:42:01,729 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1860734016] [2022-11-02 20:42:01,729 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:42:01,729 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-11-02 20:42:01,730 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:42:01,730 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-11-02 20:42:01,730 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=141, Unknown=0, NotChecked=0, Total=182 [2022-11-02 20:42:01,731 INFO L87 Difference]: Start difference. First operand 2537 states and 3459 transitions. Second operand has 14 states, 13 states have (on average 3.3076923076923075) internal successors, (43), 14 states have internal predecessors, (43), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-11-02 20:42:03,072 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:42:03,072 INFO L93 Difference]: Finished difference Result 2755 states and 3680 transitions. [2022-11-02 20:42:03,073 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-11-02 20:42:03,073 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 3.3076923076923075) internal successors, (43), 14 states have internal predecessors, (43), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 45 [2022-11-02 20:42:03,073 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:42:03,080 INFO L225 Difference]: With dead ends: 2755 [2022-11-02 20:42:03,080 INFO L226 Difference]: Without dead ends: 2755 [2022-11-02 20:42:03,080 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 58 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=174, Invalid=378, Unknown=0, NotChecked=0, Total=552 [2022-11-02 20:42:03,081 INFO L413 NwaCegarLoop]: 189 mSDtfsCounter, 686 mSDsluCounter, 739 mSDsCounter, 0 mSdLazyCounter, 568 mSolverCounterSat, 33 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 686 SdHoareTripleChecker+Valid, 928 SdHoareTripleChecker+Invalid, 601 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 33 IncrementalHoareTripleChecker+Valid, 568 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-11-02 20:42:03,081 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [686 Valid, 928 Invalid, 601 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [33 Valid, 568 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-11-02 20:42:03,083 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2755 states. [2022-11-02 20:42:03,125 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2755 to 2533. [2022-11-02 20:42:03,128 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2533 states, 2274 states have (on average 1.3575197889182058) internal successors, (3087), 2355 states have internal predecessors, (3087), 122 states have call successors, (122), 55 states have call predecessors, (122), 110 states have return successors, (244), 122 states have call predecessors, (244), 122 states have call successors, (244) [2022-11-02 20:42:03,134 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2533 states to 2533 states and 3453 transitions. [2022-11-02 20:42:03,135 INFO L78 Accepts]: Start accepts. Automaton has 2533 states and 3453 transitions. Word has length 45 [2022-11-02 20:42:03,135 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:42:03,135 INFO L495 AbstractCegarLoop]: Abstraction has 2533 states and 3453 transitions. [2022-11-02 20:42:03,135 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 3.3076923076923075) internal successors, (43), 14 states have internal predecessors, (43), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-11-02 20:42:03,136 INFO L276 IsEmpty]: Start isEmpty. Operand 2533 states and 3453 transitions. [2022-11-02 20:42:03,136 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2022-11-02 20:42:03,137 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:42:03,137 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:42:03,137 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable56 [2022-11-02 20:42:03,137 INFO L420 AbstractCegarLoop]: === Iteration 58 === Targeting ULTIMATE.startErr51REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 54 more)] === [2022-11-02 20:42:03,138 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:42:03,138 INFO L85 PathProgramCache]: Analyzing trace with hash -1928082603, now seen corresponding path program 1 times [2022-11-02 20:42:03,138 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:42:03,138 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [648631344] [2022-11-02 20:42:03,138 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:42:03,139 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:42:03,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:42:03,764 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-02 20:42:03,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:42:03,787 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:42:03,787 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:42:03,787 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [648631344] [2022-11-02 20:42:03,787 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [648631344] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:42:03,787 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:42:03,788 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2022-11-02 20:42:03,788 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1672975696] [2022-11-02 20:42:03,788 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:42:03,788 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-11-02 20:42:03,788 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:42:03,789 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-11-02 20:42:03,789 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=99, Unknown=0, NotChecked=0, Total=132 [2022-11-02 20:42:03,789 INFO L87 Difference]: Start difference. First operand 2533 states and 3453 transitions. Second operand has 12 states, 12 states have (on average 3.5833333333333335) internal successors, (43), 11 states have internal predecessors, (43), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-11-02 20:42:04,360 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:42:04,360 INFO L93 Difference]: Finished difference Result 2371 states and 3168 transitions. [2022-11-02 20:42:04,360 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-11-02 20:42:04,360 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 3.5833333333333335) internal successors, (43), 11 states have internal predecessors, (43), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 45 [2022-11-02 20:42:04,361 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:42:04,369 INFO L225 Difference]: With dead ends: 2371 [2022-11-02 20:42:04,369 INFO L226 Difference]: Without dead ends: 2369 [2022-11-02 20:42:04,370 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 47 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=137, Invalid=325, Unknown=0, NotChecked=0, Total=462 [2022-11-02 20:42:04,370 INFO L413 NwaCegarLoop]: 214 mSDtfsCounter, 969 mSDsluCounter, 1031 mSDsCounter, 0 mSdLazyCounter, 318 mSolverCounterSat, 44 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 969 SdHoareTripleChecker+Valid, 1245 SdHoareTripleChecker+Invalid, 362 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 44 IncrementalHoareTripleChecker+Valid, 318 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-02 20:42:04,370 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [969 Valid, 1245 Invalid, 362 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [44 Valid, 318 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-11-02 20:42:04,375 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2369 states. [2022-11-02 20:42:04,407 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2369 to 2037. [2022-11-02 20:42:04,409 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2037 states, 1842 states have (on average 1.3485342019543973) internal successors, (2484), 1895 states have internal predecessors, (2484), 90 states have call successors, (90), 39 states have call predecessors, (90), 78 states have return successors, (180), 102 states have call predecessors, (180), 90 states have call successors, (180) [2022-11-02 20:42:04,413 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2037 states to 2037 states and 2754 transitions. [2022-11-02 20:42:04,413 INFO L78 Accepts]: Start accepts. Automaton has 2037 states and 2754 transitions. Word has length 45 [2022-11-02 20:42:04,414 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:42:04,414 INFO L495 AbstractCegarLoop]: Abstraction has 2037 states and 2754 transitions. [2022-11-02 20:42:04,414 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 3.5833333333333335) internal successors, (43), 11 states have internal predecessors, (43), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-11-02 20:42:04,414 INFO L276 IsEmpty]: Start isEmpty. Operand 2037 states and 2754 transitions. [2022-11-02 20:42:04,415 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2022-11-02 20:42:04,415 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:42:04,415 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:42:04,415 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable57 [2022-11-02 20:42:04,416 INFO L420 AbstractCegarLoop]: === Iteration 59 === Targeting ULTIMATE.startErr56ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 54 more)] === [2022-11-02 20:42:04,416 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:42:04,416 INFO L85 PathProgramCache]: Analyzing trace with hash 1569652866, now seen corresponding path program 1 times [2022-11-02 20:42:04,416 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:42:04,416 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [402530446] [2022-11-02 20:42:04,417 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:42:04,417 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:42:04,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:42:04,907 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-02 20:42:04,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:42:04,924 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:42:04,924 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:42:04,925 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [402530446] [2022-11-02 20:42:04,925 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [402530446] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:42:04,925 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:42:04,925 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2022-11-02 20:42:04,925 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2120422074] [2022-11-02 20:42:04,925 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:42:04,925 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-11-02 20:42:04,925 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:42:04,926 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-11-02 20:42:04,926 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=122, Unknown=0, NotChecked=0, Total=156 [2022-11-02 20:42:04,926 INFO L87 Difference]: Start difference. First operand 2037 states and 2754 transitions. Second operand has 13 states, 13 states have (on average 3.3846153846153846) internal successors, (44), 12 states have internal predecessors, (44), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-11-02 20:42:06,004 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:42:06,004 INFO L93 Difference]: Finished difference Result 2613 states and 3414 transitions. [2022-11-02 20:42:06,004 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2022-11-02 20:42:06,005 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 3.3846153846153846) internal successors, (44), 12 states have internal predecessors, (44), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 46 [2022-11-02 20:42:06,005 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:42:06,010 INFO L225 Difference]: With dead ends: 2613 [2022-11-02 20:42:06,010 INFO L226 Difference]: Without dead ends: 2613 [2022-11-02 20:42:06,011 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 4 SyntacticMatches, 1 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 260 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=233, Invalid=957, Unknown=0, NotChecked=0, Total=1190 [2022-11-02 20:42:06,011 INFO L413 NwaCegarLoop]: 227 mSDtfsCounter, 757 mSDsluCounter, 1639 mSDsCounter, 0 mSdLazyCounter, 814 mSolverCounterSat, 42 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 761 SdHoareTripleChecker+Valid, 1866 SdHoareTripleChecker+Invalid, 856 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 42 IncrementalHoareTripleChecker+Valid, 814 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-11-02 20:42:06,012 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [761 Valid, 1866 Invalid, 856 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [42 Valid, 814 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-11-02 20:42:06,014 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2613 states. [2022-11-02 20:42:06,053 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2613 to 1855. [2022-11-02 20:42:06,055 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1855 states, 1676 states have (on average 1.3448687350835322) internal successors, (2254), 1726 states have internal predecessors, (2254), 80 states have call successors, (80), 36 states have call predecessors, (80), 72 states have return successors, (160), 92 states have call predecessors, (160), 80 states have call successors, (160) [2022-11-02 20:42:06,080 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1855 states to 1855 states and 2494 transitions. [2022-11-02 20:42:06,081 INFO L78 Accepts]: Start accepts. Automaton has 1855 states and 2494 transitions. Word has length 46 [2022-11-02 20:42:06,082 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:42:06,082 INFO L495 AbstractCegarLoop]: Abstraction has 1855 states and 2494 transitions. [2022-11-02 20:42:06,082 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 3.3846153846153846) internal successors, (44), 12 states have internal predecessors, (44), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-11-02 20:42:06,082 INFO L276 IsEmpty]: Start isEmpty. Operand 1855 states and 2494 transitions. [2022-11-02 20:42:06,083 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2022-11-02 20:42:06,083 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:42:06,083 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:42:06,084 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable58 [2022-11-02 20:42:06,084 INFO L420 AbstractCegarLoop]: === Iteration 60 === Targeting ULTIMATE.startErr56ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 54 more)] === [2022-11-02 20:42:06,085 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:42:06,085 INFO L85 PathProgramCache]: Analyzing trace with hash 1512394564, now seen corresponding path program 1 times [2022-11-02 20:42:06,085 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:42:06,085 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [481627760] [2022-11-02 20:42:06,085 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:42:06,085 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:42:06,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:42:06,607 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-02 20:42:06,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:42:06,611 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:42:06,611 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:42:06,611 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [481627760] [2022-11-02 20:42:06,611 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [481627760] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:42:06,611 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:42:06,611 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2022-11-02 20:42:06,611 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1335899971] [2022-11-02 20:42:06,612 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:42:06,612 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-11-02 20:42:06,612 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:42:06,612 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-11-02 20:42:06,612 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=141, Unknown=0, NotChecked=0, Total=182 [2022-11-02 20:42:06,613 INFO L87 Difference]: Start difference. First operand 1855 states and 2494 transitions. Second operand has 14 states, 14 states have (on average 3.142857142857143) internal successors, (44), 14 states have internal predecessors, (44), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-11-02 20:42:07,603 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:42:07,603 INFO L93 Difference]: Finished difference Result 2060 states and 2697 transitions. [2022-11-02 20:42:07,604 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-11-02 20:42:07,604 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 3.142857142857143) internal successors, (44), 14 states have internal predecessors, (44), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 46 [2022-11-02 20:42:07,604 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:42:07,608 INFO L225 Difference]: With dead ends: 2060 [2022-11-02 20:42:07,608 INFO L226 Difference]: Without dead ends: 2060 [2022-11-02 20:42:07,608 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 58 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=172, Invalid=380, Unknown=0, NotChecked=0, Total=552 [2022-11-02 20:42:07,609 INFO L413 NwaCegarLoop]: 221 mSDtfsCounter, 577 mSDsluCounter, 1048 mSDsCounter, 0 mSdLazyCounter, 476 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 577 SdHoareTripleChecker+Valid, 1269 SdHoareTripleChecker+Invalid, 503 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 476 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-11-02 20:42:07,609 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [577 Valid, 1269 Invalid, 503 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 476 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-11-02 20:42:07,611 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2060 states. [2022-11-02 20:42:07,647 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2060 to 1846. [2022-11-02 20:42:07,649 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1846 states, 1667 states have (on average 1.3443311337732453) internal successors, (2241), 1717 states have internal predecessors, (2241), 80 states have call successors, (80), 36 states have call predecessors, (80), 72 states have return successors, (160), 92 states have call predecessors, (160), 80 states have call successors, (160) [2022-11-02 20:42:07,653 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1846 states to 1846 states and 2481 transitions. [2022-11-02 20:42:07,653 INFO L78 Accepts]: Start accepts. Automaton has 1846 states and 2481 transitions. Word has length 46 [2022-11-02 20:42:07,654 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:42:07,654 INFO L495 AbstractCegarLoop]: Abstraction has 1846 states and 2481 transitions. [2022-11-02 20:42:07,654 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 3.142857142857143) internal successors, (44), 14 states have internal predecessors, (44), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-11-02 20:42:07,654 INFO L276 IsEmpty]: Start isEmpty. Operand 1846 states and 2481 transitions. [2022-11-02 20:42:07,655 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2022-11-02 20:42:07,655 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:42:07,655 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:42:07,655 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable59 [2022-11-02 20:42:07,655 INFO L420 AbstractCegarLoop]: === Iteration 61 === Targeting ULTIMATE.startErr54ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 54 more)] === [2022-11-02 20:42:07,656 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:42:07,656 INFO L85 PathProgramCache]: Analyzing trace with hash 1829142158, now seen corresponding path program 1 times [2022-11-02 20:42:07,656 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:42:07,657 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [376277606] [2022-11-02 20:42:07,657 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:42:07,657 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:42:07,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:42:08,532 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-02 20:42:08,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:42:08,555 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:42:08,555 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:42:08,555 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [376277606] [2022-11-02 20:42:08,555 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [376277606] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-02 20:42:08,555 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1136404915] [2022-11-02 20:42:08,555 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:42:08,556 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-02 20:42:08,556 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eacac830-ac89-42b6-ba82-d293b55624ad/bin/uautomizer-Dbtcem3rbc/z3 [2022-11-02 20:42:08,557 INFO L229 MonitoredProcess]: Starting monitored process 12 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eacac830-ac89-42b6-ba82-d293b55624ad/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-02 20:42:08,576 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eacac830-ac89-42b6-ba82-d293b55624ad/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2022-11-02 20:42:08,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:42:08,729 INFO L263 TraceCheckSpWp]: Trace formula consists of 275 conjuncts, 22 conjunts are in the unsatisfiable core [2022-11-02 20:42:08,731 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-02 20:42:09,165 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 15 treesize of output 11 [2022-11-02 20:42:09,381 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-02 20:42:09,382 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 25 treesize of output 9 [2022-11-02 20:42:09,413 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:42:09,413 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-02 20:42:09,413 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1136404915] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:42:09,413 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-11-02 20:42:09,414 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [17] total 27 [2022-11-02 20:42:09,414 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [429912137] [2022-11-02 20:42:09,414 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:42:09,414 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-11-02 20:42:09,414 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:42:09,414 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-11-02 20:42:09,414 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=86, Invalid=670, Unknown=0, NotChecked=0, Total=756 [2022-11-02 20:42:09,415 INFO L87 Difference]: Start difference. First operand 1846 states and 2481 transitions. Second operand has 13 states, 12 states have (on average 3.75) internal successors, (45), 12 states have internal predecessors, (45), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-11-02 20:42:09,777 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:42:09,777 INFO L93 Difference]: Finished difference Result 1927 states and 2554 transitions. [2022-11-02 20:42:09,777 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-11-02 20:42:09,777 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 12 states have (on average 3.75) internal successors, (45), 12 states have internal predecessors, (45), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 47 [2022-11-02 20:42:09,777 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:42:09,781 INFO L225 Difference]: With dead ends: 1927 [2022-11-02 20:42:09,781 INFO L226 Difference]: Without dead ends: 1927 [2022-11-02 20:42:09,782 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 41 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 210 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=158, Invalid=964, Unknown=0, NotChecked=0, Total=1122 [2022-11-02 20:42:09,782 INFO L413 NwaCegarLoop]: 174 mSDtfsCounter, 535 mSDsluCounter, 848 mSDsCounter, 0 mSdLazyCounter, 224 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 535 SdHoareTripleChecker+Valid, 1022 SdHoareTripleChecker+Invalid, 353 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 224 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 115 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-02 20:42:09,782 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [535 Valid, 1022 Invalid, 353 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 224 Invalid, 0 Unknown, 115 Unchecked, 0.2s Time] [2022-11-02 20:42:09,784 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1927 states. [2022-11-02 20:42:09,812 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1927 to 1855. [2022-11-02 20:42:09,814 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1855 states, 1676 states have (on average 1.3430787589498807) internal successors, (2251), 1726 states have internal predecessors, (2251), 80 states have call successors, (80), 36 states have call predecessors, (80), 72 states have return successors, (160), 92 states have call predecessors, (160), 80 states have call successors, (160) [2022-11-02 20:42:09,818 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1855 states to 1855 states and 2491 transitions. [2022-11-02 20:42:09,818 INFO L78 Accepts]: Start accepts. Automaton has 1855 states and 2491 transitions. Word has length 47 [2022-11-02 20:42:09,818 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:42:09,818 INFO L495 AbstractCegarLoop]: Abstraction has 1855 states and 2491 transitions. [2022-11-02 20:42:09,819 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 12 states have (on average 3.75) internal successors, (45), 12 states have internal predecessors, (45), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-11-02 20:42:09,819 INFO L276 IsEmpty]: Start isEmpty. Operand 1855 states and 2491 transitions. [2022-11-02 20:42:09,819 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2022-11-02 20:42:09,820 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:42:09,820 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:42:09,860 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eacac830-ac89-42b6-ba82-d293b55624ad/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Ended with exit code 0 [2022-11-02 20:42:10,035 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable60,12 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eacac830-ac89-42b6-ba82-d293b55624ad/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-02 20:42:10,036 INFO L420 AbstractCegarLoop]: === Iteration 62 === Targeting ULTIMATE.startErr54ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 54 more)] === [2022-11-02 20:42:10,036 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:42:10,036 INFO L85 PathProgramCache]: Analyzing trace with hash -1656478512, now seen corresponding path program 1 times [2022-11-02 20:42:10,036 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:42:10,036 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1711493422] [2022-11-02 20:42:10,036 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:42:10,036 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:42:10,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:42:11,864 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-02 20:42:11,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:42:11,869 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:42:11,870 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:42:11,870 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1711493422] [2022-11-02 20:42:11,870 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1711493422] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-02 20:42:11,870 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [938891881] [2022-11-02 20:42:11,870 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:42:11,870 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-02 20:42:11,870 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eacac830-ac89-42b6-ba82-d293b55624ad/bin/uautomizer-Dbtcem3rbc/z3 [2022-11-02 20:42:11,871 INFO L229 MonitoredProcess]: Starting monitored process 13 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eacac830-ac89-42b6-ba82-d293b55624ad/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-02 20:42:11,873 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eacac830-ac89-42b6-ba82-d293b55624ad/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2022-11-02 20:42:12,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:42:12,052 INFO L263 TraceCheckSpWp]: Trace formula consists of 274 conjuncts, 35 conjunts are in the unsatisfiable core [2022-11-02 20:42:12,055 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-02 20:42:12,662 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 15 treesize of output 11 [2022-11-02 20:42:12,780 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-02 20:42:12,781 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 29 treesize of output 28 [2022-11-02 20:42:12,956 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 21 treesize of output 9 [2022-11-02 20:42:12,968 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:42:12,968 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-02 20:42:12,968 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [938891881] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:42:12,968 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-11-02 20:42:12,968 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [18] total 29 [2022-11-02 20:42:12,968 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1475954413] [2022-11-02 20:42:12,969 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:42:12,969 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-11-02 20:42:12,969 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:42:12,969 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-11-02 20:42:12,970 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=92, Invalid=778, Unknown=0, NotChecked=0, Total=870 [2022-11-02 20:42:12,970 INFO L87 Difference]: Start difference. First operand 1855 states and 2491 transitions. Second operand has 15 states, 14 states have (on average 3.2142857142857144) internal successors, (45), 13 states have internal predecessors, (45), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-11-02 20:42:14,301 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:42:14,301 INFO L93 Difference]: Finished difference Result 2302 states and 3023 transitions. [2022-11-02 20:42:14,301 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2022-11-02 20:42:14,301 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 14 states have (on average 3.2142857142857144) internal successors, (45), 13 states have internal predecessors, (45), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 47 [2022-11-02 20:42:14,302 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:42:14,307 INFO L225 Difference]: With dead ends: 2302 [2022-11-02 20:42:14,308 INFO L226 Difference]: Without dead ends: 2302 [2022-11-02 20:42:14,308 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 87 GetRequests, 40 SyntacticMatches, 0 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 394 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=376, Invalid=1976, Unknown=0, NotChecked=0, Total=2352 [2022-11-02 20:42:14,316 INFO L413 NwaCegarLoop]: 121 mSDtfsCounter, 1036 mSDsluCounter, 1229 mSDsCounter, 0 mSdLazyCounter, 664 mSolverCounterSat, 77 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1040 SdHoareTripleChecker+Valid, 1350 SdHoareTripleChecker+Invalid, 741 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 77 IncrementalHoareTripleChecker+Valid, 664 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-11-02 20:42:14,316 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1040 Valid, 1350 Invalid, 741 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [77 Valid, 664 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-11-02 20:42:14,318 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2302 states. [2022-11-02 20:42:14,357 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2302 to 1860. [2022-11-02 20:42:14,360 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1860 states, 1681 states have (on average 1.3432480666270077) internal successors, (2258), 1731 states have internal predecessors, (2258), 80 states have call successors, (80), 36 states have call predecessors, (80), 72 states have return successors, (160), 92 states have call predecessors, (160), 80 states have call successors, (160) [2022-11-02 20:42:14,364 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1860 states to 1860 states and 2498 transitions. [2022-11-02 20:42:14,364 INFO L78 Accepts]: Start accepts. Automaton has 1860 states and 2498 transitions. Word has length 47 [2022-11-02 20:42:14,364 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:42:14,365 INFO L495 AbstractCegarLoop]: Abstraction has 1860 states and 2498 transitions. [2022-11-02 20:42:14,366 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 14 states have (on average 3.2142857142857144) internal successors, (45), 13 states have internal predecessors, (45), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-11-02 20:42:14,367 INFO L276 IsEmpty]: Start isEmpty. Operand 1860 states and 2498 transitions. [2022-11-02 20:42:14,369 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2022-11-02 20:42:14,369 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:42:14,369 INFO L195 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:42:14,413 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eacac830-ac89-42b6-ba82-d293b55624ad/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Forceful destruction successful, exit code 0 [2022-11-02 20:42:14,592 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eacac830-ac89-42b6-ba82-d293b55624ad/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable61 [2022-11-02 20:42:14,592 INFO L420 AbstractCegarLoop]: === Iteration 63 === Targeting ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 54 more)] === [2022-11-02 20:42:14,593 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:42:14,593 INFO L85 PathProgramCache]: Analyzing trace with hash 1323444049, now seen corresponding path program 1 times [2022-11-02 20:42:14,593 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:42:14,593 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [314724779] [2022-11-02 20:42:14,593 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:42:14,593 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:42:14,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:42:14,720 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-02 20:42:14,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:42:14,723 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2022-11-02 20:42:14,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:42:14,726 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-11-02 20:42:14,727 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:42:14,727 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [314724779] [2022-11-02 20:42:14,727 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [314724779] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:42:14,727 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:42:14,727 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-02 20:42:14,728 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1345204762] [2022-11-02 20:42:14,728 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:42:14,728 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-02 20:42:14,729 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:42:14,729 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-02 20:42:14,729 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-11-02 20:42:14,729 INFO L87 Difference]: Start difference. First operand 1860 states and 2498 transitions. Second operand has 5 states, 4 states have (on average 10.0) internal successors, (40), 5 states have internal predecessors, (40), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-11-02 20:42:14,772 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:42:14,772 INFO L93 Difference]: Finished difference Result 2080 states and 2768 transitions. [2022-11-02 20:42:14,773 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-02 20:42:14,773 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 10.0) internal successors, (40), 5 states have internal predecessors, (40), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 48 [2022-11-02 20:42:14,773 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:42:14,778 INFO L225 Difference]: With dead ends: 2080 [2022-11-02 20:42:14,778 INFO L226 Difference]: Without dead ends: 2080 [2022-11-02 20:42:14,778 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2022-11-02 20:42:14,779 INFO L413 NwaCegarLoop]: 180 mSDtfsCounter, 215 mSDsluCounter, 135 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 215 SdHoareTripleChecker+Valid, 315 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 17 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-02 20:42:14,780 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [215 Valid, 315 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-02 20:42:14,782 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2080 states. [2022-11-02 20:42:14,831 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2080 to 1859. [2022-11-02 20:42:14,833 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1859 states, 1681 states have (on average 1.3337299226650803) internal successors, (2242), 1730 states have internal predecessors, (2242), 80 states have call successors, (80), 36 states have call predecessors, (80), 72 states have return successors, (160), 92 states have call predecessors, (160), 80 states have call successors, (160) [2022-11-02 20:42:14,838 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1859 states to 1859 states and 2482 transitions. [2022-11-02 20:42:14,838 INFO L78 Accepts]: Start accepts. Automaton has 1859 states and 2482 transitions. Word has length 48 [2022-11-02 20:42:14,838 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:42:14,839 INFO L495 AbstractCegarLoop]: Abstraction has 1859 states and 2482 transitions. [2022-11-02 20:42:14,839 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 10.0) internal successors, (40), 5 states have internal predecessors, (40), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-11-02 20:42:14,839 INFO L276 IsEmpty]: Start isEmpty. Operand 1859 states and 2482 transitions. [2022-11-02 20:42:14,840 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2022-11-02 20:42:14,840 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:42:14,840 INFO L195 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:42:14,841 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable62 [2022-11-02 20:42:14,842 INFO L420 AbstractCegarLoop]: === Iteration 64 === Targeting ULTIMATE.startErr25ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 54 more)] === [2022-11-02 20:42:14,843 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:42:14,843 INFO L85 PathProgramCache]: Analyzing trace with hash -1922907279, now seen corresponding path program 1 times [2022-11-02 20:42:14,844 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:42:14,844 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [74590512] [2022-11-02 20:42:14,844 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:42:14,845 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:42:14,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:42:18,016 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-02 20:42:18,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:42:18,024 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2022-11-02 20:42:18,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:42:18,030 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-11-02 20:42:18,030 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:42:18,030 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [74590512] [2022-11-02 20:42:18,031 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [74590512] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-02 20:42:18,031 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1976823724] [2022-11-02 20:42:18,031 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:42:18,031 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-02 20:42:18,032 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eacac830-ac89-42b6-ba82-d293b55624ad/bin/uautomizer-Dbtcem3rbc/z3 [2022-11-02 20:42:18,033 INFO L229 MonitoredProcess]: Starting monitored process 14 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eacac830-ac89-42b6-ba82-d293b55624ad/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-02 20:42:18,056 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eacac830-ac89-42b6-ba82-d293b55624ad/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2022-11-02 20:42:18,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:42:18,266 INFO L263 TraceCheckSpWp]: Trace formula consists of 291 conjuncts, 74 conjunts are in the unsatisfiable core [2022-11-02 20:42:18,274 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-02 20:42:18,763 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 15 treesize of output 11 [2022-11-02 20:42:18,770 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 15 treesize of output 11 [2022-11-02 20:42:19,023 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-02 20:42:19,025 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 23 [2022-11-02 20:42:19,035 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-02 20:42:19,036 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:42:19,279 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-02 20:42:19,279 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 21 treesize of output 15 [2022-11-02 20:42:19,500 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-02 20:42:19,501 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-02 20:42:19,504 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-02 20:42:19,520 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-02 20:42:19,523 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 56 treesize of output 52 [2022-11-02 20:42:19,846 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:42:19,846 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-02 20:42:20,820 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-02 20:42:20,833 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-02 20:42:20,834 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 142 treesize of output 146 [2022-11-02 20:42:20,840 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-02 20:42:20,853 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-02 20:42:20,853 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 223 treesize of output 225 [2022-11-02 20:42:20,889 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 30 treesize of output 24 [2022-11-02 20:42:21,035 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 8 treesize of output 4 [2022-11-02 20:42:21,045 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-02 20:42:21,064 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-02 20:42:21,065 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 241 treesize of output 243 [2022-11-02 20:42:21,083 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-02 20:42:21,084 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 235 treesize of output 233 [2022-11-02 20:42:22,416 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-11-02 20:42:22,417 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1976823724] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-02 20:42:22,417 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-02 20:42:22,417 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 19, 21] total 58 [2022-11-02 20:42:22,417 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [437324948] [2022-11-02 20:42:22,417 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-02 20:42:22,418 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 58 states [2022-11-02 20:42:22,418 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:42:22,419 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 58 interpolants. [2022-11-02 20:42:22,420 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=237, Invalid=3069, Unknown=0, NotChecked=0, Total=3306 [2022-11-02 20:42:22,420 INFO L87 Difference]: Start difference. First operand 1859 states and 2482 transitions. Second operand has 58 states, 58 states have (on average 2.1551724137931036) internal successors, (125), 56 states have internal predecessors, (125), 6 states have call successors, (6), 3 states have call predecessors, (6), 4 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-11-02 20:42:56,441 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:42:56,441 INFO L93 Difference]: Finished difference Result 6726 states and 8827 transitions. [2022-11-02 20:42:56,442 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 198 states. [2022-11-02 20:42:56,443 INFO L78 Accepts]: Start accepts. Automaton has has 58 states, 58 states have (on average 2.1551724137931036) internal successors, (125), 56 states have internal predecessors, (125), 6 states have call successors, (6), 3 states have call predecessors, (6), 4 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Word has length 49 [2022-11-02 20:42:56,444 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:42:56,492 INFO L225 Difference]: With dead ends: 6726 [2022-11-02 20:42:56,492 INFO L226 Difference]: Without dead ends: 6722 [2022-11-02 20:42:56,500 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 328 GetRequests, 73 SyntacticMatches, 6 SemanticMatches, 249 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21051 ImplicationChecksByTransitivity, 30.9s TimeCoverageRelationStatistics Valid=9666, Invalid=53084, Unknown=0, NotChecked=0, Total=62750 [2022-11-02 20:42:56,500 INFO L413 NwaCegarLoop]: 182 mSDtfsCounter, 6652 mSDsluCounter, 6555 mSDsCounter, 0 mSdLazyCounter, 4723 mSolverCounterSat, 1585 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6654 SdHoareTripleChecker+Valid, 6737 SdHoareTripleChecker+Invalid, 6655 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1585 IncrementalHoareTripleChecker+Valid, 4723 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 347 IncrementalHoareTripleChecker+Unchecked, 5.2s IncrementalHoareTripleChecker+Time [2022-11-02 20:42:56,502 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [6654 Valid, 6737 Invalid, 6655 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1585 Valid, 4723 Invalid, 0 Unknown, 347 Unchecked, 5.2s Time] [2022-11-02 20:42:56,507 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6722 states. [2022-11-02 20:42:56,586 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6722 to 2004. [2022-11-02 20:42:56,588 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2004 states, 1812 states have (on average 1.3322295805739515) internal successors, (2414), 1864 states have internal predecessors, (2414), 88 states have call successors, (88), 39 states have call predecessors, (88), 78 states have return successors, (176), 100 states have call predecessors, (176), 88 states have call successors, (176) [2022-11-02 20:42:56,593 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2004 states to 2004 states and 2678 transitions. [2022-11-02 20:42:56,595 INFO L78 Accepts]: Start accepts. Automaton has 2004 states and 2678 transitions. Word has length 49 [2022-11-02 20:42:56,595 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:42:56,595 INFO L495 AbstractCegarLoop]: Abstraction has 2004 states and 2678 transitions. [2022-11-02 20:42:56,596 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 58 states, 58 states have (on average 2.1551724137931036) internal successors, (125), 56 states have internal predecessors, (125), 6 states have call successors, (6), 3 states have call predecessors, (6), 4 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-11-02 20:42:56,596 INFO L276 IsEmpty]: Start isEmpty. Operand 2004 states and 2678 transitions. [2022-11-02 20:42:56,597 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2022-11-02 20:42:56,597 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:42:56,597 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:42:56,645 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eacac830-ac89-42b6-ba82-d293b55624ad/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Forceful destruction successful, exit code 0 [2022-11-02 20:42:56,812 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable63,14 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eacac830-ac89-42b6-ba82-d293b55624ad/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-02 20:42:56,812 INFO L420 AbstractCegarLoop]: === Iteration 65 === Targeting ULTIMATE.startErr54ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 54 more)] === [2022-11-02 20:42:56,813 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:42:56,813 INFO L85 PathProgramCache]: Analyzing trace with hash 904339398, now seen corresponding path program 1 times [2022-11-02 20:42:56,814 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:42:56,814 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2084997976] [2022-11-02 20:42:56,814 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:42:56,814 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:42:56,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:42:57,823 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-02 20:42:57,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:42:57,848 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:42:57,848 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:42:57,849 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2084997976] [2022-11-02 20:42:57,849 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2084997976] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:42:57,849 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:42:57,849 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2022-11-02 20:42:57,849 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2143684958] [2022-11-02 20:42:57,849 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:42:57,850 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-11-02 20:42:57,850 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:42:57,850 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-11-02 20:42:57,851 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=193, Unknown=0, NotChecked=0, Total=240 [2022-11-02 20:42:57,851 INFO L87 Difference]: Start difference. First operand 2004 states and 2678 transitions. Second operand has 16 states, 15 states have (on average 3.066666666666667) internal successors, (46), 15 states have internal predecessors, (46), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-11-02 20:42:59,460 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:42:59,460 INFO L93 Difference]: Finished difference Result 2449 states and 3206 transitions. [2022-11-02 20:42:59,460 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2022-11-02 20:42:59,460 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 15 states have (on average 3.066666666666667) internal successors, (46), 15 states have internal predecessors, (46), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 48 [2022-11-02 20:42:59,461 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:42:59,466 INFO L225 Difference]: With dead ends: 2449 [2022-11-02 20:42:59,466 INFO L226 Difference]: Without dead ends: 2449 [2022-11-02 20:42:59,467 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 264 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=277, Invalid=983, Unknown=0, NotChecked=0, Total=1260 [2022-11-02 20:42:59,468 INFO L413 NwaCegarLoop]: 197 mSDtfsCounter, 1376 mSDsluCounter, 1101 mSDsCounter, 0 mSdLazyCounter, 606 mSolverCounterSat, 84 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1376 SdHoareTripleChecker+Valid, 1298 SdHoareTripleChecker+Invalid, 690 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 84 IncrementalHoareTripleChecker+Valid, 606 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-11-02 20:42:59,468 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1376 Valid, 1298 Invalid, 690 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [84 Valid, 606 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-11-02 20:42:59,470 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2449 states. [2022-11-02 20:42:59,508 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2449 to 2004. [2022-11-02 20:42:59,510 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2004 states, 1812 states have (on average 1.3322295805739515) internal successors, (2414), 1864 states have internal predecessors, (2414), 88 states have call successors, (88), 39 states have call predecessors, (88), 78 states have return successors, (176), 100 states have call predecessors, (176), 88 states have call successors, (176) [2022-11-02 20:42:59,515 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2004 states to 2004 states and 2678 transitions. [2022-11-02 20:42:59,515 INFO L78 Accepts]: Start accepts. Automaton has 2004 states and 2678 transitions. Word has length 48 [2022-11-02 20:42:59,516 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:42:59,516 INFO L495 AbstractCegarLoop]: Abstraction has 2004 states and 2678 transitions. [2022-11-02 20:42:59,516 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 15 states have (on average 3.066666666666667) internal successors, (46), 15 states have internal predecessors, (46), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-11-02 20:42:59,516 INFO L276 IsEmpty]: Start isEmpty. Operand 2004 states and 2678 transitions. [2022-11-02 20:42:59,517 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2022-11-02 20:42:59,517 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:42:59,517 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:42:59,517 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable64 [2022-11-02 20:42:59,518 INFO L420 AbstractCegarLoop]: === Iteration 66 === Targeting ULTIMATE.startErr54ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 54 more)] === [2022-11-02 20:42:59,518 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:42:59,518 INFO L85 PathProgramCache]: Analyzing trace with hash 1713686024, now seen corresponding path program 1 times [2022-11-02 20:42:59,518 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:42:59,519 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1471505862] [2022-11-02 20:42:59,519 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:42:59,519 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:42:59,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:43:00,126 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-02 20:43:00,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:43:00,129 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:43:00,130 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:43:00,130 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1471505862] [2022-11-02 20:43:00,130 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1471505862] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:43:00,130 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:43:00,130 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2022-11-02 20:43:00,131 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1416344272] [2022-11-02 20:43:00,131 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:43:00,131 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-11-02 20:43:00,131 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:43:00,132 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-11-02 20:43:00,132 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=141, Unknown=0, NotChecked=0, Total=182 [2022-11-02 20:43:00,132 INFO L87 Difference]: Start difference. First operand 2004 states and 2678 transitions. Second operand has 14 states, 13 states have (on average 3.5384615384615383) internal successors, (46), 14 states have internal predecessors, (46), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-11-02 20:43:01,350 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:43:01,351 INFO L93 Difference]: Finished difference Result 2203 states and 2877 transitions. [2022-11-02 20:43:01,351 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2022-11-02 20:43:01,351 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 3.5384615384615383) internal successors, (46), 14 states have internal predecessors, (46), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 48 [2022-11-02 20:43:01,351 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:43:01,354 INFO L225 Difference]: With dead ends: 2203 [2022-11-02 20:43:01,354 INFO L226 Difference]: Without dead ends: 2203 [2022-11-02 20:43:01,354 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 81 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=237, Invalid=519, Unknown=0, NotChecked=0, Total=756 [2022-11-02 20:43:01,354 INFO L413 NwaCegarLoop]: 194 mSDtfsCounter, 702 mSDsluCounter, 745 mSDsCounter, 0 mSdLazyCounter, 520 mSolverCounterSat, 46 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 702 SdHoareTripleChecker+Valid, 939 SdHoareTripleChecker+Invalid, 566 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 46 IncrementalHoareTripleChecker+Valid, 520 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-11-02 20:43:01,354 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [702 Valid, 939 Invalid, 566 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [46 Valid, 520 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-11-02 20:43:01,355 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2203 states. [2022-11-02 20:43:01,389 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2203 to 1991. [2022-11-02 20:43:01,392 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1991 states, 1799 states have (on average 1.3329627570872706) internal successors, (2398), 1851 states have internal predecessors, (2398), 88 states have call successors, (88), 39 states have call predecessors, (88), 78 states have return successors, (176), 100 states have call predecessors, (176), 88 states have call successors, (176) [2022-11-02 20:43:01,396 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1991 states to 1991 states and 2662 transitions. [2022-11-02 20:43:01,397 INFO L78 Accepts]: Start accepts. Automaton has 1991 states and 2662 transitions. Word has length 48 [2022-11-02 20:43:01,397 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:43:01,397 INFO L495 AbstractCegarLoop]: Abstraction has 1991 states and 2662 transitions. [2022-11-02 20:43:01,397 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 3.5384615384615383) internal successors, (46), 14 states have internal predecessors, (46), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-11-02 20:43:01,398 INFO L276 IsEmpty]: Start isEmpty. Operand 1991 states and 2662 transitions. [2022-11-02 20:43:01,398 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2022-11-02 20:43:01,399 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:43:01,399 INFO L195 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:43:01,399 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable65 [2022-11-02 20:43:01,399 INFO L420 AbstractCegarLoop]: === Iteration 67 === Targeting ULTIMATE.startErr25ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 54 more)] === [2022-11-02 20:43:01,400 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:43:01,400 INFO L85 PathProgramCache]: Analyzing trace with hash -1600129367, now seen corresponding path program 1 times [2022-11-02 20:43:01,400 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:43:01,400 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [351783461] [2022-11-02 20:43:01,400 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:43:01,401 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:43:01,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:43:03,219 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-02 20:43:03,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:43:03,252 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2022-11-02 20:43:03,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:43:03,256 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-11-02 20:43:03,256 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:43:03,256 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [351783461] [2022-11-02 20:43:03,256 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [351783461] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-02 20:43:03,256 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [768181596] [2022-11-02 20:43:03,256 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:43:03,256 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-02 20:43:03,257 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eacac830-ac89-42b6-ba82-d293b55624ad/bin/uautomizer-Dbtcem3rbc/z3 [2022-11-02 20:43:03,257 INFO L229 MonitoredProcess]: Starting monitored process 15 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eacac830-ac89-42b6-ba82-d293b55624ad/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-02 20:43:03,259 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eacac830-ac89-42b6-ba82-d293b55624ad/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2022-11-02 20:43:03,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:43:03,431 INFO L263 TraceCheckSpWp]: Trace formula consists of 294 conjuncts, 55 conjunts are in the unsatisfiable core [2022-11-02 20:43:03,434 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-02 20:43:03,897 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 15 treesize of output 11 [2022-11-02 20:43:03,985 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-02 20:43:03,986 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 23 [2022-11-02 20:43:04,290 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-02 20:43:04,291 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-02 20:43:04,293 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-02 20:43:04,308 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-02 20:43:04,308 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 56 treesize of output 52 [2022-11-02 20:43:04,568 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:43:04,568 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-02 20:43:05,214 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 88 treesize of output 82 [2022-11-02 20:43:05,248 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-02 20:43:05,258 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 88 treesize of output 82 [2022-11-02 20:43:06,232 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-11-02 20:43:06,233 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [768181596] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-02 20:43:06,233 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-02 20:43:06,233 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 17, 19] total 54 [2022-11-02 20:43:06,233 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1895261943] [2022-11-02 20:43:06,233 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-02 20:43:06,233 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 54 states [2022-11-02 20:43:06,234 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:43:06,234 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 54 interpolants. [2022-11-02 20:43:06,235 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=212, Invalid=2650, Unknown=0, NotChecked=0, Total=2862 [2022-11-02 20:43:06,235 INFO L87 Difference]: Start difference. First operand 1991 states and 2662 transitions. Second operand has 54 states, 54 states have (on average 2.4074074074074074) internal successors, (130), 51 states have internal predecessors, (130), 6 states have call successors, (6), 3 states have call predecessors, (6), 5 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-11-02 20:43:19,693 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:43:19,694 INFO L93 Difference]: Finished difference Result 4712 states and 6190 transitions. [2022-11-02 20:43:19,694 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 69 states. [2022-11-02 20:43:19,695 INFO L78 Accepts]: Start accepts. Automaton has has 54 states, 54 states have (on average 2.4074074074074074) internal successors, (130), 51 states have internal predecessors, (130), 6 states have call successors, (6), 3 states have call predecessors, (6), 5 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Word has length 50 [2022-11-02 20:43:19,695 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:43:19,701 INFO L225 Difference]: With dead ends: 4712 [2022-11-02 20:43:19,702 INFO L226 Difference]: Without dead ends: 4708 [2022-11-02 20:43:19,704 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 188 GetRequests, 71 SyntacticMatches, 1 SemanticMatches, 116 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3426 ImplicationChecksByTransitivity, 10.4s TimeCoverageRelationStatistics Valid=2527, Invalid=11279, Unknown=0, NotChecked=0, Total=13806 [2022-11-02 20:43:19,708 INFO L413 NwaCegarLoop]: 358 mSDtfsCounter, 4745 mSDsluCounter, 11267 mSDsCounter, 0 mSdLazyCounter, 5635 mSolverCounterSat, 487 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4745 SdHoareTripleChecker+Valid, 11625 SdHoareTripleChecker+Invalid, 6122 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 487 IncrementalHoareTripleChecker+Valid, 5635 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.8s IncrementalHoareTripleChecker+Time [2022-11-02 20:43:19,710 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4745 Valid, 11625 Invalid, 6122 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [487 Valid, 5635 Invalid, 0 Unknown, 0 Unchecked, 4.8s Time] [2022-11-02 20:43:19,713 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4708 states. [2022-11-02 20:43:19,776 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4708 to 1911. [2022-11-02 20:43:19,778 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1911 states, 1727 states have (on average 1.3231036479444123) internal successors, (2285), 1777 states have internal predecessors, (2285), 84 states have call successors, (84), 37 states have call predecessors, (84), 74 states have return successors, (168), 96 states have call predecessors, (168), 84 states have call successors, (168) [2022-11-02 20:43:19,782 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1911 states to 1911 states and 2537 transitions. [2022-11-02 20:43:19,783 INFO L78 Accepts]: Start accepts. Automaton has 1911 states and 2537 transitions. Word has length 50 [2022-11-02 20:43:19,783 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:43:19,783 INFO L495 AbstractCegarLoop]: Abstraction has 1911 states and 2537 transitions. [2022-11-02 20:43:19,783 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 54 states, 54 states have (on average 2.4074074074074074) internal successors, (130), 51 states have internal predecessors, (130), 6 states have call successors, (6), 3 states have call predecessors, (6), 5 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-11-02 20:43:19,784 INFO L276 IsEmpty]: Start isEmpty. Operand 1911 states and 2537 transitions. [2022-11-02 20:43:19,784 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2022-11-02 20:43:19,784 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:43:19,785 INFO L195 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:43:19,833 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eacac830-ac89-42b6-ba82-d293b55624ad/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Forceful destruction successful, exit code 0 [2022-11-02 20:43:20,000 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable66,15 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eacac830-ac89-42b6-ba82-d293b55624ad/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-02 20:43:20,000 INFO L420 AbstractCegarLoop]: === Iteration 68 === Targeting ULTIMATE.startErr51REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 54 more)] === [2022-11-02 20:43:20,001 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:43:20,001 INFO L85 PathProgramCache]: Analyzing trace with hash 1724221356, now seen corresponding path program 1 times [2022-11-02 20:43:20,001 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:43:20,001 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2101868841] [2022-11-02 20:43:20,001 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:43:20,001 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:43:20,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:43:22,677 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-02 20:43:22,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:43:22,719 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:43:22,719 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:43:22,720 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2101868841] [2022-11-02 20:43:22,720 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2101868841] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-02 20:43:22,720 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [800010580] [2022-11-02 20:43:22,720 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:43:22,720 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-02 20:43:22,721 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eacac830-ac89-42b6-ba82-d293b55624ad/bin/uautomizer-Dbtcem3rbc/z3 [2022-11-02 20:43:22,725 INFO L229 MonitoredProcess]: Starting monitored process 16 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eacac830-ac89-42b6-ba82-d293b55624ad/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-02 20:43:22,752 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eacac830-ac89-42b6-ba82-d293b55624ad/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2022-11-02 20:43:22,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:43:22,927 INFO L263 TraceCheckSpWp]: Trace formula consists of 285 conjuncts, 66 conjunts are in the unsatisfiable core [2022-11-02 20:43:22,930 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-02 20:43:23,114 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-11-02 20:43:23,114 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:43:23,319 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 15 treesize of output 11 [2022-11-02 20:43:23,328 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 15 treesize of output 11 [2022-11-02 20:43:23,426 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-02 20:43:23,427 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 21 treesize of output 20 [2022-11-02 20:43:23,440 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-02 20:43:23,442 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 21 treesize of output 20 [2022-11-02 20:43:23,804 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-02 20:43:23,807 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 16 treesize of output 18 [2022-11-02 20:43:23,817 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-02 20:43:23,819 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 16 treesize of output 18 [2022-11-02 20:43:24,021 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 25 treesize of output 24 [2022-11-02 20:43:24,028 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 24 treesize of output 26 [2022-11-02 20:43:24,791 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-02 20:43:24,793 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-02 20:43:24,806 INFO L356 Elim1Store]: treesize reduction 25, result has 24.2 percent of original size [2022-11-02 20:43:24,806 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 5 case distinctions, treesize of input 85 treesize of output 45 [2022-11-02 20:43:24,820 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-02 20:43:24,821 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 1 case distinctions, treesize of input 21 treesize of output 15 [2022-11-02 20:43:24,887 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:43:24,888 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-02 20:43:25,264 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse3 (* ~unnamed1~0~LIST_END 4))) (let ((.cse0 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_append_one_~list#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_append_one_~list#1.base|) (+ .cse3 |c_ULTIMATE.start_append_one_~list#1.offset|) |c_ULTIMATE.start_append_one_~item~1#1.base|)))) (let ((.cse1 (select (select .cse0 |c_~#list~0.base|) (+ |c_~#list~0.offset| .cse3))) (.cse2 (* ~unnamed2~0~ITEM_PREV 4))) (and (= (select (select .cse0 .cse1) .cse2) 0) (forall ((v_ArrVal_1526 (Array Int Int))) (= (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_append_one_~list#1.base| v_ArrVal_1526) .cse1) .cse2) 0)))))) is different from false [2022-11-02 20:43:25,417 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-02 20:43:25,417 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 37 treesize of output 34 [2022-11-02 20:43:25,429 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-02 20:43:25,430 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 30 treesize of output 34 [2022-11-02 20:43:26,342 INFO L356 Elim1Store]: treesize reduction 18, result has 62.5 percent of original size [2022-11-02 20:43:26,342 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 57 treesize of output 70 [2022-11-02 20:43:26,368 INFO L356 Elim1Store]: treesize reduction 18, result has 62.5 percent of original size [2022-11-02 20:43:26,368 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 40 treesize of output 53 [2022-11-02 20:43:26,382 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-02 20:43:26,382 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 67 treesize of output 70 [2022-11-02 20:43:26,395 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-02 20:43:26,395 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 33 treesize of output 29 [2022-11-02 20:43:26,427 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-02 20:43:26,427 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 3 new quantified variables, introduced 3 case distinctions, treesize of input 81 treesize of output 103 [2022-11-02 20:43:26,436 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 50 treesize of output 42 [2022-11-02 20:43:27,067 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-02 20:43:27,073 INFO L356 Elim1Store]: treesize reduction 22, result has 4.3 percent of original size [2022-11-02 20:43:27,073 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 1 new quantified variables, introduced 2 case distinctions, treesize of input 57 treesize of output 1 [2022-11-02 20:43:28,145 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [800010580] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-02 20:43:28,146 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-02 20:43:28,146 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 19] total 41 [2022-11-02 20:43:28,146 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1780333113] [2022-11-02 20:43:28,146 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-02 20:43:28,147 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 41 states [2022-11-02 20:43:28,147 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:43:28,147 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2022-11-02 20:43:28,148 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=164, Invalid=2793, Unknown=17, NotChecked=106, Total=3080 [2022-11-02 20:43:28,148 INFO L87 Difference]: Start difference. First operand 1911 states and 2537 transitions. Second operand has 41 states, 41 states have (on average 2.1951219512195124) internal successors, (90), 40 states have internal predecessors, (90), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-11-02 20:43:36,532 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:43:36,532 INFO L93 Difference]: Finished difference Result 4042 states and 5422 transitions. [2022-11-02 20:43:36,533 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2022-11-02 20:43:36,533 INFO L78 Accepts]: Start accepts. Automaton has has 41 states, 41 states have (on average 2.1951219512195124) internal successors, (90), 40 states have internal predecessors, (90), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 50 [2022-11-02 20:43:36,533 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:43:36,538 INFO L225 Difference]: With dead ends: 4042 [2022-11-02 20:43:36,538 INFO L226 Difference]: Without dead ends: 4042 [2022-11-02 20:43:36,539 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 153 GetRequests, 62 SyntacticMatches, 4 SemanticMatches, 87 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 1710 ImplicationChecksByTransitivity, 8.8s TimeCoverageRelationStatistics Valid=994, Invalid=6649, Unknown=17, NotChecked=172, Total=7832 [2022-11-02 20:43:36,539 INFO L413 NwaCegarLoop]: 256 mSDtfsCounter, 1672 mSDsluCounter, 6586 mSDsCounter, 0 mSdLazyCounter, 3178 mSolverCounterSat, 298 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1680 SdHoareTripleChecker+Valid, 6842 SdHoareTripleChecker+Invalid, 3814 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 298 IncrementalHoareTripleChecker+Valid, 3178 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 338 IncrementalHoareTripleChecker+Unchecked, 3.3s IncrementalHoareTripleChecker+Time [2022-11-02 20:43:36,540 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1680 Valid, 6842 Invalid, 3814 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [298 Valid, 3178 Invalid, 0 Unknown, 338 Unchecked, 3.3s Time] [2022-11-02 20:43:36,543 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4042 states. [2022-11-02 20:43:36,604 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4042 to 2953. [2022-11-02 20:43:36,607 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2953 states, 2691 states have (on average 1.3232998885172798) internal successors, (3561), 2754 states have internal predecessors, (3561), 132 states have call successors, (132), 52 states have call predecessors, (132), 104 states have return successors, (264), 146 states have call predecessors, (264), 132 states have call successors, (264) [2022-11-02 20:43:36,613 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2953 states to 2953 states and 3957 transitions. [2022-11-02 20:43:36,614 INFO L78 Accepts]: Start accepts. Automaton has 2953 states and 3957 transitions. Word has length 50 [2022-11-02 20:43:36,614 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:43:36,614 INFO L495 AbstractCegarLoop]: Abstraction has 2953 states and 3957 transitions. [2022-11-02 20:43:36,615 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 41 states, 41 states have (on average 2.1951219512195124) internal successors, (90), 40 states have internal predecessors, (90), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-11-02 20:43:36,615 INFO L276 IsEmpty]: Start isEmpty. Operand 2953 states and 3957 transitions. [2022-11-02 20:43:36,616 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2022-11-02 20:43:36,616 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:43:36,616 INFO L195 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:43:36,655 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eacac830-ac89-42b6-ba82-d293b55624ad/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Forceful destruction successful, exit code 0 [2022-11-02 20:43:36,844 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eacac830-ac89-42b6-ba82-d293b55624ad/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable67 [2022-11-02 20:43:36,844 INFO L420 AbstractCegarLoop]: === Iteration 69 === Targeting ULTIMATE.startErr51REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 54 more)] === [2022-11-02 20:43:36,845 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:43:36,845 INFO L85 PathProgramCache]: Analyzing trace with hash 1023156778, now seen corresponding path program 1 times [2022-11-02 20:43:36,845 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:43:36,845 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1905088451] [2022-11-02 20:43:36,845 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:43:36,845 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:43:36,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:43:40,561 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-02 20:43:40,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:43:40,603 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:43:40,603 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:43:40,603 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1905088451] [2022-11-02 20:43:40,604 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1905088451] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-02 20:43:40,604 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [827901861] [2022-11-02 20:43:40,604 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:43:40,604 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-02 20:43:40,604 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eacac830-ac89-42b6-ba82-d293b55624ad/bin/uautomizer-Dbtcem3rbc/z3 [2022-11-02 20:43:40,605 INFO L229 MonitoredProcess]: Starting monitored process 17 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eacac830-ac89-42b6-ba82-d293b55624ad/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-02 20:43:40,606 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eacac830-ac89-42b6-ba82-d293b55624ad/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Waiting until timeout for monitored process [2022-11-02 20:43:40,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:43:40,790 INFO L263 TraceCheckSpWp]: Trace formula consists of 284 conjuncts, 87 conjunts are in the unsatisfiable core [2022-11-02 20:43:40,794 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-02 20:43:41,094 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-11-02 20:43:41,094 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:43:41,323 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 15 treesize of output 11 [2022-11-02 20:43:41,339 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 15 treesize of output 11 [2022-11-02 20:43:41,475 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-02 20:43:41,476 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 27 treesize of output 26 [2022-11-02 20:43:41,487 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-02 20:43:41,488 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 27 treesize of output 26 [2022-11-02 20:43:41,602 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-02 20:43:41,603 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 21 treesize of output 20 [2022-11-02 20:43:41,615 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-02 20:43:41,616 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 21 treesize of output 20 [2022-11-02 20:43:42,084 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-02 20:43:42,085 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 25 treesize of output 24 [2022-11-02 20:43:42,095 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-02 20:43:42,096 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 24 treesize of output 26 [2022-11-02 20:43:42,258 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-02 20:43:42,260 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-02 20:43:42,268 INFO L356 Elim1Store]: treesize reduction 19, result has 32.1 percent of original size [2022-11-02 20:43:42,269 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 62 treesize of output 51 [2022-11-02 20:43:42,277 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 24 treesize of output 26 [2022-11-02 20:43:42,744 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-02 20:43:42,745 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 1 case distinctions, treesize of input 33 treesize of output 15 [2022-11-02 20:43:42,748 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-02 20:43:42,757 INFO L356 Elim1Store]: treesize reduction 19, result has 29.6 percent of original size [2022-11-02 20:43:42,757 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 3 case distinctions, treesize of input 43 treesize of output 22 [2022-11-02 20:43:42,824 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:43:42,825 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-02 20:43:43,356 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse2 (+ |c_~#list~0.offset| (* ~unnamed1~0~LIST_BEG 4))) (.cse0 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_append_one_~list#1.base|)) (.cse1 (+ (* ~unnamed1~0~LIST_END 4) |c_ULTIMATE.start_append_one_~list#1.offset|))) (and (forall ((v_ArrVal_1611 (Array Int Int)) (v_ArrVal_1609 Int)) (= (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_append_one_~list#1.base| v_ArrVal_1611) (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_append_one_~list#1.base| (store .cse0 .cse1 v_ArrVal_1609)) |c_~#list~0.base|) .cse2)) 4) 0)) (forall ((v_ArrVal_1609 Int)) (= (select (let ((.cse3 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_append_one_~list#1.base| (store .cse0 .cse1 v_ArrVal_1609)))) (select .cse3 (select (select .cse3 |c_~#list~0.base|) .cse2))) 4) 0)))) is different from false [2022-11-02 20:43:47,049 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 68830 treesize of output 68574 [2022-11-02 20:43:47,378 INFO L356 Elim1Store]: treesize reduction 62, result has 47.9 percent of original size [2022-11-02 20:43:47,379 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 3 case distinctions, treesize of input 68574 treesize of output 44054 [2022-11-02 20:43:48,075 INFO L356 Elim1Store]: treesize reduction 150, result has 51.1 percent of original size [2022-11-02 20:43:48,076 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 8 select indices, 8 select index equivalence classes, 0 disjoint index pairs (out of 28 index pairs), introduced 8 new quantified variables, introduced 28 case distinctions, treesize of input 56332 treesize of output 52376 [2022-11-02 20:43:48,322 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 52190 treesize of output 50142