./Ultimate.py --spec ../../sv-benchmarks/c/properties/valid-memsafety.prp --file ../../sv-benchmarks/c/memsafety/test-0504.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 38b53e6a 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_566ce540-1391-469b-bbbb-cc92d0ef0a3d/bin/uautomizer-ZsLfNo2U6R/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_566ce540-1391-469b-bbbb-cc92d0ef0a3d/bin/uautomizer-ZsLfNo2U6R/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_566ce540-1391-469b-bbbb-cc92d0ef0a3d/bin/uautomizer-ZsLfNo2U6R/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_566ce540-1391-469b-bbbb-cc92d0ef0a3d/bin/uautomizer-ZsLfNo2U6R/config/AutomizerMemDerefMemtrack.xml -i ../../sv-benchmarks/c/memsafety/test-0504.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_566ce540-1391-469b-bbbb-cc92d0ef0a3d/bin/uautomizer-ZsLfNo2U6R/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_566ce540-1391-469b-bbbb-cc92d0ef0a3d/bin/uautomizer-ZsLfNo2U6R --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 cddde357ab55a506b6049f3b60959cd723bf2cbfd36f7774fe3606d53024bbf3 --- 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-38b53e6 [2022-11-25 16:53:30,840 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-25 16:53:30,848 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-25 16:53:30,870 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-25 16:53:30,873 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-25 16:53:30,875 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-25 16:53:30,876 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-25 16:53:30,878 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-25 16:53:30,880 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-25 16:53:30,881 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-25 16:53:30,883 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-25 16:53:30,884 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-25 16:53:30,884 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-25 16:53:30,886 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-25 16:53:30,887 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-25 16:53:30,888 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-25 16:53:30,889 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-25 16:53:30,890 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-25 16:53:30,892 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-25 16:53:30,894 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-25 16:53:30,896 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-25 16:53:30,897 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-25 16:53:30,899 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-25 16:53:30,900 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-25 16:53:30,904 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-25 16:53:30,904 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-25 16:53:30,905 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-25 16:53:30,906 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-25 16:53:30,907 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-25 16:53:30,908 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-25 16:53:30,909 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-25 16:53:30,910 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-25 16:53:30,911 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-25 16:53:30,913 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-25 16:53:30,914 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-25 16:53:30,915 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-25 16:53:30,916 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-25 16:53:30,916 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-25 16:53:30,916 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-25 16:53:30,918 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-25 16:53:30,919 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-25 16:53:30,920 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_566ce540-1391-469b-bbbb-cc92d0ef0a3d/bin/uautomizer-ZsLfNo2U6R/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2022-11-25 16:53:30,962 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-25 16:53:30,964 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-25 16:53:30,965 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-25 16:53:30,965 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-25 16:53:30,966 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-11-25 16:53:30,967 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-11-25 16:53:30,968 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-11-25 16:53:30,968 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-11-25 16:53:30,968 INFO L138 SettingsManager]: * Use SBE=true [2022-11-25 16:53:30,969 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-25 16:53:30,970 INFO L138 SettingsManager]: * sizeof long=4 [2022-11-25 16:53:30,970 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-11-25 16:53:30,971 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-11-25 16:53:30,971 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-11-25 16:53:30,971 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-25 16:53:30,972 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2022-11-25 16:53:30,972 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2022-11-25 16:53:30,972 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2022-11-25 16:53:30,972 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-11-25 16:53:30,973 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-11-25 16:53:30,973 INFO L138 SettingsManager]: * sizeof long double=12 [2022-11-25 16:53:30,973 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-25 16:53:30,974 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-25 16:53:30,974 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-11-25 16:53:30,974 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-11-25 16:53:30,974 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-25 16:53:30,975 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-25 16:53:30,975 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-11-25 16:53:30,976 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-11-25 16:53:30,976 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-11-25 16:53:30,977 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-11-25 16:53:30,977 INFO L138 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2022-11-25 16:53:30,977 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-11-25 16:53:30,978 INFO L138 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC 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_566ce540-1391-469b-bbbb-cc92d0ef0a3d/bin/uautomizer-ZsLfNo2U6R/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_566ce540-1391-469b-bbbb-cc92d0ef0a3d/bin/uautomizer-ZsLfNo2U6R 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 -> cddde357ab55a506b6049f3b60959cd723bf2cbfd36f7774fe3606d53024bbf3 [2022-11-25 16:53:31,386 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-25 16:53:31,429 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-25 16:53:31,432 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-25 16:53:31,433 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-25 16:53:31,434 INFO L275 PluginConnector]: CDTParser initialized [2022-11-25 16:53:31,436 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_566ce540-1391-469b-bbbb-cc92d0ef0a3d/bin/uautomizer-ZsLfNo2U6R/../../sv-benchmarks/c/memsafety/test-0504.i [2022-11-25 16:53:34,739 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-11-25 16:53:35,045 INFO L351 CDTParser]: Found 1 translation units. [2022-11-25 16:53:35,046 INFO L172 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_566ce540-1391-469b-bbbb-cc92d0ef0a3d/sv-benchmarks/c/memsafety/test-0504.i [2022-11-25 16:53:35,067 INFO L394 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_566ce540-1391-469b-bbbb-cc92d0ef0a3d/bin/uautomizer-ZsLfNo2U6R/data/099e377a8/c001c7728b404082b8f75e912b9b2800/FLAGa7cdcd0b2 [2022-11-25 16:53:35,093 INFO L402 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_566ce540-1391-469b-bbbb-cc92d0ef0a3d/bin/uautomizer-ZsLfNo2U6R/data/099e377a8/c001c7728b404082b8f75e912b9b2800 [2022-11-25 16:53:35,100 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-25 16:53:35,104 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-25 16:53:35,110 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-25 16:53:35,110 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-25 16:53:35,115 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-25 16:53:35,116 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.11 04:53:35" (1/1) ... [2022-11-25 16:53:35,118 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@19b1380c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 04:53:35, skipping insertion in model container [2022-11-25 16:53:35,118 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.11 04:53:35" (1/1) ... [2022-11-25 16:53:35,129 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-25 16:53:35,171 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-25 16:53:35,497 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-25 16:53:35,510 INFO L203 MainTranslator]: Completed pre-run [2022-11-25 16:53:35,564 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-25 16:53:35,608 INFO L208 MainTranslator]: Completed translation [2022-11-25 16:53:35,608 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 04:53:35 WrapperNode [2022-11-25 16:53:35,609 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-25 16:53:35,610 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-11-25 16:53:35,610 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-11-25 16:53:35,611 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-11-25 16:53:35,621 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 04:53:35" (1/1) ... [2022-11-25 16:53:35,639 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 04:53:35" (1/1) ... [2022-11-25 16:53:35,668 INFO L138 Inliner]: procedures = 123, calls = 27, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 86 [2022-11-25 16:53:35,669 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-11-25 16:53:35,670 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-11-25 16:53:35,670 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-11-25 16:53:35,670 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-11-25 16:53:35,683 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 04:53:35" (1/1) ... [2022-11-25 16:53:35,683 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 04:53:35" (1/1) ... [2022-11-25 16:53:35,688 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 04:53:35" (1/1) ... [2022-11-25 16:53:35,688 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 04:53:35" (1/1) ... [2022-11-25 16:53:35,697 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 04:53:35" (1/1) ... [2022-11-25 16:53:35,703 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 04:53:35" (1/1) ... [2022-11-25 16:53:35,705 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 04:53:35" (1/1) ... [2022-11-25 16:53:35,707 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 04:53:35" (1/1) ... [2022-11-25 16:53:35,710 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-11-25 16:53:35,711 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-11-25 16:53:35,711 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-11-25 16:53:35,712 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-11-25 16:53:35,713 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 04:53:35" (1/1) ... [2022-11-25 16:53:35,722 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-25 16:53:35,746 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_566ce540-1391-469b-bbbb-cc92d0ef0a3d/bin/uautomizer-ZsLfNo2U6R/z3 [2022-11-25 16:53:35,763 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_566ce540-1391-469b-bbbb-cc92d0ef0a3d/bin/uautomizer-ZsLfNo2U6R/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-11-25 16:53:35,799 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_566ce540-1391-469b-bbbb-cc92d0ef0a3d/bin/uautomizer-ZsLfNo2U6R/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-11-25 16:53:35,833 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-11-25 16:53:35,834 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-11-25 16:53:35,834 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-11-25 16:53:35,834 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-11-25 16:53:35,835 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-11-25 16:53:35,835 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-11-25 16:53:35,836 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-11-25 16:53:35,837 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-11-25 16:53:35,837 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-11-25 16:53:35,973 INFO L235 CfgBuilder]: Building ICFG [2022-11-25 16:53:35,976 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-11-25 16:53:36,410 INFO L276 CfgBuilder]: Performing block encoding [2022-11-25 16:53:36,422 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-11-25 16:53:36,435 INFO L300 CfgBuilder]: Removed 4 assume(true) statements. [2022-11-25 16:53:36,438 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.11 04:53:36 BoogieIcfgContainer [2022-11-25 16:53:36,438 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-11-25 16:53:36,442 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-11-25 16:53:36,442 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-11-25 16:53:36,447 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-11-25 16:53:36,456 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 25.11 04:53:35" (1/3) ... [2022-11-25 16:53:36,457 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3a9bf24c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.11 04:53:36, skipping insertion in model container [2022-11-25 16:53:36,458 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 04:53:35" (2/3) ... [2022-11-25 16:53:36,458 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3a9bf24c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.11 04:53:36, skipping insertion in model container [2022-11-25 16:53:36,459 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.11 04:53:36" (3/3) ... [2022-11-25 16:53:36,461 INFO L112 eAbstractionObserver]: Analyzing ICFG test-0504.i [2022-11-25 16:53:36,507 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-11-25 16:53:36,519 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 41 error locations. [2022-11-25 16:53:36,610 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-11-25 16:53:36,619 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=PETRI_NET, 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;@418b1b2, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-25 16:53:36,619 INFO L358 AbstractCegarLoop]: Starting to check reachability of 41 error locations. [2022-11-25 16:53:36,627 INFO L276 IsEmpty]: Start isEmpty. Operand has 87 states, 45 states have (on average 2.1555555555555554) internal successors, (97), 86 states have internal predecessors, (97), 0 states have call successors, (0), 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-25 16:53:36,636 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2022-11-25 16:53:36,636 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 16:53:36,636 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2022-11-25 16:53:36,637 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr28REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 38 more)] === [2022-11-25 16:53:36,642 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 16:53:36,643 INFO L85 PathProgramCache]: Analyzing trace with hash 28780379, now seen corresponding path program 1 times [2022-11-25 16:53:36,652 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 16:53:36,653 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1534005606] [2022-11-25 16:53:36,653 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 16:53:36,654 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 16:53:36,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 16:53:36,835 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-25 16:53:36,835 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 16:53:36,836 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1534005606] [2022-11-25 16:53:36,837 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1534005606] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 16:53:36,838 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 16:53:36,838 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-25 16:53:36,840 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1446509108] [2022-11-25 16:53:36,842 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 16:53:36,849 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-11-25 16:53:36,851 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 16:53:36,911 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-11-25 16:53:36,912 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-11-25 16:53:36,916 INFO L87 Difference]: Start difference. First operand has 87 states, 45 states have (on average 2.1555555555555554) internal successors, (97), 86 states have internal predecessors, (97), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 2 states, 2 states have (on average 2.5) internal successors, (5), 2 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 16:53:36,968 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 16:53:36,969 INFO L93 Difference]: Finished difference Result 87 states and 91 transitions. [2022-11-25 16:53:36,974 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-25 16:53:36,976 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 2.5) internal successors, (5), 2 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 5 [2022-11-25 16:53:36,976 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 16:53:37,002 INFO L225 Difference]: With dead ends: 87 [2022-11-25 16:53:37,002 INFO L226 Difference]: Without dead ends: 85 [2022-11-25 16:53:37,004 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-25 16:53:37,008 INFO L413 NwaCegarLoop]: 91 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, 91 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-25 16:53:37,015 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 91 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-25 16:53:37,040 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2022-11-25 16:53:37,059 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 85. [2022-11-25 16:53:37,061 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 85 states, 44 states have (on average 2.022727272727273) internal successors, (89), 84 states have internal predecessors, (89), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 16:53:37,064 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 89 transitions. [2022-11-25 16:53:37,065 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 89 transitions. Word has length 5 [2022-11-25 16:53:37,066 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 16:53:37,066 INFO L495 AbstractCegarLoop]: Abstraction has 85 states and 89 transitions. [2022-11-25 16:53:37,066 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 2.5) internal successors, (5), 2 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 16:53:37,067 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 89 transitions. [2022-11-25 16:53:37,067 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2022-11-25 16:53:37,067 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 16:53:37,068 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2022-11-25 16:53:37,068 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-11-25 16:53:37,068 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr28REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 38 more)] === [2022-11-25 16:53:37,069 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 16:53:37,070 INFO L85 PathProgramCache]: Analyzing trace with hash 889572104, now seen corresponding path program 1 times [2022-11-25 16:53:37,070 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 16:53:37,071 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1822411032] [2022-11-25 16:53:37,071 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 16:53:37,072 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 16:53:37,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 16:53:37,229 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-25 16:53:37,229 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 16:53:37,230 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1822411032] [2022-11-25 16:53:37,231 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1822411032] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 16:53:37,231 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 16:53:37,231 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-25 16:53:37,232 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1642486298] [2022-11-25 16:53:37,232 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 16:53:37,233 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-25 16:53:37,234 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 16:53:37,235 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-25 16:53:37,236 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-25 16:53:37,237 INFO L87 Difference]: Start difference. First operand 85 states and 89 transitions. Second operand has 3 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 16:53:37,298 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 16:53:37,299 INFO L93 Difference]: Finished difference Result 133 states and 139 transitions. [2022-11-25 16:53:37,300 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-25 16:53:37,301 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 6 [2022-11-25 16:53:37,301 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 16:53:37,307 INFO L225 Difference]: With dead ends: 133 [2022-11-25 16:53:37,307 INFO L226 Difference]: Without dead ends: 133 [2022-11-25 16:53:37,308 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-25 16:53:37,309 INFO L413 NwaCegarLoop]: 87 mSDtfsCounter, 49 mSDsluCounter, 78 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 49 SdHoareTripleChecker+Valid, 165 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-25 16:53:37,312 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [49 Valid, 165 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-25 16:53:37,317 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 133 states. [2022-11-25 16:53:37,330 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 133 to 109. [2022-11-25 16:53:37,331 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 109 states, 68 states have (on average 2.0441176470588234) internal successors, (139), 108 states have internal predecessors, (139), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 16:53:37,333 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 139 transitions. [2022-11-25 16:53:37,333 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 139 transitions. Word has length 6 [2022-11-25 16:53:37,334 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 16:53:37,334 INFO L495 AbstractCegarLoop]: Abstraction has 109 states and 139 transitions. [2022-11-25 16:53:37,334 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 16:53:37,335 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 139 transitions. [2022-11-25 16:53:37,335 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2022-11-25 16:53:37,338 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 16:53:37,339 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2022-11-25 16:53:37,339 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-11-25 16:53:37,339 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 38 more)] === [2022-11-25 16:53:37,341 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 16:53:37,343 INFO L85 PathProgramCache]: Analyzing trace with hash 889571339, now seen corresponding path program 1 times [2022-11-25 16:53:37,343 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 16:53:37,343 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [654204721] [2022-11-25 16:53:37,351 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 16:53:37,353 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 16:53:37,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 16:53:37,490 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-25 16:53:37,490 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 16:53:37,491 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [654204721] [2022-11-25 16:53:37,491 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [654204721] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 16:53:37,491 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 16:53:37,491 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-25 16:53:37,511 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1368391559] [2022-11-25 16:53:37,511 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 16:53:37,512 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-25 16:53:37,512 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 16:53:37,512 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-25 16:53:37,513 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-25 16:53:37,513 INFO L87 Difference]: Start difference. First operand 109 states and 139 transitions. Second operand has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 16:53:37,671 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 16:53:37,671 INFO L93 Difference]: Finished difference Result 130 states and 154 transitions. [2022-11-25 16:53:37,672 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-25 16:53:37,672 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 6 [2022-11-25 16:53:37,672 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 16:53:37,673 INFO L225 Difference]: With dead ends: 130 [2022-11-25 16:53:37,674 INFO L226 Difference]: Without dead ends: 130 [2022-11-25 16:53:37,674 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-25 16:53:37,676 INFO L413 NwaCegarLoop]: 43 mSDtfsCounter, 74 mSDsluCounter, 21 mSDsCounter, 0 mSdLazyCounter, 57 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 74 SdHoareTripleChecker+Valid, 64 SdHoareTripleChecker+Invalid, 65 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 57 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-25 16:53:37,677 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [74 Valid, 64 Invalid, 65 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 57 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-25 16:53:37,678 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 130 states. [2022-11-25 16:53:37,685 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 130 to 101. [2022-11-25 16:53:37,685 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 101 states, 68 states have (on average 1.8235294117647058) internal successors, (124), 100 states have internal predecessors, (124), 0 states have call successors, (0), 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-25 16:53:37,687 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 124 transitions. [2022-11-25 16:53:37,688 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 124 transitions. Word has length 6 [2022-11-25 16:53:37,688 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 16:53:37,688 INFO L495 AbstractCegarLoop]: Abstraction has 101 states and 124 transitions. [2022-11-25 16:53:37,689 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 16:53:37,689 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 124 transitions. [2022-11-25 16:53:37,689 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2022-11-25 16:53:37,690 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 16:53:37,690 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2022-11-25 16:53:37,690 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-11-25 16:53:37,690 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 38 more)] === [2022-11-25 16:53:37,691 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 16:53:37,691 INFO L85 PathProgramCache]: Analyzing trace with hash 889571340, now seen corresponding path program 1 times [2022-11-25 16:53:37,692 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 16:53:37,692 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [604185143] [2022-11-25 16:53:37,692 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 16:53:37,693 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 16:53:37,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 16:53:37,810 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-25 16:53:37,810 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 16:53:37,810 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [604185143] [2022-11-25 16:53:37,811 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [604185143] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 16:53:37,811 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 16:53:37,811 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-25 16:53:37,811 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [642466965] [2022-11-25 16:53:37,812 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 16:53:37,812 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-25 16:53:37,812 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 16:53:37,813 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-25 16:53:37,813 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-25 16:53:37,814 INFO L87 Difference]: Start difference. First operand 101 states and 124 transitions. Second operand has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 16:53:37,962 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 16:53:37,962 INFO L93 Difference]: Finished difference Result 138 states and 161 transitions. [2022-11-25 16:53:37,963 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-25 16:53:37,963 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 6 [2022-11-25 16:53:37,963 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 16:53:37,964 INFO L225 Difference]: With dead ends: 138 [2022-11-25 16:53:37,964 INFO L226 Difference]: Without dead ends: 138 [2022-11-25 16:53:37,965 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-25 16:53:37,966 INFO L413 NwaCegarLoop]: 63 mSDtfsCounter, 47 mSDsluCounter, 39 mSDsCounter, 0 mSdLazyCounter, 48 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 47 SdHoareTripleChecker+Valid, 102 SdHoareTripleChecker+Invalid, 53 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 48 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-25 16:53:37,967 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [47 Valid, 102 Invalid, 53 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 48 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-25 16:53:37,968 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 138 states. [2022-11-25 16:53:37,974 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 138 to 101. [2022-11-25 16:53:37,975 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 101 states, 73 states have (on average 1.6849315068493151) internal successors, (123), 100 states have internal predecessors, (123), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 16:53:37,985 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 123 transitions. [2022-11-25 16:53:37,986 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 123 transitions. Word has length 6 [2022-11-25 16:53:37,986 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 16:53:37,986 INFO L495 AbstractCegarLoop]: Abstraction has 101 states and 123 transitions. [2022-11-25 16:53:37,986 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 16:53:37,987 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 123 transitions. [2022-11-25 16:53:37,987 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2022-11-25 16:53:37,987 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 16:53:37,988 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2022-11-25 16:53:37,988 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-11-25 16:53:37,988 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr40ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 38 more)] === [2022-11-25 16:53:37,989 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 16:53:37,989 INFO L85 PathProgramCache]: Analyzing trace with hash 1806930847, now seen corresponding path program 1 times [2022-11-25 16:53:37,990 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 16:53:37,990 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1608136957] [2022-11-25 16:53:37,990 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 16:53:37,990 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 16:53:38,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 16:53:38,072 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-25 16:53:38,072 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 16:53:38,073 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1608136957] [2022-11-25 16:53:38,073 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1608136957] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 16:53:38,074 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 16:53:38,074 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-25 16:53:38,074 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1973592460] [2022-11-25 16:53:38,074 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 16:53:38,075 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-25 16:53:38,075 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 16:53:38,076 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-25 16:53:38,076 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-25 16:53:38,077 INFO L87 Difference]: Start difference. First operand 101 states and 123 transitions. Second operand has 3 states, 2 states have (on average 3.5) 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-25 16:53:38,197 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 16:53:38,197 INFO L93 Difference]: Finished difference Result 103 states and 124 transitions. [2022-11-25 16:53:38,198 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-25 16:53:38,198 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 3.5) 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-25 16:53:38,199 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 16:53:38,201 INFO L225 Difference]: With dead ends: 103 [2022-11-25 16:53:38,201 INFO L226 Difference]: Without dead ends: 100 [2022-11-25 16:53:38,202 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-25 16:53:38,204 INFO L413 NwaCegarLoop]: 75 mSDtfsCounter, 0 mSDsluCounter, 41 mSDsCounter, 0 mSdLazyCounter, 35 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 116 SdHoareTripleChecker+Invalid, 35 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 35 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-25 16:53:38,205 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 116 Invalid, 35 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 35 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-25 16:53:38,206 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2022-11-25 16:53:38,212 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 100. [2022-11-25 16:53:38,213 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 100 states, 72 states have (on average 1.6805555555555556) internal successors, (121), 99 states have internal predecessors, (121), 0 states have call successors, (0), 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-25 16:53:38,214 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 121 transitions. [2022-11-25 16:53:38,214 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 121 transitions. Word has length 7 [2022-11-25 16:53:38,215 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 16:53:38,215 INFO L495 AbstractCegarLoop]: Abstraction has 100 states and 121 transitions. [2022-11-25 16:53:38,215 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 3.5) 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-25 16:53:38,215 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 121 transitions. [2022-11-25 16:53:38,216 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-11-25 16:53:38,216 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 16:53:38,216 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 16:53:38,217 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-11-25 16:53:38,217 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 38 more)] === [2022-11-25 16:53:38,218 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 16:53:38,218 INFO L85 PathProgramCache]: Analyzing trace with hash 1857997403, now seen corresponding path program 1 times [2022-11-25 16:53:38,218 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 16:53:38,219 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1675958375] [2022-11-25 16:53:38,219 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 16:53:38,219 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 16:53:38,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 16:53:38,689 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-25 16:53:38,689 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 16:53:38,689 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1675958375] [2022-11-25 16:53:38,690 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1675958375] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 16:53:38,690 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 16:53:38,690 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-25 16:53:38,690 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1448806462] [2022-11-25 16:53:38,690 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 16:53:38,691 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-25 16:53:38,691 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 16:53:38,692 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-25 16:53:38,692 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-11-25 16:53:38,693 INFO L87 Difference]: Start difference. First operand 100 states and 121 transitions. Second operand has 5 states, 4 states have (on average 3.75) internal successors, (15), 5 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 16:53:38,927 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 16:53:38,927 INFO L93 Difference]: Finished difference Result 126 states and 146 transitions. [2022-11-25 16:53:38,927 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-25 16:53:38,928 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 3.75) internal successors, (15), 5 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 15 [2022-11-25 16:53:38,928 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 16:53:38,932 INFO L225 Difference]: With dead ends: 126 [2022-11-25 16:53:38,932 INFO L226 Difference]: Without dead ends: 126 [2022-11-25 16:53:38,933 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2022-11-25 16:53:38,942 INFO L413 NwaCegarLoop]: 29 mSDtfsCounter, 112 mSDsluCounter, 40 mSDsCounter, 0 mSdLazyCounter, 96 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 112 SdHoareTripleChecker+Valid, 69 SdHoareTripleChecker+Invalid, 100 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 96 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-25 16:53:38,943 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [112 Valid, 69 Invalid, 100 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 96 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-25 16:53:38,944 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 126 states. [2022-11-25 16:53:38,948 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 126 to 92. [2022-11-25 16:53:38,948 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 92 states, 67 states have (on average 1.5970149253731343) internal successors, (107), 91 states have internal predecessors, (107), 0 states have call successors, (0), 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-25 16:53:38,949 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 107 transitions. [2022-11-25 16:53:38,949 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 107 transitions. Word has length 15 [2022-11-25 16:53:38,950 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 16:53:38,950 INFO L495 AbstractCegarLoop]: Abstraction has 92 states and 107 transitions. [2022-11-25 16:53:38,950 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 3.75) internal successors, (15), 5 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 16:53:38,950 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 107 transitions. [2022-11-25 16:53:38,951 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-11-25 16:53:38,951 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 16:53:38,961 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 16:53:38,961 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-11-25 16:53:38,962 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 38 more)] === [2022-11-25 16:53:38,963 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 16:53:38,964 INFO L85 PathProgramCache]: Analyzing trace with hash 1763344638, now seen corresponding path program 1 times [2022-11-25 16:53:38,964 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 16:53:38,964 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1573722564] [2022-11-25 16:53:38,964 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 16:53:38,964 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 16:53:39,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 16:53:39,149 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-25 16:53:39,150 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 16:53:39,150 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1573722564] [2022-11-25 16:53:39,150 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1573722564] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 16:53:39,151 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 16:53:39,151 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-25 16:53:39,151 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [78001274] [2022-11-25 16:53:39,151 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 16:53:39,152 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-25 16:53:39,152 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 16:53:39,153 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-25 16:53:39,153 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-25 16:53:39,153 INFO L87 Difference]: Start difference. First operand 92 states and 107 transitions. Second operand has 3 states, 2 states have (on average 8.0) internal successors, (16), 3 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 16:53:39,235 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 16:53:39,236 INFO L93 Difference]: Finished difference Result 88 states and 99 transitions. [2022-11-25 16:53:39,236 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-25 16:53:39,237 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 8.0) internal successors, (16), 3 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2022-11-25 16:53:39,237 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 16:53:39,238 INFO L225 Difference]: With dead ends: 88 [2022-11-25 16:53:39,238 INFO L226 Difference]: Without dead ends: 88 [2022-11-25 16:53:39,238 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-25 16:53:39,239 INFO L413 NwaCegarLoop]: 56 mSDtfsCounter, 14 mSDsluCounter, 28 mSDsCounter, 0 mSdLazyCounter, 37 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 84 SdHoareTripleChecker+Invalid, 40 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 37 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-25 16:53:39,240 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 84 Invalid, 40 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 37 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-25 16:53:39,241 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2022-11-25 16:53:39,245 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 88. [2022-11-25 16:53:39,245 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 88 states, 67 states have (on average 1.4776119402985075) internal successors, (99), 87 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 16:53:39,246 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 99 transitions. [2022-11-25 16:53:39,247 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 99 transitions. Word has length 16 [2022-11-25 16:53:39,247 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 16:53:39,247 INFO L495 AbstractCegarLoop]: Abstraction has 88 states and 99 transitions. [2022-11-25 16:53:39,248 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 8.0) internal successors, (16), 3 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 16:53:39,248 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 99 transitions. [2022-11-25 16:53:39,249 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-11-25 16:53:39,249 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 16:53:39,249 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 16:53:39,250 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-11-25 16:53:39,250 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 38 more)] === [2022-11-25 16:53:39,251 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 16:53:39,251 INFO L85 PathProgramCache]: Analyzing trace with hash 1763344639, now seen corresponding path program 1 times [2022-11-25 16:53:39,251 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 16:53:39,252 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1659790277] [2022-11-25 16:53:39,252 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 16:53:39,252 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 16:53:39,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 16:53:39,386 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-25 16:53:39,386 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 16:53:39,387 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1659790277] [2022-11-25 16:53:39,387 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1659790277] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 16:53:39,387 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 16:53:39,388 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-25 16:53:39,388 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [938824629] [2022-11-25 16:53:39,388 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 16:53:39,410 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-25 16:53:39,410 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 16:53:39,411 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-25 16:53:39,411 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-25 16:53:39,412 INFO L87 Difference]: Start difference. First operand 88 states and 99 transitions. Second operand has 3 states, 2 states have (on average 8.0) internal successors, (16), 3 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 16:53:39,485 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 16:53:39,485 INFO L93 Difference]: Finished difference Result 84 states and 91 transitions. [2022-11-25 16:53:39,486 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-25 16:53:39,486 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 8.0) internal successors, (16), 3 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2022-11-25 16:53:39,486 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 16:53:39,487 INFO L225 Difference]: With dead ends: 84 [2022-11-25 16:53:39,487 INFO L226 Difference]: Without dead ends: 84 [2022-11-25 16:53:39,488 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-25 16:53:39,489 INFO L413 NwaCegarLoop]: 56 mSDtfsCounter, 10 mSDsluCounter, 33 mSDsCounter, 0 mSdLazyCounter, 28 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 89 SdHoareTripleChecker+Invalid, 31 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 28 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-25 16:53:39,491 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 89 Invalid, 31 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 28 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-25 16:53:39,496 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2022-11-25 16:53:39,507 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 84. [2022-11-25 16:53:39,507 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 84 states, 67 states have (on average 1.3582089552238805) internal successors, (91), 83 states have internal predecessors, (91), 0 states have call successors, (0), 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-25 16:53:39,508 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 91 transitions. [2022-11-25 16:53:39,509 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 91 transitions. Word has length 16 [2022-11-25 16:53:39,509 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 16:53:39,509 INFO L495 AbstractCegarLoop]: Abstraction has 84 states and 91 transitions. [2022-11-25 16:53:39,509 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 8.0) internal successors, (16), 3 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 16:53:39,509 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 91 transitions. [2022-11-25 16:53:39,510 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-11-25 16:53:39,510 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 16:53:39,510 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 16:53:39,511 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-11-25 16:53:39,511 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr28REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 38 more)] === [2022-11-25 16:53:39,511 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 16:53:39,512 INFO L85 PathProgramCache]: Analyzing trace with hash -1967864768, now seen corresponding path program 1 times [2022-11-25 16:53:39,512 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 16:53:39,512 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1844893021] [2022-11-25 16:53:39,512 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 16:53:39,513 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 16:53:39,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 16:53:39,610 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 16:53:39,610 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 16:53:39,611 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1844893021] [2022-11-25 16:53:39,611 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1844893021] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 16:53:39,611 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 16:53:39,611 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-25 16:53:39,612 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1963484111] [2022-11-25 16:53:39,612 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 16:53:39,613 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-25 16:53:39,613 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 16:53:39,614 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-25 16:53:39,614 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-25 16:53:39,615 INFO L87 Difference]: Start difference. First operand 84 states and 91 transitions. Second operand has 4 states, 3 states have (on average 6.0) internal successors, (18), 4 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 16:53:39,775 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 16:53:39,775 INFO L93 Difference]: Finished difference Result 114 states and 120 transitions. [2022-11-25 16:53:39,776 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-25 16:53:39,776 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), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2022-11-25 16:53:39,776 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 16:53:39,777 INFO L225 Difference]: With dead ends: 114 [2022-11-25 16:53:39,777 INFO L226 Difference]: Without dead ends: 114 [2022-11-25 16:53:39,778 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-25 16:53:39,781 INFO L413 NwaCegarLoop]: 40 mSDtfsCounter, 83 mSDsluCounter, 44 mSDsCounter, 0 mSdLazyCounter, 96 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 83 SdHoareTripleChecker+Valid, 84 SdHoareTripleChecker+Invalid, 101 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 96 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-25 16:53:39,782 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [83 Valid, 84 Invalid, 101 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 96 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-25 16:53:39,783 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114 states. [2022-11-25 16:53:39,796 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114 to 86. [2022-11-25 16:53:39,796 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 86 states, 69 states have (on average 1.3768115942028984) internal successors, (95), 85 states have internal predecessors, (95), 0 states have call successors, (0), 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-25 16:53:39,799 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 95 transitions. [2022-11-25 16:53:39,807 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 95 transitions. Word has length 18 [2022-11-25 16:53:39,807 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 16:53:39,807 INFO L495 AbstractCegarLoop]: Abstraction has 86 states and 95 transitions. [2022-11-25 16:53:39,808 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), 0 states have call successors, (0), 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-25 16:53:39,808 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 95 transitions. [2022-11-25 16:53:39,809 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-11-25 16:53:39,809 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 16:53:39,809 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 16:53:39,809 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-11-25 16:53:39,810 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr29REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 38 more)] === [2022-11-25 16:53:39,810 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 16:53:39,812 INFO L85 PathProgramCache]: Analyzing trace with hash -1967864767, now seen corresponding path program 1 times [2022-11-25 16:53:39,812 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 16:53:39,813 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1860210643] [2022-11-25 16:53:39,813 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 16:53:39,813 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 16:53:39,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 16:53:40,065 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 16:53:40,065 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 16:53:40,066 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1860210643] [2022-11-25 16:53:40,066 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1860210643] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 16:53:40,066 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 16:53:40,066 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-25 16:53:40,066 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [492299267] [2022-11-25 16:53:40,067 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 16:53:40,067 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-25 16:53:40,067 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 16:53:40,068 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-25 16:53:40,068 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-25 16:53:40,069 INFO L87 Difference]: Start difference. First operand 86 states and 95 transitions. Second operand has 4 states, 3 states have (on average 6.0) internal successors, (18), 4 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 16:53:40,231 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 16:53:40,232 INFO L93 Difference]: Finished difference Result 153 states and 172 transitions. [2022-11-25 16:53:40,232 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-25 16:53:40,232 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), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2022-11-25 16:53:40,233 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 16:53:40,233 INFO L225 Difference]: With dead ends: 153 [2022-11-25 16:53:40,234 INFO L226 Difference]: Without dead ends: 153 [2022-11-25 16:53:40,234 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-25 16:53:40,235 INFO L413 NwaCegarLoop]: 48 mSDtfsCounter, 72 mSDsluCounter, 70 mSDsCounter, 0 mSdLazyCounter, 93 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 72 SdHoareTripleChecker+Valid, 118 SdHoareTripleChecker+Invalid, 94 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 93 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-25 16:53:40,235 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [72 Valid, 118 Invalid, 94 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 93 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-25 16:53:40,236 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 153 states. [2022-11-25 16:53:40,238 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 153 to 109. [2022-11-25 16:53:40,239 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 109 states, 92 states have (on average 1.3804347826086956) internal successors, (127), 108 states have internal predecessors, (127), 0 states have call successors, (0), 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-25 16:53:40,239 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 127 transitions. [2022-11-25 16:53:40,240 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 127 transitions. Word has length 18 [2022-11-25 16:53:40,240 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 16:53:40,240 INFO L495 AbstractCegarLoop]: Abstraction has 109 states and 127 transitions. [2022-11-25 16:53:40,240 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), 0 states have call successors, (0), 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-25 16:53:40,240 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 127 transitions. [2022-11-25 16:53:40,241 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-11-25 16:53:40,241 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 16:53:40,241 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 16:53:40,241 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-11-25 16:53:40,241 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr40ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 38 more)] === [2022-11-25 16:53:40,242 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 16:53:40,242 INFO L85 PathProgramCache]: Analyzing trace with hash -874266265, now seen corresponding path program 1 times [2022-11-25 16:53:40,242 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 16:53:40,242 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [711599138] [2022-11-25 16:53:40,243 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 16:53:40,243 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 16:53:40,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 16:53:40,302 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 16:53:40,303 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 16:53:40,303 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [711599138] [2022-11-25 16:53:40,303 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [711599138] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 16:53:40,303 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 16:53:40,303 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-25 16:53:40,304 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [337364285] [2022-11-25 16:53:40,304 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 16:53:40,304 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-25 16:53:40,304 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 16:53:40,305 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-25 16:53:40,305 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-25 16:53:40,305 INFO L87 Difference]: Start difference. First operand 109 states and 127 transitions. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 16:53:40,402 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 16:53:40,402 INFO L93 Difference]: Finished difference Result 113 states and 123 transitions. [2022-11-25 16:53:40,403 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-25 16:53:40,403 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2022-11-25 16:53:40,404 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 16:53:40,404 INFO L225 Difference]: With dead ends: 113 [2022-11-25 16:53:40,404 INFO L226 Difference]: Without dead ends: 113 [2022-11-25 16:53:40,405 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 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-25 16:53:40,406 INFO L413 NwaCegarLoop]: 65 mSDtfsCounter, 89 mSDsluCounter, 43 mSDsCounter, 0 mSdLazyCounter, 43 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 89 SdHoareTripleChecker+Valid, 108 SdHoareTripleChecker+Invalid, 44 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 43 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-25 16:53:40,406 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [89 Valid, 108 Invalid, 44 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 43 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-25 16:53:40,407 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113 states. [2022-11-25 16:53:40,409 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113 to 106. [2022-11-25 16:53:40,409 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 106 states, 89 states have (on average 1.3258426966292134) internal successors, (118), 105 states have internal predecessors, (118), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 16:53:40,410 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 118 transitions. [2022-11-25 16:53:40,413 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 118 transitions. Word has length 19 [2022-11-25 16:53:40,415 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 16:53:40,415 INFO L495 AbstractCegarLoop]: Abstraction has 106 states and 118 transitions. [2022-11-25 16:53:40,415 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 16:53:40,416 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 118 transitions. [2022-11-25 16:53:40,416 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-11-25 16:53:40,416 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 16:53:40,416 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-25 16:53:40,417 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-11-25 16:53:40,417 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr16REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 38 more)] === [2022-11-25 16:53:40,418 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 16:53:40,418 INFO L85 PathProgramCache]: Analyzing trace with hash 55140128, now seen corresponding path program 1 times [2022-11-25 16:53:40,418 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 16:53:40,418 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [610307582] [2022-11-25 16:53:40,418 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 16:53:40,419 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 16:53:40,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 16:53:40,694 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-25 16:53:40,694 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 16:53:40,695 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [610307582] [2022-11-25 16:53:40,695 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [610307582] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 16:53:40,695 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 16:53:40,695 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-25 16:53:40,695 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1873613464] [2022-11-25 16:53:40,696 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 16:53:40,696 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-25 16:53:40,696 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 16:53:40,697 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-25 16:53:40,697 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-11-25 16:53:40,697 INFO L87 Difference]: Start difference. First operand 106 states and 118 transitions. Second operand has 6 states, 5 states have (on average 3.8) internal successors, (19), 6 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 16:53:40,932 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 16:53:40,932 INFO L93 Difference]: Finished difference Result 170 states and 187 transitions. [2022-11-25 16:53:40,933 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-11-25 16:53:40,933 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 3.8) internal successors, (19), 6 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2022-11-25 16:53:40,933 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 16:53:40,934 INFO L225 Difference]: With dead ends: 170 [2022-11-25 16:53:40,934 INFO L226 Difference]: Without dead ends: 170 [2022-11-25 16:53:40,935 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2022-11-25 16:53:40,935 INFO L413 NwaCegarLoop]: 50 mSDtfsCounter, 45 mSDsluCounter, 133 mSDsCounter, 0 mSdLazyCounter, 146 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 45 SdHoareTripleChecker+Valid, 183 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-25 16:53:40,936 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [45 Valid, 183 Invalid, 153 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 146 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-25 16:53:40,936 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 170 states. [2022-11-25 16:53:40,938 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 170 to 120. [2022-11-25 16:53:40,939 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 120 states, 103 states have (on average 1.3106796116504855) internal successors, (135), 119 states have internal predecessors, (135), 0 states have call successors, (0), 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-25 16:53:40,939 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 120 states to 120 states and 135 transitions. [2022-11-25 16:53:40,940 INFO L78 Accepts]: Start accepts. Automaton has 120 states and 135 transitions. Word has length 19 [2022-11-25 16:53:40,940 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 16:53:40,940 INFO L495 AbstractCegarLoop]: Abstraction has 120 states and 135 transitions. [2022-11-25 16:53:40,940 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 3.8) internal successors, (19), 6 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 16:53:40,940 INFO L276 IsEmpty]: Start isEmpty. Operand 120 states and 135 transitions. [2022-11-25 16:53:40,941 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-11-25 16:53:40,941 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 16:53:40,941 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-25 16:53:40,941 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-11-25 16:53:40,941 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr17REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 38 more)] === [2022-11-25 16:53:40,942 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 16:53:40,942 INFO L85 PathProgramCache]: Analyzing trace with hash 55140129, now seen corresponding path program 1 times [2022-11-25 16:53:40,942 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 16:53:40,942 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1395817627] [2022-11-25 16:53:40,942 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 16:53:40,943 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 16:53:40,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 16:53:41,714 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-25 16:53:41,714 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 16:53:41,714 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1395817627] [2022-11-25 16:53:41,714 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1395817627] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 16:53:41,715 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 16:53:41,715 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-11-25 16:53:41,715 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [532584560] [2022-11-25 16:53:41,715 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 16:53:41,715 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-11-25 16:53:41,716 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 16:53:41,716 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-11-25 16:53:41,716 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2022-11-25 16:53:41,717 INFO L87 Difference]: Start difference. First operand 120 states and 135 transitions. Second operand has 9 states, 8 states have (on average 2.375) internal successors, (19), 9 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 16:53:42,283 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 16:53:42,283 INFO L93 Difference]: Finished difference Result 184 states and 199 transitions. [2022-11-25 16:53:42,285 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-11-25 16:53:42,285 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 2.375) internal successors, (19), 9 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2022-11-25 16:53:42,285 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 16:53:42,286 INFO L225 Difference]: With dead ends: 184 [2022-11-25 16:53:42,286 INFO L226 Difference]: Without dead ends: 184 [2022-11-25 16:53:42,286 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=79, Invalid=161, Unknown=0, NotChecked=0, Total=240 [2022-11-25 16:53:42,287 INFO L413 NwaCegarLoop]: 31 mSDtfsCounter, 173 mSDsluCounter, 164 mSDsCounter, 0 mSdLazyCounter, 273 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 173 SdHoareTripleChecker+Valid, 195 SdHoareTripleChecker+Invalid, 287 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 273 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-25 16:53:42,287 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [173 Valid, 195 Invalid, 287 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 273 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-11-25 16:53:42,288 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 184 states. [2022-11-25 16:53:42,290 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 184 to 120. [2022-11-25 16:53:42,291 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 120 states, 103 states have (on average 1.2912621359223302) internal successors, (133), 119 states have internal predecessors, (133), 0 states have call successors, (0), 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-25 16:53:42,292 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 120 states to 120 states and 133 transitions. [2022-11-25 16:53:42,292 INFO L78 Accepts]: Start accepts. Automaton has 120 states and 133 transitions. Word has length 19 [2022-11-25 16:53:42,292 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 16:53:42,292 INFO L495 AbstractCegarLoop]: Abstraction has 120 states and 133 transitions. [2022-11-25 16:53:42,292 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 2.375) internal successors, (19), 9 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 16:53:42,293 INFO L276 IsEmpty]: Start isEmpty. Operand 120 states and 133 transitions. [2022-11-25 16:53:42,293 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-11-25 16:53:42,293 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 16:53:42,293 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 16:53:42,294 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-11-25 16:53:42,294 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr30REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 38 more)] === [2022-11-25 16:53:42,294 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 16:53:42,295 INFO L85 PathProgramCache]: Analyzing trace with hash -1332429407, now seen corresponding path program 1 times [2022-11-25 16:53:42,295 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 16:53:42,295 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1600153284] [2022-11-25 16:53:42,295 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 16:53:42,298 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 16:53:42,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 16:53:42,386 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-11-25 16:53:42,386 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 16:53:42,386 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1600153284] [2022-11-25 16:53:42,386 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1600153284] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 16:53:42,386 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 16:53:42,387 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-25 16:53:42,387 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1068689486] [2022-11-25 16:53:42,387 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 16:53:42,387 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-25 16:53:42,387 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 16:53:42,388 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-25 16:53:42,388 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-25 16:53:42,388 INFO L87 Difference]: Start difference. First operand 120 states and 133 transitions. Second operand has 4 states, 3 states have (on average 6.333333333333333) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 16:53:42,495 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 16:53:42,495 INFO L93 Difference]: Finished difference Result 135 states and 149 transitions. [2022-11-25 16:53:42,496 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-25 16:53:42,496 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), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 20 [2022-11-25 16:53:42,496 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 16:53:42,497 INFO L225 Difference]: With dead ends: 135 [2022-11-25 16:53:42,497 INFO L226 Difference]: Without dead ends: 135 [2022-11-25 16:53:42,497 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-11-25 16:53:42,498 INFO L413 NwaCegarLoop]: 50 mSDtfsCounter, 21 mSDsluCounter, 48 mSDsCounter, 0 mSdLazyCounter, 85 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 98 SdHoareTripleChecker+Invalid, 86 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 85 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-25 16:53:42,498 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [21 Valid, 98 Invalid, 86 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 85 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-25 16:53:42,500 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 135 states. [2022-11-25 16:53:42,505 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 135 to 123. [2022-11-25 16:53:42,505 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 123 states, 107 states have (on average 1.2990654205607477) internal successors, (139), 122 states have internal predecessors, (139), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 16:53:42,506 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 123 states to 123 states and 139 transitions. [2022-11-25 16:53:42,506 INFO L78 Accepts]: Start accepts. Automaton has 123 states and 139 transitions. Word has length 20 [2022-11-25 16:53:42,506 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 16:53:42,506 INFO L495 AbstractCegarLoop]: Abstraction has 123 states and 139 transitions. [2022-11-25 16:53:42,506 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), 0 states have call successors, (0), 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-25 16:53:42,507 INFO L276 IsEmpty]: Start isEmpty. Operand 123 states and 139 transitions. [2022-11-25 16:53:42,508 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-11-25 16:53:42,508 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 16:53:42,508 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 16:53:42,508 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-11-25 16:53:42,509 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr31REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 38 more)] === [2022-11-25 16:53:42,509 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 16:53:42,509 INFO L85 PathProgramCache]: Analyzing trace with hash -1332429406, now seen corresponding path program 1 times [2022-11-25 16:53:42,509 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 16:53:42,510 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1545564096] [2022-11-25 16:53:42,510 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 16:53:42,510 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 16:53:42,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 16:53:42,710 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 16:53:42,711 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 16:53:42,711 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1545564096] [2022-11-25 16:53:42,711 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1545564096] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 16:53:42,711 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 16:53:42,711 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-25 16:53:42,711 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [775202424] [2022-11-25 16:53:42,712 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 16:53:42,712 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-25 16:53:42,712 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 16:53:42,712 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-25 16:53:42,713 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-11-25 16:53:42,713 INFO L87 Difference]: Start difference. First operand 123 states and 139 transitions. Second operand has 5 states, 4 states have (on average 5.0) internal successors, (20), 5 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 16:53:42,957 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 16:53:42,957 INFO L93 Difference]: Finished difference Result 194 states and 217 transitions. [2022-11-25 16:53:42,958 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-25 16:53:42,958 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 5.0) internal successors, (20), 5 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 20 [2022-11-25 16:53:42,958 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 16:53:42,959 INFO L225 Difference]: With dead ends: 194 [2022-11-25 16:53:42,959 INFO L226 Difference]: Without dead ends: 194 [2022-11-25 16:53:42,959 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2022-11-25 16:53:42,960 INFO L413 NwaCegarLoop]: 42 mSDtfsCounter, 111 mSDsluCounter, 90 mSDsCounter, 0 mSdLazyCounter, 152 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 111 SdHoareTripleChecker+Valid, 132 SdHoareTripleChecker+Invalid, 154 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 152 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-25 16:53:42,960 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [111 Valid, 132 Invalid, 154 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 152 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-25 16:53:42,961 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 194 states. [2022-11-25 16:53:42,963 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 194 to 135. [2022-11-25 16:53:42,964 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 135 states, 119 states have (on average 1.3277310924369747) internal successors, (158), 134 states have internal predecessors, (158), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 16:53:42,964 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 135 states to 135 states and 158 transitions. [2022-11-25 16:53:42,965 INFO L78 Accepts]: Start accepts. Automaton has 135 states and 158 transitions. Word has length 20 [2022-11-25 16:53:42,965 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 16:53:42,965 INFO L495 AbstractCegarLoop]: Abstraction has 135 states and 158 transitions. [2022-11-25 16:53:42,965 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 5.0) internal successors, (20), 5 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 16:53:42,965 INFO L276 IsEmpty]: Start isEmpty. Operand 135 states and 158 transitions. [2022-11-25 16:53:42,968 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-11-25 16:53:42,968 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 16:53:42,968 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 16:53:42,968 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-11-25 16:53:42,968 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr32REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 38 more)] === [2022-11-25 16:53:42,969 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 16:53:42,969 INFO L85 PathProgramCache]: Analyzing trace with hash -316635569, now seen corresponding path program 1 times [2022-11-25 16:53:42,969 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 16:53:42,969 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1544510564] [2022-11-25 16:53:42,969 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 16:53:42,970 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 16:53:42,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 16:53:43,275 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 16:53:43,275 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 16:53:43,276 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1544510564] [2022-11-25 16:53:43,278 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1544510564] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 16:53:43,278 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 16:53:43,278 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-11-25 16:53:43,279 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1895087233] [2022-11-25 16:53:43,279 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 16:53:43,279 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-11-25 16:53:43,279 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 16:53:43,280 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-11-25 16:53:43,280 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2022-11-25 16:53:43,280 INFO L87 Difference]: Start difference. First operand 135 states and 158 transitions. Second operand has 8 states, 7 states have (on average 3.2857142857142856) internal successors, (23), 8 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 16:53:43,609 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 16:53:43,609 INFO L93 Difference]: Finished difference Result 200 states and 231 transitions. [2022-11-25 16:53:43,610 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-11-25 16:53:43,610 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 3.2857142857142856) internal successors, (23), 8 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 23 [2022-11-25 16:53:43,610 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 16:53:43,611 INFO L225 Difference]: With dead ends: 200 [2022-11-25 16:53:43,611 INFO L226 Difference]: Without dead ends: 200 [2022-11-25 16:53:43,612 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=53, Invalid=157, Unknown=0, NotChecked=0, Total=210 [2022-11-25 16:53:43,612 INFO L413 NwaCegarLoop]: 45 mSDtfsCounter, 87 mSDsluCounter, 180 mSDsCounter, 0 mSdLazyCounter, 245 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 87 SdHoareTripleChecker+Valid, 225 SdHoareTripleChecker+Invalid, 249 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 245 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-25 16:53:43,613 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [87 Valid, 225 Invalid, 249 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 245 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-25 16:53:43,613 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 200 states. [2022-11-25 16:53:43,616 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 200 to 144. [2022-11-25 16:53:43,617 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 144 states, 128 states have (on average 1.328125) internal successors, (170), 143 states have internal predecessors, (170), 0 states have call successors, (0), 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-25 16:53:43,617 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 144 states to 144 states and 170 transitions. [2022-11-25 16:53:43,617 INFO L78 Accepts]: Start accepts. Automaton has 144 states and 170 transitions. Word has length 23 [2022-11-25 16:53:43,618 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 16:53:43,618 INFO L495 AbstractCegarLoop]: Abstraction has 144 states and 170 transitions. [2022-11-25 16:53:43,618 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 3.2857142857142856) internal successors, (23), 8 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 16:53:43,618 INFO L276 IsEmpty]: Start isEmpty. Operand 144 states and 170 transitions. [2022-11-25 16:53:43,619 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-11-25 16:53:43,619 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 16:53:43,619 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 16:53:43,619 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2022-11-25 16:53:43,620 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr33REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 38 more)] === [2022-11-25 16:53:43,620 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 16:53:43,621 INFO L85 PathProgramCache]: Analyzing trace with hash -316635568, now seen corresponding path program 1 times [2022-11-25 16:53:43,621 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 16:53:43,621 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1869261474] [2022-11-25 16:53:43,621 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 16:53:43,622 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 16:53:43,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 16:53:43,993 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 16:53:43,994 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 16:53:43,994 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1869261474] [2022-11-25 16:53:43,994 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1869261474] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 16:53:43,994 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 16:53:43,994 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-11-25 16:53:43,995 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1704682638] [2022-11-25 16:53:43,995 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 16:53:43,995 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-25 16:53:43,996 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 16:53:43,996 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-25 16:53:43,996 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-11-25 16:53:43,997 INFO L87 Difference]: Start difference. First operand 144 states and 170 transitions. Second operand has 7 states, 7 states have (on average 3.2857142857142856) internal successors, (23), 7 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 16:53:44,287 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 16:53:44,287 INFO L93 Difference]: Finished difference Result 195 states and 225 transitions. [2022-11-25 16:53:44,288 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-11-25 16:53:44,288 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 3.2857142857142856) internal successors, (23), 7 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 23 [2022-11-25 16:53:44,288 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 16:53:44,289 INFO L225 Difference]: With dead ends: 195 [2022-11-25 16:53:44,289 INFO L226 Difference]: Without dead ends: 195 [2022-11-25 16:53:44,289 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=43, Invalid=113, Unknown=0, NotChecked=0, Total=156 [2022-11-25 16:53:44,290 INFO L413 NwaCegarLoop]: 48 mSDtfsCounter, 95 mSDsluCounter, 188 mSDsCounter, 0 mSdLazyCounter, 161 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 95 SdHoareTripleChecker+Valid, 236 SdHoareTripleChecker+Invalid, 165 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 161 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-25 16:53:44,290 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [95 Valid, 236 Invalid, 165 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 161 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-25 16:53:44,291 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 195 states. [2022-11-25 16:53:44,294 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 195 to 143. [2022-11-25 16:53:44,294 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 143 states, 127 states have (on average 1.31496062992126) internal successors, (167), 142 states have internal predecessors, (167), 0 states have call successors, (0), 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-25 16:53:44,295 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 143 states to 143 states and 167 transitions. [2022-11-25 16:53:44,295 INFO L78 Accepts]: Start accepts. Automaton has 143 states and 167 transitions. Word has length 23 [2022-11-25 16:53:44,295 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 16:53:44,295 INFO L495 AbstractCegarLoop]: Abstraction has 143 states and 167 transitions. [2022-11-25 16:53:44,296 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 3.2857142857142856) internal successors, (23), 7 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 16:53:44,296 INFO L276 IsEmpty]: Start isEmpty. Operand 143 states and 167 transitions. [2022-11-25 16:53:44,298 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-11-25 16:53:44,298 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 16:53:44,298 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 16:53:44,298 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2022-11-25 16:53:44,298 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr38ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 38 more)] === [2022-11-25 16:53:44,299 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 16:53:44,299 INFO L85 PathProgramCache]: Analyzing trace with hash -1225769432, now seen corresponding path program 1 times [2022-11-25 16:53:44,299 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 16:53:44,299 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1755067064] [2022-11-25 16:53:44,299 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 16:53:44,300 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 16:53:44,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 16:53:44,419 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 16:53:44,419 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 16:53:44,419 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1755067064] [2022-11-25 16:53:44,419 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1755067064] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 16:53:44,419 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 16:53:44,420 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-25 16:53:44,420 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [732504061] [2022-11-25 16:53:44,420 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 16:53:44,420 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-25 16:53:44,420 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 16:53:44,421 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-25 16:53:44,421 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-11-25 16:53:44,421 INFO L87 Difference]: Start difference. First operand 143 states and 167 transitions. Second operand has 5 states, 4 states have (on average 6.0) internal successors, (24), 5 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 16:53:44,590 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 16:53:44,590 INFO L93 Difference]: Finished difference Result 167 states and 191 transitions. [2022-11-25 16:53:44,590 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-25 16:53:44,591 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 6.0) internal successors, (24), 5 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 24 [2022-11-25 16:53:44,591 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 16:53:44,592 INFO L225 Difference]: With dead ends: 167 [2022-11-25 16:53:44,592 INFO L226 Difference]: Without dead ends: 167 [2022-11-25 16:53:44,592 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2022-11-25 16:53:44,593 INFO L413 NwaCegarLoop]: 63 mSDtfsCounter, 113 mSDsluCounter, 85 mSDsCounter, 0 mSdLazyCounter, 111 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 113 SdHoareTripleChecker+Valid, 148 SdHoareTripleChecker+Invalid, 112 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 111 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-25 16:53:44,593 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [113 Valid, 148 Invalid, 112 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 111 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-25 16:53:44,594 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 167 states. [2022-11-25 16:53:44,596 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 167 to 157. [2022-11-25 16:53:44,597 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 157 states, 141 states have (on average 1.3546099290780143) internal successors, (191), 156 states have internal predecessors, (191), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 16:53:44,597 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 157 states to 157 states and 191 transitions. [2022-11-25 16:53:44,597 INFO L78 Accepts]: Start accepts. Automaton has 157 states and 191 transitions. Word has length 24 [2022-11-25 16:53:44,599 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 16:53:44,599 INFO L495 AbstractCegarLoop]: Abstraction has 157 states and 191 transitions. [2022-11-25 16:53:44,599 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 6.0) internal successors, (24), 5 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 16:53:44,599 INFO L276 IsEmpty]: Start isEmpty. Operand 157 states and 191 transitions. [2022-11-25 16:53:44,600 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2022-11-25 16:53:44,600 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 16:53:44,600 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] [2022-11-25 16:53:44,600 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2022-11-25 16:53:44,602 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr28REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 38 more)] === [2022-11-25 16:53:44,603 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 16:53:44,603 INFO L85 PathProgramCache]: Analyzing trace with hash -1085033438, now seen corresponding path program 1 times [2022-11-25 16:53:44,603 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 16:53:44,603 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1564831837] [2022-11-25 16:53:44,603 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 16:53:44,604 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 16:53:44,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 16:53:45,114 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 16:53:45,115 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 16:53:45,115 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1564831837] [2022-11-25 16:53:45,115 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1564831837] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-25 16:53:45,116 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1210481487] [2022-11-25 16:53:45,116 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 16:53:45,116 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 16:53:45,116 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_566ce540-1391-469b-bbbb-cc92d0ef0a3d/bin/uautomizer-ZsLfNo2U6R/z3 [2022-11-25 16:53:45,123 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_566ce540-1391-469b-bbbb-cc92d0ef0a3d/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-25 16:53:45,167 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_566ce540-1391-469b-bbbb-cc92d0ef0a3d/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-11-25 16:53:45,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 16:53:45,313 INFO L263 TraceCheckSpWp]: Trace formula consists of 196 conjuncts, 39 conjunts are in the unsatisfiable core [2022-11-25 16:53:45,334 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 16:53:45,449 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-25 16:53:45,458 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-25 16:53:45,519 INFO L350 Elim1Store]: Elim1 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-25 16:53:45,529 INFO L350 Elim1Store]: Elim1 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-25 16:53:45,577 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 16:53:45,578 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2022-11-25 16:53:45,587 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 16:53:45,595 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2022-11-25 16:53:45,637 INFO L350 Elim1Store]: Elim1 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-25 16:53:45,651 INFO L350 Elim1Store]: Elim1 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-25 16:53:45,692 INFO L350 Elim1Store]: Elim1 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-25 16:53:45,707 INFO L350 Elim1Store]: Elim1 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-25 16:53:45,817 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-11-25 16:53:45,825 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-11-25 16:53:45,875 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 16:53:45,875 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-25 16:53:46,054 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 16:53:46,054 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1210481487] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-25 16:53:46,054 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-25 16:53:46,054 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 6] total 9 [2022-11-25 16:53:46,055 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1779363248] [2022-11-25 16:53:46,055 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-25 16:53:46,055 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-11-25 16:53:46,055 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 16:53:46,056 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-11-25 16:53:46,056 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2022-11-25 16:53:46,057 INFO L87 Difference]: Start difference. First operand 157 states and 191 transitions. Second operand has 9 states, 9 states have (on average 4.666666666666667) internal successors, (42), 9 states have internal predecessors, (42), 0 states have call successors, (0), 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-25 16:53:46,361 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 16:53:46,361 INFO L93 Difference]: Finished difference Result 186 states and 218 transitions. [2022-11-25 16:53:46,362 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-11-25 16:53:46,362 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 4.666666666666667) internal successors, (42), 9 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 27 [2022-11-25 16:53:46,362 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 16:53:46,363 INFO L225 Difference]: With dead ends: 186 [2022-11-25 16:53:46,363 INFO L226 Difference]: Without dead ends: 186 [2022-11-25 16:53:46,364 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 57 SyntacticMatches, 1 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=52, Invalid=130, Unknown=0, NotChecked=0, Total=182 [2022-11-25 16:53:46,364 INFO L413 NwaCegarLoop]: 51 mSDtfsCounter, 205 mSDsluCounter, 216 mSDsCounter, 0 mSdLazyCounter, 156 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 205 SdHoareTripleChecker+Valid, 267 SdHoareTripleChecker+Invalid, 163 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 156 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-25 16:53:46,365 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [205 Valid, 267 Invalid, 163 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 156 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-25 16:53:46,365 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 186 states. [2022-11-25 16:53:46,368 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 186 to 161. [2022-11-25 16:53:46,368 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 161 states, 145 states have (on average 1.3448275862068966) internal successors, (195), 160 states have internal predecessors, (195), 0 states have call successors, (0), 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-25 16:53:46,369 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 161 states to 161 states and 195 transitions. [2022-11-25 16:53:46,369 INFO L78 Accepts]: Start accepts. Automaton has 161 states and 195 transitions. Word has length 27 [2022-11-25 16:53:46,369 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 16:53:46,369 INFO L495 AbstractCegarLoop]: Abstraction has 161 states and 195 transitions. [2022-11-25 16:53:46,370 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 4.666666666666667) internal successors, (42), 9 states have internal predecessors, (42), 0 states have call successors, (0), 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-25 16:53:46,370 INFO L276 IsEmpty]: Start isEmpty. Operand 161 states and 195 transitions. [2022-11-25 16:53:46,370 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2022-11-25 16:53:46,370 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 16:53:46,370 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1] [2022-11-25 16:53:46,385 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_566ce540-1391-469b-bbbb-cc92d0ef0a3d/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-11-25 16:53:46,571 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_566ce540-1391-469b-bbbb-cc92d0ef0a3d/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 16:53:46,571 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr24REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 38 more)] === [2022-11-25 16:53:46,572 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 16:53:46,572 INFO L85 PathProgramCache]: Analyzing trace with hash 2078846143, now seen corresponding path program 1 times [2022-11-25 16:53:46,572 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 16:53:46,572 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2051001265] [2022-11-25 16:53:46,572 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 16:53:46,572 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 16:53:46,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 16:53:46,748 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 2 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 16:53:46,749 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 16:53:46,749 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2051001265] [2022-11-25 16:53:46,749 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2051001265] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-25 16:53:46,749 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [103067824] [2022-11-25 16:53:46,750 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 16:53:46,750 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 16:53:46,750 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_566ce540-1391-469b-bbbb-cc92d0ef0a3d/bin/uautomizer-ZsLfNo2U6R/z3 [2022-11-25 16:53:46,751 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_566ce540-1391-469b-bbbb-cc92d0ef0a3d/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-25 16:53:46,783 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_566ce540-1391-469b-bbbb-cc92d0ef0a3d/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-11-25 16:53:46,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 16:53:46,927 INFO L263 TraceCheckSpWp]: Trace formula consists of 252 conjuncts, 9 conjunts are in the unsatisfiable core [2022-11-25 16:53:46,929 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 16:53:46,940 INFO L350 Elim1Store]: Elim1 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-25 16:53:46,988 INFO L321 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-11-25 16:53:46,988 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2022-11-25 16:53:47,021 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 2 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 16:53:47,022 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-25 16:53:47,212 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 2 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 16:53:47,213 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [103067824] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-25 16:53:47,213 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-25 16:53:47,213 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 3, 4] total 6 [2022-11-25 16:53:47,213 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [74101902] [2022-11-25 16:53:47,214 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-25 16:53:47,214 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-25 16:53:47,214 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 16:53:47,215 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-25 16:53:47,215 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2022-11-25 16:53:47,216 INFO L87 Difference]: Start difference. First operand 161 states and 195 transitions. Second operand has 7 states, 6 states have (on average 7.166666666666667) internal successors, (43), 7 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 16:53:47,427 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 16:53:47,427 INFO L93 Difference]: Finished difference Result 181 states and 214 transitions. [2022-11-25 16:53:47,428 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-25 16:53:47,428 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 7.166666666666667) internal successors, (43), 7 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 27 [2022-11-25 16:53:47,428 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 16:53:47,429 INFO L225 Difference]: With dead ends: 181 [2022-11-25 16:53:47,429 INFO L226 Difference]: Without dead ends: 181 [2022-11-25 16:53:47,430 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 54 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2022-11-25 16:53:47,430 INFO L413 NwaCegarLoop]: 45 mSDtfsCounter, 118 mSDsluCounter, 96 mSDsCounter, 0 mSdLazyCounter, 123 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 118 SdHoareTripleChecker+Valid, 141 SdHoareTripleChecker+Invalid, 128 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 123 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-25 16:53:47,430 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [118 Valid, 141 Invalid, 128 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 123 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-25 16:53:47,431 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 181 states. [2022-11-25 16:53:47,434 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 181 to 160. [2022-11-25 16:53:47,434 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 160 states, 145 states have (on average 1.3310344827586207) internal successors, (193), 159 states have internal predecessors, (193), 0 states have call successors, (0), 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-25 16:53:47,435 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 160 states to 160 states and 193 transitions. [2022-11-25 16:53:47,435 INFO L78 Accepts]: Start accepts. Automaton has 160 states and 193 transitions. Word has length 27 [2022-11-25 16:53:47,435 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 16:53:47,435 INFO L495 AbstractCegarLoop]: Abstraction has 160 states and 193 transitions. [2022-11-25 16:53:47,436 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 7.166666666666667) internal successors, (43), 7 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 16:53:47,436 INFO L276 IsEmpty]: Start isEmpty. Operand 160 states and 193 transitions. [2022-11-25 16:53:47,436 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2022-11-25 16:53:47,436 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 16:53:47,436 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1] [2022-11-25 16:53:47,444 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_566ce540-1391-469b-bbbb-cc92d0ef0a3d/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-11-25 16:53:47,643 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_566ce540-1391-469b-bbbb-cc92d0ef0a3d/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 16:53:47,643 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr25REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 38 more)] === [2022-11-25 16:53:47,644 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 16:53:47,644 INFO L85 PathProgramCache]: Analyzing trace with hash 2078846144, now seen corresponding path program 1 times [2022-11-25 16:53:47,644 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 16:53:47,644 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [462180112] [2022-11-25 16:53:47,644 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 16:53:47,645 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 16:53:47,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 16:53:47,882 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 2 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 16:53:47,882 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 16:53:47,883 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [462180112] [2022-11-25 16:53:47,883 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [462180112] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-25 16:53:47,883 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [964785690] [2022-11-25 16:53:47,883 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 16:53:47,884 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 16:53:47,884 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_566ce540-1391-469b-bbbb-cc92d0ef0a3d/bin/uautomizer-ZsLfNo2U6R/z3 [2022-11-25 16:53:47,885 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_566ce540-1391-469b-bbbb-cc92d0ef0a3d/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-25 16:53:47,908 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_566ce540-1391-469b-bbbb-cc92d0ef0a3d/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-11-25 16:53:48,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 16:53:48,061 INFO L263 TraceCheckSpWp]: Trace formula consists of 252 conjuncts, 15 conjunts are in the unsatisfiable core [2022-11-25 16:53:48,065 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 16:53:48,077 INFO L350 Elim1Store]: Elim1 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-25 16:53:48,215 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 16:53:48,216 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-11-25 16:53:48,228 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-11-25 16:53:48,229 INFO L350 Elim1Store]: Elim1 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-25 16:53:48,297 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 2 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 16:53:48,298 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-25 16:53:48,686 INFO L350 Elim1Store]: Elim1 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 46 [2022-11-25 16:53:48,758 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 2 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 16:53:48,758 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [964785690] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-25 16:53:48,759 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-25 16:53:48,759 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 5] total 14 [2022-11-25 16:53:48,759 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1066627502] [2022-11-25 16:53:48,759 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-25 16:53:48,760 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-11-25 16:53:48,760 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 16:53:48,760 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-11-25 16:53:48,761 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=158, Unknown=0, NotChecked=0, Total=210 [2022-11-25 16:53:48,761 INFO L87 Difference]: Start difference. First operand 160 states and 193 transitions. Second operand has 15 states, 14 states have (on average 5.357142857142857) internal successors, (75), 15 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 16:53:49,015 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 16:53:49,015 INFO L93 Difference]: Finished difference Result 180 states and 212 transitions. [2022-11-25 16:53:49,016 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-25 16:53:49,016 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 14 states have (on average 5.357142857142857) internal successors, (75), 15 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 27 [2022-11-25 16:53:49,016 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 16:53:49,017 INFO L225 Difference]: With dead ends: 180 [2022-11-25 16:53:49,017 INFO L226 Difference]: Without dead ends: 180 [2022-11-25 16:53:49,017 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 46 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 56 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=74, Invalid=198, Unknown=0, NotChecked=0, Total=272 [2022-11-25 16:53:49,018 INFO L413 NwaCegarLoop]: 40 mSDtfsCounter, 220 mSDsluCounter, 126 mSDsCounter, 0 mSdLazyCounter, 191 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 220 SdHoareTripleChecker+Valid, 166 SdHoareTripleChecker+Invalid, 198 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 191 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-25 16:53:49,018 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [220 Valid, 166 Invalid, 198 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 191 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-25 16:53:49,019 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 180 states. [2022-11-25 16:53:49,021 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 180 to 159. [2022-11-25 16:53:49,022 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 159 states, 145 states have (on average 1.3172413793103448) internal successors, (191), 158 states have internal predecessors, (191), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 16:53:49,022 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 159 states to 159 states and 191 transitions. [2022-11-25 16:53:49,023 INFO L78 Accepts]: Start accepts. Automaton has 159 states and 191 transitions. Word has length 27 [2022-11-25 16:53:49,023 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 16:53:49,023 INFO L495 AbstractCegarLoop]: Abstraction has 159 states and 191 transitions. [2022-11-25 16:53:49,023 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 14 states have (on average 5.357142857142857) internal successors, (75), 15 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 16:53:49,023 INFO L276 IsEmpty]: Start isEmpty. Operand 159 states and 191 transitions. [2022-11-25 16:53:49,023 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2022-11-25 16:53:49,023 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 16:53:49,024 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 16:53:49,039 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_566ce540-1391-469b-bbbb-cc92d0ef0a3d/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-11-25 16:53:49,231 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_566ce540-1391-469b-bbbb-cc92d0ef0a3d/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable20 [2022-11-25 16:53:49,231 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr40ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 38 more)] === [2022-11-25 16:53:49,232 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 16:53:49,232 INFO L85 PathProgramCache]: Analyzing trace with hash 723701189, now seen corresponding path program 1 times [2022-11-25 16:53:49,232 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 16:53:49,232 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1677399241] [2022-11-25 16:53:49,232 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 16:53:49,232 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 16:53:49,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 16:53:49,343 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 16:53:49,344 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 16:53:49,344 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1677399241] [2022-11-25 16:53:49,344 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1677399241] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-25 16:53:49,344 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [840140740] [2022-11-25 16:53:49,344 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 16:53:49,345 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 16:53:49,345 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_566ce540-1391-469b-bbbb-cc92d0ef0a3d/bin/uautomizer-ZsLfNo2U6R/z3 [2022-11-25 16:53:49,346 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_566ce540-1391-469b-bbbb-cc92d0ef0a3d/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-25 16:53:49,374 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_566ce540-1391-469b-bbbb-cc92d0ef0a3d/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-11-25 16:53:49,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 16:53:49,488 INFO L263 TraceCheckSpWp]: Trace formula consists of 197 conjuncts, 14 conjunts are in the unsatisfiable core [2022-11-25 16:53:49,491 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 16:53:49,549 INFO L350 Elim1Store]: Elim1 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 13 treesize of output 9 [2022-11-25 16:53:49,577 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 16:53:49,577 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-25 16:53:49,629 WARN L837 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_~x~0#1.base_37| Int)) (or (= |c_ULTIMATE.start_main_old_#valid#1| (store |c_#valid| |v_ULTIMATE.start_main_~x~0#1.base_37| 0)) (not (= (select |c_#valid| |v_ULTIMATE.start_main_~x~0#1.base_37|) 0)))) is different from false [2022-11-25 16:53:49,637 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 2 not checked. [2022-11-25 16:53:49,637 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [840140740] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-25 16:53:49,637 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-25 16:53:49,638 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 6, 6] total 7 [2022-11-25 16:53:49,638 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [779324700] [2022-11-25 16:53:49,638 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-25 16:53:49,639 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-11-25 16:53:49,639 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 16:53:49,639 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-11-25 16:53:49,639 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=31, Unknown=1, NotChecked=10, Total=56 [2022-11-25 16:53:49,640 INFO L87 Difference]: Start difference. First operand 159 states and 191 transitions. Second operand has 8 states, 7 states have (on average 5.0) internal successors, (35), 8 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 16:53:49,884 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 16:53:49,884 INFO L93 Difference]: Finished difference Result 161 states and 192 transitions. [2022-11-25 16:53:49,885 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-11-25 16:53:49,885 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 5.0) internal successors, (35), 8 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 28 [2022-11-25 16:53:49,885 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 16:53:49,885 INFO L225 Difference]: With dead ends: 161 [2022-11-25 16:53:49,886 INFO L226 Difference]: Without dead ends: 149 [2022-11-25 16:53:49,886 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 53 SyntacticMatches, 2 SemanticMatches, 10 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=36, Invalid=77, Unknown=1, NotChecked=18, Total=132 [2022-11-25 16:53:49,886 INFO L413 NwaCegarLoop]: 48 mSDtfsCounter, 17 mSDsluCounter, 167 mSDsCounter, 0 mSdLazyCounter, 194 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 215 SdHoareTripleChecker+Invalid, 249 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 194 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 53 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-25 16:53:49,887 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 215 Invalid, 249 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 194 Invalid, 0 Unknown, 53 Unchecked, 0.2s Time] [2022-11-25 16:53:49,887 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 149 states. [2022-11-25 16:53:49,889 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 149 to 149. [2022-11-25 16:53:49,889 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 149 states, 135 states have (on average 1.3333333333333333) internal successors, (180), 148 states have internal predecessors, (180), 0 states have call successors, (0), 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-25 16:53:49,890 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 149 states to 149 states and 180 transitions. [2022-11-25 16:53:49,890 INFO L78 Accepts]: Start accepts. Automaton has 149 states and 180 transitions. Word has length 28 [2022-11-25 16:53:49,890 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 16:53:49,890 INFO L495 AbstractCegarLoop]: Abstraction has 149 states and 180 transitions. [2022-11-25 16:53:49,890 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 5.0) internal successors, (35), 8 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 16:53:49,890 INFO L276 IsEmpty]: Start isEmpty. Operand 149 states and 180 transitions. [2022-11-25 16:53:49,890 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2022-11-25 16:53:49,890 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 16:53:49,891 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] [2022-11-25 16:53:49,897 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_566ce540-1391-469b-bbbb-cc92d0ef0a3d/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2022-11-25 16:53:50,097 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21,5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_566ce540-1391-469b-bbbb-cc92d0ef0a3d/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 16:53:50,097 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr29REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 38 more)] === [2022-11-25 16:53:50,097 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 16:53:50,098 INFO L85 PathProgramCache]: Analyzing trace with hash -28804244, now seen corresponding path program 1 times [2022-11-25 16:53:50,098 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 16:53:50,098 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [486290521] [2022-11-25 16:53:50,098 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 16:53:50,098 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 16:53:50,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 16:53:50,678 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 16:53:50,678 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 16:53:50,678 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [486290521] [2022-11-25 16:53:50,678 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [486290521] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-25 16:53:50,678 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2112200282] [2022-11-25 16:53:50,679 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 16:53:50,679 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 16:53:50,679 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_566ce540-1391-469b-bbbb-cc92d0ef0a3d/bin/uautomizer-ZsLfNo2U6R/z3 [2022-11-25 16:53:50,680 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_566ce540-1391-469b-bbbb-cc92d0ef0a3d/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-25 16:53:50,699 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_566ce540-1391-469b-bbbb-cc92d0ef0a3d/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-11-25 16:53:50,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 16:53:50,858 INFO L263 TraceCheckSpWp]: Trace formula consists of 274 conjuncts, 30 conjunts are in the unsatisfiable core [2022-11-25 16:53:50,863 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 16:53:50,874 INFO L350 Elim1Store]: Elim1 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-25 16:53:50,916 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-25 16:53:50,936 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 16:53:50,937 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2022-11-25 16:53:50,963 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 16:53:50,964 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2022-11-25 16:53:51,014 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-11-25 16:53:51,014 INFO L350 Elim1Store]: Elim1 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-25 16:53:51,022 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 14 [2022-11-25 16:53:51,092 INFO L350 Elim1Store]: Elim1 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 18 [2022-11-25 16:53:51,177 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 7 [2022-11-25 16:53:51,246 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 16:53:51,246 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-25 16:53:51,594 INFO L350 Elim1Store]: Elim1 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 46 [2022-11-25 16:53:51,675 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 16:53:51,675 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2112200282] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-25 16:53:51,676 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-25 16:53:51,676 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9, 5] total 17 [2022-11-25 16:53:51,676 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1025752968] [2022-11-25 16:53:51,676 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-25 16:53:51,677 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2022-11-25 16:53:51,677 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 16:53:51,678 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2022-11-25 16:53:51,678 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=72, Invalid=234, Unknown=0, NotChecked=0, Total=306 [2022-11-25 16:53:51,678 INFO L87 Difference]: Start difference. First operand 149 states and 180 transitions. Second operand has 18 states, 17 states have (on average 4.235294117647059) internal successors, (72), 18 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 16:53:52,540 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 16:53:52,540 INFO L93 Difference]: Finished difference Result 229 states and 267 transitions. [2022-11-25 16:53:52,541 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2022-11-25 16:53:52,541 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 17 states have (on average 4.235294117647059) internal successors, (72), 18 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 31 [2022-11-25 16:53:52,541 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 16:53:52,542 INFO L225 Difference]: With dead ends: 229 [2022-11-25 16:53:52,542 INFO L226 Difference]: Without dead ends: 229 [2022-11-25 16:53:52,543 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 88 GetRequests, 58 SyntacticMatches, 1 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 185 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=241, Invalid=689, Unknown=0, NotChecked=0, Total=930 [2022-11-25 16:53:52,544 INFO L413 NwaCegarLoop]: 46 mSDtfsCounter, 245 mSDsluCounter, 269 mSDsCounter, 0 mSdLazyCounter, 450 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 245 SdHoareTripleChecker+Valid, 315 SdHoareTripleChecker+Invalid, 473 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 450 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-11-25 16:53:52,544 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [245 Valid, 315 Invalid, 473 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 450 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-11-25 16:53:52,545 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 229 states. [2022-11-25 16:53:52,547 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 229 to 166. [2022-11-25 16:53:52,548 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 166 states, 152 states have (on average 1.3092105263157894) internal successors, (199), 165 states have internal predecessors, (199), 0 states have call successors, (0), 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-25 16:53:52,548 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 166 states to 166 states and 199 transitions. [2022-11-25 16:53:52,549 INFO L78 Accepts]: Start accepts. Automaton has 166 states and 199 transitions. Word has length 31 [2022-11-25 16:53:52,549 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 16:53:52,549 INFO L495 AbstractCegarLoop]: Abstraction has 166 states and 199 transitions. [2022-11-25 16:53:52,549 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 17 states have (on average 4.235294117647059) internal successors, (72), 18 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 16:53:52,549 INFO L276 IsEmpty]: Start isEmpty. Operand 166 states and 199 transitions. [2022-11-25 16:53:52,550 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2022-11-25 16:53:52,550 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 16:53:52,550 INFO L195 NwaCegarLoop]: trace histogram [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] [2022-11-25 16:53:52,562 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_566ce540-1391-469b-bbbb-cc92d0ef0a3d/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2022-11-25 16:53:52,750 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_566ce540-1391-469b-bbbb-cc92d0ef0a3d/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable22 [2022-11-25 16:53:52,751 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr16REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 38 more)] === [2022-11-25 16:53:52,751 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 16:53:52,751 INFO L85 PathProgramCache]: Analyzing trace with hash 36474197, now seen corresponding path program 1 times [2022-11-25 16:53:52,751 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 16:53:52,751 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [27505308] [2022-11-25 16:53:52,752 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 16:53:52,752 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 16:53:52,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 16:53:53,141 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 2 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 16:53:53,141 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 16:53:53,142 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [27505308] [2022-11-25 16:53:53,142 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [27505308] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-25 16:53:53,142 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [565783301] [2022-11-25 16:53:53,142 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 16:53:53,142 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 16:53:53,143 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_566ce540-1391-469b-bbbb-cc92d0ef0a3d/bin/uautomizer-ZsLfNo2U6R/z3 [2022-11-25 16:53:53,145 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_566ce540-1391-469b-bbbb-cc92d0ef0a3d/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-25 16:53:53,167 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_566ce540-1391-469b-bbbb-cc92d0ef0a3d/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2022-11-25 16:53:53,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 16:53:53,351 INFO L263 TraceCheckSpWp]: Trace formula consists of 298 conjuncts, 19 conjunts are in the unsatisfiable core [2022-11-25 16:53:53,357 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 16:53:53,361 INFO L350 Elim1Store]: Elim1 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-25 16:53:53,387 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-25 16:53:53,417 INFO L321 Elim1Store]: treesize reduction 30, result has 37.5 percent of original size [2022-11-25 16:53:53,418 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 29 [2022-11-25 16:53:53,500 INFO L321 Elim1Store]: treesize reduction 25, result has 21.9 percent of original size [2022-11-25 16:53:53,501 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 33 treesize of output 24 [2022-11-25 16:53:53,562 INFO L321 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2022-11-25 16:53:53,563 INFO L350 Elim1Store]: Elim1 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 36 treesize of output 16 [2022-11-25 16:53:53,567 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 2 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 16:53:53,567 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-25 16:53:53,739 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 2 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 16:53:53,739 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [565783301] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-25 16:53:53,739 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-25 16:53:53,740 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 13 [2022-11-25 16:53:53,740 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1915419884] [2022-11-25 16:53:53,740 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-25 16:53:53,741 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-11-25 16:53:53,741 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 16:53:53,742 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-11-25 16:53:53,742 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=147, Unknown=0, NotChecked=0, Total=182 [2022-11-25 16:53:53,742 INFO L87 Difference]: Start difference. First operand 166 states and 199 transitions. Second operand has 14 states, 13 states have (on average 4.230769230769231) internal successors, (55), 14 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 16:53:54,239 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 16:53:54,239 INFO L93 Difference]: Finished difference Result 184 states and 218 transitions. [2022-11-25 16:53:54,240 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-11-25 16:53:54,240 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 4.230769230769231) internal successors, (55), 14 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 32 [2022-11-25 16:53:54,240 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 16:53:54,241 INFO L225 Difference]: With dead ends: 184 [2022-11-25 16:53:54,241 INFO L226 Difference]: Without dead ends: 184 [2022-11-25 16:53:54,242 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 77 GetRequests, 57 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 65 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=127, Invalid=335, Unknown=0, NotChecked=0, Total=462 [2022-11-25 16:53:54,243 INFO L413 NwaCegarLoop]: 40 mSDtfsCounter, 45 mSDsluCounter, 279 mSDsCounter, 0 mSdLazyCounter, 302 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 45 SdHoareTripleChecker+Valid, 319 SdHoareTripleChecker+Invalid, 316 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 302 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-25 16:53:54,243 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [45 Valid, 319 Invalid, 316 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 302 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-11-25 16:53:54,244 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 184 states. [2022-11-25 16:53:54,246 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 184 to 165. [2022-11-25 16:53:54,247 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 165 states, 152 states have (on average 1.2960526315789473) internal successors, (197), 164 states have internal predecessors, (197), 0 states have call successors, (0), 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-25 16:53:54,248 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 165 states to 165 states and 197 transitions. [2022-11-25 16:53:54,248 INFO L78 Accepts]: Start accepts. Automaton has 165 states and 197 transitions. Word has length 32 [2022-11-25 16:53:54,248 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 16:53:54,248 INFO L495 AbstractCegarLoop]: Abstraction has 165 states and 197 transitions. [2022-11-25 16:53:54,248 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 4.230769230769231) internal successors, (55), 14 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 16:53:54,248 INFO L276 IsEmpty]: Start isEmpty. Operand 165 states and 197 transitions. [2022-11-25 16:53:54,249 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2022-11-25 16:53:54,249 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 16:53:54,249 INFO L195 NwaCegarLoop]: trace histogram [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] [2022-11-25 16:53:54,263 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_566ce540-1391-469b-bbbb-cc92d0ef0a3d/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2022-11-25 16:53:54,449 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_566ce540-1391-469b-bbbb-cc92d0ef0a3d/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable23 [2022-11-25 16:53:54,450 INFO L420 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr17REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 38 more)] === [2022-11-25 16:53:54,450 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 16:53:54,450 INFO L85 PathProgramCache]: Analyzing trace with hash 36474198, now seen corresponding path program 1 times [2022-11-25 16:53:54,450 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 16:53:54,451 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [821028046] [2022-11-25 16:53:54,451 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 16:53:54,451 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 16:53:54,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 16:53:55,049 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 2 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 16:53:55,050 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 16:53:55,050 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [821028046] [2022-11-25 16:53:55,050 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [821028046] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-25 16:53:55,050 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [580315908] [2022-11-25 16:53:55,050 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 16:53:55,051 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 16:53:55,051 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_566ce540-1391-469b-bbbb-cc92d0ef0a3d/bin/uautomizer-ZsLfNo2U6R/z3 [2022-11-25 16:53:55,052 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_566ce540-1391-469b-bbbb-cc92d0ef0a3d/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-25 16:53:55,078 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_566ce540-1391-469b-bbbb-cc92d0ef0a3d/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2022-11-25 16:53:55,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 16:53:55,262 INFO L263 TraceCheckSpWp]: Trace formula consists of 298 conjuncts, 33 conjunts are in the unsatisfiable core [2022-11-25 16:53:55,270 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 16:53:55,275 INFO L350 Elim1Store]: Elim1 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-25 16:53:55,370 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-25 16:53:55,376 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-25 16:53:55,447 INFO L321 Elim1Store]: treesize reduction 4, result has 66.7 percent of original size [2022-11-25 16:53:55,448 INFO L350 Elim1Store]: Elim1 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 15 treesize of output 15 [2022-11-25 16:53:55,456 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 24 [2022-11-25 16:53:55,577 INFO L321 Elim1Store]: treesize reduction 25, result has 21.9 percent of original size [2022-11-25 16:53:55,578 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 38 treesize of output 29 [2022-11-25 16:53:55,603 INFO L321 Elim1Store]: treesize reduction 25, result has 21.9 percent of original size [2022-11-25 16:53:55,604 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 39 treesize of output 30 [2022-11-25 16:53:55,705 INFO L321 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2022-11-25 16:53:55,706 INFO L350 Elim1Store]: Elim1 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 42 treesize of output 22 [2022-11-25 16:53:55,714 INFO L321 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2022-11-25 16:53:55,714 INFO L350 Elim1Store]: Elim1 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 37 treesize of output 17 [2022-11-25 16:53:55,744 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 2 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 16:53:55,744 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-25 16:54:02,205 INFO L350 Elim1Store]: Elim1 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 46 [2022-11-25 16:54:02,416 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 2 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 16:54:02,417 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [580315908] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-25 16:54:02,417 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-25 16:54:02,417 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 22 [2022-11-25 16:54:02,418 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [887025892] [2022-11-25 16:54:02,418 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-25 16:54:02,418 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2022-11-25 16:54:02,418 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 16:54:02,419 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2022-11-25 16:54:02,420 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=438, Unknown=0, NotChecked=0, Total=506 [2022-11-25 16:54:02,420 INFO L87 Difference]: Start difference. First operand 165 states and 197 transitions. Second operand has 23 states, 22 states have (on average 3.272727272727273) internal successors, (72), 23 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 16:54:04,083 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 16:54:04,083 INFO L93 Difference]: Finished difference Result 239 states and 283 transitions. [2022-11-25 16:54:04,083 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-11-25 16:54:04,084 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 22 states have (on average 3.272727272727273) internal successors, (72), 23 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 32 [2022-11-25 16:54:04,084 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 16:54:04,085 INFO L225 Difference]: With dead ends: 239 [2022-11-25 16:54:04,085 INFO L226 Difference]: Without dead ends: 239 [2022-11-25 16:54:04,086 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 82 GetRequests, 49 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 163 ImplicationChecksByTransitivity, 7.5s TimeCoverageRelationStatistics Valid=260, Invalid=930, Unknown=0, NotChecked=0, Total=1190 [2022-11-25 16:54:04,087 INFO L413 NwaCegarLoop]: 49 mSDtfsCounter, 104 mSDsluCounter, 440 mSDsCounter, 0 mSdLazyCounter, 495 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 104 SdHoareTripleChecker+Valid, 489 SdHoareTripleChecker+Invalid, 512 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 495 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2022-11-25 16:54:04,087 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [104 Valid, 489 Invalid, 512 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 495 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2022-11-25 16:54:04,088 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 239 states. [2022-11-25 16:54:04,090 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 239 to 150. [2022-11-25 16:54:04,091 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 150 states, 138 states have (on average 1.3043478260869565) internal successors, (180), 149 states have internal predecessors, (180), 0 states have call successors, (0), 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-25 16:54:04,095 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 150 states to 150 states and 180 transitions. [2022-11-25 16:54:04,095 INFO L78 Accepts]: Start accepts. Automaton has 150 states and 180 transitions. Word has length 32 [2022-11-25 16:54:04,095 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 16:54:04,095 INFO L495 AbstractCegarLoop]: Abstraction has 150 states and 180 transitions. [2022-11-25 16:54:04,096 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 22 states have (on average 3.272727272727273) internal successors, (72), 23 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 16:54:04,096 INFO L276 IsEmpty]: Start isEmpty. Operand 150 states and 180 transitions. [2022-11-25 16:54:04,096 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2022-11-25 16:54:04,096 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 16:54:04,096 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] [2022-11-25 16:54:04,109 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_566ce540-1391-469b-bbbb-cc92d0ef0a3d/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2022-11-25 16:54:04,299 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24,8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_566ce540-1391-469b-bbbb-cc92d0ef0a3d/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 16:54:04,300 INFO L420 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr31REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 38 more)] === [2022-11-25 16:54:04,300 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 16:54:04,301 INFO L85 PathProgramCache]: Analyzing trace with hash -1911073267, now seen corresponding path program 1 times [2022-11-25 16:54:04,301 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 16:54:04,301 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1827081485] [2022-11-25 16:54:04,301 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 16:54:04,301 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 16:54:04,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 16:54:04,973 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 16:54:04,973 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 16:54:04,973 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1827081485] [2022-11-25 16:54:04,973 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1827081485] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-25 16:54:04,974 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [245699987] [2022-11-25 16:54:04,974 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 16:54:04,974 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 16:54:04,974 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_566ce540-1391-469b-bbbb-cc92d0ef0a3d/bin/uautomizer-ZsLfNo2U6R/z3 [2022-11-25 16:54:04,976 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_566ce540-1391-469b-bbbb-cc92d0ef0a3d/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-25 16:54:04,999 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_566ce540-1391-469b-bbbb-cc92d0ef0a3d/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2022-11-25 16:54:05,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 16:54:05,188 INFO L263 TraceCheckSpWp]: Trace formula consists of 286 conjuncts, 10 conjunts are in the unsatisfiable core [2022-11-25 16:54:05,190 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 16:54:05,319 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-11-25 16:54:05,320 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-25 16:54:05,320 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [245699987] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 16:54:05,320 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-11-25 16:54:05,320 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [9] total 13 [2022-11-25 16:54:05,320 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [349837688] [2022-11-25 16:54:05,320 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 16:54:05,321 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-25 16:54:05,321 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 16:54:05,322 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-25 16:54:05,322 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=144, Unknown=0, NotChecked=0, Total=182 [2022-11-25 16:54:05,323 INFO L87 Difference]: Start difference. First operand 150 states and 180 transitions. Second operand has 6 states, 5 states have (on average 6.4) internal successors, (32), 6 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 16:54:05,563 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 16:54:05,563 INFO L93 Difference]: Finished difference Result 164 states and 186 transitions. [2022-11-25 16:54:05,563 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-11-25 16:54:05,564 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 6.4) internal successors, (32), 6 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 33 [2022-11-25 16:54:05,564 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 16:54:05,565 INFO L225 Difference]: With dead ends: 164 [2022-11-25 16:54:05,565 INFO L226 Difference]: Without dead ends: 164 [2022-11-25 16:54:05,565 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 72 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=69, Invalid=273, Unknown=0, NotChecked=0, Total=342 [2022-11-25 16:54:05,566 INFO L413 NwaCegarLoop]: 37 mSDtfsCounter, 118 mSDsluCounter, 58 mSDsCounter, 0 mSdLazyCounter, 98 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 118 SdHoareTripleChecker+Valid, 95 SdHoareTripleChecker+Invalid, 101 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 98 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-25 16:54:05,566 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [118 Valid, 95 Invalid, 101 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 98 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-25 16:54:05,567 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 164 states. [2022-11-25 16:54:05,570 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 164 to 150. [2022-11-25 16:54:05,570 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 150 states, 138 states have (on average 1.2971014492753623) internal successors, (179), 149 states have internal predecessors, (179), 0 states have call successors, (0), 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-25 16:54:05,571 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 150 states to 150 states and 179 transitions. [2022-11-25 16:54:05,571 INFO L78 Accepts]: Start accepts. Automaton has 150 states and 179 transitions. Word has length 33 [2022-11-25 16:54:05,571 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 16:54:05,573 INFO L495 AbstractCegarLoop]: Abstraction has 150 states and 179 transitions. [2022-11-25 16:54:05,575 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 6.4) internal successors, (32), 6 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 16:54:05,575 INFO L276 IsEmpty]: Start isEmpty. Operand 150 states and 179 transitions. [2022-11-25 16:54:05,575 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2022-11-25 16:54:05,576 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 16:54:05,576 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] [2022-11-25 16:54:05,590 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_566ce540-1391-469b-bbbb-cc92d0ef0a3d/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2022-11-25 16:54:05,776 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25,9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_566ce540-1391-469b-bbbb-cc92d0ef0a3d/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 16:54:05,777 INFO L420 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr37ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 38 more)] === [2022-11-25 16:54:05,777 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 16:54:05,777 INFO L85 PathProgramCache]: Analyzing trace with hash 1302827474, now seen corresponding path program 1 times [2022-11-25 16:54:05,777 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 16:54:05,778 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1088690793] [2022-11-25 16:54:05,778 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 16:54:05,778 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 16:54:05,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 16:54:05,873 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-11-25 16:54:05,874 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 16:54:05,874 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1088690793] [2022-11-25 16:54:05,876 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1088690793] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 16:54:05,876 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 16:54:05,876 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-25 16:54:05,876 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1819877682] [2022-11-25 16:54:05,877 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 16:54:05,877 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-25 16:54:05,877 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 16:54:05,878 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-25 16:54:05,878 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-11-25 16:54:05,878 INFO L87 Difference]: Start difference. First operand 150 states and 179 transitions. Second operand has 5 states, 4 states have (on average 8.75) internal successors, (35), 5 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 16:54:05,981 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 16:54:05,981 INFO L93 Difference]: Finished difference Result 156 states and 177 transitions. [2022-11-25 16:54:05,982 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-25 16:54:05,982 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 8.75) internal successors, (35), 5 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 36 [2022-11-25 16:54:05,982 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 16:54:05,983 INFO L225 Difference]: With dead ends: 156 [2022-11-25 16:54:05,983 INFO L226 Difference]: Without dead ends: 156 [2022-11-25 16:54:05,984 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2022-11-25 16:54:05,984 INFO L413 NwaCegarLoop]: 43 mSDtfsCounter, 105 mSDsluCounter, 54 mSDsCounter, 0 mSdLazyCounter, 51 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 105 SdHoareTripleChecker+Valid, 97 SdHoareTripleChecker+Invalid, 54 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 51 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-25 16:54:05,984 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [105 Valid, 97 Invalid, 54 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 51 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-25 16:54:05,985 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 156 states. [2022-11-25 16:54:05,987 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 156 to 121. [2022-11-25 16:54:05,988 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 121 states, 109 states have (on average 1.275229357798165) internal successors, (139), 120 states have internal predecessors, (139), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 16:54:05,988 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121 states to 121 states and 139 transitions. [2022-11-25 16:54:05,989 INFO L78 Accepts]: Start accepts. Automaton has 121 states and 139 transitions. Word has length 36 [2022-11-25 16:54:05,989 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 16:54:05,989 INFO L495 AbstractCegarLoop]: Abstraction has 121 states and 139 transitions. [2022-11-25 16:54:05,989 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 8.75) internal successors, (35), 5 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 16:54:05,990 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 139 transitions. [2022-11-25 16:54:05,990 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2022-11-25 16:54:05,990 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 16:54:05,990 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] [2022-11-25 16:54:05,991 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2022-11-25 16:54:05,991 INFO L420 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr32REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 38 more)] === [2022-11-25 16:54:05,991 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 16:54:05,992 INFO L85 PathProgramCache]: Analyzing trace with hash 1302827524, now seen corresponding path program 1 times [2022-11-25 16:54:05,992 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 16:54:05,992 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [837854329] [2022-11-25 16:54:05,992 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 16:54:05,992 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 16:54:06,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 16:54:06,256 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-25 16:54:06,256 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 16:54:06,257 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [837854329] [2022-11-25 16:54:06,257 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [837854329] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 16:54:06,257 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 16:54:06,257 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-11-25 16:54:06,257 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [346059128] [2022-11-25 16:54:06,258 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 16:54:06,258 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-11-25 16:54:06,258 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 16:54:06,259 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-11-25 16:54:06,259 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2022-11-25 16:54:06,259 INFO L87 Difference]: Start difference. First operand 121 states and 139 transitions. Second operand has 8 states, 7 states have (on average 5.142857142857143) internal successors, (36), 8 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 16:54:06,615 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 16:54:06,615 INFO L93 Difference]: Finished difference Result 155 states and 174 transitions. [2022-11-25 16:54:06,615 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-11-25 16:54:06,616 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 5.142857142857143) internal successors, (36), 8 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 36 [2022-11-25 16:54:06,616 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 16:54:06,617 INFO L225 Difference]: With dead ends: 155 [2022-11-25 16:54:06,617 INFO L226 Difference]: Without dead ends: 155 [2022-11-25 16:54:06,617 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=49, Invalid=161, Unknown=0, NotChecked=0, Total=210 [2022-11-25 16:54:06,618 INFO L413 NwaCegarLoop]: 34 mSDtfsCounter, 71 mSDsluCounter, 137 mSDsCounter, 0 mSdLazyCounter, 251 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 71 SdHoareTripleChecker+Valid, 171 SdHoareTripleChecker+Invalid, 261 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 251 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-25 16:54:06,618 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [71 Valid, 171 Invalid, 261 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 251 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-11-25 16:54:06,618 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 155 states. [2022-11-25 16:54:06,621 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 155 to 130. [2022-11-25 16:54:06,621 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 130 states, 118 states have (on average 1.2796610169491525) internal successors, (151), 129 states have internal predecessors, (151), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 16:54:06,622 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 130 states to 130 states and 151 transitions. [2022-11-25 16:54:06,622 INFO L78 Accepts]: Start accepts. Automaton has 130 states and 151 transitions. Word has length 36 [2022-11-25 16:54:06,622 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 16:54:06,622 INFO L495 AbstractCegarLoop]: Abstraction has 130 states and 151 transitions. [2022-11-25 16:54:06,622 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 5.142857142857143) internal successors, (36), 8 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 16:54:06,622 INFO L276 IsEmpty]: Start isEmpty. Operand 130 states and 151 transitions. [2022-11-25 16:54:06,623 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2022-11-25 16:54:06,623 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 16:54:06,623 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] [2022-11-25 16:54:06,623 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2022-11-25 16:54:06,630 INFO L420 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr33REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 38 more)] === [2022-11-25 16:54:06,631 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 16:54:06,632 INFO L85 PathProgramCache]: Analyzing trace with hash 1302827525, now seen corresponding path program 1 times [2022-11-25 16:54:06,632 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 16:54:06,633 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [641522404] [2022-11-25 16:54:06,633 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 16:54:06,633 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 16:54:06,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 16:54:07,043 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-25 16:54:07,043 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 16:54:07,043 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [641522404] [2022-11-25 16:54:07,043 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [641522404] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 16:54:07,043 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 16:54:07,044 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-11-25 16:54:07,044 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [237173487] [2022-11-25 16:54:07,044 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 16:54:07,044 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-11-25 16:54:07,044 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 16:54:07,045 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-11-25 16:54:07,045 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2022-11-25 16:54:07,045 INFO L87 Difference]: Start difference. First operand 130 states and 151 transitions. Second operand has 8 states, 7 states have (on average 5.142857142857143) internal successors, (36), 8 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 16:54:07,542 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 16:54:07,542 INFO L93 Difference]: Finished difference Result 206 states and 232 transitions. [2022-11-25 16:54:07,542 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-11-25 16:54:07,542 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 5.142857142857143) internal successors, (36), 8 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 36 [2022-11-25 16:54:07,543 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 16:54:07,543 INFO L225 Difference]: With dead ends: 206 [2022-11-25 16:54:07,543 INFO L226 Difference]: Without dead ends: 206 [2022-11-25 16:54:07,544 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=49, Invalid=161, Unknown=0, NotChecked=0, Total=210 [2022-11-25 16:54:07,544 INFO L413 NwaCegarLoop]: 47 mSDtfsCounter, 127 mSDsluCounter, 202 mSDsCounter, 0 mSdLazyCounter, 289 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 127 SdHoareTripleChecker+Valid, 249 SdHoareTripleChecker+Invalid, 290 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 289 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-25 16:54:07,545 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [127 Valid, 249 Invalid, 290 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 289 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-11-25 16:54:07,545 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 206 states. [2022-11-25 16:54:07,547 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 206 to 130. [2022-11-25 16:54:07,548 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 130 states, 118 states have (on average 1.271186440677966) internal successors, (150), 129 states have internal predecessors, (150), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 16:54:07,548 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 130 states to 130 states and 150 transitions. [2022-11-25 16:54:07,548 INFO L78 Accepts]: Start accepts. Automaton has 130 states and 150 transitions. Word has length 36 [2022-11-25 16:54:07,548 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 16:54:07,548 INFO L495 AbstractCegarLoop]: Abstraction has 130 states and 150 transitions. [2022-11-25 16:54:07,549 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 5.142857142857143) internal successors, (36), 8 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 16:54:07,549 INFO L276 IsEmpty]: Start isEmpty. Operand 130 states and 150 transitions. [2022-11-25 16:54:07,549 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2022-11-25 16:54:07,549 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 16:54:07,549 INFO L195 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 16:54:07,549 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2022-11-25 16:54:07,550 INFO L420 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr32REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 38 more)] === [2022-11-25 16:54:07,550 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 16:54:07,550 INFO L85 PathProgramCache]: Analyzing trace with hash 904979977, now seen corresponding path program 1 times [2022-11-25 16:54:07,550 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 16:54:07,550 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1819541117] [2022-11-25 16:54:07,550 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 16:54:07,551 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 16:54:07,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 16:54:08,629 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 4 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 16:54:08,629 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 16:54:08,629 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1819541117] [2022-11-25 16:54:08,629 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1819541117] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-25 16:54:08,630 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1205731611] [2022-11-25 16:54:08,630 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 16:54:08,630 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 16:54:08,630 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_566ce540-1391-469b-bbbb-cc92d0ef0a3d/bin/uautomizer-ZsLfNo2U6R/z3 [2022-11-25 16:54:08,632 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_566ce540-1391-469b-bbbb-cc92d0ef0a3d/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-25 16:54:08,636 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_566ce540-1391-469b-bbbb-cc92d0ef0a3d/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2022-11-25 16:54:08,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 16:54:08,881 INFO L263 TraceCheckSpWp]: Trace formula consists of 326 conjuncts, 41 conjunts are in the unsatisfiable core [2022-11-25 16:54:08,891 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 16:54:08,900 INFO L350 Elim1Store]: Elim1 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-25 16:54:08,926 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-25 16:54:08,965 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 16:54:08,966 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2022-11-25 16:54:08,977 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 16:54:08,978 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2022-11-25 16:54:09,097 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-11-25 16:54:09,098 INFO L350 Elim1Store]: Elim1 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-25 16:54:09,164 INFO L350 Elim1Store]: Elim1 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 14 treesize of output 16 [2022-11-25 16:54:09,189 INFO L350 Elim1Store]: Elim1 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 14 treesize of output 16 [2022-11-25 16:54:09,213 INFO L350 Elim1Store]: Elim1 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 14 treesize of output 16 [2022-11-25 16:54:09,232 INFO L350 Elim1Store]: Elim1 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 14 treesize of output 16 [2022-11-25 16:54:09,261 INFO L350 Elim1Store]: Elim1 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 14 treesize of output 16 [2022-11-25 16:54:09,357 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 16:54:09,358 INFO L350 Elim1Store]: Elim1 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-25 16:54:09,403 INFO L350 Elim1Store]: Elim1 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 14 treesize of output 16 [2022-11-25 16:54:09,538 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-11-25 16:54:09,597 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 4 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 16:54:09,597 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-25 16:54:09,648 INFO L321 Elim1Store]: treesize reduction 5, result has 58.3 percent of original size [2022-11-25 16:54:09,649 INFO L350 Elim1Store]: Elim1 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 16 treesize of output 15 [2022-11-25 16:54:09,731 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1787 (Array Int Int))) (= (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_1787) |c_ULTIMATE.start_main_~first~0#1.base|) |c_ULTIMATE.start_main_~first~0#1.offset|) |c_ULTIMATE.start_main_~first~0#1.base|)) is different from false [2022-11-25 16:54:10,502 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-25 16:54:10,502 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 42 treesize of output 35 [2022-11-25 16:54:10,509 INFO L350 Elim1Store]: Elim1 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 70 treesize of output 66 [2022-11-25 16:54:10,515 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-25 16:54:10,519 INFO L350 Elim1Store]: Elim1 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 24 treesize of output 22 [2022-11-25 16:54:10,525 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-25 16:54:10,528 INFO L350 Elim1Store]: Elim1 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 32 treesize of output 28 [2022-11-25 16:54:10,538 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-11-25 16:54:10,590 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 4 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 16:54:10,590 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1205731611] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-25 16:54:10,591 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-25 16:54:10,591 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 11, 13] total 31 [2022-11-25 16:54:10,591 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [640782616] [2022-11-25 16:54:10,591 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-25 16:54:10,592 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 31 states [2022-11-25 16:54:10,593 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 16:54:10,594 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2022-11-25 16:54:10,594 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=100, Invalid=753, Unknown=21, NotChecked=56, Total=930 [2022-11-25 16:54:10,595 INFO L87 Difference]: Start difference. First operand 130 states and 150 transitions. Second operand has 31 states, 31 states have (on average 3.3548387096774195) internal successors, (104), 31 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 16:54:14,666 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 16:54:14,666 INFO L93 Difference]: Finished difference Result 245 states and 272 transitions. [2022-11-25 16:54:14,666 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2022-11-25 16:54:14,666 INFO L78 Accepts]: Start accepts. Automaton has has 31 states, 31 states have (on average 3.3548387096774195) internal successors, (104), 31 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 38 [2022-11-25 16:54:14,667 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 16:54:14,668 INFO L225 Difference]: With dead ends: 245 [2022-11-25 16:54:14,668 INFO L226 Difference]: Without dead ends: 245 [2022-11-25 16:54:14,669 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 128 GetRequests, 68 SyntacticMatches, 2 SemanticMatches, 58 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 629 ImplicationChecksByTransitivity, 3.3s TimeCoverageRelationStatistics Valid=527, Invalid=2856, Unknown=43, NotChecked=114, Total=3540 [2022-11-25 16:54:14,670 INFO L413 NwaCegarLoop]: 58 mSDtfsCounter, 276 mSDsluCounter, 653 mSDsCounter, 0 mSdLazyCounter, 1139 mSolverCounterSat, 72 mSolverCounterUnsat, 25 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 276 SdHoareTripleChecker+Valid, 711 SdHoareTripleChecker+Invalid, 1352 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 72 IncrementalHoareTripleChecker+Valid, 1139 IncrementalHoareTripleChecker+Invalid, 25 IncrementalHoareTripleChecker+Unknown, 116 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2022-11-25 16:54:14,670 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [276 Valid, 711 Invalid, 1352 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [72 Valid, 1139 Invalid, 25 Unknown, 116 Unchecked, 1.8s Time] [2022-11-25 16:54:14,671 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 245 states. [2022-11-25 16:54:14,674 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 245 to 173. [2022-11-25 16:54:14,674 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 173 states, 161 states have (on average 1.236024844720497) internal successors, (199), 172 states have internal predecessors, (199), 0 states have call successors, (0), 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-25 16:54:14,675 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 173 states to 173 states and 199 transitions. [2022-11-25 16:54:14,676 INFO L78 Accepts]: Start accepts. Automaton has 173 states and 199 transitions. Word has length 38 [2022-11-25 16:54:14,676 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 16:54:14,676 INFO L495 AbstractCegarLoop]: Abstraction has 173 states and 199 transitions. [2022-11-25 16:54:14,676 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 31 states, 31 states have (on average 3.3548387096774195) internal successors, (104), 31 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 16:54:14,676 INFO L276 IsEmpty]: Start isEmpty. Operand 173 states and 199 transitions. [2022-11-25 16:54:14,677 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2022-11-25 16:54:14,677 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 16:54:14,677 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] [2022-11-25 16:54:14,685 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_566ce540-1391-469b-bbbb-cc92d0ef0a3d/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2022-11-25 16:54:14,884 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29,10 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_566ce540-1391-469b-bbbb-cc92d0ef0a3d/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 16:54:14,885 INFO L420 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr34ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 38 more)] === [2022-11-25 16:54:14,885 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 16:54:14,885 INFO L85 PathProgramCache]: Analyzing trace with hash -2113196924, now seen corresponding path program 1 times [2022-11-25 16:54:14,886 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 16:54:14,886 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [520678590] [2022-11-25 16:54:14,886 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 16:54:14,886 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 16:54:14,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 16:54:15,123 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-25 16:54:15,123 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 16:54:15,123 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [520678590] [2022-11-25 16:54:15,124 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [520678590] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 16:54:15,124 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 16:54:15,124 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-11-25 16:54:15,124 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [783035839] [2022-11-25 16:54:15,124 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 16:54:15,125 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-11-25 16:54:15,125 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 16:54:15,125 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-11-25 16:54:15,126 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2022-11-25 16:54:15,126 INFO L87 Difference]: Start difference. First operand 173 states and 199 transitions. Second operand has 9 states, 8 states have (on average 4.75) internal successors, (38), 9 states have internal predecessors, (38), 0 states have call successors, (0), 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-25 16:54:15,667 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 16:54:15,667 INFO L93 Difference]: Finished difference Result 288 states and 322 transitions. [2022-11-25 16:54:15,667 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-11-25 16:54:15,668 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 4.75) internal successors, (38), 9 states have internal predecessors, (38), 0 states have call successors, (0), 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 38 [2022-11-25 16:54:15,668 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 16:54:15,669 INFO L225 Difference]: With dead ends: 288 [2022-11-25 16:54:15,669 INFO L226 Difference]: Without dead ends: 288 [2022-11-25 16:54:15,670 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 52 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=104, Invalid=316, Unknown=0, NotChecked=0, Total=420 [2022-11-25 16:54:15,670 INFO L413 NwaCegarLoop]: 71 mSDtfsCounter, 289 mSDsluCounter, 346 mSDsCounter, 0 mSdLazyCounter, 299 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 289 SdHoareTripleChecker+Valid, 417 SdHoareTripleChecker+Invalid, 306 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 299 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-25 16:54:15,670 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [289 Valid, 417 Invalid, 306 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 299 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-11-25 16:54:15,671 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 288 states. [2022-11-25 16:54:15,675 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 288 to 175. [2022-11-25 16:54:15,675 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 175 states, 163 states have (on average 1.2331288343558282) internal successors, (201), 174 states have internal predecessors, (201), 0 states have call successors, (0), 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-25 16:54:15,680 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 175 states to 175 states and 201 transitions. [2022-11-25 16:54:15,680 INFO L78 Accepts]: Start accepts. Automaton has 175 states and 201 transitions. Word has length 38 [2022-11-25 16:54:15,680 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 16:54:15,681 INFO L495 AbstractCegarLoop]: Abstraction has 175 states and 201 transitions. [2022-11-25 16:54:15,681 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 4.75) internal successors, (38), 9 states have internal predecessors, (38), 0 states have call successors, (0), 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-25 16:54:15,681 INFO L276 IsEmpty]: Start isEmpty. Operand 175 states and 201 transitions. [2022-11-25 16:54:15,682 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2022-11-25 16:54:15,682 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 16:54:15,682 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] [2022-11-25 16:54:15,682 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2022-11-25 16:54:15,683 INFO L420 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr35ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 38 more)] === [2022-11-25 16:54:15,684 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 16:54:15,684 INFO L85 PathProgramCache]: Analyzing trace with hash -1084595048, now seen corresponding path program 1 times [2022-11-25 16:54:15,684 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 16:54:15,684 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [813656373] [2022-11-25 16:54:15,685 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 16:54:15,685 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 16:54:15,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 16:54:15,977 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-25 16:54:15,977 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 16:54:15,978 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [813656373] [2022-11-25 16:54:15,978 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [813656373] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 16:54:15,978 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 16:54:15,978 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-11-25 16:54:15,978 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1330652621] [2022-11-25 16:54:15,978 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 16:54:15,978 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-11-25 16:54:15,979 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 16:54:15,979 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-11-25 16:54:15,979 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2022-11-25 16:54:15,979 INFO L87 Difference]: Start difference. First operand 175 states and 201 transitions. Second operand has 9 states, 8 states have (on average 4.875) internal successors, (39), 9 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 16:54:16,569 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 16:54:16,569 INFO L93 Difference]: Finished difference Result 287 states and 321 transitions. [2022-11-25 16:54:16,569 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-11-25 16:54:16,570 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 4.875) internal successors, (39), 9 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 39 [2022-11-25 16:54:16,570 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 16:54:16,571 INFO L225 Difference]: With dead ends: 287 [2022-11-25 16:54:16,571 INFO L226 Difference]: Without dead ends: 287 [2022-11-25 16:54:16,571 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=73, Invalid=269, Unknown=0, NotChecked=0, Total=342 [2022-11-25 16:54:16,572 INFO L413 NwaCegarLoop]: 55 mSDtfsCounter, 194 mSDsluCounter, 292 mSDsCounter, 0 mSdLazyCounter, 367 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 194 SdHoareTripleChecker+Valid, 347 SdHoareTripleChecker+Invalid, 370 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 367 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-11-25 16:54:16,572 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [194 Valid, 347 Invalid, 370 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 367 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-11-25 16:54:16,573 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 287 states. [2022-11-25 16:54:16,577 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 287 to 176. [2022-11-25 16:54:16,578 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 176 states, 164 states have (on average 1.2317073170731707) internal successors, (202), 175 states have internal predecessors, (202), 0 states have call successors, (0), 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-25 16:54:16,579 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 176 states to 176 states and 202 transitions. [2022-11-25 16:54:16,579 INFO L78 Accepts]: Start accepts. Automaton has 176 states and 202 transitions. Word has length 39 [2022-11-25 16:54:16,579 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 16:54:16,580 INFO L495 AbstractCegarLoop]: Abstraction has 176 states and 202 transitions. [2022-11-25 16:54:16,580 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 4.875) internal successors, (39), 9 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 16:54:16,580 INFO L276 IsEmpty]: Start isEmpty. Operand 176 states and 202 transitions. [2022-11-25 16:54:16,580 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2022-11-25 16:54:16,581 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 16:54:16,581 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] [2022-11-25 16:54:16,581 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2022-11-25 16:54:16,581 INFO L420 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr28REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 38 more)] === [2022-11-25 16:54:16,582 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 16:54:16,582 INFO L85 PathProgramCache]: Analyzing trace with hash 693362007, now seen corresponding path program 1 times [2022-11-25 16:54:16,582 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 16:54:16,582 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [101571442] [2022-11-25 16:54:16,583 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 16:54:16,583 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 16:54:16,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 16:54:16,837 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 16:54:16,838 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 16:54:16,838 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [101571442] [2022-11-25 16:54:16,838 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [101571442] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-25 16:54:16,839 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [492334615] [2022-11-25 16:54:16,839 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 16:54:16,839 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 16:54:16,839 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_566ce540-1391-469b-bbbb-cc92d0ef0a3d/bin/uautomizer-ZsLfNo2U6R/z3 [2022-11-25 16:54:16,844 INFO L229 MonitoredProcess]: Starting monitored process 11 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_566ce540-1391-469b-bbbb-cc92d0ef0a3d/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-25 16:54:16,875 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_566ce540-1391-469b-bbbb-cc92d0ef0a3d/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2022-11-25 16:54:17,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 16:54:17,101 INFO L263 TraceCheckSpWp]: Trace formula consists of 314 conjuncts, 23 conjunts are in the unsatisfiable core [2022-11-25 16:54:17,104 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 16:54:17,113 INFO L350 Elim1Store]: Elim1 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-25 16:54:17,200 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-11-25 16:54:17,201 INFO L350 Elim1Store]: Elim1 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-25 16:54:17,271 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-25 16:54:17,350 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-25 16:54:17,350 INFO L350 Elim1Store]: Elim1 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 16 treesize of output 16 [2022-11-25 16:54:17,446 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 16:54:17,446 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-25 16:54:17,552 INFO L350 Elim1Store]: Elim1 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 11 treesize of output 9 [2022-11-25 16:54:17,555 INFO L350 Elim1Store]: Elim1 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 20 treesize of output 18 [2022-11-25 16:54:17,724 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 16:54:17,724 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [492334615] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-25 16:54:17,725 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-25 16:54:17,725 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 10, 10] total 20 [2022-11-25 16:54:17,725 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [167270175] [2022-11-25 16:54:17,725 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-25 16:54:17,726 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2022-11-25 16:54:17,726 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 16:54:17,726 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2022-11-25 16:54:17,727 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=332, Unknown=0, NotChecked=0, Total=380 [2022-11-25 16:54:17,727 INFO L87 Difference]: Start difference. First operand 176 states and 202 transitions. Second operand has 20 states, 20 states have (on average 4.3) internal successors, (86), 20 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 16:54:18,645 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 16:54:18,645 INFO L93 Difference]: Finished difference Result 269 states and 299 transitions. [2022-11-25 16:54:18,646 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-11-25 16:54:18,646 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 20 states have (on average 4.3) internal successors, (86), 20 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 40 [2022-11-25 16:54:18,646 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 16:54:18,647 INFO L225 Difference]: With dead ends: 269 [2022-11-25 16:54:18,648 INFO L226 Difference]: Without dead ends: 269 [2022-11-25 16:54:18,648 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 100 GetRequests, 69 SyntacticMatches, 1 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 118 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=175, Invalid=817, Unknown=0, NotChecked=0, Total=992 [2022-11-25 16:54:18,649 INFO L413 NwaCegarLoop]: 51 mSDtfsCounter, 313 mSDsluCounter, 618 mSDsCounter, 0 mSdLazyCounter, 803 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 313 SdHoareTripleChecker+Valid, 669 SdHoareTripleChecker+Invalid, 815 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 803 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-11-25 16:54:18,649 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [313 Valid, 669 Invalid, 815 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 803 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-11-25 16:54:18,650 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 269 states. [2022-11-25 16:54:18,662 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 269 to 176. [2022-11-25 16:54:18,663 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 176 states, 164 states have (on average 1.225609756097561) internal successors, (201), 175 states have internal predecessors, (201), 0 states have call successors, (0), 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-25 16:54:18,663 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 176 states to 176 states and 201 transitions. [2022-11-25 16:54:18,664 INFO L78 Accepts]: Start accepts. Automaton has 176 states and 201 transitions. Word has length 40 [2022-11-25 16:54:18,664 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 16:54:18,664 INFO L495 AbstractCegarLoop]: Abstraction has 176 states and 201 transitions. [2022-11-25 16:54:18,664 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 4.3) internal successors, (86), 20 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 16:54:18,665 INFO L276 IsEmpty]: Start isEmpty. Operand 176 states and 201 transitions. [2022-11-25 16:54:18,665 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2022-11-25 16:54:18,665 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 16:54:18,665 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-25 16:54:18,680 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_566ce540-1391-469b-bbbb-cc92d0ef0a3d/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2022-11-25 16:54:18,871 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32,11 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_566ce540-1391-469b-bbbb-cc92d0ef0a3d/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 16:54:18,872 INFO L420 AbstractCegarLoop]: === Iteration 34 === Targeting ULTIMATE.startErr36ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 38 more)] === [2022-11-25 16:54:18,872 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 16:54:18,872 INFO L85 PathProgramCache]: Analyzing trace with hash 737292038, now seen corresponding path program 1 times [2022-11-25 16:54:18,872 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 16:54:18,873 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [131937310] [2022-11-25 16:54:18,873 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 16:54:18,873 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 16:54:18,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 16:54:18,941 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-11-25 16:54:18,942 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 16:54:18,942 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [131937310] [2022-11-25 16:54:18,942 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [131937310] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 16:54:18,942 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 16:54:18,942 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-25 16:54:18,943 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [863049612] [2022-11-25 16:54:18,943 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 16:54:18,943 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-25 16:54:18,943 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 16:54:18,944 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-25 16:54:18,944 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-25 16:54:18,944 INFO L87 Difference]: Start difference. First operand 176 states and 201 transitions. Second operand has 4 states, 3 states have (on average 12.666666666666666) internal successors, (38), 4 states have internal predecessors, (38), 0 states have call successors, (0), 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-25 16:54:19,024 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 16:54:19,025 INFO L93 Difference]: Finished difference Result 175 states and 199 transitions. [2022-11-25 16:54:19,025 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-25 16:54:19,025 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 12.666666666666666) internal successors, (38), 4 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 40 [2022-11-25 16:54:19,025 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 16:54:19,026 INFO L225 Difference]: With dead ends: 175 [2022-11-25 16:54:19,026 INFO L226 Difference]: Without dead ends: 175 [2022-11-25 16:54:19,027 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-11-25 16:54:19,027 INFO L413 NwaCegarLoop]: 53 mSDtfsCounter, 5 mSDsluCounter, 50 mSDsCounter, 0 mSdLazyCounter, 64 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 103 SdHoareTripleChecker+Invalid, 64 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 64 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-25 16:54:19,027 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 103 Invalid, 64 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 64 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-25 16:54:19,028 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 175 states. [2022-11-25 16:54:19,030 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 175 to 175. [2022-11-25 16:54:19,030 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 175 states, 164 states have (on average 1.2134146341463414) internal successors, (199), 174 states have internal predecessors, (199), 0 states have call successors, (0), 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-25 16:54:19,031 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 175 states to 175 states and 199 transitions. [2022-11-25 16:54:19,031 INFO L78 Accepts]: Start accepts. Automaton has 175 states and 199 transitions. Word has length 40 [2022-11-25 16:54:19,031 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 16:54:19,031 INFO L495 AbstractCegarLoop]: Abstraction has 175 states and 199 transitions. [2022-11-25 16:54:19,032 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 12.666666666666666) internal successors, (38), 4 states have internal predecessors, (38), 0 states have call successors, (0), 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-25 16:54:19,032 INFO L276 IsEmpty]: Start isEmpty. Operand 175 states and 199 transitions. [2022-11-25 16:54:19,032 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2022-11-25 16:54:19,032 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 16:54:19,032 INFO L195 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 16:54:19,032 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33 [2022-11-25 16:54:19,032 INFO L420 AbstractCegarLoop]: === Iteration 35 === Targeting ULTIMATE.startErr28REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 38 more)] === [2022-11-25 16:54:19,033 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 16:54:19,033 INFO L85 PathProgramCache]: Analyzing trace with hash 1696179932, now seen corresponding path program 1 times [2022-11-25 16:54:19,033 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 16:54:19,033 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [180146035] [2022-11-25 16:54:19,033 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 16:54:19,033 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 16:54:19,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 16:54:19,586 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 4 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 16:54:19,586 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 16:54:19,586 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [180146035] [2022-11-25 16:54:19,586 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [180146035] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-25 16:54:19,586 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [925562163] [2022-11-25 16:54:19,587 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 16:54:19,587 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 16:54:19,587 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_566ce540-1391-469b-bbbb-cc92d0ef0a3d/bin/uautomizer-ZsLfNo2U6R/z3 [2022-11-25 16:54:19,588 INFO L229 MonitoredProcess]: Starting monitored process 12 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_566ce540-1391-469b-bbbb-cc92d0ef0a3d/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-25 16:54:19,607 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_566ce540-1391-469b-bbbb-cc92d0ef0a3d/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2022-11-25 16:54:19,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 16:54:19,865 INFO L263 TraceCheckSpWp]: Trace formula consists of 337 conjuncts, 31 conjunts are in the unsatisfiable core [2022-11-25 16:54:19,867 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 16:54:19,872 INFO L350 Elim1Store]: Elim1 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-25 16:54:19,973 INFO L321 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-11-25 16:54:19,973 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2022-11-25 16:54:20,183 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-25 16:54:20,246 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-25 16:54:20,247 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 29 [2022-11-25 16:54:20,371 INFO L350 Elim1Store]: Elim1 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-25 16:54:20,479 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 17 [2022-11-25 16:54:20,490 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 4 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 16:54:20,491 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-25 16:54:20,753 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-25 16:54:20,753 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 24 [2022-11-25 16:54:20,764 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-25 16:54:20,764 INFO L350 Elim1Store]: Elim1 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 39 treesize of output 38 [2022-11-25 16:54:20,769 INFO L350 Elim1Store]: Elim1 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 22 treesize of output 18 [2022-11-25 16:54:20,794 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-25 16:54:20,794 INFO L350 Elim1Store]: Elim1 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 1 case distinctions, treesize of input 24 treesize of output 25 [2022-11-25 16:54:20,797 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-25 16:54:20,800 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 16:54:20,801 INFO L350 Elim1Store]: Elim1 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 10 [2022-11-25 16:54:21,099 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 14 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 16:54:21,099 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [925562163] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-25 16:54:21,099 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-25 16:54:21,099 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 10, 10] total 24 [2022-11-25 16:54:21,099 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1907404778] [2022-11-25 16:54:21,099 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-25 16:54:21,100 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2022-11-25 16:54:21,100 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 16:54:21,100 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2022-11-25 16:54:21,101 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=93, Invalid=495, Unknown=12, NotChecked=0, Total=600 [2022-11-25 16:54:21,101 INFO L87 Difference]: Start difference. First operand 175 states and 199 transitions. Second operand has 25 states, 24 states have (on average 4.166666666666667) internal successors, (100), 25 states have internal predecessors, (100), 0 states have call successors, (0), 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-25 16:54:22,568 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 16:54:22,569 INFO L93 Difference]: Finished difference Result 272 states and 302 transitions. [2022-11-25 16:54:22,569 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-11-25 16:54:22,570 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 24 states have (on average 4.166666666666667) internal successors, (100), 25 states have internal predecessors, (100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 42 [2022-11-25 16:54:22,570 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 16:54:22,571 INFO L225 Difference]: With dead ends: 272 [2022-11-25 16:54:22,571 INFO L226 Difference]: Without dead ends: 272 [2022-11-25 16:54:22,572 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 109 GetRequests, 72 SyntacticMatches, 2 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 302 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=253, Invalid=1067, Unknown=12, NotChecked=0, Total=1332 [2022-11-25 16:54:22,572 INFO L413 NwaCegarLoop]: 50 mSDtfsCounter, 177 mSDsluCounter, 537 mSDsCounter, 0 mSdLazyCounter, 956 mSolverCounterSat, 16 mSolverCounterUnsat, 6 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 177 SdHoareTripleChecker+Valid, 587 SdHoareTripleChecker+Invalid, 978 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 956 IncrementalHoareTripleChecker+Invalid, 6 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2022-11-25 16:54:22,573 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [177 Valid, 587 Invalid, 978 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 956 Invalid, 6 Unknown, 0 Unchecked, 1.0s Time] [2022-11-25 16:54:22,573 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 272 states. [2022-11-25 16:54:22,577 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 272 to 222. [2022-11-25 16:54:22,578 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 222 states, 211 states have (on average 1.2037914691943128) internal successors, (254), 221 states have internal predecessors, (254), 0 states have call successors, (0), 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-25 16:54:22,578 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 222 states to 222 states and 254 transitions. [2022-11-25 16:54:22,579 INFO L78 Accepts]: Start accepts. Automaton has 222 states and 254 transitions. Word has length 42 [2022-11-25 16:54:22,579 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 16:54:22,579 INFO L495 AbstractCegarLoop]: Abstraction has 222 states and 254 transitions. [2022-11-25 16:54:22,579 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 24 states have (on average 4.166666666666667) internal successors, (100), 25 states have internal predecessors, (100), 0 states have call successors, (0), 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-25 16:54:22,579 INFO L276 IsEmpty]: Start isEmpty. Operand 222 states and 254 transitions. [2022-11-25 16:54:22,580 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2022-11-25 16:54:22,580 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 16:54:22,580 INFO L195 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 16:54:22,593 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_566ce540-1391-469b-bbbb-cc92d0ef0a3d/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2022-11-25 16:54:22,793 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_566ce540-1391-469b-bbbb-cc92d0ef0a3d/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable34 [2022-11-25 16:54:22,794 INFO L420 AbstractCegarLoop]: === Iteration 36 === Targeting ULTIMATE.startErr29REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 38 more)] === [2022-11-25 16:54:22,794 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 16:54:22,794 INFO L85 PathProgramCache]: Analyzing trace with hash 1696179933, now seen corresponding path program 1 times [2022-11-25 16:54:22,794 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 16:54:22,794 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1119359378] [2022-11-25 16:54:22,794 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 16:54:22,794 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 16:54:22,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 16:54:23,952 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 6 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 16:54:23,952 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 16:54:23,952 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1119359378] [2022-11-25 16:54:23,952 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1119359378] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-25 16:54:23,952 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1351195479] [2022-11-25 16:54:23,953 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 16:54:23,953 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 16:54:23,953 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_566ce540-1391-469b-bbbb-cc92d0ef0a3d/bin/uautomizer-ZsLfNo2U6R/z3 [2022-11-25 16:54:23,954 INFO L229 MonitoredProcess]: Starting monitored process 13 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_566ce540-1391-469b-bbbb-cc92d0ef0a3d/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-25 16:54:23,986 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_566ce540-1391-469b-bbbb-cc92d0ef0a3d/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2022-11-25 16:54:24,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 16:54:24,257 INFO L263 TraceCheckSpWp]: Trace formula consists of 337 conjuncts, 39 conjunts are in the unsatisfiable core [2022-11-25 16:54:24,262 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 16:54:24,267 INFO L350 Elim1Store]: Elim1 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-25 16:54:24,363 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-11-25 16:54:24,364 INFO L350 Elim1Store]: Elim1 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-25 16:54:24,606 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-25 16:54:24,618 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-25 16:54:24,682 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-25 16:54:24,683 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 38 treesize of output 37 [2022-11-25 16:54:24,691 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2022-11-25 16:54:24,790 INFO L350 Elim1Store]: Elim1 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-25 16:54:24,797 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-11-25 16:54:24,883 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 4 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 16:54:24,883 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-25 16:54:25,068 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse0 (+ |c_ULTIMATE.start_main_~first~0#1.offset| 12))) (and (forall ((v_ArrVal_2432 (Array Int Int))) (<= 0 (+ (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_2432) |c_ULTIMATE.start_main_~first~0#1.base|) .cse0) 12))) (forall ((v_ArrVal_2433 (Array Int Int)) (v_ArrVal_2432 (Array Int Int))) (<= (+ (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_2432) |c_ULTIMATE.start_main_~first~0#1.base|) .cse0) 16) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_2433) |c_ULTIMATE.start_main_~first~0#1.base|) .cse0)))))) is different from false [2022-11-25 16:54:25,080 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-25 16:54:25,080 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 24 treesize of output 25 [2022-11-25 16:54:25,091 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-25 16:54:25,092 INFO L350 Elim1Store]: Elim1 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 40 treesize of output 39 [2022-11-25 16:54:25,114 INFO L350 Elim1Store]: Elim1 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 9 treesize of output 5 [2022-11-25 16:54:25,126 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-25 16:54:25,127 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 45 treesize of output 46 [2022-11-25 16:54:25,137 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-25 16:54:25,137 INFO L350 Elim1Store]: Elim1 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 1 case distinctions, treesize of input 35 treesize of output 36 [2022-11-25 16:54:25,141 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-25 16:54:25,145 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 16:54:25,146 INFO L350 Elim1Store]: Elim1 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 21 [2022-11-25 16:54:25,150 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-25 16:54:25,153 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 16:54:25,154 INFO L350 Elim1Store]: Elim1 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 12 [2022-11-25 16:54:25,336 INFO L350 Elim1Store]: Elim1 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 6 [2022-11-25 16:54:25,532 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 4 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 16:54:25,532 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1351195479] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-25 16:54:25,533 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-25 16:54:25,533 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 9, 9] total 25 [2022-11-25 16:54:25,533 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1909912515] [2022-11-25 16:54:25,533 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-25 16:54:25,533 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2022-11-25 16:54:25,534 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 16:54:25,534 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2022-11-25 16:54:25,535 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=87, Invalid=516, Unknown=1, NotChecked=46, Total=650 [2022-11-25 16:54:25,535 INFO L87 Difference]: Start difference. First operand 222 states and 254 transitions. Second operand has 26 states, 25 states have (on average 4.44) internal successors, (111), 26 states have internal predecessors, (111), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 16:54:27,408 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 16:54:27,408 INFO L93 Difference]: Finished difference Result 300 states and 334 transitions. [2022-11-25 16:54:27,409 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2022-11-25 16:54:27,409 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 25 states have (on average 4.44) internal successors, (111), 26 states have internal predecessors, (111), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 42 [2022-11-25 16:54:27,410 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 16:54:27,411 INFO L225 Difference]: With dead ends: 300 [2022-11-25 16:54:27,411 INFO L226 Difference]: Without dead ends: 300 [2022-11-25 16:54:27,412 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 114 GetRequests, 75 SyntacticMatches, 1 SemanticMatches, 38 ConstructedPredicates, 1 IntricatePredicates, 1 DeprecatedPredicates, 283 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=290, Invalid=1195, Unknown=1, NotChecked=74, Total=1560 [2022-11-25 16:54:27,412 INFO L413 NwaCegarLoop]: 56 mSDtfsCounter, 449 mSDsluCounter, 434 mSDsCounter, 0 mSdLazyCounter, 696 mSolverCounterSat, 25 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 449 SdHoareTripleChecker+Valid, 490 SdHoareTripleChecker+Invalid, 869 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 696 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 147 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2022-11-25 16:54:27,413 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [449 Valid, 490 Invalid, 869 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 696 Invalid, 1 Unknown, 147 Unchecked, 0.9s Time] [2022-11-25 16:54:27,413 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 300 states. [2022-11-25 16:54:27,421 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 300 to 246. [2022-11-25 16:54:27,422 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 246 states, 235 states have (on average 1.2170212765957447) internal successors, (286), 245 states have internal predecessors, (286), 0 states have call successors, (0), 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-25 16:54:27,423 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 246 states to 246 states and 286 transitions. [2022-11-25 16:54:27,423 INFO L78 Accepts]: Start accepts. Automaton has 246 states and 286 transitions. Word has length 42 [2022-11-25 16:54:27,423 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 16:54:27,424 INFO L495 AbstractCegarLoop]: Abstraction has 246 states and 286 transitions. [2022-11-25 16:54:27,424 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 25 states have (on average 4.44) internal successors, (111), 26 states have internal predecessors, (111), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 16:54:27,424 INFO L276 IsEmpty]: Start isEmpty. Operand 246 states and 286 transitions. [2022-11-25 16:54:27,425 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2022-11-25 16:54:27,425 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 16:54:27,425 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] [2022-11-25 16:54:27,436 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_566ce540-1391-469b-bbbb-cc92d0ef0a3d/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Forceful destruction successful, exit code 0 [2022-11-25 16:54:27,632 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_566ce540-1391-469b-bbbb-cc92d0ef0a3d/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable35 [2022-11-25 16:54:27,632 INFO L420 AbstractCegarLoop]: === Iteration 37 === Targeting ULTIMATE.startErr32REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 38 more)] === [2022-11-25 16:54:27,632 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 16:54:27,633 INFO L85 PathProgramCache]: Analyzing trace with hash -131950583, now seen corresponding path program 1 times [2022-11-25 16:54:27,633 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 16:54:27,633 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [846617702] [2022-11-25 16:54:27,633 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 16:54:27,633 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 16:54:27,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 16:54:28,713 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-25 16:54:28,713 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 16:54:28,713 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [846617702] [2022-11-25 16:54:28,713 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [846617702] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-25 16:54:28,713 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1507212842] [2022-11-25 16:54:28,714 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 16:54:28,714 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 16:54:28,714 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_566ce540-1391-469b-bbbb-cc92d0ef0a3d/bin/uautomizer-ZsLfNo2U6R/z3 [2022-11-25 16:54:28,715 INFO L229 MonitoredProcess]: Starting monitored process 14 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_566ce540-1391-469b-bbbb-cc92d0ef0a3d/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-25 16:54:28,718 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_566ce540-1391-469b-bbbb-cc92d0ef0a3d/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2022-11-25 16:54:28,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 16:54:28,974 INFO L263 TraceCheckSpWp]: Trace formula consists of 327 conjuncts, 79 conjunts are in the unsatisfiable core [2022-11-25 16:54:28,978 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 16:54:28,992 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-25 16:54:28,998 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-25 16:54:29,041 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 16:54:29,041 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2022-11-25 16:54:29,058 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 16:54:29,060 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2022-11-25 16:54:29,085 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 16:54:29,086 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2022-11-25 16:54:29,093 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 16:54:29,094 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2022-11-25 16:54:29,272 INFO L321 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2022-11-25 16:54:29,273 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 18 [2022-11-25 16:54:29,299 INFO L321 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2022-11-25 16:54:29,299 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 18 [2022-11-25 16:54:29,512 INFO L321 Elim1Store]: treesize reduction 29, result has 38.3 percent of original size [2022-11-25 16:54:29,512 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 39 treesize of output 48 [2022-11-25 16:54:29,554 INFO L321 Elim1Store]: treesize reduction 12, result has 64.7 percent of original size [2022-11-25 16:54:29,555 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 27 treesize of output 41 [2022-11-25 16:54:29,566 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 5 [2022-11-25 16:54:29,589 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-11-25 16:54:29,603 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 5 [2022-11-25 16:54:29,628 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-25 16:54:29,735 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 16:54:29,737 INFO L350 Elim1Store]: Elim1 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 33 treesize of output 32 [2022-11-25 16:54:29,743 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 16:54:29,744 INFO L350 Elim1Store]: Elim1 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 33 treesize of output 32 [2022-11-25 16:54:29,773 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 30 [2022-11-25 16:54:29,777 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 30 [2022-11-25 16:54:29,885 INFO L321 Elim1Store]: treesize reduction 13, result has 45.8 percent of original size [2022-11-25 16:54:29,886 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 31 treesize of output 34 [2022-11-25 16:54:29,905 INFO L321 Elim1Store]: treesize reduction 19, result has 47.2 percent of original size [2022-11-25 16:54:29,906 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 30 treesize of output 40 [2022-11-25 16:54:30,506 INFO L321 Elim1Store]: treesize reduction 16, result has 51.5 percent of original size [2022-11-25 16:54:30,506 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 5 case distinctions, treesize of input 67 treesize of output 57 [2022-11-25 16:54:30,540 INFO L321 Elim1Store]: treesize reduction 12, result has 58.6 percent of original size [2022-11-25 16:54:30,541 INFO L350 Elim1Store]: Elim1 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 30 treesize of output 34 [2022-11-25 16:54:30,800 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 16:54:30,801 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-25 16:54:31,489 INFO L350 Elim1Store]: Elim1 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 6 treesize of output 4 [2022-11-25 16:54:36,142 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 16:54:36,142 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1507212842] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-25 16:54:36,143 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-25 16:54:36,143 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 19, 21] total 52 [2022-11-25 16:54:36,143 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2044403087] [2022-11-25 16:54:36,143 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-25 16:54:36,145 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 52 states [2022-11-25 16:54:36,145 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 16:54:36,146 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 52 interpolants. [2022-11-25 16:54:36,147 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=204, Invalid=2207, Unknown=241, NotChecked=0, Total=2652 [2022-11-25 16:54:36,148 INFO L87 Difference]: Start difference. First operand 246 states and 286 transitions. Second operand has 52 states, 52 states have (on average 2.0961538461538463) internal successors, (109), 52 states have internal predecessors, (109), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 16:54:44,081 WARN L233 SmtUtils]: Spent 6.14s on a formula simplification. DAG size of input: 77 DAG size of output: 37 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-25 16:54:50,628 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 16:54:50,628 INFO L93 Difference]: Finished difference Result 510 states and 606 transitions. [2022-11-25 16:54:50,628 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2022-11-25 16:54:50,628 INFO L78 Accepts]: Start accepts. Automaton has has 52 states, 52 states have (on average 2.0961538461538463) internal successors, (109), 52 states have internal predecessors, (109), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 42 [2022-11-25 16:54:50,629 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 16:54:50,631 INFO L225 Difference]: With dead ends: 510 [2022-11-25 16:54:50,631 INFO L226 Difference]: Without dead ends: 510 [2022-11-25 16:54:50,633 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 150 GetRequests, 57 SyntacticMatches, 1 SemanticMatches, 92 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1955 ImplicationChecksByTransitivity, 17.7s TimeCoverageRelationStatistics Valid=886, Invalid=7524, Unknown=332, NotChecked=0, Total=8742 [2022-11-25 16:54:50,634 INFO L413 NwaCegarLoop]: 53 mSDtfsCounter, 583 mSDsluCounter, 1209 mSDsCounter, 0 mSdLazyCounter, 1976 mSolverCounterSat, 98 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 583 SdHoareTripleChecker+Valid, 1262 SdHoareTripleChecker+Invalid, 2074 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 98 IncrementalHoareTripleChecker+Valid, 1976 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.6s IncrementalHoareTripleChecker+Time [2022-11-25 16:54:50,634 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [583 Valid, 1262 Invalid, 2074 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [98 Valid, 1976 Invalid, 0 Unknown, 0 Unchecked, 2.6s Time] [2022-11-25 16:54:50,635 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 510 states. [2022-11-25 16:54:50,640 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 510 to 274. [2022-11-25 16:54:50,641 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 274 states, 263 states have (on average 1.2015209125475286) internal successors, (316), 273 states have internal predecessors, (316), 0 states have call successors, (0), 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-25 16:54:50,642 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 274 states to 274 states and 316 transitions. [2022-11-25 16:54:50,642 INFO L78 Accepts]: Start accepts. Automaton has 274 states and 316 transitions. Word has length 42 [2022-11-25 16:54:50,643 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 16:54:50,643 INFO L495 AbstractCegarLoop]: Abstraction has 274 states and 316 transitions. [2022-11-25 16:54:50,643 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 52 states, 52 states have (on average 2.0961538461538463) internal successors, (109), 52 states have internal predecessors, (109), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 16:54:50,643 INFO L276 IsEmpty]: Start isEmpty. Operand 274 states and 316 transitions. [2022-11-25 16:54:50,644 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2022-11-25 16:54:50,644 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 16:54:50,644 INFO L195 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 16:54:50,651 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_566ce540-1391-469b-bbbb-cc92d0ef0a3d/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Forceful destruction successful, exit code 0 [2022-11-25 16:54:50,850 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_566ce540-1391-469b-bbbb-cc92d0ef0a3d/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable36 [2022-11-25 16:54:50,851 INFO L420 AbstractCegarLoop]: === Iteration 38 === Targeting ULTIMATE.startErr40ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 38 more)] === [2022-11-25 16:54:50,851 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 16:54:50,851 INFO L85 PathProgramCache]: Analyzing trace with hash 1041969739, now seen corresponding path program 1 times [2022-11-25 16:54:50,852 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 16:54:50,852 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [466248200] [2022-11-25 16:54:50,852 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 16:54:50,852 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 16:54:50,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 16:54:51,286 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 4 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 16:54:51,286 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 16:54:51,286 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [466248200] [2022-11-25 16:54:51,286 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [466248200] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-25 16:54:51,286 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1203014717] [2022-11-25 16:54:51,286 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 16:54:51,286 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 16:54:51,287 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_566ce540-1391-469b-bbbb-cc92d0ef0a3d/bin/uautomizer-ZsLfNo2U6R/z3 [2022-11-25 16:54:51,289 INFO L229 MonitoredProcess]: Starting monitored process 15 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_566ce540-1391-469b-bbbb-cc92d0ef0a3d/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-25 16:54:51,290 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_566ce540-1391-469b-bbbb-cc92d0ef0a3d/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2022-11-25 16:54:51,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 16:54:51,527 INFO L263 TraceCheckSpWp]: Trace formula consists of 338 conjuncts, 29 conjunts are in the unsatisfiable core [2022-11-25 16:54:51,530 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 16:54:51,541 INFO L350 Elim1Store]: Elim1 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-25 16:54:51,626 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-11-25 16:54:51,627 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2022-11-25 16:54:51,793 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-25 16:54:51,832 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-25 16:54:51,833 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 27 treesize of output 28 [2022-11-25 16:54:51,894 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 12 [2022-11-25 16:54:51,911 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 4 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 16:54:51,911 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-25 16:54:51,999 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-25 16:54:52,000 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 24 [2022-11-25 16:54:52,010 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-25 16:54:52,011 INFO L350 Elim1Store]: Elim1 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 39 treesize of output 38 [2022-11-25 16:54:52,016 INFO L350 Elim1Store]: Elim1 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 22 treesize of output 18 [2022-11-25 16:54:52,319 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 4 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 16:54:52,319 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1203014717] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-25 16:54:52,319 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-25 16:54:52,320 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9, 9] total 17 [2022-11-25 16:54:52,320 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [550914714] [2022-11-25 16:54:52,320 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-25 16:54:52,320 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2022-11-25 16:54:52,321 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 16:54:52,321 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2022-11-25 16:54:52,321 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=222, Unknown=4, NotChecked=0, Total=272 [2022-11-25 16:54:52,322 INFO L87 Difference]: Start difference. First operand 274 states and 316 transitions. Second operand has 17 states, 17 states have (on average 4.882352941176471) internal successors, (83), 17 states have internal predecessors, (83), 0 states have call successors, (0), 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-25 16:54:53,066 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 16:54:53,067 INFO L93 Difference]: Finished difference Result 305 states and 338 transitions. [2022-11-25 16:54:53,067 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-11-25 16:54:53,067 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 4.882352941176471) internal successors, (83), 17 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 43 [2022-11-25 16:54:53,067 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 16:54:53,069 INFO L225 Difference]: With dead ends: 305 [2022-11-25 16:54:53,069 INFO L226 Difference]: Without dead ends: 305 [2022-11-25 16:54:53,069 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 106 GetRequests, 82 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 96 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=152, Invalid=493, Unknown=5, NotChecked=0, Total=650 [2022-11-25 16:54:53,070 INFO L413 NwaCegarLoop]: 52 mSDtfsCounter, 412 mSDsluCounter, 339 mSDsCounter, 0 mSdLazyCounter, 432 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 412 SdHoareTripleChecker+Valid, 391 SdHoareTripleChecker+Invalid, 444 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 432 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-11-25 16:54:53,070 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [412 Valid, 391 Invalid, 444 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 432 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-11-25 16:54:53,071 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 305 states. [2022-11-25 16:54:53,074 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 305 to 274. [2022-11-25 16:54:53,075 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 274 states, 263 states have (on average 1.193916349809886) internal successors, (314), 273 states have internal predecessors, (314), 0 states have call successors, (0), 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-25 16:54:53,076 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 274 states to 274 states and 314 transitions. [2022-11-25 16:54:53,076 INFO L78 Accepts]: Start accepts. Automaton has 274 states and 314 transitions. Word has length 43 [2022-11-25 16:54:53,076 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 16:54:53,077 INFO L495 AbstractCegarLoop]: Abstraction has 274 states and 314 transitions. [2022-11-25 16:54:53,077 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 4.882352941176471) internal successors, (83), 17 states have internal predecessors, (83), 0 states have call successors, (0), 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-25 16:54:53,077 INFO L276 IsEmpty]: Start isEmpty. Operand 274 states and 314 transitions. [2022-11-25 16:54:53,078 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2022-11-25 16:54:53,078 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 16:54:53,078 INFO L195 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 16:54:53,084 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_566ce540-1391-469b-bbbb-cc92d0ef0a3d/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Ended with exit code 0 [2022-11-25 16:54:53,284 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_566ce540-1391-469b-bbbb-cc92d0ef0a3d/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable37 [2022-11-25 16:54:53,284 INFO L420 AbstractCegarLoop]: === Iteration 39 === Targeting ULTIMATE.startErr31REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 38 more)] === [2022-11-25 16:54:53,285 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 16:54:53,285 INFO L85 PathProgramCache]: Analyzing trace with hash -2058655426, now seen corresponding path program 1 times [2022-11-25 16:54:53,285 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 16:54:53,285 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1554833308] [2022-11-25 16:54:53,285 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 16:54:53,285 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 16:54:53,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 16:54:54,191 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 6 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 16:54:54,191 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 16:54:54,192 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1554833308] [2022-11-25 16:54:54,192 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1554833308] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-25 16:54:54,192 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [666880708] [2022-11-25 16:54:54,192 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 16:54:54,192 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 16:54:54,192 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_566ce540-1391-469b-bbbb-cc92d0ef0a3d/bin/uautomizer-ZsLfNo2U6R/z3 [2022-11-25 16:54:54,194 INFO L229 MonitoredProcess]: Starting monitored process 16 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_566ce540-1391-469b-bbbb-cc92d0ef0a3d/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-25 16:54:54,201 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_566ce540-1391-469b-bbbb-cc92d0ef0a3d/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2022-11-25 16:54:54,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 16:54:54,508 INFO L263 TraceCheckSpWp]: Trace formula consists of 349 conjuncts, 55 conjunts are in the unsatisfiable core [2022-11-25 16:54:54,512 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 16:54:54,518 INFO L350 Elim1Store]: Elim1 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-25 16:54:54,535 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-25 16:54:54,574 INFO L350 Elim1Store]: Elim1 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-25 16:54:54,635 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 16:54:54,637 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 16:54:54,638 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 32 [2022-11-25 16:54:54,665 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 34 [2022-11-25 16:54:54,686 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 34 [2022-11-25 16:54:54,823 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-11-25 16:54:54,823 INFO L350 Elim1Store]: Elim1 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-25 16:54:54,894 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 21 [2022-11-25 16:54:54,929 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 21 [2022-11-25 16:54:54,961 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 21 [2022-11-25 16:54:54,986 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 21 [2022-11-25 16:54:55,020 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 21 [2022-11-25 16:54:55,147 INFO L321 Elim1Store]: treesize reduction 32, result has 31.9 percent of original size [2022-11-25 16:54:55,148 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 28 treesize of output 30 [2022-11-25 16:54:55,255 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 21 [2022-11-25 16:54:55,342 INFO L350 Elim1Store]: Elim1 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 7 treesize of output 3 [2022-11-25 16:54:55,349 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-25 16:54:55,349 INFO L350 Elim1Store]: Elim1 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 22 treesize of output 10 [2022-11-25 16:54:55,451 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 4 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 16:54:55,451 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-25 16:54:55,505 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-25 16:54:55,506 INFO L350 Elim1Store]: Elim1 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 20 treesize of output 24 [2022-11-25 16:54:56,316 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2923 (Array Int Int)) (|v_ULTIMATE.start_main_~x~0#1.base_50| Int) (v_ArrVal_2920 (Array Int Int)) (|ULTIMATE.start_main_~last~0#1.offset| Int) (v_ArrVal_2911 Int)) (or (<= 0 (select (select (store (let ((.cse0 (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~x~0#1.base| (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset| v_ArrVal_2911)) |v_ULTIMATE.start_main_~x~0#1.base_50| v_ArrVal_2920))) (store .cse0 |c_ULTIMATE.start_main_~x~0#1.base| (store (select .cse0 |c_ULTIMATE.start_main_~x~0#1.base|) (+ |ULTIMATE.start_main_~last~0#1.offset| 12) 0))) |v_ULTIMATE.start_main_~x~0#1.base_50| v_ArrVal_2923) |c_ULTIMATE.start_main_~x~0#1.base|) (+ |c_ULTIMATE.start_main_~x~0#1.offset| 12))) (not (= (select |c_#valid| |v_ULTIMATE.start_main_~x~0#1.base_50|) 0)))) is different from false [2022-11-25 16:54:56,409 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-25 16:54:56,410 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 48 treesize of output 39 [2022-11-25 16:54:56,415 INFO L350 Elim1Store]: Elim1 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 80 treesize of output 76 [2022-11-25 16:54:56,424 INFO L350 Elim1Store]: Elim1 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 47 treesize of output 39 [2022-11-25 16:54:56,432 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2022-11-25 16:54:56,472 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 4 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 1 not checked. [2022-11-25 16:54:56,473 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [666880708] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-25 16:54:56,473 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-25 16:54:56,473 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12, 13] total 32 [2022-11-25 16:54:56,473 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1237133005] [2022-11-25 16:54:56,473 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-25 16:54:56,474 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 33 states [2022-11-25 16:54:56,474 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 16:54:56,474 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2022-11-25 16:54:56,475 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=131, Invalid=855, Unknown=10, NotChecked=60, Total=1056 [2022-11-25 16:54:56,475 INFO L87 Difference]: Start difference. First operand 274 states and 314 transitions. Second operand has 33 states, 32 states have (on average 3.71875) internal successors, (119), 33 states have internal predecessors, (119), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 16:55:03,186 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 16:55:03,186 INFO L93 Difference]: Finished difference Result 452 states and 505 transitions. [2022-11-25 16:55:03,187 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 51 states. [2022-11-25 16:55:03,187 INFO L78 Accepts]: Start accepts. Automaton has has 33 states, 32 states have (on average 3.71875) internal successors, (119), 33 states have internal predecessors, (119), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 44 [2022-11-25 16:55:03,187 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 16:55:03,189 INFO L225 Difference]: With dead ends: 452 [2022-11-25 16:55:03,189 INFO L226 Difference]: Without dead ends: 452 [2022-11-25 16:55:03,191 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 163 GetRequests, 78 SyntacticMatches, 7 SemanticMatches, 78 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 1739 ImplicationChecksByTransitivity, 5.4s TimeCoverageRelationStatistics Valid=1164, Invalid=4990, Unknown=12, NotChecked=154, Total=6320 [2022-11-25 16:55:03,191 INFO L413 NwaCegarLoop]: 47 mSDtfsCounter, 791 mSDsluCounter, 770 mSDsCounter, 0 mSdLazyCounter, 1506 mSolverCounterSat, 132 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 791 SdHoareTripleChecker+Valid, 817 SdHoareTripleChecker+Invalid, 1782 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 132 IncrementalHoareTripleChecker+Valid, 1506 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 142 IncrementalHoareTripleChecker+Unchecked, 2.4s IncrementalHoareTripleChecker+Time [2022-11-25 16:55:03,192 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [791 Valid, 817 Invalid, 1782 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [132 Valid, 1506 Invalid, 2 Unknown, 142 Unchecked, 2.4s Time] [2022-11-25 16:55:03,193 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 452 states. [2022-11-25 16:55:03,200 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 452 to 321. [2022-11-25 16:55:03,200 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 321 states, 310 states have (on average 1.2258064516129032) internal successors, (380), 320 states have internal predecessors, (380), 0 states have call successors, (0), 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-25 16:55:03,202 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 321 states to 321 states and 380 transitions. [2022-11-25 16:55:03,202 INFO L78 Accepts]: Start accepts. Automaton has 321 states and 380 transitions. Word has length 44 [2022-11-25 16:55:03,202 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 16:55:03,202 INFO L495 AbstractCegarLoop]: Abstraction has 321 states and 380 transitions. [2022-11-25 16:55:03,203 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 33 states, 32 states have (on average 3.71875) internal successors, (119), 33 states have internal predecessors, (119), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 16:55:03,203 INFO L276 IsEmpty]: Start isEmpty. Operand 321 states and 380 transitions. [2022-11-25 16:55:03,204 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2022-11-25 16:55:03,204 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 16:55:03,204 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] [2022-11-25 16:55:03,216 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_566ce540-1391-469b-bbbb-cc92d0ef0a3d/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Ended with exit code 0 [2022-11-25 16:55:03,411 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable38,16 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_566ce540-1391-469b-bbbb-cc92d0ef0a3d/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 16:55:03,411 INFO L420 AbstractCegarLoop]: === Iteration 40 === Targeting ULTIMATE.startErr28REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 38 more)] === [2022-11-25 16:55:03,412 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 16:55:03,412 INFO L85 PathProgramCache]: Analyzing trace with hash 1931630812, now seen corresponding path program 1 times [2022-11-25 16:55:03,412 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 16:55:03,412 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1852924850] [2022-11-25 16:55:03,412 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 16:55:03,412 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 16:55:03,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 16:55:05,432 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 3 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 16:55:05,432 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 16:55:05,432 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1852924850] [2022-11-25 16:55:05,432 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1852924850] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-25 16:55:05,432 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1764806913] [2022-11-25 16:55:05,433 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 16:55:05,433 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 16:55:05,433 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_566ce540-1391-469b-bbbb-cc92d0ef0a3d/bin/uautomizer-ZsLfNo2U6R/z3 [2022-11-25 16:55:05,435 INFO L229 MonitoredProcess]: Starting monitored process 17 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_566ce540-1391-469b-bbbb-cc92d0ef0a3d/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-25 16:55:05,451 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_566ce540-1391-469b-bbbb-cc92d0ef0a3d/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Waiting until timeout for monitored process [2022-11-25 16:55:05,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 16:55:05,773 INFO L263 TraceCheckSpWp]: Trace formula consists of 338 conjuncts, 86 conjunts are in the unsatisfiable core [2022-11-25 16:55:05,780 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 16:55:05,792 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-25 16:55:05,798 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-25 16:55:05,816 INFO L350 Elim1Store]: Elim1 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-25 16:55:05,823 INFO L350 Elim1Store]: Elim1 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-25 16:55:05,837 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 16:55:05,838 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2022-11-25 16:55:05,848 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 16:55:05,849 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2022-11-25 16:55:05,917 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 16:55:05,919 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 16:55:05,921 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-25 16:55:05,922 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 30 treesize of output 32 [2022-11-25 16:55:05,934 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 16:55:05,936 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 16:55:05,937 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 32 [2022-11-25 16:55:05,955 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 16:55:05,956 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 16:55:05,958 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-25 16:55:05,959 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 30 treesize of output 32 [2022-11-25 16:55:05,971 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 16:55:05,973 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 16:55:05,976 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 32 [2022-11-25 16:55:06,170 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 16:55:06,228 INFO L321 Elim1Store]: treesize reduction 36, result has 49.3 percent of original size [2022-11-25 16:55:06,229 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 35 treesize of output 51 [2022-11-25 16:55:06,265 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 16:55:06,311 INFO L321 Elim1Store]: treesize reduction 44, result has 38.0 percent of original size [2022-11-25 16:55:06,311 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 32 treesize of output 40 [2022-11-25 16:55:06,773 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 16:55:06,894 INFO L321 Elim1Store]: treesize reduction 132, result has 31.6 percent of original size [2022-11-25 16:55:06,894 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 9 case distinctions, treesize of input 117 treesize of output 135 [2022-11-25 16:55:06,914 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 16:55:07,015 INFO L321 Elim1Store]: treesize reduction 136, result has 29.5 percent of original size [2022-11-25 16:55:07,016 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 9 case distinctions, treesize of input 101 treesize of output 123 [2022-11-25 16:55:08,532 INFO L321 Elim1Store]: treesize reduction 10, result has 64.3 percent of original size [2022-11-25 16:55:08,532 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 184 treesize of output 184 [2022-11-25 16:55:08,585 INFO L321 Elim1Store]: treesize reduction 10, result has 64.3 percent of original size [2022-11-25 16:55:08,586 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 168 treesize of output 160 [2022-11-25 16:55:08,709 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 5 [2022-11-25 16:55:08,741 INFO L350 Elim1Store]: Elim1 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 13 treesize of output 9 [2022-11-25 16:55:09,018 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-11-25 16:55:09,059 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-11-25 16:55:09,077 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-11-25 16:55:09,094 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-11-25 16:55:09,259 INFO L350 Elim1Store]: Elim1 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 17 treesize of output 9 [2022-11-25 16:55:09,271 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2022-11-25 16:55:09,288 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 16:55:09,294 INFO L321 Elim1Store]: treesize reduction 18, result has 5.3 percent of original size [2022-11-25 16:55:09,295 INFO L350 Elim1Store]: Elim1 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 54 treesize of output 38 [2022-11-25 16:55:09,313 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2022-11-25 16:55:09,318 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2022-11-25 16:55:09,321 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-11-25 16:55:09,422 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-11-25 16:55:09,422 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 30 treesize of output 36 [2022-11-25 16:55:09,466 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-11-25 16:55:09,466 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 34 [2022-11-25 16:55:09,503 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 16:55:09,505 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 34 [2022-11-25 16:55:09,513 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 16:55:09,519 INFO L350 Elim1Store]: Elim1 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 39 treesize of output 38 [2022-11-25 16:55:09,853 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-25 16:55:09,853 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 38 treesize of output 38 [2022-11-25 16:55:09,874 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-25 16:55:09,875 INFO L350 Elim1Store]: Elim1 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 30 treesize of output 26 [2022-11-25 16:55:10,391 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 3 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 16:55:10,392 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-25 16:55:12,005 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse1 (+ |c_ULTIMATE.start_main_~x~0#1.offset| 12)) (.cse4 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem8#1.base|)) (.cse2 (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem8#1.base|)) (.cse3 (+ |c_ULTIMATE.start_main_#t~mem8#1.offset| 4))) (and (forall ((v_ArrVal_3083 Int) (v_ArrVal_3082 Int) (|ULTIMATE.start_main_~x~1#1.offset| Int)) (or (forall ((v_ArrVal_3087 (Array Int Int)) (v_ArrVal_3090 Int)) (let ((.cse0 (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem8#1.base| (store .cse2 .cse3 v_ArrVal_3082)) |c_ULTIMATE.start_main_~y~0#1.base| v_ArrVal_3087) |c_ULTIMATE.start_main_~x~0#1.base|))) (or (= (select .cse0 .cse1) 0) (not (= (select (store .cse0 |c_ULTIMATE.start_main_~x~0#1.offset| v_ArrVal_3090) |ULTIMATE.start_main_~x~1#1.offset|) 0))))) (not (<= 0 |ULTIMATE.start_main_~x~1#1.offset|)) (forall ((v_ArrVal_3086 (Array Int Int))) (= |c_ULTIMATE.start_main_~x~0#1.base| (select (store (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem8#1.base| (store .cse4 .cse3 v_ArrVal_3083)) |c_ULTIMATE.start_main_~y~0#1.base| v_ArrVal_3086) |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset| |c_ULTIMATE.start_main_~y~0#1.base|) |ULTIMATE.start_main_~x~1#1.offset|))) (not (<= |ULTIMATE.start_main_~x~1#1.offset| 0)))) (forall ((v_ArrVal_3083 Int) (v_ArrVal_3082 Int) (|ULTIMATE.start_main_~x~1#1.offset| Int)) (or (forall ((v_ArrVal_3086 (Array Int Int))) (let ((.cse5 (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem8#1.base| (store .cse4 .cse3 v_ArrVal_3083)) |c_ULTIMATE.start_main_~y~0#1.base| v_ArrVal_3086) |c_ULTIMATE.start_main_~x~0#1.base|))) (or (= |c_ULTIMATE.start_main_~x~0#1.base| (select (store .cse5 |c_ULTIMATE.start_main_~x~0#1.offset| |c_ULTIMATE.start_main_~y~0#1.base|) |ULTIMATE.start_main_~x~1#1.offset|)) (= (select .cse5 .cse1) 0)))) (not (<= 0 |ULTIMATE.start_main_~x~1#1.offset|)) (forall ((v_ArrVal_3087 (Array Int Int)) (v_ArrVal_3090 Int)) (not (= (select (store (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem8#1.base| (store .cse2 .cse3 v_ArrVal_3082)) |c_ULTIMATE.start_main_~y~0#1.base| v_ArrVal_3087) |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset| v_ArrVal_3090) |ULTIMATE.start_main_~x~1#1.offset|) 0))) (not (<= |ULTIMATE.start_main_~x~1#1.offset| 0)))))) is different from false [2022-11-25 16:55:12,111 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse3 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~y~0#1.base|) |c_ULTIMATE.start_main_~y~0#1.offset|))) (let ((.cse0 (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~y~0#1.base|) |c_ULTIMATE.start_main_~y~0#1.offset|)) (.cse2 (+ |c_ULTIMATE.start_main_~x~0#1.offset| 12)) (.cse6 (select |c_#memory_$Pointer$.base| .cse3)) (.cse4 (select |c_#memory_$Pointer$.offset| .cse3))) (and (forall ((|v_ULTIMATE.start_main_#t~mem8#1.offset_20| Int)) (or (not (<= |v_ULTIMATE.start_main_#t~mem8#1.offset_20| .cse0)) (forall ((v_ArrVal_3083 Int) (v_ArrVal_3082 Int) (|ULTIMATE.start_main_~x~1#1.offset| Int)) (let ((.cse5 (+ |v_ULTIMATE.start_main_#t~mem8#1.offset_20| 4))) (or (not (<= 0 |ULTIMATE.start_main_~x~1#1.offset|)) (forall ((v_ArrVal_3087 (Array Int Int)) (v_ArrVal_3090 Int)) (let ((.cse1 (select (store (store |c_#memory_$Pointer$.offset| .cse3 (store .cse4 .cse5 v_ArrVal_3082)) |c_ULTIMATE.start_main_~y~0#1.base| v_ArrVal_3087) |c_ULTIMATE.start_main_~x~0#1.base|))) (or (not (= (select (store .cse1 |c_ULTIMATE.start_main_~x~0#1.offset| v_ArrVal_3090) |ULTIMATE.start_main_~x~1#1.offset|) 0)) (= (select .cse1 .cse2) 0)))) (forall ((v_ArrVal_3086 (Array Int Int))) (= (select (store (select (store (store |c_#memory_$Pointer$.base| .cse3 (store .cse6 .cse5 v_ArrVal_3083)) |c_ULTIMATE.start_main_~y~0#1.base| v_ArrVal_3086) |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset| |c_ULTIMATE.start_main_~y~0#1.base|) |ULTIMATE.start_main_~x~1#1.offset|) |c_ULTIMATE.start_main_~x~0#1.base|)) (not (<= |ULTIMATE.start_main_~x~1#1.offset| 0))))))) (forall ((|v_ULTIMATE.start_main_#t~mem8#1.offset_20| Int)) (or (not (<= |v_ULTIMATE.start_main_#t~mem8#1.offset_20| .cse0)) (forall ((v_ArrVal_3083 Int) (v_ArrVal_3082 Int) (|ULTIMATE.start_main_~x~1#1.offset| Int)) (let ((.cse8 (+ |v_ULTIMATE.start_main_#t~mem8#1.offset_20| 4))) (or (not (<= 0 |ULTIMATE.start_main_~x~1#1.offset|)) (forall ((v_ArrVal_3086 (Array Int Int))) (let ((.cse7 (select (store (store |c_#memory_$Pointer$.base| .cse3 (store .cse6 .cse8 v_ArrVal_3083)) |c_ULTIMATE.start_main_~y~0#1.base| v_ArrVal_3086) |c_ULTIMATE.start_main_~x~0#1.base|))) (or (= (select (store .cse7 |c_ULTIMATE.start_main_~x~0#1.offset| |c_ULTIMATE.start_main_~y~0#1.base|) |ULTIMATE.start_main_~x~1#1.offset|) |c_ULTIMATE.start_main_~x~0#1.base|) (= (select .cse7 .cse2) 0)))) (forall ((v_ArrVal_3087 (Array Int Int)) (v_ArrVal_3090 Int)) (not (= (select (store (select (store (store |c_#memory_$Pointer$.offset| .cse3 (store .cse4 .cse8 v_ArrVal_3082)) |c_ULTIMATE.start_main_~y~0#1.base| v_ArrVal_3087) |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset| v_ArrVal_3090) |ULTIMATE.start_main_~x~1#1.offset|) 0))) (not (<= |ULTIMATE.start_main_~x~1#1.offset| 0)))))))))) is different from false [2022-11-25 16:55:14,418 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse1 (+ |c_ULTIMATE.start_main_~x~0#1.offset| 12))) (and (forall ((v_ArrVal_3078 Int)) (or (forall ((|v_ULTIMATE.start_main_#t~mem8#1.offset_20| Int) (|ULTIMATE.start_main_~y~0#1.offset| Int) (|ULTIMATE.start_main_~y~0#1.base| Int)) (or (not (<= |v_ULTIMATE.start_main_#t~mem8#1.offset_20| v_ArrVal_3078)) (forall ((v_ArrVal_3083 Int) (v_ArrVal_3082 Int) (|ULTIMATE.start_main_~x~1#1.offset| Int)) (let ((.cse3 (+ |v_ULTIMATE.start_main_#t~mem8#1.offset_20| 4))) (or (not (<= 0 |ULTIMATE.start_main_~x~1#1.offset|)) (forall ((v_ArrVal_3086 (Array Int Int))) (let ((.cse0 (select (store (let ((.cse2 (store |c_#memory_$Pointer$.base| |ULTIMATE.start_main_~y~0#1.base| (store (select |c_#memory_$Pointer$.base| |ULTIMATE.start_main_~y~0#1.base|) |ULTIMATE.start_main_~y~0#1.offset| |c_ULTIMATE.start_main_#t~mem7#1.base|)))) (store .cse2 |c_ULTIMATE.start_main_#t~mem7#1.base| (store (select .cse2 |c_ULTIMATE.start_main_#t~mem7#1.base|) .cse3 v_ArrVal_3083))) |ULTIMATE.start_main_~y~0#1.base| v_ArrVal_3086) |c_ULTIMATE.start_main_~x~0#1.base|))) (or (= (select .cse0 .cse1) 0) (= (select (store .cse0 |c_ULTIMATE.start_main_~x~0#1.offset| |ULTIMATE.start_main_~y~0#1.base|) |ULTIMATE.start_main_~x~1#1.offset|) |c_ULTIMATE.start_main_~x~0#1.base|)))) (forall ((v_ArrVal_3087 (Array Int Int)) (v_ArrVal_3090 Int)) (not (= (select (store (select (store (let ((.cse4 (store |c_#memory_$Pointer$.offset| |ULTIMATE.start_main_~y~0#1.base| (store (select |c_#memory_$Pointer$.offset| |ULTIMATE.start_main_~y~0#1.base|) |ULTIMATE.start_main_~y~0#1.offset| v_ArrVal_3078)))) (store .cse4 |c_ULTIMATE.start_main_#t~mem7#1.base| (store (select .cse4 |c_ULTIMATE.start_main_#t~mem7#1.base|) .cse3 v_ArrVal_3082))) |ULTIMATE.start_main_~y~0#1.base| v_ArrVal_3087) |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset| v_ArrVal_3090) |ULTIMATE.start_main_~x~1#1.offset|) 0))) (not (<= |ULTIMATE.start_main_~x~1#1.offset| 0))))))) (not (<= v_ArrVal_3078 |c_ULTIMATE.start_main_#t~mem7#1.offset|)))) (forall ((v_ArrVal_3078 Int)) (or (not (<= v_ArrVal_3078 |c_ULTIMATE.start_main_#t~mem7#1.offset|)) (forall ((|v_ULTIMATE.start_main_#t~mem8#1.offset_20| Int) (|ULTIMATE.start_main_~y~0#1.offset| Int) (|ULTIMATE.start_main_~y~0#1.base| Int)) (or (forall ((v_ArrVal_3083 Int) (v_ArrVal_3082 Int) (|ULTIMATE.start_main_~x~1#1.offset| Int)) (let ((.cse7 (+ |v_ULTIMATE.start_main_#t~mem8#1.offset_20| 4))) (or (forall ((v_ArrVal_3087 (Array Int Int)) (v_ArrVal_3090 Int)) (let ((.cse5 (select (store (let ((.cse6 (store |c_#memory_$Pointer$.offset| |ULTIMATE.start_main_~y~0#1.base| (store (select |c_#memory_$Pointer$.offset| |ULTIMATE.start_main_~y~0#1.base|) |ULTIMATE.start_main_~y~0#1.offset| v_ArrVal_3078)))) (store .cse6 |c_ULTIMATE.start_main_#t~mem7#1.base| (store (select .cse6 |c_ULTIMATE.start_main_#t~mem7#1.base|) .cse7 v_ArrVal_3082))) |ULTIMATE.start_main_~y~0#1.base| v_ArrVal_3087) |c_ULTIMATE.start_main_~x~0#1.base|))) (or (= (select .cse5 .cse1) 0) (not (= (select (store .cse5 |c_ULTIMATE.start_main_~x~0#1.offset| v_ArrVal_3090) |ULTIMATE.start_main_~x~1#1.offset|) 0))))) (not (<= 0 |ULTIMATE.start_main_~x~1#1.offset|)) (forall ((v_ArrVal_3086 (Array Int Int))) (= (select (store (select (store (let ((.cse8 (store |c_#memory_$Pointer$.base| |ULTIMATE.start_main_~y~0#1.base| (store (select |c_#memory_$Pointer$.base| |ULTIMATE.start_main_~y~0#1.base|) |ULTIMATE.start_main_~y~0#1.offset| |c_ULTIMATE.start_main_#t~mem7#1.base|)))) (store .cse8 |c_ULTIMATE.start_main_#t~mem7#1.base| (store (select .cse8 |c_ULTIMATE.start_main_#t~mem7#1.base|) .cse7 v_ArrVal_3083))) |ULTIMATE.start_main_~y~0#1.base| v_ArrVal_3086) |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset| |ULTIMATE.start_main_~y~0#1.base|) |ULTIMATE.start_main_~x~1#1.offset|) |c_ULTIMATE.start_main_~x~0#1.base|)) (not (<= |ULTIMATE.start_main_~x~1#1.offset| 0))))) (not (<= |v_ULTIMATE.start_main_#t~mem8#1.offset_20| v_ArrVal_3078)))))))) is different from false [2022-11-25 16:55:28,427 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse11 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base|)) (.cse7 (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~x~0#1.base|))) (let ((.cse2 (select .cse7 |c_ULTIMATE.start_main_~x~0#1.offset|)) (.cse1 (+ |c_ULTIMATE.start_main_~x~0#1.offset| 12)) (.cse4 (select .cse11 |c_ULTIMATE.start_main_~x~0#1.offset|)) (.cse8 (+ |c_ULTIMATE.start_main_~x~0#1.offset| 8))) (and (forall ((|ULTIMATE.start_main_~x~1#1.offset| Int) (v_ArrVal_3078 Int) (v_ArrVal_3075 Int) (|v_ULTIMATE.start_main_#t~mem8#1.offset_20| Int) (v_ArrVal_3083 Int) (v_ArrVal_3073 Int) (|ULTIMATE.start_main_~y~0#1.offset| Int) (v_ArrVal_3086 (Array Int Int)) (v_ArrVal_3087 (Array Int Int)) (v_ArrVal_3082 Int) (v_ArrVal_3090 Int) (|ULTIMATE.start_main_~y~0#1.base| Int)) (let ((.cse5 (+ |v_ULTIMATE.start_main_#t~mem8#1.offset_20| 4))) (let ((.cse0 (select (store (let ((.cse9 (let ((.cse10 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base| (store .cse11 .cse8 v_ArrVal_3075)))) (store .cse10 |ULTIMATE.start_main_~y~0#1.base| (store (select .cse10 |ULTIMATE.start_main_~y~0#1.base|) |ULTIMATE.start_main_~y~0#1.offset| .cse4))))) (store .cse9 .cse4 (store (select .cse9 .cse4) .cse5 v_ArrVal_3083))) |ULTIMATE.start_main_~y~0#1.base| v_ArrVal_3086) |c_ULTIMATE.start_main_~x~0#1.base|))) (or (= (select (store .cse0 |c_ULTIMATE.start_main_~x~0#1.offset| |ULTIMATE.start_main_~y~0#1.base|) |ULTIMATE.start_main_~x~1#1.offset|) |c_ULTIMATE.start_main_~x~0#1.base|) (not (<= 0 |ULTIMATE.start_main_~x~1#1.offset|)) (= (select .cse0 .cse1) 0) (< .cse2 v_ArrVal_3078) (not (= (select (store (select (store (let ((.cse3 (let ((.cse6 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~x~0#1.base| (store .cse7 .cse8 v_ArrVal_3073)))) (store .cse6 |ULTIMATE.start_main_~y~0#1.base| (store (select .cse6 |ULTIMATE.start_main_~y~0#1.base|) |ULTIMATE.start_main_~y~0#1.offset| v_ArrVal_3078))))) (store .cse3 .cse4 (store (select .cse3 .cse4) .cse5 v_ArrVal_3082))) |ULTIMATE.start_main_~y~0#1.base| v_ArrVal_3087) |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset| v_ArrVal_3090) |ULTIMATE.start_main_~x~1#1.offset|) 0)) (not (<= |ULTIMATE.start_main_~x~1#1.offset| 0)) (not (<= |v_ULTIMATE.start_main_#t~mem8#1.offset_20| v_ArrVal_3078)))))) (forall ((|ULTIMATE.start_main_~x~1#1.offset| Int) (v_ArrVal_3078 Int) (v_ArrVal_3075 Int) (|v_ULTIMATE.start_main_#t~mem8#1.offset_20| Int) (v_ArrVal_3083 Int) (v_ArrVal_3073 Int) (|ULTIMATE.start_main_~y~0#1.offset| Int) (v_ArrVal_3086 (Array Int Int)) (v_ArrVal_3087 (Array Int Int)) (v_ArrVal_3082 Int) (v_ArrVal_3090 Int) (|ULTIMATE.start_main_~y~0#1.base| Int)) (let ((.cse13 (+ |v_ULTIMATE.start_main_#t~mem8#1.offset_20| 4))) (let ((.cse15 (select (store (let ((.cse16 (let ((.cse17 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~x~0#1.base| (store .cse7 .cse8 v_ArrVal_3073)))) (store .cse17 |ULTIMATE.start_main_~y~0#1.base| (store (select .cse17 |ULTIMATE.start_main_~y~0#1.base|) |ULTIMATE.start_main_~y~0#1.offset| v_ArrVal_3078))))) (store .cse16 .cse4 (store (select .cse16 .cse4) .cse13 v_ArrVal_3082))) |ULTIMATE.start_main_~y~0#1.base| v_ArrVal_3087) |c_ULTIMATE.start_main_~x~0#1.base|))) (or (= (select (store (select (store (let ((.cse12 (let ((.cse14 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base| (store .cse11 .cse8 v_ArrVal_3075)))) (store .cse14 |ULTIMATE.start_main_~y~0#1.base| (store (select .cse14 |ULTIMATE.start_main_~y~0#1.base|) |ULTIMATE.start_main_~y~0#1.offset| .cse4))))) (store .cse12 .cse4 (store (select .cse12 .cse4) .cse13 v_ArrVal_3083))) |ULTIMATE.start_main_~y~0#1.base| v_ArrVal_3086) |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset| |ULTIMATE.start_main_~y~0#1.base|) |ULTIMATE.start_main_~x~1#1.offset|) |c_ULTIMATE.start_main_~x~0#1.base|) (not (<= 0 |ULTIMATE.start_main_~x~1#1.offset|)) (< .cse2 v_ArrVal_3078) (not (= (select (store .cse15 |c_ULTIMATE.start_main_~x~0#1.offset| v_ArrVal_3090) |ULTIMATE.start_main_~x~1#1.offset|) 0)) (not (<= |ULTIMATE.start_main_~x~1#1.offset| 0)) (= (select .cse15 .cse1) 0) (not (<= |v_ULTIMATE.start_main_#t~mem8#1.offset_20| v_ArrVal_3078))))))))) is different from false [2022-11-25 16:55:28,858 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse12 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base|)) (.cse5 (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~x~0#1.base|))) (let ((.cse8 (+ |c_ULTIMATE.start_main_~x~0#1.offset| 12)) (.cse9 (select .cse5 |c_ULTIMATE.start_main_~x~0#1.offset|)) (.cse2 (select .cse12 |c_ULTIMATE.start_main_~x~0#1.offset|)) (.cse6 (+ |c_ULTIMATE.start_main_~x~0#1.offset| 4)) (.cse7 (+ |c_ULTIMATE.start_main_~x~0#1.offset| 8))) (and (forall ((|ULTIMATE.start_main_~x~1#1.offset| Int) (v_ArrVal_3078 Int) (v_ArrVal_3075 Int) (|v_ULTIMATE.start_main_#t~mem8#1.offset_20| Int) (v_ArrVal_3083 Int) (v_ArrVal_3073 Int) (|ULTIMATE.start_main_~y~0#1.offset| Int) (v_ArrVal_3086 (Array Int Int)) (v_ArrVal_3070 Int) (v_ArrVal_3087 (Array Int Int)) (v_ArrVal_3071 Int) (v_ArrVal_3082 Int) (v_ArrVal_3090 Int) (|ULTIMATE.start_main_~y~0#1.base| Int)) (let ((.cse3 (+ |v_ULTIMATE.start_main_#t~mem8#1.offset_20| 4))) (let ((.cse0 (select (store (let ((.cse10 (let ((.cse11 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base| (store (store .cse12 .cse6 v_ArrVal_3071) .cse7 v_ArrVal_3075)))) (store .cse11 |ULTIMATE.start_main_~y~0#1.base| (store (select .cse11 |ULTIMATE.start_main_~y~0#1.base|) |ULTIMATE.start_main_~y~0#1.offset| .cse2))))) (store .cse10 .cse2 (store (select .cse10 .cse2) .cse3 v_ArrVal_3083))) |ULTIMATE.start_main_~y~0#1.base| v_ArrVal_3086) |c_ULTIMATE.start_main_~x~0#1.base|))) (or (= (select (store .cse0 |c_ULTIMATE.start_main_~x~0#1.offset| |ULTIMATE.start_main_~y~0#1.base|) |ULTIMATE.start_main_~x~1#1.offset|) |c_ULTIMATE.start_main_~x~0#1.base|) (not (<= 0 |ULTIMATE.start_main_~x~1#1.offset|)) (not (= (select (store (select (store (let ((.cse1 (let ((.cse4 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~x~0#1.base| (store (store .cse5 .cse6 v_ArrVal_3070) .cse7 v_ArrVal_3073)))) (store .cse4 |ULTIMATE.start_main_~y~0#1.base| (store (select .cse4 |ULTIMATE.start_main_~y~0#1.base|) |ULTIMATE.start_main_~y~0#1.offset| v_ArrVal_3078))))) (store .cse1 .cse2 (store (select .cse1 .cse2) .cse3 v_ArrVal_3082))) |ULTIMATE.start_main_~y~0#1.base| v_ArrVal_3087) |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset| v_ArrVal_3090) |ULTIMATE.start_main_~x~1#1.offset|) 0)) (= 0 (select .cse0 .cse8)) (< .cse9 v_ArrVal_3078) (not (<= |ULTIMATE.start_main_~x~1#1.offset| 0)) (not (<= |v_ULTIMATE.start_main_#t~mem8#1.offset_20| v_ArrVal_3078)))))) (forall ((|ULTIMATE.start_main_~x~1#1.offset| Int) (v_ArrVal_3078 Int) (v_ArrVal_3075 Int) (|v_ULTIMATE.start_main_#t~mem8#1.offset_20| Int) (v_ArrVal_3083 Int) (v_ArrVal_3073 Int) (|ULTIMATE.start_main_~y~0#1.offset| Int) (v_ArrVal_3086 (Array Int Int)) (v_ArrVal_3070 Int) (v_ArrVal_3087 (Array Int Int)) (v_ArrVal_3071 Int) (v_ArrVal_3082 Int) (v_ArrVal_3090 Int) (|ULTIMATE.start_main_~y~0#1.base| Int)) (let ((.cse14 (+ |v_ULTIMATE.start_main_#t~mem8#1.offset_20| 4))) (let ((.cse16 (select (store (let ((.cse17 (let ((.cse18 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~x~0#1.base| (store (store .cse5 .cse6 v_ArrVal_3070) .cse7 v_ArrVal_3073)))) (store .cse18 |ULTIMATE.start_main_~y~0#1.base| (store (select .cse18 |ULTIMATE.start_main_~y~0#1.base|) |ULTIMATE.start_main_~y~0#1.offset| v_ArrVal_3078))))) (store .cse17 .cse2 (store (select .cse17 .cse2) .cse14 v_ArrVal_3082))) |ULTIMATE.start_main_~y~0#1.base| v_ArrVal_3087) |c_ULTIMATE.start_main_~x~0#1.base|))) (or (= (select (store (select (store (let ((.cse13 (let ((.cse15 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base| (store (store .cse12 .cse6 v_ArrVal_3071) .cse7 v_ArrVal_3075)))) (store .cse15 |ULTIMATE.start_main_~y~0#1.base| (store (select .cse15 |ULTIMATE.start_main_~y~0#1.base|) |ULTIMATE.start_main_~y~0#1.offset| .cse2))))) (store .cse13 .cse2 (store (select .cse13 .cse2) .cse14 v_ArrVal_3083))) |ULTIMATE.start_main_~y~0#1.base| v_ArrVal_3086) |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset| |ULTIMATE.start_main_~y~0#1.base|) |ULTIMATE.start_main_~x~1#1.offset|) |c_ULTIMATE.start_main_~x~0#1.base|) (not (<= 0 |ULTIMATE.start_main_~x~1#1.offset|)) (not (= (select (store .cse16 |c_ULTIMATE.start_main_~x~0#1.offset| v_ArrVal_3090) |ULTIMATE.start_main_~x~1#1.offset|) 0)) (= (select .cse16 .cse8) 0) (< .cse9 v_ArrVal_3078) (not (<= |ULTIMATE.start_main_~x~1#1.offset| 0)) (not (<= |v_ULTIMATE.start_main_#t~mem8#1.offset_20| v_ArrVal_3078))))))))) is different from false [2022-11-25 16:55:38,909 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse1 (+ |c_ULTIMATE.start_main_~x~0#1.offset| 12)) (.cse11 (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~x~0#1.base|)) (.cse5 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base|)) (.cse6 (+ |c_ULTIMATE.start_main_~x~0#1.offset| 16)) (.cse7 (+ |c_ULTIMATE.start_main_~x~0#1.offset| 4)) (.cse8 (+ |c_ULTIMATE.start_main_~x~0#1.offset| 8))) (and (forall ((v_ArrVal_3062 Int) (v_ArrVal_3066 Int) (v_ArrVal_3063 Int)) (or (not (<= v_ArrVal_3066 |c_ULTIMATE.start_main_~x~0#1.offset|)) (forall ((|ULTIMATE.start_main_~x~1#1.offset| Int) (v_ArrVal_3078 Int) (v_ArrVal_3075 Int) (|v_ULTIMATE.start_main_#t~mem8#1.offset_20| Int) (v_ArrVal_3083 Int) (v_ArrVal_3073 Int) (|ULTIMATE.start_main_~y~0#1.offset| Int) (v_ArrVal_3086 (Array Int Int)) (v_ArrVal_3070 Int) (v_ArrVal_3087 (Array Int Int)) (v_ArrVal_3071 Int) (v_ArrVal_3082 Int) (v_ArrVal_3090 Int) (|ULTIMATE.start_main_~y~0#1.base| Int)) (let ((.cse3 (+ |v_ULTIMATE.start_main_#t~mem8#1.offset_20| 4))) (let ((.cse0 (select (store (let ((.cse9 (let ((.cse10 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~x~0#1.base| (store (store (store (store .cse11 .cse6 v_ArrVal_3063) |c_ULTIMATE.start_main_~x~0#1.offset| v_ArrVal_3066) .cse7 v_ArrVal_3070) .cse8 v_ArrVal_3073)))) (store .cse10 |ULTIMATE.start_main_~y~0#1.base| (store (select .cse10 |ULTIMATE.start_main_~y~0#1.base|) |ULTIMATE.start_main_~y~0#1.offset| v_ArrVal_3078))))) (store .cse9 |c_ULTIMATE.start_main_~x~0#1.base| (store (select .cse9 |c_ULTIMATE.start_main_~x~0#1.base|) .cse3 v_ArrVal_3082))) |ULTIMATE.start_main_~y~0#1.base| v_ArrVal_3087) |c_ULTIMATE.start_main_~x~0#1.base|))) (or (= (select .cse0 .cse1) 0) (not (<= 0 |ULTIMATE.start_main_~x~1#1.offset|)) (= (select (store (select (store (let ((.cse2 (let ((.cse4 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base| (store (store (store (store .cse5 .cse6 v_ArrVal_3062) |c_ULTIMATE.start_main_~x~0#1.offset| |c_ULTIMATE.start_main_~x~0#1.base|) .cse7 v_ArrVal_3071) .cse8 v_ArrVal_3075)))) (store .cse4 |ULTIMATE.start_main_~y~0#1.base| (store (select .cse4 |ULTIMATE.start_main_~y~0#1.base|) |ULTIMATE.start_main_~y~0#1.offset| |c_ULTIMATE.start_main_~x~0#1.base|))))) (store .cse2 |c_ULTIMATE.start_main_~x~0#1.base| (store (select .cse2 |c_ULTIMATE.start_main_~x~0#1.base|) .cse3 v_ArrVal_3083))) |ULTIMATE.start_main_~y~0#1.base| v_ArrVal_3086) |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset| |ULTIMATE.start_main_~y~0#1.base|) |ULTIMATE.start_main_~x~1#1.offset|) |c_ULTIMATE.start_main_~x~0#1.base|) (not (= (select (store .cse0 |c_ULTIMATE.start_main_~x~0#1.offset| v_ArrVal_3090) |ULTIMATE.start_main_~x~1#1.offset|) 0)) (not (<= |ULTIMATE.start_main_~x~1#1.offset| 0)) (not (<= |v_ULTIMATE.start_main_#t~mem8#1.offset_20| v_ArrVal_3078)) (< v_ArrVal_3066 v_ArrVal_3078))))))) (forall ((v_ArrVal_3062 Int) (v_ArrVal_3066 Int) (v_ArrVal_3063 Int)) (or (forall ((|ULTIMATE.start_main_~x~1#1.offset| Int) (v_ArrVal_3078 Int) (v_ArrVal_3075 Int) (|v_ULTIMATE.start_main_#t~mem8#1.offset_20| Int) (v_ArrVal_3083 Int) (v_ArrVal_3073 Int) (|ULTIMATE.start_main_~y~0#1.offset| Int) (v_ArrVal_3086 (Array Int Int)) (v_ArrVal_3070 Int) (v_ArrVal_3087 (Array Int Int)) (v_ArrVal_3071 Int) (v_ArrVal_3082 Int) (v_ArrVal_3090 Int) (|ULTIMATE.start_main_~y~0#1.base| Int)) (let ((.cse14 (+ |v_ULTIMATE.start_main_#t~mem8#1.offset_20| 4))) (let ((.cse12 (select (store (let ((.cse16 (let ((.cse17 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base| (store (store (store (store .cse5 .cse6 v_ArrVal_3062) |c_ULTIMATE.start_main_~x~0#1.offset| |c_ULTIMATE.start_main_~x~0#1.base|) .cse7 v_ArrVal_3071) .cse8 v_ArrVal_3075)))) (store .cse17 |ULTIMATE.start_main_~y~0#1.base| (store (select .cse17 |ULTIMATE.start_main_~y~0#1.base|) |ULTIMATE.start_main_~y~0#1.offset| |c_ULTIMATE.start_main_~x~0#1.base|))))) (store .cse16 |c_ULTIMATE.start_main_~x~0#1.base| (store (select .cse16 |c_ULTIMATE.start_main_~x~0#1.base|) .cse14 v_ArrVal_3083))) |ULTIMATE.start_main_~y~0#1.base| v_ArrVal_3086) |c_ULTIMATE.start_main_~x~0#1.base|))) (or (= (select .cse12 .cse1) 0) (not (<= 0 |ULTIMATE.start_main_~x~1#1.offset|)) (= (select (store .cse12 |c_ULTIMATE.start_main_~x~0#1.offset| |ULTIMATE.start_main_~y~0#1.base|) |ULTIMATE.start_main_~x~1#1.offset|) |c_ULTIMATE.start_main_~x~0#1.base|) (not (= (select (store (select (store (let ((.cse13 (let ((.cse15 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~x~0#1.base| (store (store (store (store .cse11 .cse6 v_ArrVal_3063) |c_ULTIMATE.start_main_~x~0#1.offset| v_ArrVal_3066) .cse7 v_ArrVal_3070) .cse8 v_ArrVal_3073)))) (store .cse15 |ULTIMATE.start_main_~y~0#1.base| (store (select .cse15 |ULTIMATE.start_main_~y~0#1.base|) |ULTIMATE.start_main_~y~0#1.offset| v_ArrVal_3078))))) (store .cse13 |c_ULTIMATE.start_main_~x~0#1.base| (store (select .cse13 |c_ULTIMATE.start_main_~x~0#1.base|) .cse14 v_ArrVal_3082))) |ULTIMATE.start_main_~y~0#1.base| v_ArrVal_3087) |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset| v_ArrVal_3090) |ULTIMATE.start_main_~x~1#1.offset|) 0)) (not (<= |ULTIMATE.start_main_~x~1#1.offset| 0)) (not (<= |v_ULTIMATE.start_main_#t~mem8#1.offset_20| v_ArrVal_3078)) (< v_ArrVal_3066 v_ArrVal_3078))))) (not (<= v_ArrVal_3066 |c_ULTIMATE.start_main_~x~0#1.offset|)))))) is different from false [2022-11-25 16:55:39,077 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 16:55:39,103 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-25 16:55:39,125 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-25 16:55:39,187 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-25 16:55:39,235 INFO L217 Elim1Store]: Index analysis took 170 ms [2022-11-25 16:55:40,292 INFO L321 Elim1Store]: treesize reduction 128, result has 47.8 percent of original size [2022-11-25 16:55:40,292 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 13 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 7 case distinctions, treesize of input 152 treesize of output 131 [2022-11-25 16:55:40,323 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-25 16:55:40,324 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-25 16:55:40,329 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-25 16:55:40,534 INFO L321 Elim1Store]: treesize reduction 175, result has 40.3 percent of original size [2022-11-25 16:55:40,534 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 13 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 7 case distinctions, treesize of input 302 treesize of output 143 [2022-11-25 16:55:40,553 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 16:55:40,560 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 16:55:40,615 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-25 16:55:40,616 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 6 select indices, 6 select index equivalence classes, 10 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 5 case distinctions, treesize of input 116 treesize of output 132 [2022-11-25 16:55:40,649 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-11-25 16:55:40,649 INFO L350 Elim1Store]: Elim1 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 160 treesize of output 148 [2022-11-25 16:55:40,876 INFO L321 Elim1Store]: treesize reduction 8, result has 92.4 percent of original size [2022-11-25 16:55:40,876 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 7 select indices, 7 select index equivalence classes, 10 disjoint index pairs (out of 21 index pairs), introduced 7 new quantified variables, introduced 11 case distinctions, treesize of input 131 treesize of output 201 [2022-11-25 16:55:40,934 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-25 16:55:40,935 INFO L350 Elim1Store]: Elim1 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 34 treesize of output 38 [2022-11-25 16:55:40,962 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-25 16:55:40,970 INFO L350 Elim1Store]: Elim1 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 6 treesize of output 4 [2022-11-25 16:55:41,481 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-25 16:55:41,482 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-25 16:55:41,483 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-25 16:55:41,505 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-25 16:55:41,575 INFO L321 Elim1Store]: treesize reduction 106, result has 0.9 percent of original size [2022-11-25 16:55:41,576 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 14 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 7 case distinctions, treesize of input 303 treesize of output 1 [2022-11-25 16:55:41,584 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 4 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 16:55:41,584 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1764806913] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-25 16:55:41,584 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-25 16:55:41,584 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 20, 23] total 51 [2022-11-25 16:55:41,584 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1712917289] [2022-11-25 16:55:41,584 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-25 16:55:41,585 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 51 states [2022-11-25 16:55:41,585 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 16:55:41,586 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 51 interpolants. [2022-11-25 16:55:41,586 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=212, Invalid=1688, Unknown=104, NotChecked=546, Total=2550 [2022-11-25 16:55:41,587 INFO L87 Difference]: Start difference. First operand 321 states and 380 transitions. Second operand has 51 states, 51 states have (on average 2.196078431372549) internal successors, (112), 51 states have internal predecessors, (112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 16:56:16,630 WARN L233 SmtUtils]: Spent 24.28s on a formula simplification. DAG size of input: 101 DAG size of output: 34 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-25 16:56:44,914 WARN L233 SmtUtils]: Spent 20.53s on a formula simplification. DAG size of input: 118 DAG size of output: 111 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-25 16:56:49,120 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-11-25 16:56:51,149 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-11-25 16:56:53,153 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-11-25 16:56:54,814 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.66s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-11-25 16:56:56,916 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-11-25 16:56:59,318 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-11-25 16:57:01,326 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-11-25 16:57:34,586 WARN L233 SmtUtils]: Spent 20.62s on a formula simplification. DAG size of input: 111 DAG size of output: 44 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-25 16:58:14,260 WARN L233 SmtUtils]: Spent 24.34s on a formula simplification. DAG size of input: 97 DAG size of output: 30 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-25 16:58:15,066 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 16:58:15,066 INFO L93 Difference]: Finished difference Result 470 states and 558 transitions. [2022-11-25 16:58:15,067 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 54 states. [2022-11-25 16:58:15,067 INFO L78 Accepts]: Start accepts. Automaton has has 51 states, 51 states have (on average 2.196078431372549) internal successors, (112), 51 states have internal predecessors, (112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 46 [2022-11-25 16:58:15,067 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 16:58:15,069 INFO L225 Difference]: With dead ends: 470 [2022-11-25 16:58:15,070 INFO L226 Difference]: Without dead ends: 470 [2022-11-25 16:58:15,072 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 170 GetRequests, 68 SyntacticMatches, 6 SemanticMatches, 96 ConstructedPredicates, 6 IntricatePredicates, 0 DeprecatedPredicates, 1996 ImplicationChecksByTransitivity, 161.9s TimeCoverageRelationStatistics Valid=1105, Invalid=7089, Unknown=202, NotChecked=1110, Total=9506 [2022-11-25 16:58:15,073 INFO L413 NwaCegarLoop]: 31 mSDtfsCounter, 485 mSDsluCounter, 649 mSDsCounter, 0 mSdLazyCounter, 1239 mSolverCounterSat, 77 mSolverCounterUnsat, 8 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 18.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 485 SdHoareTripleChecker+Valid, 680 SdHoareTripleChecker+Invalid, 2247 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 77 IncrementalHoareTripleChecker+Valid, 1239 IncrementalHoareTripleChecker+Invalid, 8 IncrementalHoareTripleChecker+Unknown, 923 IncrementalHoareTripleChecker+Unchecked, 19.0s IncrementalHoareTripleChecker+Time [2022-11-25 16:58:15,073 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [485 Valid, 680 Invalid, 2247 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [77 Valid, 1239 Invalid, 8 Unknown, 923 Unchecked, 19.0s Time] [2022-11-25 16:58:15,074 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 470 states. [2022-11-25 16:58:15,080 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 470 to 325. [2022-11-25 16:58:15,081 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 325 states, 314 states have (on average 1.2229299363057324) internal successors, (384), 324 states have internal predecessors, (384), 0 states have call successors, (0), 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-25 16:58:15,082 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 325 states to 325 states and 384 transitions. [2022-11-25 16:58:15,082 INFO L78 Accepts]: Start accepts. Automaton has 325 states and 384 transitions. Word has length 46 [2022-11-25 16:58:15,083 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 16:58:15,083 INFO L495 AbstractCegarLoop]: Abstraction has 325 states and 384 transitions. [2022-11-25 16:58:15,083 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 51 states, 51 states have (on average 2.196078431372549) internal successors, (112), 51 states have internal predecessors, (112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 16:58:15,083 INFO L276 IsEmpty]: Start isEmpty. Operand 325 states and 384 transitions. [2022-11-25 16:58:15,084 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2022-11-25 16:58:15,084 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 16:58:15,084 INFO L195 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 16:58:15,100 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_566ce540-1391-469b-bbbb-cc92d0ef0a3d/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Ended with exit code 0 [2022-11-25 16:58:15,291 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_566ce540-1391-469b-bbbb-cc92d0ef0a3d/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable39 [2022-11-25 16:58:15,291 INFO L420 AbstractCegarLoop]: === Iteration 41 === Targeting ULTIMATE.startErr32REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 38 more)] === [2022-11-25 16:58:15,291 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 16:58:15,291 INFO L85 PathProgramCache]: Analyzing trace with hash -1565727437, now seen corresponding path program 1 times [2022-11-25 16:58:15,291 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 16:58:15,291 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [55913389] [2022-11-25 16:58:15,292 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 16:58:15,292 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 16:58:15,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 16:58:16,553 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 4 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 16:58:16,554 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 16:58:16,554 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [55913389] [2022-11-25 16:58:16,554 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [55913389] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-25 16:58:16,554 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1944003983] [2022-11-25 16:58:16,554 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 16:58:16,554 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 16:58:16,554 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_566ce540-1391-469b-bbbb-cc92d0ef0a3d/bin/uautomizer-ZsLfNo2U6R/z3 [2022-11-25 16:58:16,563 INFO L229 MonitoredProcess]: Starting monitored process 18 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_566ce540-1391-469b-bbbb-cc92d0ef0a3d/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-25 16:58:16,587 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_566ce540-1391-469b-bbbb-cc92d0ef0a3d/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Waiting until timeout for monitored process [2022-11-25 16:58:16,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 16:58:16,896 INFO L263 TraceCheckSpWp]: Trace formula consists of 366 conjuncts, 89 conjunts are in the unsatisfiable core [2022-11-25 16:58:16,901 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 16:58:16,911 INFO L350 Elim1Store]: Elim1 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-25 16:58:16,926 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-25 16:58:16,938 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-25 16:58:16,989 INFO L350 Elim1Store]: Elim1 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-25 16:58:16,995 INFO L350 Elim1Store]: Elim1 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-25 16:58:17,060 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 16:58:17,061 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2022-11-25 16:58:17,071 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 16:58:17,073 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 16:58:17,074 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 32 [2022-11-25 16:58:17,096 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 34 [2022-11-25 16:58:17,116 INFO L350 Elim1Store]: Elim1 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-25 16:58:17,130 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 34 [2022-11-25 16:58:17,149 INFO L350 Elim1Store]: Elim1 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-25 16:58:17,325 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-11-25 16:58:17,325 INFO L350 Elim1Store]: Elim1 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-25 16:58:17,424 INFO L350 Elim1Store]: Elim1 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 14 treesize of output 16 [2022-11-25 16:58:17,436 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 21 [2022-11-25 16:58:17,459 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 21 [2022-11-25 16:58:17,474 INFO L350 Elim1Store]: Elim1 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 14 treesize of output 16 [2022-11-25 16:58:17,495 INFO L350 Elim1Store]: Elim1 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 14 treesize of output 16 [2022-11-25 16:58:17,510 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 28 [2022-11-25 16:58:17,595 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 16:58:17,596 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 40 [2022-11-25 16:58:17,612 INFO L350 Elim1Store]: Elim1 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 14 treesize of output 16 [2022-11-25 16:58:17,640 INFO L350 Elim1Store]: Elim1 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 14 treesize of output 16 [2022-11-25 16:58:17,648 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 16:58:17,650 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 40 [2022-11-25 16:58:17,810 INFO L321 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2022-11-25 16:58:17,810 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 21 treesize of output 20 [2022-11-25 16:58:17,851 INFO L321 Elim1Store]: treesize reduction 24, result has 48.9 percent of original size [2022-11-25 16:58:17,851 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 35 treesize of output 48 [2022-11-25 16:58:18,035 INFO L321 Elim1Store]: treesize reduction 16, result has 5.9 percent of original size [2022-11-25 16:58:18,036 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 2 case distinctions, treesize of input 85 treesize of output 81 [2022-11-25 16:58:18,043 INFO L350 Elim1Store]: Elim1 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 80 treesize of output 78 [2022-11-25 16:58:18,477 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-25 16:58:18,477 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 133 treesize of output 131 [2022-11-25 16:58:19,618 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-25 16:58:19,618 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 59 treesize of output 26 [2022-11-25 16:58:19,731 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 4 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 16:58:19,731 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-25 16:58:19,846 INFO L321 Elim1Store]: treesize reduction 5, result has 58.3 percent of original size [2022-11-25 16:58:19,846 INFO L350 Elim1Store]: Elim1 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 16 treesize of output 15 [2022-11-25 16:58:20,204 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse3 (+ |c_ULTIMATE.start_main_~first~0#1.offset| 12)) (.cse4 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base|)) (.cse5 (+ |c_ULTIMATE.start_main_~x~0#1.offset| 16))) (and (forall ((v_ArrVal_3285 (Array Int Int)) (v_ArrVal_3286 Int)) (let ((.cse2 (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_3285) |c_ULTIMATE.start_main_~first~0#1.base|) .cse3))) (or (let ((.cse1 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base| (store .cse4 .cse5 v_ArrVal_3286)))) (let ((.cse0 (select (select .cse1 |c_ULTIMATE.start_main_~first~0#1.base|) .cse3))) (= .cse0 (select (select .cse1 .cse0) .cse2)))) (= .cse2 0)))) (forall ((v_ArrVal_3285 (Array Int Int)) (v_ArrVal_3286 Int)) (let ((.cse7 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base| (store .cse4 .cse5 v_ArrVal_3286)))) (let ((.cse6 (select (select .cse7 |c_ULTIMATE.start_main_~first~0#1.base|) .cse3))) (or (= .cse6 (select (select .cse7 .cse6) (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_3285) |c_ULTIMATE.start_main_~first~0#1.base|) .cse3))) (= .cse6 0))))))) is different from false [2022-11-25 16:58:20,839 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse6 (+ |c_ULTIMATE.start_main_~x~0#1.offset| 16)) (.cse8 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base|)) (.cse9 (+ |c_ULTIMATE.start_main_~x~0#1.offset| 8)) (.cse4 (+ |c_ULTIMATE.start_main_~first~0#1.offset| 12))) (and (forall ((v_ArrVal_3285 (Array Int Int)) (v_ArrVal_3277 (Array Int Int)) (|ULTIMATE.start_main_~last~0#1.offset| Int) (v_ArrVal_3279 Int) (v_ArrVal_3286 Int)) (let ((.cse3 (+ |ULTIMATE.start_main_~last~0#1.offset| 12))) (let ((.cse1 (let ((.cse5 (let ((.cse7 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base| (store .cse8 .cse9 v_ArrVal_3279)))) (store .cse7 |c_ULTIMATE.start_main_~last~0#1.base| (store (select .cse7 |c_ULTIMATE.start_main_~last~0#1.base|) .cse3 |c_ULTIMATE.start_main_~x~0#1.base|))))) (store .cse5 |c_ULTIMATE.start_main_~x~0#1.base| (store (select .cse5 |c_ULTIMATE.start_main_~x~0#1.base|) .cse6 v_ArrVal_3286))))) (let ((.cse0 (select (select .cse1 |c_ULTIMATE.start_main_~first~0#1.base|) .cse4))) (or (= .cse0 0) (= (select (select .cse1 .cse0) (select (select (store (let ((.cse2 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_3277))) (store .cse2 |c_ULTIMATE.start_main_~last~0#1.base| (store (select .cse2 |c_ULTIMATE.start_main_~last~0#1.base|) .cse3 |c_ULTIMATE.start_main_~x~0#1.offset|))) |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_3285) |c_ULTIMATE.start_main_~first~0#1.base|) .cse4)) .cse0)))))) (forall ((v_ArrVal_3285 (Array Int Int)) (v_ArrVal_3277 (Array Int Int)) (|ULTIMATE.start_main_~last~0#1.offset| Int) (v_ArrVal_3279 Int) (v_ArrVal_3286 Int)) (let ((.cse15 (+ |ULTIMATE.start_main_~last~0#1.offset| 12))) (let ((.cse12 (select (select (store (let ((.cse16 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_3277))) (store .cse16 |c_ULTIMATE.start_main_~last~0#1.base| (store (select .cse16 |c_ULTIMATE.start_main_~last~0#1.base|) .cse15 |c_ULTIMATE.start_main_~x~0#1.offset|))) |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_3285) |c_ULTIMATE.start_main_~first~0#1.base|) .cse4))) (or (let ((.cse10 (let ((.cse13 (let ((.cse14 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base| (store .cse8 .cse9 v_ArrVal_3279)))) (store .cse14 |c_ULTIMATE.start_main_~last~0#1.base| (store (select .cse14 |c_ULTIMATE.start_main_~last~0#1.base|) .cse15 |c_ULTIMATE.start_main_~x~0#1.base|))))) (store .cse13 |c_ULTIMATE.start_main_~x~0#1.base| (store (select .cse13 |c_ULTIMATE.start_main_~x~0#1.base|) .cse6 v_ArrVal_3286))))) (let ((.cse11 (select (select .cse10 |c_ULTIMATE.start_main_~first~0#1.base|) .cse4))) (= (select (select .cse10 .cse11) .cse12) .cse11))) (= .cse12 0))))))) is different from false [2022-11-25 16:58:29,246 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-25 16:58:29,247 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 3 case distinctions, treesize of input 326 treesize of output 193 [2022-11-25 16:58:29,289 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-25 16:58:29,289 INFO L350 Elim1Store]: Elim1 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 3 case distinctions, treesize of input 430 treesize of output 244 [2022-11-25 16:58:29,324 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse6 (+ |c_ULTIMATE.start_main_~x~0#1.offset| 16)) (.cse4 (+ |c_ULTIMATE.start_main_~first~0#1.offset| 12))) (and (forall ((v_arrayElimArr_13 (Array Int Int)) (v_ArrVal_3285 (Array Int Int)) (v_ArrVal_3277 (Array Int Int)) (|ULTIMATE.start_main_~last~0#1.offset| Int) (v_ArrVal_3286 Int)) (let ((.cse3 (+ |ULTIMATE.start_main_~last~0#1.offset| 12))) (let ((.cse1 (let ((.cse5 (let ((.cse7 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base| v_arrayElimArr_13))) (store .cse7 |c_ULTIMATE.start_main_~last~0#1.base| (store (select .cse7 |c_ULTIMATE.start_main_~last~0#1.base|) .cse3 |c_ULTIMATE.start_main_~x~0#1.base|))))) (store .cse5 |c_ULTIMATE.start_main_~x~0#1.base| (store (select .cse5 |c_ULTIMATE.start_main_~x~0#1.base|) .cse6 v_ArrVal_3286))))) (let ((.cse0 (select (select .cse1 |c_ULTIMATE.start_main_~first~0#1.base|) .cse4))) (or (= .cse0 0) (not (= (select v_arrayElimArr_13 |c_ULTIMATE.start_main_~x~0#1.offset|) |c_ULTIMATE.start_main_~x~0#1.base|)) (= (select (select .cse1 .cse0) (select (select (store (let ((.cse2 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_3277))) (store .cse2 |c_ULTIMATE.start_main_~last~0#1.base| (store (select .cse2 |c_ULTIMATE.start_main_~last~0#1.base|) .cse3 |c_ULTIMATE.start_main_~x~0#1.offset|))) |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_3285) |c_ULTIMATE.start_main_~first~0#1.base|) .cse4)) .cse0)))))) (forall ((v_ArrVal_3285 (Array Int Int)) (v_arrayElimArr_12 (Array Int Int)) (v_ArrVal_3277 (Array Int Int)) (|ULTIMATE.start_main_~last~0#1.offset| Int) (v_ArrVal_3286 Int)) (let ((.cse13 (+ |ULTIMATE.start_main_~last~0#1.offset| 12))) (let ((.cse10 (select (select (store (let ((.cse14 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_3277))) (store .cse14 |c_ULTIMATE.start_main_~last~0#1.base| (store (select .cse14 |c_ULTIMATE.start_main_~last~0#1.base|) .cse13 |c_ULTIMATE.start_main_~x~0#1.offset|))) |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_3285) |c_ULTIMATE.start_main_~first~0#1.base|) .cse4))) (or (let ((.cse8 (let ((.cse11 (let ((.cse12 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base| v_arrayElimArr_12))) (store .cse12 |c_ULTIMATE.start_main_~last~0#1.base| (store (select .cse12 |c_ULTIMATE.start_main_~last~0#1.base|) .cse13 |c_ULTIMATE.start_main_~x~0#1.base|))))) (store .cse11 |c_ULTIMATE.start_main_~x~0#1.base| (store (select .cse11 |c_ULTIMATE.start_main_~x~0#1.base|) .cse6 v_ArrVal_3286))))) (let ((.cse9 (select (select .cse8 |c_ULTIMATE.start_main_~first~0#1.base|) .cse4))) (= (select (select .cse8 .cse9) .cse10) .cse9))) (= .cse10 0) (not (= (select v_arrayElimArr_12 |c_ULTIMATE.start_main_~x~0#1.offset|) |c_ULTIMATE.start_main_~x~0#1.base|)))))))) is different from false [2022-11-25 16:58:36,056 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse13 (+ |c_ULTIMATE.start_main_~x~0#1.offset| 16))) (let ((.cse12 (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~x~0#1.base|)) (.cse3 (+ |c_ULTIMATE.start_main_~x~0#1.offset| 12)) (.cse8 (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base|) .cse13 0)) (.cse9 (+ |c_ULTIMATE.start_main_~x~0#1.offset| 4)) (.cse10 (+ |c_ULTIMATE.start_main_~x~0#1.offset| 8))) (and (forall ((v_arrayElimArr_12 (Array Int Int)) (v_ArrVal_3258 Int) (v_ArrVal_3259 Int) (|ULTIMATE.start_main_~last~0#1.offset| Int) (v_ArrVal_3256 Int) (v_ArrVal_3265 Int) (v_ArrVal_3266 Int) (v_ArrVal_3252 Int) (v_ArrVal_3286 Int) (v_ArrVal_3260 Int) (v_ArrVal_3285 (Array Int Int)) (v_ArrVal_3277 (Array Int Int))) (let ((.cse7 (+ |ULTIMATE.start_main_~last~0#1.offset| 12)) (.cse5 (select v_arrayElimArr_12 0))) (let ((.cse2 (select (select (store (let ((.cse11 (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~x~0#1.base| (store (store (store (store .cse12 .cse13 v_ArrVal_3252) |c_ULTIMATE.start_main_~x~0#1.offset| v_ArrVal_3256) .cse9 v_ArrVal_3259) .cse10 v_ArrVal_3266)) .cse5 v_ArrVal_3277))) (store .cse11 |c_ULTIMATE.start_main_~x~0#1.base| (store (select .cse11 |c_ULTIMATE.start_main_~x~0#1.base|) .cse7 0))) .cse5 v_ArrVal_3285) |c_ULTIMATE.start_main_~x~0#1.base|) .cse3))) (or (let ((.cse1 (let ((.cse4 (let ((.cse6 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base| (store (store (store .cse8 |c_ULTIMATE.start_main_~x~0#1.offset| v_ArrVal_3258) .cse9 v_ArrVal_3260) .cse10 v_ArrVal_3265)) .cse5 v_arrayElimArr_12))) (store .cse6 |c_ULTIMATE.start_main_~x~0#1.base| (store (select .cse6 |c_ULTIMATE.start_main_~x~0#1.base|) .cse7 .cse5))))) (store .cse4 .cse5 (store (select .cse4 .cse5) 16 v_ArrVal_3286))))) (let ((.cse0 (select (select .cse1 |c_ULTIMATE.start_main_~x~0#1.base|) .cse3))) (= .cse0 (select (select .cse1 .cse0) .cse2)))) (= .cse2 0) (not (= (select |c_#valid| .cse5) 0)))))) (forall ((v_arrayElimArr_13 (Array Int Int)) (v_ArrVal_3258 Int) (v_ArrVal_3259 Int) (|ULTIMATE.start_main_~last~0#1.offset| Int) (v_ArrVal_3256 Int) (v_ArrVal_3265 Int) (v_ArrVal_3266 Int) (v_ArrVal_3252 Int) (v_ArrVal_3286 Int) (v_ArrVal_3260 Int) (v_ArrVal_3285 (Array Int Int)) (v_ArrVal_3277 (Array Int Int))) (let ((.cse17 (+ |ULTIMATE.start_main_~last~0#1.offset| 12)) (.cse18 (select v_arrayElimArr_13 0))) (let ((.cse15 (let ((.cse19 (let ((.cse20 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base| (store (store (store .cse8 |c_ULTIMATE.start_main_~x~0#1.offset| v_ArrVal_3258) .cse9 v_ArrVal_3260) .cse10 v_ArrVal_3265)) .cse18 v_arrayElimArr_13))) (store .cse20 |c_ULTIMATE.start_main_~x~0#1.base| (store (select .cse20 |c_ULTIMATE.start_main_~x~0#1.base|) .cse17 .cse18))))) (store .cse19 .cse18 (store (select .cse19 .cse18) 16 v_ArrVal_3286))))) (let ((.cse14 (select (select .cse15 |c_ULTIMATE.start_main_~x~0#1.base|) .cse3))) (or (= .cse14 0) (= .cse14 (select (select .cse15 .cse14) (select (select (store (let ((.cse16 (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~x~0#1.base| (store (store (store (store .cse12 .cse13 v_ArrVal_3252) |c_ULTIMATE.start_main_~x~0#1.offset| v_ArrVal_3256) .cse9 v_ArrVal_3259) .cse10 v_ArrVal_3266)) .cse18 v_ArrVal_3277))) (store .cse16 |c_ULTIMATE.start_main_~x~0#1.base| (store (select .cse16 |c_ULTIMATE.start_main_~x~0#1.base|) .cse17 0))) .cse18 v_ArrVal_3285) |c_ULTIMATE.start_main_~x~0#1.base|) .cse3))) (not (= (select |c_#valid| .cse18) 0)))))))))) is different from false [2022-11-25 16:58:36,179 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-25 16:58:36,180 INFO L350 Elim1Store]: Elim1 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 5 case distinctions, treesize of input 701 treesize of output 637 [2022-11-25 16:58:36,210 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-25 16:58:36,210 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 10 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 5 case distinctions, treesize of input 554 treesize of output 267 [2022-11-25 16:58:36,235 INFO L350 Elim1Store]: Elim1 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 909 treesize of output 903 [2022-11-25 16:58:36,253 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 16:58:36,265 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-25 16:58:36,502 INFO L321 Elim1Store]: treesize reduction 48, result has 81.1 percent of original size [2022-11-25 16:58:36,502 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 2 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 9 case distinctions, treesize of input 4646 treesize of output 4643 [2022-11-25 16:58:36,574 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-25 16:58:36,598 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 16:58:36,765 INFO L321 Elim1Store]: treesize reduction 21, result has 82.6 percent of original size [2022-11-25 16:58:36,767 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 4 new quantified variables, introduced 9 case distinctions, treesize of input 45728 treesize of output 36897 [2022-11-25 16:58:38,867 INFO L350 Elim1Store]: Elim1 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 33025 treesize of output 30121 [2022-11-25 16:58:39,207 INFO L350 Elim1Store]: Elim1 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 18855 treesize of output 17383 [2022-11-25 16:58:39,843 INFO L350 Elim1Store]: Elim1 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 14973 treesize of output 14361